Eulerian-Cycle-Cut in SuperHyperGraphs

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

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

Eulerian-Cycle-Cut In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures iv
List of Tables v
1 ABSTRACT 1
2 Background 11
Bibliography 17
3 Acknowledgements 39
4 Cancer In Extreme SuperHyperGraph 41
5 Extreme Eulerian-Cycle-Cut 45
6 New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut In

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

Scientific Research 55
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59
10 Extreme SuperHyperEulerian-Cycle-Cut But As The Extensions Excerpt

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 215
Bibliography 221
24 Cancer In Neutrosophic SuperHyperGraph 243
25 Neutrosophic Eulerian-Cycle-Cut 247
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA 249
27 ABSTRACT 251
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 261

30 Neutrosophic SuperHyperEulerian-Cycle-Cut But As The Extensions Ex-

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

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

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

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

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

Motivations 343
37 Conclusion and Closing Remarks 345
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 403
43 Background 417
Bibliography 423
44 Books’ Contributions 445
45 “SuperHyperGraph-Based Books”: | Featured Tweets 453
46 CV 481

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

SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.3) . . . . . . . . . . . . 77
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . . . . . 114
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.7) . . . . . . . . . . . . . 116
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.9) . . . . . . . . . . . . . 117
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Cycle-Cut in the Example (42.0.11) . . . . . . . . . . . . 119
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperEulerian-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . . . . . 121
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.15) . . . . . . . 122
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Cycle-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.3) . . 279


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

SuperHyperEulerian-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . . . . . 316
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Cycle-Cut in the Example (42.0.11) . . . 321
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEulerian-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . . . . . 323
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324

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 EULA By Hyper Eulogy Of Eulerian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7853922). . . . . . . . . . . . . . . . . . . . . . . . . . . 446
2023, (doi: 10.5281/zenodo.7853922). . . . . . . . . . . . . . . . . . . . . . . . . . . 447
2023, (doi: 10.5281/zenodo.7853922). . . . . . . . . . . . . . . . . . . . . . . . . . . 447
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo
2023, (doi: 10.5281/zenodo.7853867). . . . . . . . . . . . . . . . . . . . . . . . . . . 448
2023, (doi: 10.5281/zenodo.7853867). . . . . . . . . . . . . . . . . . . . . . . . . . . 449
2023, (doi: 10.5281/zenodo.7853867). . . . . . . . . . . . . . . . . . . . . . . . . . . 449
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 454

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 455
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 456
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 462



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

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 138

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 140
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 340

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

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

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

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

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

“Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the 65
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 67
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table 68
holds. And a Eulerian-Cycle-Cut In SuperHyperGraphs are redefined to a “Neutrosophic 69

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

“Neutrosophic SuperHyperPath”, “Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs”, 76
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 77
rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 78
SuperHyperGraph has a “Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs” where it’s 79

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

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

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

but literarily, it’s the deformation of any Eulerian-Cycle-Cut In SuperHyperGraphs. It, 122
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 123
Neutrosophic SuperHyperGraph theory are proposed. 124
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Cycle-Cut In SuperHyperGraphs, 125

Cancer’s Recognition 126

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

and well-reviewed. The literature review is implemented in the whole of this research. For 133
shining the elegancy and the significancy of this research, the comparison between this Su- 134
perHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 135
featured. The definitions are followed by the examples and the instances thus the clarifications 136
are driven with different tools. The applications are figured out to make sense about the 137
theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” are the 138
under scientific research to figure out the challenges make sense about ongoing and upcoming 139
research. The special case is up. The cells are viewed in the deemed ways. There are different 140
types of them. Some of them are individuals and some of them are well-modeled by the 141
group of cells. These types are all officially called “SuperHyperVertex” but the relations 142
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 143
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Can- 144
cer’s Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open 145
up some avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic 146
Recognition”. Some avenues are posed to pursue this research. It’s also officially collected 147
in the form of some questions and some problems. Assume a SuperHyperGraph. Then 148
an “δ−Eulerian-Cycle-Cut In SuperHyperGraphs” is a maximal Eulerian-Cycle-Cut In Su- 149
perHyperGraphs of SuperHyperVertices with maximum cardinality such that either of the 150
s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 152
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if S is 153
an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Eulerian-Cycle-Cut In SuperHyperGraphs” 154
is a maximal Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs of SuperHyperVertices 155
with maximum Neutrosophic cardinality such that either of the following expressions hold for 156
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 157
|S ∩(V \N (s))|N eutrosophic +δ, |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first 158
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 159
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 160
version of Eulerian-Cycle-Cut In SuperHyperGraphs . Since there’s more ways to get type-results 161
to make Eulerian-Cycle-Cut In SuperHyperGraphs more understandable. For the sake of 162
having Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs, there’s a need to “redefine” 163
the notion of “Eulerian-Cycle-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the 164
there’s the usage of the position of labels to assign to the values. Assume a Eulerian-Cycle-Cut 166
In SuperHyperGraphs . It’s redefined Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs 167

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

maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 172
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 173
To get structural examples and instances, I’m going to introduce the next SuperHyperClass of 174
SuperHyperGraph based on Eulerian-Cycle-Cut In SuperHyperGraphs . It’s the main. It’ll be 175
disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 176
there’s a need to have all Eulerian-Cycle-Cut In SuperHyperGraphs until the Eulerian-Cycle-Cut 177
In SuperHyperGraphs, then it’s officially called “Eulerian-Cycle-Cut In SuperHyperGraphs” 178

but otherwise, it isn’t Eulerian-Cycle-Cut In SuperHyperGraphs . There are some instances 179
about the clarifications for the main definition titled “Eulerian-Cycle-Cut In SuperHyperGraphs 180
”. These two examples get more scrutiny and discernment since there are characterized in the 181
disciplinary ways of the SuperHyperClass based on Eulerian-Cycle-Cut In SuperHyperGraphs 182
. For the sake of having Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs, there’s a 183
need to “redefine” the notion of “Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs” and 184

“Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the 185
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 187
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. 188
And Eulerian-Cycle-Cut In SuperHyperGraphs are redefined “Neutrosophic Eulerian-Cycle-Cut 189
In SuperHyperGraphs” if the intended Table holds. It’s useful to define “Neutrosophic” version 190
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make Neutro- 191
sophic Eulerian-Cycle-Cut In SuperHyperGraphs more understandable. Assume a Neutrosophic 192
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 193
holds. Thus SuperHyperPath, Eulerian-Cycle-Cut In SuperHyperGraphs, SuperHyperStar, 194
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 195
SuperHyperPath”, “Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs”, “Neutrosophic 196

SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPart- 197
ite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 198
has “Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs” where it’s the strongest [the 199
maximum Neutrosophic value from all Eulerian-Cycle-Cut In SuperHyperGraphs amid the 200
maximum value amid all SuperHyperVertices from a Eulerian-Cycle-Cut In SuperHyperGraphs 201
.] Eulerian-Cycle-Cut In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyper- 202

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

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

strongest Eulerian-Cycle-Cut In SuperHyperGraphs, called Neutrosophic Eulerian-Cycle-Cut 237
In SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, 238
essential to have at least three SuperHyperEdges to form any style of a Eulerian-Cycle-Cut In 240
SuperHyperGraphs. There isn’t any formation of any Eulerian-Cycle-Cut In SuperHyperGraphs 241
but literarily, it’s the deformation of any Eulerian-Cycle-Cut In SuperHyperGraphs. It, 242
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 243
Neutrosophic SuperHyperGraph theory are proposed. 244
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Eulerian-Cycle-Cut In SuperHy- 245
perGraphs, Cancer’s Neutrosophic Recognition 246

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

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




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

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

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

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

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 351
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 352
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 353
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 354
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 355
Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 356

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

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

in Ref. [HG28] by Henry Garrett (2023), “Demonstrating Complete Connections in Every 374
Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 375
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett 376
(2023), “Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed 377
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutro- 378
sophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As 379
(Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition Titled 380
“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 384
(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1- 385

Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 386
on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), 387
“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Su- 388
perHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 389
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 390
(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 391
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 392
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 393
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 394
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 395
(2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 396
HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; HG24; HG25; 397
HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; HG121; HG122; 400

HG246; HG247; HG248; HG249; HG250; HG251; HG252; HG253], there are some 413
endeavors to formalize the basic SuperHyperNotions about neutrosophic SuperHyperGraph and 414
SuperHyperGraph alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 415
HG64b; HG65b; HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; 416
HG94b; HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; 419
HG103b; HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; 420

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

HG251; HG252; HG253] alongside scientific research books at [HG60b; HG61b; HG62b; 464

HG158b; HG159b; HG160b; HG161b; HG162b; HG163b; HG164b; HG165b]. Two 476
popular scientific research books in Scribd in the terms of high readers, 4331 and 5327 477
respectively, on neutrosophic science is on [HG32b; HG44b]. 478

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 551
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 552
(doi: 10.20944/preprints202212.0549.v1). 553
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 554
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 555
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 556
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 557
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 558
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 559
(doi: 10.20944/preprints202212.0500.v1). 560
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 561
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 562
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 564
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 565
HG253 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 567
By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 568
10.5281/zenodo.7853867). 569
HG252 [26] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 570
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 571
10.5281/zenodo.7853922). 572
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 574

(doi: 10.5281/zenodo.7851519). 575
HG250 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 576
Path-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 577
2023, (doi: 10.5281/zenodo.7851550). 578
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 580
Zenodo 2023, (doi: 10.5281/zenodo.7839333). 581
HG248 [30] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 582
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 583
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206). 584

By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 586
10.5281/zenodo.7834229). 587
HG246 [32] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 588
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 589
10.5281/zenodo.7834261). 590
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 592
10.5281/zenodo.7824560). 593
HG244 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 594
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 595
(doi: 10.5281/zenodo.7824623). 596
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 598
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 601
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 604
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 606
2023, (doi: 10.5281/zenodo.7809365). 607
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 609
2023, (doi: 10.5281/zenodo.7809358). 610
HG238 [40] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 611
10.5281/zenodo.7809219). 613
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 615
10.5281/zenodo.7809328). 616
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 618
2023, (doi: 10.5281/zenodo.7806767). 619
HG235 [43] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 620
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 621
2023, (doi: 10.5281/zenodo.7806838). 622

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 624
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 625
HG233 [45] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 626
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 627
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 628
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 630
(doi: 10.5281/zenodo.7799902). 631
HG231 [47] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 632
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 633
2023, (doi: 10.5281/zenodo.7804218). 634
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 636
(doi: 10.5281/zenodo.7796334). 637
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 639
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 642
10.5281/zenodo.7791952). 643
HG225 [51] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 644
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 645
(doi: 10.5281/zenodo.7791982). 646
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 648
10.5281/zenodo.7790026). 649
HG223 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 650
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 651
2023, (doi: 10.5281/zenodo.7790052). 652
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 654
2023, (doi: 10.5281/zenodo.7787066). 655
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 657
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 658
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 660
10.5281/zenodo.7781476). 661

HG219 [57] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 662
10.5281/zenodo.7783082). 664
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 666
10.5281/zenodo.7777857). 667
HG217 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 668
10.5281/zenodo.7779286). 670
HG215 [60] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 671
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 672
(doi: 10.5281/zenodo.7771831). 673
HG214 [61] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 674
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 675
2023, (doi: 10.5281/zenodo.7772468). 676
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 678
10.13140/RG.2.2.20913.25446). 679
HG212 [63] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 680
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 681
10.5281/zenodo.7764916). 682
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 684
10.13140/RG.2.2.11770.98247). 685
HG210 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 686
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 687
10.13140/RG.2.2.12400.12808). 688
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 690
2023, (doi: 10.13140/RG.2.2.22545.10089). 691
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 693
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 694
HG207 [68] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 695
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 696
10.13140/RG.2.2.11377.76644). 697
HG206 [69] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 698
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 699
10.13140/RG.2.2.23750.96329). 700

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.31366.24641). 703
HG204 [71] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 704
10.13140/RG.2.2.34721.68960). 706
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 708
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 711
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.24288.35842). 715
HG200 [75] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 716
10.13140/RG.2.2.32467.25124). 718
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.31025.45925). 721
HG198 [77] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 722
10.13140/RG.2.2.17184.25602). 724
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.23423.28327). 727
HG196 [79] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 728
10.13140/RG.2.2.28456.44805). 730
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.23525.68320). 733
HG194 [81] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 734
10.13140/RG.2.2.20170.24000). 736
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.36475.59683). 739

HG192 [83] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 740
10.13140/RG.2.2.29764.71046). 742
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 744
2023, (doi: 10.13140/RG.2.2.18780.87683). 745
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 747
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 750
10.13140/RG.2.2.26134.01603). 751
HG188 [87] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 752
10.13140/RG.2.2.27392.30721). 754
HG187 [88] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 755
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.33028.40321). 757
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 759
10.13140/RG.2.2.21389.20966). 760
HG185 [90] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 761
10.13140/RG.2.2.16356.04489). 763
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 765
10.13140/RG.2.2.21756.21129). 766
HG183 [92] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 767
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 768
10.13140/RG.2.2.30983.68009). 769
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 771
10.13140/RG.2.2.28552.29445). 772
HG181 [94] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 773
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 774
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 775
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 777
10.13140/RG.2.2.35105.89447). 778

HG179 [96] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 779
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 780
(doi: 10.13140/RG.2.2.30072.72960). 781
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 783
10.13140/RG.2.2.31147.52003). 784
HG177 [98] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 785
10.13140/RG.2.2.32825.24163). 787
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 789
10.13140/RG.2.2.13059.58401). 790
HG175 [100] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 791
10.13140/RG.2.2.11172.14720). 793
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 795
2023, (doi: 10.13140/RG.2.2.22011.80165). 796
HG173 [102] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 797
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 798
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 799
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 801
HG171 [104] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 803
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 805
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 807
2023, (doi: 10.13140/RG.2.2.19944.14086). 808
HG169 [106] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 809
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 811
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 813
(doi: 10.13140/RG.2.2.33103.76968). 814
HG167 [108] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 815
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 816
2023, (doi: 10.13140/RG.2.2.23037.44003). 817

By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 819
(doi: 10.13140/RG.2.2.35646.56641). 820
HG165 [110] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 821
(doi: 10.13140/RG.2.2.18030.48967). 823
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 825
(doi: 10.13140/RG.2.2.13973.81121). 826
HG163 [112] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 827
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 828
2023, (doi: 10.13140/RG.2.2.34106.47047). 829
HG162 [113] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 830
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 831
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 834
2023, (doi: 10.13140/RG.2.2.31956.88961). 835
HG160 [115] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 836
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 837
2023, (doi: 10.13140/RG.2.2.15179.67361). 838
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 840
10.13140/RG.2.2.21510.45125). 841
HG158 [117] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 842
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.13121.84321). 844
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 846
10.13140/RG.2.2.11758.69441). 847
HG156 [119] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 848
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 849
2023, (doi: 10.13140/RG.2.2.31891.35367). 850
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 852
10.13140/RG.2.2.19360.87048). 853
HG154 [121] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 854
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 855
2023, (doi: 10.13140/RG.2.2.32363.21286). 856

HG153 [122] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 857
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 858
(doi: 10.13140/RG.2.2.23266.81602). 859
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 861
10.13140/RG.2.2.19911.37285). 862
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 864
10.13140/RG.2.2.11050.90569). 865
HG150 [125] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 866
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 867
HG149 [126] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 869
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 870
HG148 [127] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 872
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 873
HG147 [128] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 875
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 876
(doi: 10.13140/RG.2.2.30182.50241). 877
HG146 [129] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 878
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 879
HG145 [130] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 881
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 882
HG144 [131] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 884
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 885
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 886
HG143 [132] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 887
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 888
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 889
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 892
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 895

HG140 [135] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 896
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 897
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 898
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 901
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 904
HG137 [138] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 905
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 906
HG136 [139] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 908
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 909
2023, (doi: 10.13140/RG.2.2.17252.24968). 910
HG135 [140] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 911
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 912
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 913
HG134 [141] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 914
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 915
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 916
HG132 [142] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 917
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 918
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 919
HG131 [143] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 920
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 921
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 922
HG130 [144] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 923
Recognition in The Confrontation With Super Attacks In Hyper Situations By 924

Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 925
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 926
HG129 [145] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 927

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

HG128 [146] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 931
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 932
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 933

HG127 [147] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 934
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 935
2023,(doi: 10.13140/RG.2.2.36745.93289). 936
HG126 [148] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 937
HG125 [149] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 940

10.20944/preprints202301.0282.v1). 943
HG124 [150] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 944
10.20944/preprints202301.0267.v1).). 946
HG123 [151] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 947
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 948
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 949

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 950
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 951
HG122 [152] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 952
prints202301.0262.v1). 955
HG121 [153] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 956
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 957

SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 958
2023010224, (doi: 10.20944/preprints202301.0224.v1). 961
HG24 [155] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 962

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 963
10.13140/RG.2.2.35061.65767). 964
HG25 [156] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 965
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 966
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 967
10.13140/RG.2.2.18494.15680). 968
HG26 [157] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 969
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 970
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 971
10.13140/RG.2.2.32530.73922). 972

HG27 [158] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 973
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 974
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 975
10.13140/RG.2.2.15897.70243). 976
10.13140/RG.2.2.32530.73922). 980
prints202301.0105.v1). 983
HG28 [161] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 984
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 985
HG29 [162] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 987
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 988
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 989

10.13140/RG.2.2.23172.19849). 990
HG30 [165] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 997
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 998
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 999
10.13140/RG.2.2.17385.36968). 1000
HG107 [166] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 1001
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 1002
Beyond”, Preprints 2023, 2023010044 1003
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 1005
(doi: 10.20944/preprints202301.0043.v1). 1006
HG31 [168] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1007
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1008
2023, (doi: 10.13140/RG.2.2.28945.92007). 1009

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1014
10.13140/RG.2.2.35774.77123). 1015

HG35 [172] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1019
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1020
10.13140/RG.2.2.29430.88642). 1021
(doi: 10.20944/preprints202212.0549.v1). 1027
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1029

10.13140/RG.2.2.19380.94084). 1030
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 1034
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1038
(doi: 10.20944/preprints202212.0500.v1). 1041
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1043
10.13140/RG.2.2.20993.12640). 1044
HG952 [180] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1045
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1046

SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1049
ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1050

HG942 [182] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1051

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1052
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1053
HG94 [183] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1054
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1055
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1056
HG37 [184] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1057
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1058
10.13140/RG.2.2.29173.86244). 1059
HG38 [185] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1060
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1061
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1062
HG165b [186] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1063
(doi: 10.5281/zenodo.7854561). 1064
HG164b [187] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1065
2023 (doi: 10.5281/zenodo.7851893). 1066
HG163b [188] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1067

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1068
HG162b [189] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1069
(doi: 10.5281/zenodo.7835063). 1070
HG161b [190] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1071
(doi: 10.5281/zenodo.7826705). 1072
HG160b [191] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1073
2023 (doi: 10.5281/zenodo.7820680). 1074
HG159b [192] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1075
10.5281/zenodo.7812750). 1076
HG158b [193] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1077

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

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1080
HG156b [195] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1081
2023 (doi: 10.5281/zenodo.7807782). 1082
HG155b [196] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1083
2023 (doi: 10.5281/zenodo.7804449). 1084
HG154b [197] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1085

HG153b [198] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1087
(doi: 10.5281/zenodo.7792307). 1088
HG152b [199] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1089
(doi: 10.5281/zenodo.7790728). 1090
HG151b [200] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1091
2023 (doi: 10.5281/zenodo.7787712). 1092
HG150b [201] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1093
10.5281/zenodo.7783791). 1094
HG149b [202] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1095
10.5281/zenodo.7780123). 1096
HG148b [203] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1097
(doi: 10.5281/zenodo.7773119). 1098
HG147b [204] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1099
odo.7637762). 1100
HG146b [205] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1101
10.5281/zenodo.7766174). 1102
HG145b [206] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1103
10.5281/zenodo.7762232). 1104
HG144b [207] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1105
(doi: 10.5281/zenodo.7758601). 1106
HG143b [208] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1107
10.5281/zenodo.7754661). 1108
HG142b [209] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1109
10.5281/zenodo.7750995) . 1110
HG141b [210] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1111
(doi: 10.5281/zenodo.7749875). 1112
HG140b [211] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1113
10.5281/zenodo.7747236). 1114
HG139b [212] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1115
10.5281/zenodo.7742587). 1116
HG138b [213] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1117
(doi: 10.5281/zenodo.7738635). 1118
HG137b [214] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1119
10.5281/zenodo.7734719). 1120
HG136b [215] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1121
10.5281/zenodo.7730484). 1122

HG135b [216] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1123
(doi: 10.5281/zenodo.7730469). 1124
HG134b [217] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1125
10.5281/zenodo.7722865). 1126
HG133b [218] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1127
odo.7713563). 1128
odo.7709116). 1130
HG131b [220] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1131
10.5281/zenodo.7706415). 1132
HG130b [221] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1133
(doi: 10.5281/zenodo.7706063). 1134
HG129b [222] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1135
(doi: 10.5281/zenodo.7701906). 1136
HG128b [223] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1137
odo.7700205). 1138
HG127b [224] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1139
10.5281/zenodo.7694876). 1140
HG126b [225] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7679410). 1142
HG125b [226] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7675982). 1144
HG124b [227] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1145
10.5281/zenodo.7672388). 1146
HG123b [228] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1147
odo.7668648). 1148
HG122b [229] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1149
10.5281/zenodo.7662810). 1150
HG121b [230] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1151
10.5281/zenodo.7659162). 1152
HG120b [231] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1153
odo.7653233). 1154
HG119b [232] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1155
odo.7653204). 1156
HG118b [233] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1157
odo.7653142). 1158

HG117b [234] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1159
odo.7653117). 1160
HG116b [235] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1161
odo.7653089). 1162
HG115b [236] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1163
odo.7651687). 1164
HG114b [237] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1165
odo.7651619). 1166
HG113b [238] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1167
odo.7651439). 1168
HG112b [239] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1169
odo.7650729). 1170
HG111b [240] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1171
odo.7647868). 1172
HG110b [241] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1173
odo.7647017). 1174
HG109b [242] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1175
odo.7644894). 1176
HG108b [243] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1177
odo.7641880). 1178
HG107b [244] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1179
odo.7632923). 1180
HG106b [245] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1181
odo.7623459). 1182
HG105b [246] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1183
10.5281/zenodo.7606416). 1184
HG104b [247] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7606416). 1186
HG103b [248] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1187
odo.7606404). 1188
HG102b [249] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1189
10.5281/zenodo.7580018). 1190
HG101b [250] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1191
odo.7580018). 1192
odo.7580018). 1194

odo.7579929). 1196
HG98b [253] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7563170). 1198
HG97b [254] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1199
odo.7563164). 1200
HG96b [255] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1201
odo.7563160). 1202
odo.7563160). 1204
HG94b [257] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1205
10.5281/zenodo.7563160). 1206
HG93b [258] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1207
10.5281/zenodo.7557063). 1208
HG92b [259] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1209
10.5281/zenodo.7557009). 1210
HG91b [260] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7539484). 1212
HG90b [261] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1213
10.5281/zenodo.7523390). 1214
HG89b [262] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1215
10.5281/zenodo.7523390). 1216
HG88b [263] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7523390). 1218
HG87b [264] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1219
odo.7574952). 1220
HG86b [265] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1221
10.5281/zenodo.7574992). 1222
odo.7523357). 1224
HG84b [267] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1225
10.5281/zenodo.7523357). 1226
HG83b [268] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1227
10.5281/zenodo.7504782). 1228
HG82b [269] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7504782). 1230

HG81b [270] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1231
10.5281/zenodo.7504782). 1232
HG80b [271] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1233
10.5281/zenodo.7499395). 1234
HG79b [272] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1235
odo.7499395). 1236
HG78b [273] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7499395). 1238
HG77b [274] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1239
10.5281/zenodo.7497450). 1240
HG76b [275] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7497450). 1242
HG75b [276] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7494862). 1244
HG74b [277] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1245
odo.7494862). 1246
HG73b [278] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1247
10.5281/zenodo.7494862). 1248
HG72b [279] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7493845). 1250
HG71b [280] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7493845). 1252
HG70b [281] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7493845). 1254
HG69b [282] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1255
odo.7539484). 1256
HG68b [283] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1257
odo.7523390). 1258
HG67b [284] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7523357). 1260
HG66b [285] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1261
odo.7504782). 1262
HG65b [286] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7499395). 1264
HG64b [287] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1265
odo.7497450). 1266

HG63b [288] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7494862). 1268
HG62b [289] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7493845). 1270
HG61b [290] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1271
odo.7480110). 1272
HG60b [291] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1273
odo.7378758). 1274
HG32b [292] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.6320305). 1276
HG44b [293] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.6677173). 1278

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1328
is going to figure out what’s going on this phenomenon. The special case of this disease is 1329
considered and as the consequences of the model, some parameters are used. The cells are 1330
under attack of this disease but the moves of the cancer in the special region are the matter of 1331
mind. The recognition of the cancer could help to find some treatments for this disease. The 1332
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1333
Recognition” and both bases are the background of this research. Sometimes the cancer has 1334
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1335
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1336
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1337
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1338
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1339
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1340
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1341
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1342
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1343
and neutrality about the moves and the effects of the cancer on that region; this event leads 1344
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1345
perception on what’s happened and what’s done. There are some specific models, which 1346
are well-known and they’ve got the names, and some general models. The moves and the 1347
traces of the cancer on the complex tracks and between complicated groups of cells could 1348
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1349
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1350
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1351

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1352
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1353
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1354
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1355
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1356
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1357
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1358
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1359
based on the fixed groups of cells or the fixed groups of group of cells? 1360
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1361
messy and dense SuperHyperModels where embedded notions are illustrated? 1362
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1363
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1364
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1365

research has taken more motivations to define SuperHyperClasses and to find some connections 1366
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1367
instances and examples to make clarifications about the framework of this research. The general 1368
results and some results about some connections are some avenues to make key point of this 1369
research, “Cancer’s Recognition”, more understandable and more clear. 1370
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1371
on the modeling of the regions where are under the attacks of the cancer to recognize 1372
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1373
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1374
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1375
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1376
instances and literature reviews have taken the whole way through. In this scientific research, 1377
the literature reviews have fulfilled the lines containing the notions and the results. The 1378
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1379
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1380
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1381
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1382
of the moves of the cancer in the longest and strongest styles with the formation of the design 1383
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1384
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1385
out the background for the SuperHyperNotions. 1386

CHAPTER 5 1387
Extreme Eulerian-Cycle-Cut 1388
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1389
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1390
2023, (doi: 10.13140/RG.2.2.34953.52320). 1391

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1392
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1393
(doi: 10.13140/RG.2.2.33275.80161). 1394
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1395
10.13140/RG.2.2.11050.90569). 1397
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1398
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1399
10.13140/RG.2.2.17761.79206). 1400
10.13140/RG.2.2.19911.37285). 1403
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1404
10.13140/RG.2.2.23266.81602). 1406
10.13140/RG.2.2.19360.87048). 1409
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1410
10.13140/RG.2.2.32363.21286). 1412
10.13140/RG.2.2.11758.69441). 1415
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1416
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1417
10.13140/RG.2.2.31891.35367). 1418
10.13140/RG.2.2.21510.45125). 1421
45
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1422
10.13140/RG.2.2.13121.84321). 1424

CHAPTER 6 1425
New Ideas On Super EULA By Hyper 1426
Eulogy Of Eulerian-Cycle-Cut In 1427
Recognition of Cancer With 1428
(Neutrosophic) SuperHyperGraph 1429
47
CHAPTER 7 1430
ABSTRACT 1431
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Cycle- 1432
Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Cycle-Cut pair S = (V, E). 1433
Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 1434
either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Cycle-Cut if the following expression is 1435
called Neutrosophic e-SuperHyperEulerian-Cycle-Cut criteria holds 1436
∀Ea ∈ C : C is
a SuperHyperCycle and it has
the all number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic 1437
e-SuperHyperEulerian-Cycle-Cut criteria holds 1438
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1439
SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic v-SuperHyperEulerian- 1440
Cycle-Cut criteria holds 1441
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic 1442
v-SuperHyperEulerian-Cycle-Cut criteria holds 1443
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1444
SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutro- 1445
sophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutro- 1446
sophic rv-SuperHyperEulerian-Cycle-Cut. ((Neutrosophic) SuperHyperEulerian-Cycle-Cut). Assume a 1447
49
Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic Supe- 1448
rHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian-Cycle- 1449
Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian- 1450
Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian- 1451
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1452
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1453
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 1454

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Cut; 1455
a Neutrosophic SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian- 1456
Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, 1457
and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHy- 1458
perGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1459
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 1460

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1461
that they form the Neutrosophic SuperHyperEulerian-Cycle-Cut; an Extreme SuperHyperEulerian- 1462
Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, 1463
Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and 1464
Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 1465
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1466
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1467
HyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1468
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1469
SuperHyperEulerian-Cycle-Cut; and the Extreme power is corresponded to its Extreme coefficient; 1470
a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutro- 1471
sophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic 1472

v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and C(N SHG) for 1473
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1474
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1475
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyper- 1476
Set S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1477
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1478
Cycle-Cut; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an 1479
Extreme V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, 1480
Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and 1481
Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 1482
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1483
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1484
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1485
the Extreme SuperHyperEulerian-Cycle-Cut; a Neutrosophic V-SuperHyperEulerian-Cycle-Cut if it’s 1486
either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, 1487
Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and 1488
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1489
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of 1490
high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutro- 1491
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Cycle-Cut; 1492
an Extreme V-SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutro- 1493


an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1496
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 1497
the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1498
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1499
form the Extreme SuperHyperEulerian-Cycle-Cut; and the Extreme power is corresponded to its 1500
Extreme coefficient; a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s 1501
Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut 1503
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1504
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1505
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 1506

Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1507
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1508
SuperHyperEulerian-Cycle-Cut; and the Neutrosophic power is corresponded to its Neutrosophic 1509
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1510
namely, a SuperHyperEulerian-Cycle-Cut and Neutrosophic SuperHyperEulerian-Cycle-Cut. Two 1511
different types of SuperHyperDefinitions are debut for them but the research goes further 1512
and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 1513
well-defined and well-reviewed. The literature review is implemented in the whole of this 1514
research. For shining the elegancy and the significancy of this research, the comparison between 1515
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 1516
bers are featured. The definitions are followed by the examples and the instances thus the 1517
clarifications are driven with different tools. The applications are figured out to make sense 1518
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1519
under research to figure out the challenges make sense about ongoing and upcoming research. 1520
The special case is up. The cells are viewed in the deemed ways. There are different types 1521
of them. Some of them are individuals and some of them are well-modeled by the group of 1522
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1523
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1524

SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1525
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1526
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1527
It’s also officially collected in the form of some questions and some problems. Assume a 1528
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Cycle-Cut is a 1529

maximal of SuperHyperVertices with a maximum cardinality such that either of the following 1530
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 1531
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1532
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1533
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Cycle-Cut is a max- 1534
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 1535

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1536
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1537
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 1538
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 1539

δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperEulerian- 1540

Cycle-Cut. Since there’s more ways to get type-results to make a SuperHyperEulerian-Cycle-Cut 1541
more understandable. For the sake of having Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s 1542
a need to “redefine” the notion of a “SuperHyperEulerian-Cycle-Cut ”. The SuperHyperVertices 1543
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 1544
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 1545
SuperHyperEulerian-Cycle-Cut . It’s redefined a Neutrosophic SuperHyperEulerian-Cycle-Cut if the 1546

mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 1547
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 1548
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 1549
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 1550
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 1551
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1552
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 1553
Graph based on a SuperHyperEulerian-Cycle-Cut . It’s the main. It’ll be disciplinary to have the 1554
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 1555
all SuperHyperEulerian-Cycle-Cut until the SuperHyperEulerian-Cycle-Cut, then it’s officially called a 1556
“SuperHyperEulerian-Cycle-Cut” but otherwise, it isn’t a SuperHyperEulerian-Cycle-Cut . There are some 1557
instances about the clarifications for the main definition titled a “SuperHyperEulerian-Cycle-Cut ”. 1558
disciplinary ways of the SuperHyperClass based on a SuperHyperEulerian-Cycle-Cut . For the sake 1560
of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to “redefine” the notion of 1561
a “Neutrosophic SuperHyperEulerian-Cycle-Cut” and a “Neutrosophic SuperHyperEulerian-Cycle-Cut 1562
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 1563
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1564
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 1565
SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Cycle-Cut are redefined 1566
to a “Neutrosophic SuperHyperEulerian-Cycle-Cut” if the intended Table holds. It’s useful to define 1567
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 1568
type-results to make a Neutrosophic SuperHyperEulerian-Cycle-Cut more understandable. Assume 1569
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1570

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Cycle-Cut, SuperHyperStar, 1571
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Cycle-Cut”, “Neutrosophic SuperHyper- 1573
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1574
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1575

“Neutrosophic SuperHyperEulerian-Cycle-Cut” where it’s the strongest [the maximum Neutrosophic 1576
value from all the SuperHyperEulerian-Cycle-Cut amid the maximum value amid all SuperHy- 1577
perVertices from a SuperHyperEulerian-Cycle-Cut .] SuperHyperEulerian-Cycle-Cut . A graph is a 1578
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 1579
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1580
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1581
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Cycle-Cut if it’s only one Super- 1582
Vertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1583
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1584
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1585

two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1586
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1587
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1588
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1589
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1590
the specific designs and the specific architectures. The SuperHyperModel is officially called 1591
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1592

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1593
and the common and intended properties between “specific” cells and “specific group” of 1594
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1595
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1596
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1597
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 1598
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 1599
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 1600
long cycle of the move from the cancer is identified by this research. Sometimes the move of 1601
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 1602
neutrality about the moves and the effects of the cancer on that region; this event leads us 1603
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 1604
perception on what’s happened and what’s done. There are some specific models, which are 1605
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 1606
moves and the traces of the cancer on the complex tracks and between complicated groups 1607
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Cut, 1608
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 1609
aim is to find either the longest SuperHyperEulerian-Cycle-Cut or the strongest SuperHyperEulerian- 1610
Cycle-Cut in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Cycle-Cut, 1611
called SuperHyperEulerian-Cycle-Cut, and the strongest SuperHyperEulerian-Cycle-Cut, called Neut- 1612
rosophic SuperHyperEulerian-Cycle-Cut, some general results are introduced. Beyond that in 1613
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 1614
enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1615
SuperHyperEulerian-Cycle-Cut. There isn’t any formation of any SuperHyperEulerian-Cycle-Cut but 1616

literarily, it’s the deformation of any SuperHyperEulerian-Cycle-Cut. It, literarily, deforms and 1617
it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Cycle-Cut theory, 1618
SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1619
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Cycle-Cut, Cancer’s Neutro- 1620
sophic Recognition 1621


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

research has taken more motivations to define SuperHyperClasses and to find some connections 1683
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1684
instances and examples to make clarifications about the framework of this research. The general 1685
results and some results about some connections are some avenues to make key point of this 1686
research, “Cancer’s Recognition”, more understandable and more clear. 1687
The framework of this research is as follows. In the beginning, I introduce basic definitions 1688
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1689
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1690
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1691
review literature are applied to make sense about what’s going to figure out about the 1692
upcoming sections. The main definitions and their clarifications alongside some results 1693
about new notions, SuperHyperEulerian-Cycle-Cut and Extreme SuperHyperEulerian-Cycle-Cut, are 1694

figured out in sections “ SuperHyperEulerian-Cycle-Cut” and “Extreme SuperHyperEulerian-Cycle- 1695
Cut”. In the sense of tackling on getting results and in Eulerian-Cycle-Cut to make sense about 1696
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1697
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1698
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1699
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1700

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1701
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1702
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1703
and as concluding and closing section of theoretical research are contained in the section 1704
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1705
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1706
Results”, “ SuperHyperEulerian-Cycle-Cut”, “Extreme SuperHyperEulerian-Cycle-Cut”, “Results on 1707

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1708
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1709
and going to figure out the word “best” as the description and adjective for this research as 1710
presented in section, “ SuperHyperEulerian-Cycle-Cut”. The keyword of this research debut in the 1711
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1712
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1713
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1714
there are some scrutiny and discernment on what’s done and what’s happened in this research 1715
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1716
style. The advantages and the limitations of this research alongside about what’s done in this 1717
research to make sense and to get sense about what’s figured out are included in the section, 1718
“Conclusion and Closing Remarks”. 1719

CHAPTER 9 1720
Extreme Preliminaries Of This Scientific 1721
Research On the Redeemed Ways 1722
In this section, the basic material in this scientific research, is referred to [Single Valued 1723
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1724
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1725

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1726
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1727
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1728
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1729
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1730
their clarifications are addressed to Ref.[HG38]. 1731

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

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

Let X be a Eulerian-Cycle-Cut 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}.
59
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). 1735
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1736
where 1737
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1738
(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); 1739
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1740
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1741
1, 2, . . . , n0 ); 1742
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1743
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1744

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1751
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1752
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1753
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1754
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1755
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1756

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

(Ref.[HG38],Definition 2.7,p.3). 1758
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1759
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1760
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1761
(i) If |Vi | = 1, then Vi is called vertex; 1762
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1763
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1764
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1765
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1766
SuperEdge; 1767
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1768
SuperHyperEdge. 1769
If we choose different types of binary operations, then we could get hugely diverse types of 1770
general forms of Neutrosophic SuperHyperGraph (NSHG). 1771
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1772

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1773
x, y, z, w ∈ [0, 1]: 1774
(i) 1 ⊗ x = x; 1775
(ii) x ⊗ y = y ⊗ x; 1776
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1777
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1778

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

where 1781

1, 2, . . . , n0 ); 1786
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1787
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1788
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1789
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1790
0


SuperEdge; 1810
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1813
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1814
makes the patterns and regularities. 1815
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1816
of elements of SuperHyperEdges are the same. 1817

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1818
makes to have SuperHyperUniform more understandable. 1819
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1820
Classes as follows. 1821
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1822
two given SuperHyperEdges with two exceptions; 1823
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1824
SuperHyperEdges; 1825
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1826
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1827
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1828
in common; 1829
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1830
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1831
SuperHyperEdge in common; 1832
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1833
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1834
SuperVertex. 1835
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 1836
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1837
(i) Vi , Vi+1 ∈ Ei0 ; 1838
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1839
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1840
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1841
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1842
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1843
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1844
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1845
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1847
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1848
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1849
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1850
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1851
perPath . 1852
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 1853
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1854
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1855
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1856
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1857
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1858

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1871
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1872
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1873
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Cycle-Cut). 1874

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1876
or E 0 is called 1877
(i) Neutrosophic e-SuperHyperEulerian-Cycle-Cut if the following expression is called 1878
Neutrosophic e-SuperHyperEulerian-Cycle-Cut criteria holds 1879
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Cycle-Cut if the following expression is called 1880

Neutrosophic re-SuperHyperEulerian-Cycle-Cut criteria holds 1881
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1882
(iii) Neutrosophic v-SuperHyperEulerian-Cycle-Cut if the following expression is called 1883

Neutrosophic v-SuperHyperEulerian-Cycle-Cut criteria holds 1884
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Cycle-Cut if the following expression is called 1885
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1887
(v) Neutrosophic SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 1888

SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic 1889
v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut. 1890

Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Cycle-Cut). 1891

(i) an Extreme SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 1894

SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v- 1895
SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut and C(N SHG) 1896
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1897
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 1898

perEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 1899
Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Cut; 1900
(ii) a Neutrosophic SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 1901


for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1904
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 1905
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1906
Cycle-Cut; 1908
(iii) an Extreme SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either of 1909

Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, 1910
Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle- 1911
Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1912
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1913
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 1914
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1915
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian- 1916
Cycle-Cut; and the Extreme power is corresponded to its Extreme coefficient; 1917
(iv) a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 1918

of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle- 1919
Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian- 1920
Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1921
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as 1922
the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 1923
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1924

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1925
such that they form the Neutrosophic SuperHyperEulerian-Cycle-Cut; and the Neutrosophic 1926
power is corresponded to its Neutrosophic coefficient; 1927
(v) an Extreme V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 1928

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 1932
Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 1933

(vi) a Neutrosophic V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 1935

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 1939
Cycle-Cut; 1942
(vii) an Extreme V-SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 1943

of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, 1944
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1948
(viii) a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 1952


SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1958
power is corresponded to its Neutrosophic coefficient. 1961
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Cycle-Cut). 1962

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1963
(i) an δ−SuperHyperEulerian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 1964

SuperHyperEulerian-Cycle-Cut such that either of the following expressions hold for the 1965
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1966
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 1967

(29.1), holds if S is an δ−SuperHyperDefensive; 1968
(ii) a Neutrosophic δ−SuperHyperEulerian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 1969

SuperHyperEulerian-Cycle-Cut such that either of the following Neutrosophic expressions hold 1970
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1971
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4

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

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

136TBL4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1972

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1973
For the sake of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to 1974

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and 1975
the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 1976
procedure, there’s the usage of the position of labels to assign to the values. 1977
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1978
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1979
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1980
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1981
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neut- 1983
rosophic SuperHyperPath , SuperHyperEulerian-Cycle-Cut, SuperHyperStar, SuperHyperBipart- 1984
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 1985

Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 1986
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 1987
perHyperWheel if the Table (29.2) holds. 1988
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Cycle-Cut. 1989

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Cycle-Cut 1990
more Neutrosophicly understandable. 1991
For the sake of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to “redefine” 1992
the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Cycle-Cut”. The SuperHyperVertices 1993
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 1994


136TBL1
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Cycle-Cut. It’s redefined a Neutrosophic 1996

SuperHyperEulerian-Cycle-Cut if the Table (29.3) holds. 1997

CHAPTER 10 1998
Extreme SuperHyper But As The Eulerian-Cycle-Cut 1999
Extensions Excerpt From Dense And 2000
Super Forms 2001
Definition 10.0.1. (Extreme event). 2002

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2003
a probability Eulerian-Cycle-Cut. Any Extreme k-subset of A of V is called Extreme k-event and 2004
if k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 2005
called Extreme probability of A. 2006
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2007

a probability Eulerian-Cycle-Cut. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2009
if the following expression is called Extreme s-independent criteria 2010
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 2011
following expression is called Extreme independent criteria 2012
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2013

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2014
probability Eulerian-Cycle-Cut. Any k-function Eulerian-Cycle-Cut like E is called Extreme k-Variable. 2015
If k = 2, then any 2-function Eulerian-Cycle-Cut like E is called Extreme Variable. 2016
The notion of independent on Extreme Variable is likewise. 2017
Definition 10.0.4. (Extreme Expectation). 2018
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2019
71
is a probability Eulerian-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 2020

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

a probability Eulerian-Cycle-Cut. an Extreme number is called Extreme Crossing if the following 2024
expression is called Extreme Crossing criteria 2025
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2026
S = (V, E) is a probability Eulerian-Cycle-Cut. Let m and n propose special Eulerian-Cycle-Cut. Then 2027
with m ≥ 4n, 2028
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Eulerian-Cycle-Cut 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: 2029
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2030
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2031
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let P be a SuperHyperSet of n points in 2032
the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through at 2033
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2034
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2035

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

the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2043
k < 5n4/3 . 2044
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2045
S = (V, E) is a probability Eulerian-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle around 2046
each SuperHyperPoint of P. Let ni be the Extreme number of these SuperHyperCircles 2047
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 2048
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2049

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 2050
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2051
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 2052
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2053

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2054
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2055
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2056
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2057
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2058
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be a nonnegative Extreme Variable 2059
and t a positive real number. Then 2060
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. 2061
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2062
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let Xn be a nonnegative integer-valued 2063
variable in a probability Eulerian-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 2064

P (Xn = 0) → 1 as n → ∞. 2065
Proof. 2066
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. A special SuperHyperGraph in Gn,p almost 2068
surely has stability number at most d2p−1 log ne. 2069

S = (V, E) is a probability Eulerian-Cycle-Cut. A special SuperHyperGraph in Gn,p is up. Let 2071
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2072
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2073
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2074
of the Extreme SuperHyperGraph G. 2075
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2076
Extreme Variable for this Extreme Event. By equation, we have 2077
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 2078
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2079
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: 2080
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2081
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 2082
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2083
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2084
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2085
Definition 10.0.12. (Extreme Variance). 2086

is a probability Eulerian-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 2088
Variance if the following expression is called Extreme Variance criteria 2089
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be an Extreme Variable and let t be 2091
a positive real number. Then 2092
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be an Extreme Variable and let t be a positive 2094
real number. Then 2095
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
2096
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let Xn be an Extreme Variable in a 2098
probability Eulerian-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2099
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 2101
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2102
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2103
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2105
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 2106
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2107
S = (V, E) is a probability Eulerian-Cycle-Cut. As in the proof of related Theorem, the result is 2109
straightforward. 2110
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 2112
defined in previous Theorem. Then either: 2113
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2114
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2115
S = (V, E) is a probability Eulerian-Cycle-Cut. The latter is straightforward. 2117
Definition 10.0.17. (Extreme Threshold). 2118

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2119
probability Eulerian-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs (one which is 2120

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

Definition 10.0.18. (Extreme Balanced). 2125

is a probability Eulerian-Cycle-Cut. Let F be a fixed Extreme SuperHyperGraph. Then 2127
there is a threshold function for the property of containing a copy of F as an Extreme 2128
SubSuperHyperGraph is called Extreme Balanced. 2129
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let F be a nonempty balanced Extreme 2131
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2132
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2133
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2136
the mentioned Extreme Figures in every Extreme items. 2137
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2138
Cycle-Cut, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2139
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 2140
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2141
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2142
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2143
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2144
SuperHyperEulerian-Cycle-Cut. 2145
C(N SHG)Extreme Eulerian-Cycle-Cut

= {E4 }.
C(N SHG)Extreme Eulerian-Cycle-Cut SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Cycle-Cut
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Cycle-Cut SuperHyperPolynomial
= z 5 + 2z 3 .
2146
Cycle-Cut, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 2148
some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in 2149
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 2150
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 2151
no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2152
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperEulerian-Cycle-Cut. 2153

= {E4 }.

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

= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
2154
Cycle-Cut, is up. The Extreme Algorithm is Extremely straightforward. 2156

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



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

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

= 0z 0 .
2163

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

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

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

= 0z 0 .
2172

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

SuperHyperEulerian-Cycle-Cut, is up. The Extreme Algorithm is Extremely straightfor- 2177
ward. 2178


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

ward. 2182

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

= 0z 0 .
2183

ward. 2186

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

ward. 2190

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

ward. 2194

= {}.
= 0z 0 .


= {}.
= 0z 0 .
2195

ward. 2198

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


ward. 2202

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



ward. 2206

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

ward. 2210

= {}.


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

ward. 2214

= {Eii=112 }.
X
= z |Ei | .
Ei
i=112

= {V Eii=112 }.


X
= z |Vi | .
V Ei
i=112
2215

ward. 2218

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

ward. 2222

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

ward. 2226

= {}.

SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.3) 95NHG1
= 0z 0 .
= {}.
= 0z 0 .
2227
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2228
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Cycle-Cut if for any 2229
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2230
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2231
all minus all Extreme SuperHypeNeighbors to any amount of them. 2232
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2233
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2234

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

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Cycle-Cut is at least the 2240
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2241
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2242
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2243
SuperHyperVertices are renamed to Extreme Eulerian-Cycle-Cut in some cases but the maximum 2244
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2245
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2246

Eulerian-Cycle-Cut. 2247
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Cycle-Cut has, the least Extreme cardinality, the lower

sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Eulerian-Cycle-Cut with the least Extreme cardinality, the lower 2248
sharp Extreme bound for cardinality. 2249
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2250
Then in the worst case, literally, 2251
C(N SHG)ExtremeQuasi−Eulerian−Cycle−Cut
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−Cycle−CutSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Cycle-Cut. In other words, the least cardinality, the lower sharp 2252
bound for the cardinality, of an Extreme type-result-Eulerian-Cycle-Cut is the cardinality of 2253
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−Cycle−CutSuperHyperP 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-Cycle-Cut since
neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where amount
refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than one to
form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Eulerian-Cycle-Cut. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Eulerian-Cycle-Cut 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-Cycle-Cut. 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-Cycle-Cut decorates the Extreme SuperHyperVer-
tices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Eulerian-Cycle-Cut. Since at least two Extreme SuperHyperVertices involve to
make a title in the Extreme background of the Extreme SuperHyperGraph. The Extreme
SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two Extreme
SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in the
Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said

to be loopless. The Extreme adjective “loop” on the basic Extreme framework engages one
Extreme SuperHyperVertex but it never happens in this Extreme setting. With these Extreme
bases, on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus
there’s at least an Extreme R-Eulerian-Cycle-Cut has the Extreme cardinality of an Extreme Su-
perHyperEdge. Thus, an Extreme R-Eulerian-Cycle-Cut has the Extreme cardinality at least an
Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This Extreme
SuperHyperSet isn’t an Extreme R-Eulerian-Cycle-Cut since either the Extreme SuperHyperGraph
is an obvious Extreme SuperHyperModel thus it never happens since there’s no Extreme usage
of this Extreme framework and even more there’s no Extreme connection inside or the Extreme
SuperHyperGraph isn’t obvious and as its consequences, there’s an Extreme contradiction with
the term “Extreme R-Eulerian-Cycle-Cut” 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-Cycle-Cut is the Extreme SuperHyperSet of the Extreme SuperHyperVertices such that
some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle Extreme style.
The Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet
But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that

Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices

Is an Extreme R-Eulerian-Cycle-Cut for the Extreme SuperHyperGraph as used Extreme background

in the Extreme terms of worst Extreme case and the common theme of the lower Extreme
bound occurred in the specific Extreme SuperHyperClasses of the Extreme SuperHyperGraphs
which are Extreme free-quasi-triangle.
Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the
Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no Extreme
SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices have the
eligibles to be contained in an Extreme R-Eulerian-Cycle-Cut. Those Extreme SuperHyperVertices
are potentially included in an Extreme style-R-Eulerian-Cycle-Cut. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Eulerian-Cycle-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Cycle-Cut 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-Cycle-Cut. 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, 2254
Extreme R-Eulerian-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2255
Extreme R-Eulerian-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Cycle-Cut where E ∈ EESHG:(V,E) is fixed

that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in an
Extreme Eulerian-Cycle-Cut, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique. To
sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If an Extreme
SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Cycle-Cut is at least the 2256
maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2257

with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2258
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2259
SuperHyperVertices are renamed to Extreme Eulerian-Cycle-Cut in some cases but the maximum 2260
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2261
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2262
Eulerian-Cycle-Cut. 2263
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2264
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2265
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2266
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of 2267
Extreme SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken 2268
from that Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme 2269
SuperHyperSet of the Extreme SuperHyperVertices is either has the maximum Extreme 2270
SuperHyperCardinality or it doesn’t have maximum Extreme SuperHyperCardinality. In 2271
a non-obvious SuperHyperModel, there’s at least one Extreme SuperHyperEdge containing 2272
at least all Extreme SuperHyperVertices. Thus it forms an Extreme quasi-R-Eulerian-Cycle-Cut 2273
where the Extreme completion of the Extreme incidence is up in that. Thus it’s, literarily, an 2274
Extreme embedded R-Eulerian-Cycle-Cut. The SuperHyperNotions of embedded SuperHyperSet and 2275

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2276
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such 2277
that those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re 2278
Extreme SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices 2279
are included in the minimum Extreme style of the embedded Extreme R-Eulerian-Cycle-Cut. The 2280
interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2281

of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2282
common connections, more precise and more formal, the perfect unique connections inside 2283
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2284
Extreme R-Eulerian-Cycle-Cut. Thus Extreme exterior SuperHyperVertices could be used only in 2285
one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior Extreme 2286
SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme Eulerian-Cycle- 2287
Cut, there’s the usage of exterior Extreme SuperHyperVertices since they’ve more connections 2288
inside more than outside. Thus the title “exterior” is more relevant than the title “interior”. One 2289
Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet of the 2290
Extreme SuperHyperVertices with one SuperHyperElement has been ignored in the exploring 2291
to lead on the optimal case implying the Extreme R-Eulerian-Cycle-Cut. The Extreme R-Eulerian- 2292
Cycle-Cut with the exclusion of the exclusion of all Extreme SuperHyperVertices in one Extreme 2293
SuperHyperEdge and with other terms, the Extreme R-Eulerian-Cycle-Cut with the inclusion of 2294
all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme quasi-R- 2295
Eulerian-Cycle-Cut. To sum them up, in a connected non-obvious Extreme SuperHyperGraph 2296
ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the 2297
maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of any given 2298
Extreme quasi-R-Eulerian-Cycle-Cut minus all Extreme SuperHypeNeighbor to some of them but not 2299
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2300
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Cycle-Cut, minus 2301
all Extreme SuperHypeNeighbor to some of them but not all of them. 2302
The main definition of the Extreme R-Eulerian-Cycle-Cut has two titles. an Extreme quasi-R- 2303
Eulerian-Cycle-Cut and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2304
two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi- 2305
R-Eulerian-Cycle-Cut with that quasi-maximum Extreme SuperHyperCardinality in the terms of 2306

the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, 2307
then the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme 2308
quasi-R-Eulerian-Cycle-Cuts for all Extreme numbers less than its Extreme corresponded maximum 2309
number. The essence of the Extreme Eulerian-Cycle-Cut ends up but this essence starts up in the 2310
terms of the Extreme quasi-R-Eulerian-Cycle-Cut, again and more in the operations of collecting all 2311
the Extreme quasi-R-Eulerian-Cycle-Cuts acted on the all possible used formations of the Extreme 2312
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2313
considered as the equivalence class for all corresponded quasi-R-Eulerian-Cycle-Cuts. Let 2314
zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Cycle-Cut be an Extreme number, an 2315
Extreme SuperHyperSet and an Extreme Eulerian-Cycle-Cut. Then 2316
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Cycle-Cut is re-formalized and 2317
redefined as follows. 2318
GExtreme Eulerian-Cycle-Cut ∈ ∪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 2319
definition for the Extreme Eulerian-Cycle-Cut. 2320
GExtreme Eulerian-Cycle-Cut =
{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-Cycle-Cut 2321
poses the upcoming expressions. 2322
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2323
= maxzExtreme Number

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

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



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

2327
= max zExtreme Number

2328

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2329
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2330
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2331
It’s, literarily, another name for “Extreme Quasi-Eulerian-Cycle-Cut” but, precisely, it’s the gen- 2332
eralization of “Extreme Quasi-Eulerian-Cycle-Cut” since “Extreme Quasi-Eulerian-Cycle-Cut” happens 2333
“Extreme Eulerian-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and background 2334
but “Extreme SuperHyperNeighborhood” may not happens “Extreme Eulerian-Cycle-Cut” in an 2335
Extreme SuperHyperGraph as initial framework and preliminarily background since there are 2336
some ambiguities about the Extreme SuperHyperCardinality arise from it. To get orderly 2337
keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Eulerian-Cycle-Cut”, 2338
and “Extreme Eulerian-Cycle-Cut” are up. 2339
Thus, let 2340
zExtreme Number , NExtreme SuperHyperNeighborhood and 2341
GExtreme Eulerian-Cycle-Cut be an Extreme number, an Extreme SuperHyperNeighborhood and an 2342

Extreme Eulerian-Cycle-Cut and the new terms are up. 2343
GExtreme Eulerian-Cycle-Cut ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2344
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2345
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2346
And with go back to initial structure, 2347
GExtreme Eulerian-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2348

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

2349
= max zExtreme Number

2350

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

SuperHyperSet of the Extreme SuperHyperVertices,

Is an Extreme R-Eulerian-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG :

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Eulerian-Cycle-Cut is related to the Extreme SuperHyperSet of the Extreme SuperHy-
perVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Eulerian-Cycle-Cut is up. The obvious simple Extreme type-
SuperHyperSet called the Extreme Eulerian-Cycle-Cut is an Extreme SuperHyperSet includes
only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Cut 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-Cycle-Cut. Since

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

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

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

not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2351
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2352
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2353
the 2354
“Extreme R-Eulerian-Cycle-Cut” 2355
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2356
Extreme R-Eulerian-Cycle-Cut, 2357
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Eulerian-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Eulerian-Cycle-Cut is the cardinality of
2358
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2359
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Cycle-Cut if for any of 2360

them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2361
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2362
all minus all Extreme SuperHypeNeighbors to any amount of them. 2363
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2364
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2365
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2366
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2367
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2368
R-Eulerian-Cycle-Cut with the least cardinality, the lower sharp Extreme bound for Extreme 2369
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2370
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2371
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2372
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Eulerian-Cycle-Cut. Since it 2373
doesn’t have 2374
2375
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2376
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2377
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2378
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2379

but it isn’t an Extreme R-Eulerian-Cycle-Cut. Since it doesn’t do the Extreme procedure such 2380
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2381
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2382
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2383
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2384
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2385
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2386
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Eulerian-Cycle-Cut, VESHE 2387
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Cut, 2388
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2389
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2390
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2391
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2392
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2393
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2394
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Eulerian-Cycle-Cut only contains all 2395
interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2396
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2397
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2398
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2399
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2400
The SuperHyperNotion, namely, Eulerian-Cycle-Cut, is up. There’s neither empty SuperHyperEdge 2401
nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2402
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2403
Cycle-Cut. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2404

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Eulerian−Cycle−CutSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Eulerian−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Eulerian−Cycle−CutSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Eulerian-Cycle-Cut. The Extreme 2405
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2406
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2407

is an Extreme type-SuperHyperSet with 2408
2409
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2410
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2411

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2412
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2413
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Cycle-Cut is up. The obvious 2414
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Cycle-Cut is an Extreme SuperHy- 2415
perSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet of 2416
the Extreme SuperHyperEdges[SuperHyperVertices], 2417
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- 2418
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2419

Cycle-Cut is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2420
perEdges[SuperHyperVertices], 2421
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-Cycle-Cut. Since 2422
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2423
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2424
is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2425

Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme 2426
type-SuperHyperSet called the Extreme Eulerian-Cycle-Cut and it’s an Extreme Eulerian-Cycle-Cut. 2427
Since it’s 2428
2429
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2430
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2431

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2432
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2433
intended Extreme SuperHyperSet, 2434
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.

= az s + bz t .
Thus the non-obvious Extreme Eulerian-Cycle-Cut , 2435
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-Cycle-Cut 2436
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2437
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 2438
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2439
SuperHyperSet called the 2440
“Extreme Eulerian-Cycle-Cut ” 2441
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2442
Extreme Eulerian-Cycle-Cut , 2443

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

CHAPTER 11 2446
The Extreme Departures on The 2447
Theoretical Results Toward Theoretical 2448
Motivations 2449
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2450
SuperHyperClasses. 2451
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2452

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

SuperHyperEulerian-Cycle-Cut in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2455
new way to redefine as 2456
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 2457
ViEXT ERN AL in the literatures of SuperHyperEulerian-Cycle-Cut. The latter is straightforward. 2458
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2459
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2460
(31.1), is the SuperHyperEulerian-Cycle-Cut. 2461
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2462

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

= {VEi ∈EN SHG }.

X
= z |VEi ∈EN SHG | .
Proof. Let 2463
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2464
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 2465

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2469
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2470
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Cycle-Cut. 2471
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2472

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

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

SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2473
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2474
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 2475
way to redefine as 2476


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

SuperHyperEulerian-Cycle-Cut 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), 2479
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2480
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2481
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2482
Cycle-Cut. 2483
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2484

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2485
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
2486
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 2487
a new way to redefine as 2488

Then there’s no at least one SuperHyperEulerian-Cycle-Cut. Thus the notion of quasi may be up 2491
but the SuperHyperNotions based on SuperHyperEulerian-Cycle-Cut could be applied. There are 2492
only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2493
the representative in the 2494
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Extreme SuperHyperBipartite 2495
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2496
SuperHyperPart SuperHyperEdges are attained in any solution 2497
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2498
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2499
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2500
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2501
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2502
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Cycle-Cut. 2503

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

Extreme SuperHyperEulerian-Cycle-Cut in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2504
Then 2505

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

2507
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Extreme SuperHyperMultipartite 2508

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2517
SuperHyperEdges are attained in any solution 2518
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2519
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2521
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2522
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2523
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2524
the Extreme SuperHyperEulerian-Cycle-Cut. 2525
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2526

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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2527
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2528
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Extreme SuperHyperWheel 2529
ESHW : (V, E). There’s a new way to redefine as 2530


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

Extreme SuperHyperEulerian-Cycle-Cut in the Extreme Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEulerian-Cycle-Cut. Thus the notion of quasi isn’t up and 2533
the SuperHyperNotions based on SuperHyperEulerian-Cycle-Cut could be applied. The unique 2534
embedded SuperHyperEulerian-Cycle-Cut proposes some longest SuperHyperEulerian-Cycle-Cut excerpt 2535
from some representatives. The latter is straightforward. 2536
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2537
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2538
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2539
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2540
Extreme SuperHyperEulerian-Cycle-Cut. 2541

CHAPTER 12 2542
The Surveys of Mathematical Sets On 2543
The Results But As The Initial Motivation 2544
For the SuperHyperEulerian-Cycle-Cut, Extreme SuperHyperEulerian-Cycle-Cut, and the Extreme 2545

SuperHyperEulerian-Cycle-Cut, some general results are introduced. 2546
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Cycle-Cut is “redefined” on the 2547
positions of the alphabets. 2548
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Cycle-Cut. Then 2549
Extreme SuperHyperEulerian − Cycle − Cut =

{theSuperHyperEulerian − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − Cycle − Cut
|ExtremecardinalityamidthoseSuperHyperEulerian−Cycle−Cut. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2550
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2551
and the neutrality, for i = 1, 2, 3, respectively. 2552
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2553
alphabet. Then the notion of Extreme SuperHyperEulerian-Cycle-Cut and SuperHyperEulerian-Cycle-Cut 2554
coincide. 2555
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2556
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2557
SuperHyperEulerian-Cycle-Cut if and only if it’s a SuperHyperEulerian-Cycle-Cut. 2558
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2559
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2560
SuperHyperEulerian-Cycle-Cut if and only if it’s a longest SuperHyperEulerian-Cycle-Cut. 2561
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the 2562
same identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Cycle-Cut is its 2563
SuperHyperEulerian-Cycle-Cut and reversely. 2564
123
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Cycle-Cut, SuperHy- 2565

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical 2566
letter of the alphabet. Then its Extreme SuperHyperEulerian-Cycle-Cut is its SuperHyperEulerian-Cycle-Cut 2567
and reversely. 2568
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2569
isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Cut isn’t well-defined.
Cycle-Cut 2570
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2571
Extreme SuperHyperEulerian-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Cut 2572

isn’t well-defined. 2573

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2575
SuperHyperEulerian-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Cut isn’t 2576
well-defined. 2577
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2578
is well-defined if and only if its SuperHyperEulerian-Cycle-Cut is well-defined.
Cycle-Cut 2579
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2580

Extreme SuperHyperEulerian-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Cycle-Cut is 2581
well-defined. 2582

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2584
SuperHyperEulerian-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Cycle-Cut is well- 2585
defined. 2586
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2587
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2588
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2589
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2590
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2591
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2592
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2593
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2594
(i) : the SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2595
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2596
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2597
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2598
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2599

(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2600
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2601

independent SuperHyperSet is 2602
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2605
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2609

which is a SuperHyperEulerian-Cycle-Cut/SuperHyperPath. Then V is a maximal 2610
(i) : SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2611
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2612
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2613
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2614
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2615
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2616
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2617
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2618

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2619
(i) : dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2620
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2621
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2622
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2623
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2624
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2625

which is a SuperHyperEulerian-Cycle-Cut/SuperHyperPath. Then the number of 2628
(i) : the SuperHyperEulerian-Cycle-Cut; 2629

(ii) : the SuperHyperEulerian-Cycle-Cut; 2630
(iii) : the connected SuperHyperEulerian-Cycle-Cut; 2631
(iv) : the O(ESHG)-SuperHyperEulerian-Cycle-Cut; 2632
(v) : the strong O(ESHG)-SuperHyperEulerian-Cycle-Cut; 2633
(vi) : the connected O(ESHG)-SuperHyperEulerian-Cycle-Cut. 2634
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2635
coincide. 2636

which is a SuperHyperWheel. Then the number of 2638
(i) : the dual SuperHyperEulerian-Cycle-Cut; 2639
(ii) : the dual SuperHyperEulerian-Cycle-Cut; 2640
(iii) : the dual connected SuperHyperEulerian-Cycle-Cut; 2641
(iv) : the dual O(ESHG)-SuperHyperEulerian-Cycle-Cut; 2642
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Cycle-Cut; 2643
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Cycle-Cut. 2644
coincide. 2646
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2648

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2649
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2650
is a 2651
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2655
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2656
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2657

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2660
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2661
SuperHyperPart is a 2662

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2666
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2667
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2668

SuperHyperMultipartite. Then Then the number of 2671
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2678
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2679
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2681
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2682
(iv) : SuperHyperEulerian-Cycle-Cut; 2686
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2687
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2688
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2689
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2690
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2691
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2692

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

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2697
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2699
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2700
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2701
dual 2702
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2706
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2709
perComplete. Then there’s no independent SuperHyperSet. 2710
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2711

SuperHyperEulerian-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2712
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2713
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2717
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2718
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2719
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2720
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2721
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2722
t>
2
setting of a dual 2723



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2730
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2731
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2732
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2733
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2734
SuperHyperDefensive SuperHyperEulerian-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 2735
(i) v ∈ Ns (x); 2736
(ii) vx ∈ E. 2737
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2738
SuperHyperDefensive SuperHyperEulerian-Cycle-Cut, then 2739
(i) S is SuperHyperEulerian-Cycle-Cut set; 2740
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2741
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2742
(i) Γ ≤ O; 2743
(ii) Γs ≤ On . 2744
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2745
connected. Then 2746
(i) Γ ≤ O − 1; 2747
(ii) Γs ≤ On − Σ3i=1 σi (x). 2748
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2749
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2750

SuperHyperEulerian-Cycle-Cut; 2751
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2752
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2753
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2754

Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2756
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2757
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2758
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2759
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2760
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Cycle-Cut. Then 2762
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2763

Cycle-Cut; 2764
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2765
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2766
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2767
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Cycle-Cut. Then 2769

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2773
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2774
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2776
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Cycle-Cut; 2777
(ii) Γ = 1; 2778
(iii) Γs = Σ3i=1 σi (c); 2779
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle-Cut. 2780
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2781
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2782
SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2783
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2784
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2785
i=1

6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2786
SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 2787
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2788
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Cycle- 2789
Cut; 2790
(ii) Γ = b n2 c + 1; 2791
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 2792
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2793
Cycle-Cut. 2794
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2795
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2796
(ii) Γ = b n2 c; 2797
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

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

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

Cycle-Cut for N SHF; 2804
(ii) Γ = m for N SHF : (V, E); 2805
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2806
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle- 2807
Cut for N SHF : (V, E). 2808
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2809

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2810
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 2811
SuperHyperEulerian-Cycle-Cut for N SHF; 2812
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2813
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2814
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEulerian-Cycle-Cut for 2815
N SHF : (V, E). 2816

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2818
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut 2819
for N SHF : (V, E); 2820
(ii) Γ = b n2 c for N SHF : (V, E); 2821
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

bnc for N SHF : (V, E); 2822
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Cycle-Cut for 2823
N SHF : (V, E). 2824
following statements hold; 2826
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2827

SuperHyperEulerian-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 2828
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2829
SuperHyperEulerian-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian-Cycle- 2830

Cut. 2831
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2834

SuperHyperEulerian-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Cycle-Cut; 2835

SuperHyperEulerian-Cycle-Cut, then S is a dual s-SuperHyperPowerful SuperHyperEulerian-Cycle- 2837
Cut. 2838
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2839

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

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

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

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

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

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

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

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


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

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


SuperHyperGraph which is SuperHyperEulerian-Cycle-Cut. Then following statements hold; 2880
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 2881
Cycle-Cut; 2882
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2883

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

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

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

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


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

SuperHyperEulerian-Cycle-Cut 136NSHGaa21aa
137
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEulerian- 2934
Cycle-Cut. 2935

CHAPTER 15 2936
Case 2: The Increasing Extreme Steps 2937
Toward Extreme 2938
SuperHyperMultipartite as Extreme 2939
SuperHyperModel 2940
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2941
is Extreme highlighted and Extreme featured. 2942
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2943
partite is obtained. 2944
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 2945
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

139
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite ESHM : 2946

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEulerian-Cycle-Cut. 2947
2948

CHAPTER 16 2949
Wondering Open Problems But As The 2950
Directions To Forming The Motivations 2951
In what follows, some “problems” and some “questions” are proposed. 2952
The SuperHyperEulerian-Cycle-Cut and the Extreme SuperHyperEulerian-Cycle-Cut are defined on a real- 2953
world application, titled “Cancer’s Recognitions”. 2954
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2955
recognitions? 2956
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Cycle-Cut and 2957
the Extreme SuperHyperEulerian-Cycle-Cut? 2958
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2959
them? 2960
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 2961
and the Extreme SuperHyperEulerian-Cycle-Cut?
Cycle-Cut 2962
Problem 16.0.5. The SuperHyperEulerian-Cycle-Cut and the Extreme SuperHyperEulerian-Cycle-Cut do 2963

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

CHAPTER 18 2996
Extreme SuperHyperDuality But As The 2997
Super Forms 2999
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3000

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

Va ∈ Ei , Ej ; 3004
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3005
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3006
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3007
Vi , Vj ∈ Ea ; 3008
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3009
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3010
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3011
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3012

SuperHyperDuality. 3013
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3014

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3019
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3020
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3021
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3022
Extreme SuperHyperDuality; 3023
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3024

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3025
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3026
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3027
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3028
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3029
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3030

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3031
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3032
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3034
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3035
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3036
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3037
coefficient; 3038
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3039

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

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3057
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3058
perHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3059
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3060
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3061

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3062
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3063
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3064
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3065
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3066

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3067

tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 3068
corresponded to its Extreme coefficient; 3069
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3070

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3075
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3076
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3077
to its Extreme coefficient. 3078
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3079
mentioned Extreme Figures in every Extreme items. 3080
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3081
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3082
C(N SHG)Extreme SuperHyperDuality = {E4 }.

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


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

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 3139
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. 3143
(31.1), is the SuperHyperDuality. 3146
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 3148
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3165
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 3167
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 3170
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3171
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3172
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3173
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3174
representative in the 3175
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 : 3176

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3188


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

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

∃!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 3213
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3214
Extreme SuperHyperDuality. 3220

CHAPTER 19 3221
Extreme SuperHyperJoin But As The 3222
Super Forms 3224
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3225

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3236
|Vj |NEUTROSOPIC CARDINALITY ; 3237
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3238
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3239
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3240

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3244
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3245
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3246
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3248
159
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3249

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3256
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3257
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3258
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3259
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3260
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3261
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3262
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3263

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3275
SuperHyperJoin; 3277
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3278

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3281
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3282
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3283
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3284
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3285

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3288

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

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

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

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

is up. The Extreme Algorithm is Extremely straightforward. 3318


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3439
Extreme SuperHyperPerfect But As The 3440
Super Forms 3442
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3443

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3455
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3456

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3460
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3461
Extreme SuperHyperPerfect; 3465
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3466

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3473
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3474
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3479
coefficient; 3480
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3481

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

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

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3499
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3500
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3502
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3503

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3517
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3518
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3519
to its Extreme coefficient. 3520
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3523
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3524
SuperHyperPerfect. 3530
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

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


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

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

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

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

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



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

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

Then 3628

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



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

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

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


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

CHAPTER 21 3663
Extreme SuperHyperTotal But As The 3664
Super Forms 3666
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3667
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3670
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3671

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3677
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3678

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3682
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3684
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3686
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3687

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3688
187

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3694
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3695
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3696
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3697
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3698
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3699
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3700
cient; 3701
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3702

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3703
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3705
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3706
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3707

cient; 3710
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3711

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3713
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3714
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3715
SuperHyperTotal; 3717
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3718

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3720
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3721
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3723
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3724

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3725
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3726
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3729
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3730
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3731
Extreme coefficient; 3732

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3734
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3736
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3737
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3738
cient. 3741
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3744
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3745
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3746
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3747
SuperHyperTotal. 3751
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

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

V3 , is excluded in every given Extreme SuperHyperTotal. 3758



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3806
(31.1), is the SuperHyperTotal. 3809
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 3811
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. 3818
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 3820
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3882
Extreme SuperHyperConnected But As 3883
The Extensions Excerpt From Dense And 3884
Super Forms 3885
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3886

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3900
SuperHyperConnected. 3901
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3902
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3905

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3907
201
Extreme SuperHyperConnected; 3911
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3912

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3919
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3920
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3921
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3922
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3923
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3924
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3925
power is corresponded to its Extreme coefficient; 3926
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3927


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

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

is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Su- 3946
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3948
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 3949

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

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

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

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

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

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

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


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

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

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 4027
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. 4031
(31.1), is the SuperHyperConnected. 4034
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 4036
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. 4043
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 4045



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4064

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4099
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4100
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4101
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4102
some representatives. The latter is straightforward. 4103
Extreme SuperHyperConnected. 4108

CHAPTER 23 4109
Background 4110
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 4117
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 4118
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 4119
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 4120
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 4121
results based on initial background. 4122
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4123
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4124
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 4131
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 4132
and fundamental SuperHyperNumbers. 4133
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 4134
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 4135
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 4136
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 4137

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 4138
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 4139
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 4140
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 4141
215


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 4170
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 4171
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 4172
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 4173
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 4174

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 4175
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 4176
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 4177
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 4178
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 4179

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 4180
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 4181
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 4182
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 4183
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 4184
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 4185

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 4186
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 4187
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 4188
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 4189

Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 4190
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 4191
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 4192
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 4193
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 4194
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 4195
Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 4196
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 4197
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 4198
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 4199
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 4200
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 4201
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 4202

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 4203
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 4204
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 4205
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 4206
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 4207
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 4208
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 4209
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4210
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4211
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 4212
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 4213
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 4214

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 4215
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 4216
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 4217
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModel- 4218
ing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 4219
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 4220
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 4221
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 4222
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 4223
in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; 4224

HG251; HG252; HG253], there are some endeavors to formalize the basic SuperHyperNotions 4242
about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific research books 4243
at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; HG68b; 4244

HG161b; HG162b; HG163b; HG164b; HG165b]. Two popular scientific research 4256
books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic science 4257
is on [HG32b; HG44b]. 4258
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4259
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4260
than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4261
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4262
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4269
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4270
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4271
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the no- 4272
tions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHy- 4273
perGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; 4274

HG248; HG249; HG250; HG251; HG252; HG253] alongside scientific research books 4292

is on [HG32b; HG44b]. 4307

Bibliography 4308
10.33140/JMTCM.01.03.09) 4315
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4333
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4334
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4335
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4336
221
10.20944/preprints202301.0282.v1). 4343
10.20944/preprints202301.0267.v1). 4346
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4350

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4351
prints202301.0262.v1). 4355
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4361
prints202301.0105.v1). 4364
Preprints 2023, 2023010044 4370
(doi: 10.20944/preprints202301.0043.v1). 4373

(doi: 10.20944/preprints202212.0549.v1). 4382
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4383
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4384
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4385
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4386
(doi: 10.20944/preprints202212.0500.v1). 4389
10.5281/zenodo.7853867). 4398
10.5281/zenodo.7853922). 4401

(doi: 10.5281/zenodo.7851519). 4404
HG250 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 4405
(doi: 10.5281/zenodo.7851550). 4407
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4412

10.5281/zenodo.7834229). 4416
10.5281/zenodo.7834261). 4419
10.5281/zenodo.7824560). 4422
(doi: 10.5281/zenodo.7824623). 4425
2023, (doi: 10.5281/zenodo.7809365). 4436
2023, (doi: 10.5281/zenodo.7809358). 4439
10.5281/zenodo.7809219). 4442
HG237 [41] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4443
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 4444
10.5281/zenodo.7809328). 4445
2023, (doi: 10.5281/zenodo.7806767). 4448
2023, (doi: 10.5281/zenodo.7806838). 4451

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4453
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4454
(doi: 10.5281/zenodo.7799902). 4460
2023, (doi: 10.5281/zenodo.7804218). 4463
(doi: 10.5281/zenodo.7796334). 4466
10.5281/zenodo.7791952). 4472
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4474
10.5281/zenodo.7791982). 4475
10.5281/zenodo.7790026). 4478
HG223 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4479
10.5281/zenodo.7790052). 4481
2023, (doi: 10.5281/zenodo.7787066). 4484
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4486
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4487
10.5281/zenodo.7781476). 4490

10.5281/zenodo.7783082). 4493
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4495
10.5281/zenodo.7777857). 4496
10.5281/zenodo.7779286). 4499
(doi: 10.5281/zenodo.7771831). 4502
2023, (doi: 10.5281/zenodo.7772468). 4505
10.13140/RG.2.2.20913.25446). 4508
HG212 [63] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4509
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4510
odo.7764916). 4511
10.13140/RG.2.2.11770.98247). 4514
10.13140/RG.2.2.12400.12808). 4517
2023, (doi: 10.13140/RG.2.2.22545.10089). 4520
10.13140/RG.2.2.11377.76644). 4526
10.13140/RG.2.2.23750.96329). 4529

10.13140/RG.2.2.31366.24641). 4532
10.13140/RG.2.2.34721.68960). 4535
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4537
2023, (doi: 10.13140/RG.2.2.30212.81289). 4538
10.13140/RG.2.2.24288.35842). 4544
10.13140/RG.2.2.32467.25124). 4547
10.13140/RG.2.2.31025.45925). 4550
10.13140/RG.2.2.17184.25602). 4553
10.13140/RG.2.2.23423.28327). 4556
10.13140/RG.2.2.28456.44805). 4559
10.13140/RG.2.2.23525.68320). 4562
HG194 [81] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4563
10.13140/RG.2.2.20170.24000). 4565
10.13140/RG.2.2.36475.59683). 4568

10.13140/RG.2.2.29764.71046). 4571
2023, (doi: 10.13140/RG.2.2.18780.87683). 4574
10.13140/RG.2.2.26134.01603). 4580
HG188 [87] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4581
10.13140/RG.2.2.27392.30721). 4583
10.13140/RG.2.2.33028.40321). 4586
10.13140/RG.2.2.21389.20966). 4589
10.13140/RG.2.2.16356.04489). 4592
10.13140/RG.2.2.21756.21129). 4595
HG183 [92] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4596
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4597
10.13140/RG.2.2.30983.68009). 4598
10.13140/RG.2.2.28552.29445). 4601
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4603
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4604
10.13140/RG.2.2.35105.89447). 4607

(doi: 10.13140/RG.2.2.30072.72960). 4610
10.13140/RG.2.2.31147.52003). 4613
10.13140/RG.2.2.32825.24163). 4616
10.13140/RG.2.2.13059.58401). 4619
10.13140/RG.2.2.11172.14720). 4622
2023, (doi: 10.13140/RG.2.2.22011.80165). 4625
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4628
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4630
2023, (doi: 10.13140/RG.2.2.10493.84962). 4631
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4634
2023, (doi: 10.13140/RG.2.2.19944.14086). 4637
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4640
(doi: 10.13140/RG.2.2.33103.76968). 4643
HG167 [108] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4644
(doi: 10.13140/RG.2.2.23037.44003). 4646

(doi: 10.13140/RG.2.2.35646.56641). 4649
(doi: 10.13140/RG.2.2.18030.48967). 4652
(doi: 10.13140/RG.2.2.13973.81121). 4655
2023, (doi: 10.13140/RG.2.2.34106.47047). 4658
2023, (doi: 10.13140/RG.2.2.31956.88961). 4664
2023, (doi: 10.13140/RG.2.2.15179.67361). 4667
10.13140/RG.2.2.21510.45125). 4670
HG158 [117] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4671
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4672
2023, (doi: 10.13140/RG.2.2.13121.84321). 4673
10.13140/RG.2.2.11758.69441). 4676
2023, (doi: 10.13140/RG.2.2.31891.35367). 4679
10.13140/RG.2.2.19360.87048). 4682
HG154 [121] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4683
10.13140/RG.2.2.32363.21286). 4685

10.13140/RG.2.2.23266.81602). 4688
10.13140/RG.2.2.19911.37285). 4691
10.13140/RG.2.2.11050.90569). 4694
HG150 [125] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4695
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4696
2023, (doi: 10.13140/RG.2.2.17761.79206). 4697
HG149 [126] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4698
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4699
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4702
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4703
(doi: 10.13140/RG.2.2.30182.50241). 4706

2023, (doi: 10.13140/RG.2.2.17252.24968). 4739
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4747
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4748
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4751
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4753
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4754
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4755


HG128 [146] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4760
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4761
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4762

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

10.20944/preprints202301.0282.v1). 4772
10.20944/preprints202301.0267.v1).). 4775

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4780
prints202301.0262.v1). 4784

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

10.13140/RG.2.2.35061.65767). 4793
10.13140/RG.2.2.18494.15680). 4797
10.13140/RG.2.2.32530.73922). 4801

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4803
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4804
10.13140/RG.2.2.15897.70243). 4805
10.13140/RG.2.2.32530.73922). 4809
prints202301.0105.v1). 4812

10.13140/RG.2.2.23172.19849). 4819
10.13140/RG.2.2.17385.36968). 4829
Preprints 2023, 2023010044 4832
(doi: 10.20944/preprints202301.0043.v1). 4835
2023, (doi: 10.13140/RG.2.2.28945.92007). 4838

10.13140/RG.2.2.35774.77123). 4844

10.13140/RG.2.2.29430.88642). 4850
(doi: 10.20944/preprints202212.0549.v1). 4856

10.13140/RG.2.2.19380.94084). 4859
(doi: 10.20944/preprints202212.0500.v1). 4870
10.13140/RG.2.2.20993.12640). 4873
HG952 [180] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4874

HG95 [181] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 4877
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 4878
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 4879

10.13140/RG.2.2.29173.86244). 4888
HG38 [185] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4889
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4890
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4891
(doi: 10.5281/zenodo.7854561). 4893
2023 (doi: 10.5281/zenodo.7851893). 4895

(doi: 10.5281/zenodo.7835063). 4899
(doi: 10.5281/zenodo.7826705). 4901
2023 (doi: 10.5281/zenodo.7820680). 4903
10.5281/zenodo.7812750). 4905


2023 (doi: 10.5281/zenodo.7807782). 4911
2023 (doi: 10.5281/zenodo.7804449). 4913

(doi: 10.5281/zenodo.7792307). 4917
(doi: 10.5281/zenodo.7790728). 4919
2023 (doi: 10.5281/zenodo.7787712). 4921
10.5281/zenodo.7783791). 4923
10.5281/zenodo.7780123). 4925
(doi: 10.5281/zenodo.7773119). 4927
odo.7637762). 4929
10.5281/zenodo.7766174). 4931
10.5281/zenodo.7762232). 4933
(doi: 10.5281/zenodo.7758601). 4935
10.5281/zenodo.7754661). 4937
10.5281/zenodo.7750995) . 4939
(doi: 10.5281/zenodo.7749875). 4941
10.5281/zenodo.7747236). 4943
10.5281/zenodo.7742587). 4945
(doi: 10.5281/zenodo.7738635). 4947
10.5281/zenodo.7734719). 4949
10.5281/zenodo.7730484). 4951

(doi: 10.5281/zenodo.7730469). 4953
10.5281/zenodo.7722865). 4955
odo.7713563). 4957
odo.7709116). 4959
10.5281/zenodo.7706415). 4961
(doi: 10.5281/zenodo.7706063). 4963
(doi: 10.5281/zenodo.7701906). 4965
odo.7700205). 4967
10.5281/zenodo.7694876). 4969
10.5281/zenodo.7679410). 4971
10.5281/zenodo.7675982). 4973
10.5281/zenodo.7672388). 4975
odo.7668648). 4977
10.5281/zenodo.7662810). 4979
10.5281/zenodo.7659162). 4981
HG120b [231] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4982
10.5281/zenodo.7653233). 4983
odo.7653204). 4985
odo.7653142). 4987

odo.7653117). 4989
odo.7653089). 4991
odo.7651687). 4993
odo.7651619). 4995
odo.7651439). 4997
odo.7650729). 4999
odo.7647868). 5001
odo.7647017). 5003
odo.7644894). 5005
odo.7641880). 5007
odo.7632923). 5009
odo.7623459). 5011
10.5281/zenodo.7606416). 5013
10.5281/zenodo.7606416). 5015
odo.7606404). 5017
10.5281/zenodo.7580018). 5019
odo.7580018). 5021
odo.7580018). 5023

odo.7579929). 5025
10.5281/zenodo.7563170). 5027
odo.7563164). 5029
odo.7563160). 5031
odo.7563160). 5033
10.5281/zenodo.7563160). 5035
10.5281/zenodo.7557063). 5037
10.5281/zenodo.7557009). 5039
10.5281/zenodo.7539484). 5041
10.5281/zenodo.7523390). 5043
10.5281/zenodo.7523390). 5045
10.5281/zenodo.7523390). 5047
odo.7574952). 5049
10.5281/zenodo.7574992). 5051
odo.7523357). 5053
10.5281/zenodo.7523357). 5055
10.5281/zenodo.7504782). 5057
10.5281/zenodo.7504782). 5059

10.5281/zenodo.7504782). 5061
10.5281/zenodo.7499395). 5063
odo.7499395). 5065
10.5281/zenodo.7499395). 5067
10.5281/zenodo.7497450). 5069
10.5281/zenodo.7497450). 5071
10.5281/zenodo.7494862). 5073
odo.7494862). 5075
10.5281/zenodo.7494862). 5077
10.5281/zenodo.7493845). 5079
10.5281/zenodo.7493845). 5081
10.5281/zenodo.7493845). 5083
odo.7539484). 5085
odo.7523390). 5087
odo.7523357). 5089
odo.7504782). 5091
odo.7499395). 5093
odo.7497450). 5095

odo.7494862). 5097
odo.7493845). 5099
odo.7480110). 5101
odo.7378758). 5103
HG32b [292] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5104
10.5281/zenodo.6320305). 5105
odo.6677173). 5107

CHAPTER 24 5108
Cancer In Neutrosophic 5109
SuperHyperGraph 5110
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5111
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5112
disease is considered and as the consequences of the model, some parameters are used. The 5113
cells are under attack of this disease but the moves of the cancer in the special region are the 5114
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5115
treatments for this Neutrosophic disease. 5116
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5117
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 5118
Neutrosophic function. 5119
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 5120
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 5121
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5122
easily identified since there are some determinacy, indeterminacy and neutrality about the 5123
moves and the effects of the cancer on that region; this event leads us to choose another 5124
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 5125
what’s happened and what’s done. 5126
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5127
known and they’ve got the names, and some general Neutrosophic models. The moves and 5128
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 5129
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK-Domination, 5130
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 5131
aim is to find either the Neutrosophic SuperHyperK-Domination or the Neutrosophic 5132
SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyperModels. 5133
Some cells have been faced with some attacks from the situation which is caused by the 5134
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5135
which in that, the cells could be labelled as some groups and some groups or individuals have 5136
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5137
the embedded situations, the individuals of cells and the groups of cells could be considered 5138
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5139
243
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 5140
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 5141
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 5142
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 5143
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 5144
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 5145
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 5146
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 5147
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 5148
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 5149
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 5150
figure out what’s going on this phenomenon. The special case of this disease is considered and 5151
disease but the moves of the cancer in the special region are the matter of mind. The recognition 5153
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5154
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5155
both bases are the background of this research. Sometimes the cancer has been happened on the 5156
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5157
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 5158
forms of alliances’ styles with the formation of the design and the architecture are formally called 5159
“ SuperHyperK-Domination” in the themes of jargons and buzzwords. The prefix “SuperHyper” 5160
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 5161
The recognition of the cancer in the long-term function. The specific region has been assigned 5162
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5163
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5164
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5165
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5166
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 5167
some specific models, which are well-known and they’ve got the names, and some general models. 5168
The moves and the traces of the cancer on the complex tracks and between complicated groups 5169
of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperK-Domination, 5170

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5171
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5172
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5173
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5174
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5175
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5176
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5177
deforms and it doesn’t form. 5178
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5180
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5181
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5183
these messy and dense SuperHyperModels where embedded notions are illustrated? 5184

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5185
it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5186
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5187
the research has taken more motivations to define SuperHyperClasses and to find some 5188
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5189
some instances and examples to make clarifications about the framework of this research. The 5190
general results and some results about some connections are some avenues to make key point of 5191
this research, “Cancer’s Recognition”, more understandable and more clear. 5192
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5193
research on the modeling of the regions where are under the attacks of the cancer to 5194
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5195
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5196
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5197
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5198
instances and literature reviews have taken the whole way through. In this scientific research, 5199
the literature reviews have fulfilled the lines containing the notions and the results. The 5200
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5201
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5202
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5203
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5204
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5205
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5206
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5207
figure out the background for the SuperHyperNotions. 5208

CHAPTER 25 5209
Neutrosophic Eulerian-Cycle-Cut 5210
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5211
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5212
2023, (doi: 10.13140/RG.2.2.34953.52320). 5213

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5214
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5215
(doi: 10.13140/RG.2.2.33275.80161). 5216
10.13140/RG.2.2.11050.90569). 5219
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5220
10.13140/RG.2.2.17761.79206). 5222
10.13140/RG.2.2.19911.37285). 5225
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5226
10.13140/RG.2.2.23266.81602). 5228
10.13140/RG.2.2.19360.87048). 5231
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5232
10.13140/RG.2.2.32363.21286). 5234
10.13140/RG.2.2.11758.69441). 5237
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5238
10.13140/RG.2.2.31891.35367). 5240
10.13140/RG.2.2.21510.45125). 5243
247
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5244
10.13140/RG.2.2.13121.84321). 5246

CHAPTER 26 5247
New Ideas In Recognition of Cancer And 5248
Neutrosophic SuperHyperGraph By 5249
Eulerian-Cycle-Cut As Hyper Eulogy On 5250
Super EULA 5251
249
CHAPTER 27 5252
ABSTRACT 5253
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Cycle- 5254
Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Cycle-Cut pair S = (V, E). 5255
Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 5256
either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Cycle-Cut if the following expression is 5257
called Neutrosophic e-SuperHyperEulerian-Cycle-Cut criteria holds 5258
∀Ea ∈ C : C is
Neutrosophic re-SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic 5259

e-SuperHyperEulerian-Cycle-Cut criteria holds 5260
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5261

SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic v-SuperHyperEulerian- 5262
Cycle-Cut criteria holds 5263
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Cycle-Cut if the following expression is called Neutrosophic 5264

v-SuperHyperEulerian-Cycle-Cut criteria holds 5265
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5266
SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic 5267
251
re-SuperHyperEulerian-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv- 5268

SuperHyperEulerian-Cycle-Cut. ((Neutrosophic) SuperHyperEulerian-Cycle-Cut). Assume a Neutrosophic 5269
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5270
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian-Cycle-Cut if it’s 5271
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinal- 5274
ity of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges 5275
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme Supe- 5276
rHyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Cut; a Neutrosophic 5277
SuperHyperEulerian-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 5280
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neut- 5281
rosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5282
SuperHyperEulerian-Cycle-Cut; an Extreme SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s 5284

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 5287
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 5288
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 5289
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme Super- 5290
HyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Cut; and the Extreme 5291
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Cycle-Cut 5292

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic 5293
is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5296
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5297
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5298

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5299
the Neutrosophic SuperHyperEulerian-Cycle-Cut; and the Neutrosophic power is corresponded to 5300
its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutro- 5301

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5304
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 5305
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme Super- 5306
HyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Cut; a Neutrosophic V- 5307

is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neut- 5311
rosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5312

SuperHyperEulerian-Cycle-Cut; an Extreme V-SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s 5314

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolyno- 5317
mial contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 5318
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 5319
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5320

that they form the Extreme SuperHyperEulerian-Cycle-Cut; and the Extreme power is corresponded 5321
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if 5322
it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle- 5323
Cut, Neutrosophic v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut 5324
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5325

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 5327
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5328
SuperHyperEulerian-Cycle-Cut; and the Neutrosophic power is corresponded to its Neutrosophic 5330
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5331
namely, a SuperHyperEulerian-Cycle-Cut and Neutrosophic SuperHyperEulerian-Cycle-Cut. Two different 5332

types of SuperHyperDefinitions are debut for them but the research goes further and the Super- 5333
HyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 5334
well-reviewed. The literature review is implemented in the whole of this research. For shining the 5335
elegancy and the significancy of this research, the comparison between this SuperHyperNotion with 5336
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 5337
are followed by the examples and the instances thus the clarifications are driven with different 5338
tools. The applications are figured out to make sense about the theoretical aspect of this ongoing 5339
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 5340
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 5341
deemed ways. There are different types of them. Some of them are individuals and some of them 5342
are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 5343
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “Super- 5344
HyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 5345
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 5346
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pur- 5347
sue this research. It’s also officially collected in the form of some questions and some problems. 5348
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Cycle-Cut 5349

is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5350
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5352
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5353
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Cycle-Cut is a max- 5354
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5355

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5356
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5357
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5358
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5359

δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperEulerian- 5360

Cycle-Cut. Since there’s more ways to get type-results to make a SuperHyperEulerian-Cycle-Cut 5361
more understandable. For the sake of having Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s 5362
a need to “redefine” the notion of a “SuperHyperEulerian-Cycle-Cut ”. The SuperHyperVertices 5363
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 5364
this procedure, there’s the usage of the position of labels to assign to the values. Assume 5365
a SuperHyperEulerian-Cycle-Cut . It’s redefined a Neutrosophic SuperHyperEulerian-Cycle-Cut if the 5366

mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5367
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5368
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5369
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 5370
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 5371
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 5372
get structural examples and instances, I’m going to introduce the next SuperHyperClass of 5373
SuperHyperGraph based on a SuperHyperEulerian-Cycle-Cut . It’s the main. It’ll be disciplinary to 5374
have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 5375
have all SuperHyperEulerian-Cycle-Cut until the SuperHyperEulerian-Cycle-Cut, then it’s officially called a 5376
“SuperHyperEulerian-Cycle-Cut” but otherwise, it isn’t a SuperHyperEulerian-Cycle-Cut . There are some 5377
instances about the clarifications for the main definition titled a “SuperHyperEulerian-Cycle-Cut ”. 5378
disciplinary ways of the SuperHyperClass based on a SuperHyperEulerian-Cycle-Cut . For the sake 5380
of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to “redefine” the notion of 5381
a “Neutrosophic SuperHyperEulerian-Cycle-Cut” and a “Neutrosophic SuperHyperEulerian-Cycle-Cut ”. 5382
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5383
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5384
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Super- 5385
HyperGraph” if the intended Table holds. And a SuperHyperEulerian-Cycle-Cut are redefined to 5386
a “Neutrosophic SuperHyperEulerian-Cycle-Cut” if the intended Table holds. It’s useful to define 5387
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5388
type-results to make a Neutrosophic SuperHyperEulerian-Cycle-Cut more understandable. Assume 5389
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5390

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Cycle-Cut, SuperHyperStar, 5391
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Cycle-Cut”, “Neutrosophic SuperHyperStar”, 5393
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 5394
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5395

SuperHyperEulerian-Cycle-Cut” where it’s the strongest [the maximum Neutrosophic value from all 5396
the SuperHyperEulerian-Cycle-Cut amid the maximum value amid all SuperHyperVertices from 5397
a SuperHyperEulerian-Cycle-Cut .] SuperHyperEulerian-Cycle-Cut . A graph is a SuperHyperUniform 5398
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5399
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5400
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5401
with two exceptions; it’s SuperHyperEulerian-Cycle-Cut if it’s only one SuperVertex as intersection 5402
amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5403
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5404
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 5405

no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 5406

intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 5407
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex as 5408
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with 5409
any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific 5410
architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic 5411
SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are 5412
SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between 5413
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Some- 5414
times, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have 5415
more precise SuperHyperModel which in this case the SuperHyperModel is called “Neutrosophic”. 5416
In the future research, the foundation will be based on the “Cancer’s Recognition” and the results 5417
and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long- 5418
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5419
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5420
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5421
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5422
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5423
perception on what’s happened and what’s done. There are some specific models, which are 5424
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 5425
moves and the traces of the cancer on the complex tracks and between complicated groups 5426
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Cut, 5427
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 5428
to find either the longest SuperHyperEulerian-Cycle-Cut or the strongest SuperHyperEulerian-Cycle-Cut 5429
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Cycle-Cut, called 5430

SuperHyperEulerian-Cycle-Cut, and the strongest SuperHyperEulerian-Cycle-Cut, called Neutrosophic 5431
SuperHyperEulerian-Cycle-Cut, some general results are introduced. Beyond that in SuperHyperStar, 5432
essential to have at least three SuperHyperEdges to form any style of a SuperHyperEulerian-Cycle-Cut. 5434
There isn’t any formation of any SuperHyperEulerian-Cycle-Cut but literarily, it’s the deformation of 5435
any SuperHyperEulerian-Cycle-Cut. It, literarily, deforms and it doesn’t form. A basic familiarity 5436
with Neutrosophic SuperHyperEulerian-Cycle-Cut theory, SuperHyperGraphs, and Neutrosophic 5437
SuperHyperGraphs theory are proposed. 5438
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Cycle-Cut, Cancer’s Neutrosophic 5439
Recognition 5440

CHAPTER 28 5442
Applied Notions Under The Scrutiny Of 5443
The Motivation Of This Scientific 5444
Research 5445
In this scientific research, there are some ideas in the featured frameworks of motivations. 5446
I try to bring the motivations in the narrative ways. Some cells have been faced with some 5447
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5448
some embedded analysis on the ongoing situations which in that, the cells could be labelled as 5449
some groups and some groups or individuals have excessive labels which all are raised from 5450
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5451
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5452
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5453
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5454
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5455
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5456
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5457
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5458
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5459
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5460
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5461
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5462
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5463
the disease but the model is going to figure out what’s going on this phenomenon. The special 5464
case of this disease is considered and as the consequences of the model, some parameters are 5465
used. The cells are under attack of this disease but the moves of the cancer in the special region 5466
are the matter of mind. The recognition of the cancer could help to find some treatments for this 5467
disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels 5468
on the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5469
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5470
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5471
the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5472
the architecture are formally called “ SuperHyperEulerian-Cycle-Cut” in the themes of jargons and 5473
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 5474
257
background for the SuperHyperNotions. The recognition of the cancer in the long-term function. 5475
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long 5476
cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer 5477
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about 5478
the moves and the effects of the cancer on that region; this event leads us to choose another model 5479
[it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5480
names, and some general models. The moves and the traces of the cancer on the complex tracks 5482
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5483
(-/SuperHyperEulerian-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5484
SuperHyperWheel). The aim is to find either the optimal SuperHyperEulerian-Cycle-Cut or the 5485
Neutrosophic SuperHyperEulerian-Cycle-Cut in those Neutrosophic SuperHyperModels. Some general 5486
results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5487
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5488
SuperHyperEdges to form any style of a SuperHyperEulerian-Cycle-Cut. There isn’t any formation of 5489
any SuperHyperEulerian-Cycle-Cut but literarily, it’s the deformation of any SuperHyperEulerian-Cycle-Cut. 5490
It, literarily, deforms and it doesn’t form. 5491
amount of SuperHyperEulerian-Cycle-Cut” of either individual of cells or the groups of cells based on 5493
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian-Cycle-Cut” 5494
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5496
these messy and dense SuperHyperModels where embedded notions are illustrated? 5497
Thus it motivates us to define different types of “ SuperHyperEulerian-Cycle-Cut” and “Neutrosophic 5499
SuperHyperEulerian-Cycle-Cut” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5500
the research has taken more motivations to define SuperHyperClasses and to find some 5501
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5502
some instances and examples to make clarifications about the framework of this research. The 5503
general results and some results about some connections are some avenues to make key point of 5504
this research, “Cancer’s Recognition”, more understandable and more clear. 5505
The framework of this research is as follows. In the beginning, I introduce basic definitions 5506
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5507
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5508
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5509
review literature are applied to make sense about what’s going to figure out about the upcoming 5510
sections. The main definitions and their clarifications alongside some results about new 5511
notions, SuperHyperEulerian-Cycle-Cut and Neutrosophic SuperHyperEulerian-Cycle-Cut, are figured out 5512
in sections “ SuperHyperEulerian-Cycle-Cut” and “Neutrosophic SuperHyperEulerian-Cycle-Cut”. In the 5513

sense of tackling on getting results and in Eulerian-Cycle-Cut to make sense about continuing the 5514
research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced 5515
and as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5516
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5517
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5518
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5519

Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5520

Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5521
and as concluding and closing section of theoretical research are contained in the section 5522
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 5523
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 5524
Results”, “ SuperHyperEulerian-Cycle-Cut”, “Neutrosophic SuperHyperEulerian-Cycle-Cut”, “Results on 5525
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5526

questions about what’s done about the SuperHyperNotions to make sense about excellency of this 5527
research and going to figure out the word “best” as the description and adjective for this research 5528
as presented in section, “ SuperHyperEulerian-Cycle-Cut”. The keyword of this research debut in the 5529
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 5530
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 5531
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 5532

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

CHAPTER 29 5538
Neutrosophic Preliminaries Of This 5539
Scientific Research On the Redeemed 5540
Ways 5541
In this section, the basic material in this scientific research, is referred to [Single Valued 5542
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5543

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5544
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5545
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5546
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5547
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5548
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5549
their clarifications are addressed to Ref.[HG38]. 5550
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5551
the new ideas and their clarifications are elicited. 5552
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a Eulerian-Cycle-Cut 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}.
261

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). 5554
where 5556
1, 2, . . . , n0 ); 5561
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5562
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5563

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5592
x, y, z, w ∈ [0, 1]: 5593
(i) 1 ⊗ x = x; 5594
(ii) x ⊗ y = y ⊗ x; 5595
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5596
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5597

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

where 5600

1, 2, . . . , n0 ); 5605
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5606
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5607
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5608
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5609
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5621
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5622
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5623
SuperEdge; 5629
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5632
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5633
makes the patterns and regularities. 5634
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5635
of elements of SuperHyperEdges are the same. 5636

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5637
makes to have SuperHyperUniform more understandable. 5638
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5639
Classes as follows. 5640
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5641
two given SuperHyperEdges with two exceptions; 5642
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5643
SuperHyperEdges; 5644
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5645
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5646
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5647
in common; 5648
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5649
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5650
SuperHyperEdge in common; 5651
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5652
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5653
SuperVertex. 5654
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 5655
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5656
(i) Vi , Vi+1 ∈ Ei0 ; 5657
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5658
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5659
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5660
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5661
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5662
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5663
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5664
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5666
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5667
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5668
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5669
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5670
perPath . 5671
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 5672
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5673
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5674
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5675
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5676
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5677

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5690
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5691
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5692
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Cycle-Cut). 5693

(i) Neutrosophic e-SuperHyperEulerian-Cycle-Cut if the following expression is called 5697
Neutrosophic e-SuperHyperEulerian-Cycle-Cut criteria holds 5698
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Cycle-Cut if the following expression is called 5699

Neutrosophic re-SuperHyperEulerian-Cycle-Cut criteria holds 5700
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5701
(iii) Neutrosophic v-SuperHyperEulerian-Cycle-Cut if the following expression is called 5702

∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Cycle-Cut if the following expression is called 5704
∀Va ∈ C : C is
(v) Neutrosophic SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 5707

SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, Neutrosophic 5708
v-SuperHyperEulerian-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Cycle-Cut. 5709

Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Cycle-Cut). 5710

(i) an Extreme SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 5713

of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 5717

perEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 5718
(ii) a Neutrosophic SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 5720


Cycle-Cut; 5727
(iii) an Extreme SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either of 5728

Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, 5729
of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5733
(iv) a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 5737

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5743

power is corresponded to its Neutrosophic coefficient; 5746
(v) an Extreme V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 5747


(vi) a Neutrosophic V-SuperHyperEulerian-Cycle-Cut if it’s either of Neutrosophic e- 5754

Cycle-Cut; 5761
(vii) an Extreme V-SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 5762

of Neutrosophic e-SuperHyperEulerian-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Cycle-Cut, 5763
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5767
(viii) a Neutrosophic SuperHyperEulerian-Cycle-Cut SuperHyperPolynomial if it’s either 5771


power is corresponded to its Neutrosophic coefficient. 5780
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Cycle-Cut). 5781

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5782
(i) an δ−SuperHyperEulerian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 5783

SuperHyperEulerian-Cycle-Cut such that either of the following expressions hold for the 5784
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5785
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 5786

(29.1), holds if S is an δ−SuperHyperDefensive; 5787
(ii) a Neutrosophic δ−SuperHyperEulerian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 5788

SuperHyperEulerian-Cycle-Cut such that either of the following Neutrosophic expressions hold 5789
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5790
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4


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

136TBL4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5791

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5792
For the sake of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to 5793

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5794
there’s the usage of the position of labels to assign to the values. 5796
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5798
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5799
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5800
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neut- 5802
rosophic SuperHyperPath , SuperHyperEulerian-Cycle-Cut, SuperHyperStar, SuperHyperBipart- 5803
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5804

Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5805
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5806
perHyperWheel if the Table (29.2) holds. 5807
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Cycle-Cut. 5808

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Cycle-Cut 5809
more Neutrosophicly understandable. 5810
For the sake of having a Neutrosophic SuperHyperEulerian-Cycle-Cut, there’s a need to “redefine” 5811
the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Cycle-Cut”. The SuperHyperVertices 5812
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5813


136TBL1
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Cycle-Cut. It’s redefined a Neutrosophic 5815

SuperHyperEulerian-Cycle-Cut if the Table (29.3) holds. 5816

CHAPTER 30 5817
Neutrosophic SuperHyper But As Eulerian-Cycle-Cut 5818
Super Forms 5820
Definition 30.0.1. (Neutrosophic event). 5821
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5822
is a probability Eulerian-Cycle-Cut. Any Neutrosophic k-subset of A of V is called Neutrosophic 5823
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5824
following expression is called Neutrosophic probability of A. 5825
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5826

is a probability Eulerian-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5828

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

is a probability Eulerian-Cycle-Cut. Any k-function Eulerian-Cycle-Cut like E is called Neutrosophic 5834

k-Variable. If k = 2, then any 2-function Eulerian-Cycle-Cut like E is called Neutrosophic 5835
Variable. 5836
The notion of independent on Neutrosophic Variable is likewise. 5837
Definition 30.0.4. (Neutrosophic Expectation). 5838
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5839
273
a probability Eulerian-Cycle-Cut. A Neutrosophic k-Variable E has a number is called Neutrosophic 5840

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

is a probability Eulerian-Cycle-Cut. A Neutrosophic number is called Neutrosophic Crossing if 5844

the following expression is called Neutrosophic Crossing criteria 5845
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). 5846
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let m and n propose special Eulerian-Cycle-Cut. 5847
Then with m ≥ 4n, 5848
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-Cycle-Cut 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: 5849
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5850
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5851
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let P be a SuperHyperSet of n points in the 5852
plane, and let l be the Neutrosophic number √ of SuperHyperLines in the plane passing through at 5853
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5854
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5855

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

the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5863
k < 5n4/3 . 5864
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5865
S = (V, E) is a probability Eulerian-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle around 5866

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5873
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5874
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5875
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5876
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5877
4/3 4/3
k < 4n + n < 5n . 5878
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5879
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be a nonnegative Neutrosophic 5880
Variable and t a positive real number. Then 5881
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. 5882
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5883
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let Xn be a nonnegative integer-valued 5884
variable in a probability Eulerian-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 5885

P (Xn = 0) → 1 as n → ∞. 5886
Proof. 5887
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. A special SuperHyperGraph in Gn,p almost 5889
surely has stability number at most d2p−1 log ne. 5890

S = (V, E) is a probability Eulerian-Cycle-Cut. A special SuperHyperGraph in Gn,p is up. Let 5892
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 5893
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 5894
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 5895
of the Neutrosophic SuperHyperGraph G. 5896
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5897
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5898
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 5899
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5900
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: 5901
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5902
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 5903
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5904
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5905
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5906
Definition 30.0.12. (Neutrosophic Variance). 5907

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5908
a probability Eulerian-Cycle-Cut. A Neutrosophic k-Variable E has a number is called Neutrosophic 5909
Variance if the following expression is called Neutrosophic Variance criteria 5910
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be a Neutrosophic Variable and let t 5912
be a positive real number. Then 5913
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Cycle-Cut. Let X be a Neutrosophic Variable and let t be a 5915
positive real number. Then 5916
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5917
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let Xn be a Neutrosophic Variable in a 5919

probability Eulerian-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 5920
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in Chebyshev’s 5922
Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5923
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5924
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5926
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 5927
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5928
S = (V, E) is a probability Eulerian-Cycle-Cut. As in the proof of related Theorem, the result is 5930
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 5933
defined in previous Theorem. Then either: 5934
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5935
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5936
Definition 30.0.17. (Neutrosophic Threshold). 5939
is a probability Eulerian-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs (one which 5941
is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for P is a 5942
function f (n) such that: 5943
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5944
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5945

Definition 30.0.18. (Neutrosophic Balanced). 5946

is a probability Eulerian-Cycle-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5948
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5949
SubSuperHyperGraph is called Neutrosophic Balanced. 5950
Consider S = (V, E) is a probability Eulerian-Cycle-Cut. Let F be a nonempty balanced Neutrosophic 5952
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 5953
threshold function for the property of containing F as a Neutrosophic SubSuperHyperGraph. 5954
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5957
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5958
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5959

SuperHyperEulerian-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5960
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5961

is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5962
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5963
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5964
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5965
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5966
Neutrosophic SuperHyperEulerian-Cycle-Cut. 5967
C(N SHG)Neutrosophic Eulerian-Cycle-Cut

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

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

Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5974
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5975
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Cycle-Cut. 5976

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

Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG1
= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
5977


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







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


= {}.
= 0z 0 .


= {}.
= 0z 0 .
5989


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



= {}.
= 0z 0 .
= {}.
= 0z 0 .
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


= {}.


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


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




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







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


= {}.



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


= {Eii=112 }.
X
= z |Ei | .
Ei
i=112

= {V Eii=112 }.



X
= z |Vi | .
V Ei
i=112
6045


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



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


= {}.


Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG1
= 0z 0 .
= {}.
= 0z 0 .
6057
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6058
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Cycle- 6059
Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6060
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6061

no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6062
them. 6063


Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG2
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6064
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6065
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6066
Neutrosophic quasi-R-Eulerian-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some of 6067
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6068
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6069
quasi-R-Eulerian-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but not all 6070
of them. 6071
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-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Cut is at 6072
least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutrosophic 6073
SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In other 6074
words, the maximum number of the Neutrosophic SuperHyperEdges contains the maximum 6075
Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic Eulerian- 6076
Cycle-Cut in some cases but the maximum number of the Neutrosophic SuperHyperEdge with 6077
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutrosophic 6078
SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Cycle-Cut. 6079

Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Eulerian-Cycle-Cut 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-Cycle-Cut with the least Neutrosophic cardinality, the 6080
lower sharp Neutrosophic bound for cardinality. 6081
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6082

(V, E). Then in the worst case, literally, 6083
C(N SHG)N eutrosophicQuasi−Eulerian−Cycle−Cut

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−Cycle−CutSuperHyperP 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-Cycle-Cut 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-Cycle-Cut. In other words, the least cardinality, the lower sharp bound for the
cardinality, of a quasi-R-Eulerian-Cycle-Cut 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-Cycle-Cut. 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-Cycle-Cut decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHyper-
Vertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the outside
of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of the used
Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from the fact
that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the targeted
Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore, the Neut-
rosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk
about the Neutrosophic R-Eulerian-Cycle-Cut. Since at least two Neutrosophic SuperHyperVertices
involve to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge but
at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of Neutrosophic
SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic SuperHyper-
Graph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to mention that the
word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic SuperHyperGraph,

induces there’s no Neutrosophic appearance of the loop Neutrosophic version of the Neutro-
sophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be loopless. The
Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one Neutrosophic
SuperHyperVertex but it never happens in this Neutrosophic setting. With these Neutrosophic
bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic SuperHyperEdge
thus there’s at least a Neutrosophic R-Eulerian-Cycle-Cut has the Neutrosophic cardinality of a
Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Eulerian-Cycle-Cut 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-Cycle-Cut since
either the Neutrosophic SuperHyperGraph is an obvious Neutrosophic SuperHyperModel thus
it never happens since there’s no Neutrosophic usage of this Neutrosophic framework and even
more there’s no Neutrosophic connection inside or the Neutrosophic SuperHyperGraph isn’t
obvious and as its consequences, there’s a Neutrosophic contradiction with the term “Neutro-
sophic R-Eulerian-Cycle-Cut” since the maximum Neutrosophic cardinality never happens for this
Neutrosophic style of the Neutrosophic SuperHyperSet and beyond that there’s no Neutrosophic
connection inside as mentioned in first Neutrosophic case in the forms of drawback for this
selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Eulerian-Cycle-Cut 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-Cycle-Cut 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-Cycle-Cut.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Eulerian-Cycle-Cut. 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-Cycle-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Cycle-Cut but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z

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

fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Eulerian-Cycle-Cut, 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-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Cut is 6088
at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neutro- 6089
sophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. In 6090
other words, the maximum number of the Neutrosophic SuperHyperEdges contains the max- 6091
imum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6092

Eulerian-Cycle-Cut in some cases but the maximum number of the Neutrosophic SuperHyperEdge 6093
with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the Neutro- 6094
sophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Cycle-Cut. 6095
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6096
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6097
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6098
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6099
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6100
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6101
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6102
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6103
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6104

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6105

Neutrosophic quasi-R-Eulerian-Cycle-Cut where the Neutrosophic completion of the Neutrosophic 6106
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Eulerian-Cycle-Cut. The 6107
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 6108
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 6109
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6110
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6111

timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in 6112
the minimum Neutrosophic style of the embedded Neutrosophic R-Eulerian-Cycle-Cut. The interior 6113
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6114
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6115
common connections, more precise and more formal, the perfect unique connections inside the 6116
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6117
the Neutrosophic R-Eulerian-Cycle-Cut. Thus Neutrosophic exterior SuperHyperVertices could be 6118
used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6119
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6120
embedded Neutrosophic Eulerian-Cycle-Cut, there’s the usage of exterior Neutrosophic SuperHyper- 6121
Vertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6122
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6123
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with 6124
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 6125
the Neutrosophic R-Eulerian-Cycle-Cut. The Neutrosophic R-Eulerian-Cycle-Cut with the exclusion of 6126
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6127
with other terms, the Neutrosophic R-Eulerian-Cycle-Cut with the inclusion of all Neutrosophic Supe- 6128
rHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian-Cycle-Cut. 6129

To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). 6130
There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6131
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neut- 6132
rosophic quasi-R-Eulerian-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some of them 6133
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6134
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6135

quasi-R-Eulerian-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6136
all of them. 6137
The main definition of the Neutrosophic R-Eulerian-Cycle-Cut has two titles. a Neutrosophic quasi-R- 6138
Eulerian-Cycle-Cut and its corresponded quasi-maximum Neutrosophic R-SuperHyperCardinality are 6139
two titles in the terms of quasi-R-styles. For any Neutrosophic number, there’s a Neutrosophic 6140
quasi-R-Eulerian-Cycle-Cut with that quasi-maximum Neutrosophic SuperHyperCardinality in the 6141
terms of the embedded Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic 6142
SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions lead us to take the collec- 6143
tion of all the Neutrosophic quasi-R-Eulerian-Cycle-Cuts for all Neutrosophic numbers less than its 6144
Neutrosophic corresponded maximum number. The essence of the Neutrosophic Eulerian-Cycle-Cut 6145
ends up but this essence starts up in the terms of the Neutrosophic quasi-R-Eulerian-Cycle-Cut, 6146
again and more in the operations of collecting all the Neutrosophic quasi-R-Eulerian-Cycle-Cuts 6147
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6148
Neutrosophic number. This Neutrosophic number is 6149
considered as the equivalence class for all corresponded quasi-R-Eulerian-Cycle-Cuts. Let 6150

zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Cycle-Cut be a Neutro- 6151

sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Cycle-Cut. Then 6152
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Cycle-Cut is re-formalized 6153
and redefined as follows. 6154
GNeutrosophic Eulerian-Cycle-Cut ∈ ∪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 6155
definition for the Neutrosophic Eulerian-Cycle-Cut. 6156
GNeutrosophic Eulerian-Cycle-Cut =
{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- 6157
poses the upcoming expressions.
Cycle-Cut 6158
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6159


= max zNeutrosophic Number

And then, 6160

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


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

6163

6164


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6165
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6166
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6167
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6168
Cycle-Cut” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Cycle-Cut” since 6169
“Neutrosophic Quasi-Eulerian-Cycle-Cut” happens “Neutrosophic Eulerian-Cycle-Cut” in a Neutrosophic 6170
SuperHyperGraph as initial framework and background but “Neutrosophic SuperHyperNeigh- 6171

borhood” may not happens “Neutrosophic Eulerian-Cycle-Cut” in a Neutrosophic SuperHyperGraph 6172
as initial framework and preliminarily background since there are some ambiguities about the 6173
Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Neut- 6174
rosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Cycle-Cut”, and “Neutrosophic 6175
Eulerian-Cycle-Cut” are up. 6176
Thus, let 6177

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6178
GNeutrosophic Eulerian-Cycle-Cut be a Neutrosophic number, a Neutrosophic SuperHyperNeighbor- 6179
hood and a Neutrosophic Eulerian-Cycle-Cut and the new terms are up. 6180
GNeutrosophic Eulerian-Cycle-Cut ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6181
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6182
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6183


And with go back to initial structure, 6184
GNeutrosophic Eulerian-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6186

6187

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Cycle-Cut 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-Cycle-Cut is related to the Neutrosophic SuperHyperSet of the Neutro-
sophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Cycle-Cut is up. The obvious simple
Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Cycle-Cut 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-Cycle-Cut 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-Cycle-

Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}

is an Neutrosophic R-Eulerian-Cycle-Cut 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-
Cycle-Cut and it’s an Neutrosophic Eulerian-Cycle-Cut. 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-Cycle-Cut. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Eulerian-Cycle-Cut,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-

Cycle-Cut, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6188
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6189
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6190
type-SuperHyperSet called the 6191
“Neutrosophic R-Eulerian-Cycle-Cut” 6192
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6193
Neutrosophic R-Eulerian-Cycle-Cut, 6194
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable embed-
ded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets of
the Neutrosophic R-Eulerian-Cycle-Cut amid those obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic Eulerian-Cycle-Cut, 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-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a Neutrosophic R-Eulerian-Cycle-Cut is the cardinality of
6195
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6196
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Cycle-Cut if 6197
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6198
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6199
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6200
them. 6201
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6202
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6203
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6204
Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6205
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6206

SuperHyperVertices. Consider there’s a Neutrosophic R-Eulerian-Cycle-Cut with the least cardin- 6207
ality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected 6208
Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the 6209
Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the 6210
Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6211
some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Cycle-Cut. 6212

Since it doesn’t have 6213
6214
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6215
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6216
some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic 6217
SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutro- 6218

sophic SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic 6219
R-Eulerian-Cycle-Cut. Since it doesn’t do the Neutrosophic procedure such that such that there’s 6220
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely 6221
[there are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in 6222
the connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyper- 6223
Vertex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6224

in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6225
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Su- 6226
perHyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus 6227
the obvious Neutrosophic R-Eulerian-Cycle-Cut, VESHE is up. The obvious simple Neutrosophic 6228
type-SuperHyperSet of the Neutrosophic R-Eulerian-Cycle-Cut, VESHE , is a Neutrosophic SuperHy- 6229
perSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6230

Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6231

SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6232
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6233
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6234
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6235
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6236
R-Eulerian-Cycle-Cut only contains all interior Neutrosophic SuperHyperVertices and all exterior 6237
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6238
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6239
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6240
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6241
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6242
The SuperHyperNotion, namely, Eulerian-Cycle-Cut, is up. There’s neither empty SuperHyperEdge 6243
nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic Su- 6244
perHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6245
Neutrosophic Eulerian-Cycle-Cut. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6246

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6250
ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6251
6252
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6254
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6255

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6256
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6257
Neutrosophic Eulerian-Cycle-Cut is up. The obvious simple Neutrosophic type-SuperHyperSet 6258
called the Neutrosophic Eulerian-Cycle-Cut is a Neutrosophic SuperHyperSet includes only two 6259
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6260
SuperHyperEdges[SuperHyperVertices], 6261

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- 6262
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6263
Eulerian-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6264
SuperHyperEdges[SuperHyperVertices], 6265

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 6266
Eulerian-Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6267


b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6269
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6270

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6271

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Cycle-Cut and 6272
it’s an Neutrosophic Eulerian-Cycle-Cut. Since it’s 6273
6274
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6276
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6277

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6278
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6279

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

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-Cycle-Cut, 6281
not: 6282

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is the Neutrosophic SuperHyperSet, not: 6283

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- 6284
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6285
Neutrosophic type-SuperHyperSet called the 6286
“Neutrosophic Eulerian-Cycle-Cut ” 6287
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6288
Neutrosophic Eulerian-Cycle-Cut , 6289
is only and only 6290

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

CHAPTER 31 6292
The Neutrosophic Departures on The 6293
Theoretical Results Toward Theoretical 6294
Motivations 6295
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6296
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6298

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6305
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6306
SuperHyperModel (31.1), is the SuperHyperEulerian-Cycle-Cut. 6307
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6308

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

= {VEi ∈EN SHG }.

X
= z |VEi ∈EN SHG | .
Proof. Let 6309
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6310
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). 6311

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6315
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6316
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Cycle-Cut. 6317
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6318

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

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

Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6319
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6320
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6321


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

Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6325
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6326
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6327
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6328
the Neutrosophic SuperHyperEulerian-Cycle-Cut. 6329
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6330
Then 6331

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

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

only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6340
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Neutrosophic SuperHyperBipart- 6342
ite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6343
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6346
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6347
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6348
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6349
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6350

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Cycle-Cut in the Example (42.0.11) 136NSHG21a
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6352
Then 6353

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

6355
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Neutrosophic SuperHyperMulti- 6356

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

only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6362
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6364
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6365
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6369
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6370
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6371
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6372
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Cycle-Cut. 6373
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6374
Then, 6375

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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6376
P :
CEN T ER, E2∗
6377
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Cycle-Cut taken from a connected Neutrosophic SuperHyperWheel 6378


Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Cycle-Cut in the Neutrosophic Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEulerian-Cycle-Cut. Thus the notion of quasi isn’t up and 6382
the SuperHyperNotions based on SuperHyperEulerian-Cycle-Cut could be applied. The unique 6383
embedded SuperHyperEulerian-Cycle-Cut proposes some longest SuperHyperEulerian-Cycle-Cut excerpt 6384
from some representatives. The latter is straightforward. 6385
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6386
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6387
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6388
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6389
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Cycle-Cut. 6390

CHAPTER 32 6391
The Surveys of Mathematical Sets On 6392
The Results But As The Initial Motivation 6393
For the SuperHyperEulerian-Cycle-Cut, Neutrosophic SuperHyperEulerian-Cycle-Cut, and the Neutrosophic 6394

SuperHyperEulerian-Cycle-Cut, some general results are introduced. 6395
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Cycle-Cut is “redefined” on 6396
the positions of the alphabets. 6397
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Cycle-Cut. Then 6398
N eutrosophic SuperHyperEulerian − Cycle − Cut =

{theSuperHyperEulerian − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − Cycle − Cut
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−Cycle−Cut. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6399
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6400
the neutrality, for i = 1, 2, 3, respectively. 6401
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6402
alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Cycle-Cut and SuperHyperEulerian-Cycle- 6403
Cut coincide. 6404
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6405
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6406
SuperHyperEulerian-Cycle-Cut if and only if it’s a SuperHyperEulerian-Cycle-Cut. 6407
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6408
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6409
SuperHyperEulerian-Cycle-Cut if and only if it’s a longest SuperHyperEulerian-Cycle-Cut. 6410
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the 6411
same identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Cycle-Cut is its 6412
325
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Cut, Supe- 6414

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6415
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Cycle-Cut is its 6416
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6418

SuperHyperEulerian-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Cut isn’t 6419
well-defined. 6420
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6421

Neutrosophic SuperHyperEulerian-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian- 6422
Cycle-Cut isn’t well-defined. 6423

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutro- 6425
sophic SuperHyperEulerian-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Cut 6426
isn’t well-defined. 6427
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6428

SuperHyperEulerian-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Cycle-Cut is well- 6429
defined. 6430
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6431
Neutrosophic SuperHyperEulerian-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Cycle-Cut 6432

is well-defined. 6433
rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutro- 6435

sophic SuperHyperEulerian-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Cycle-Cut is 6436
well-defined. 6437
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6438
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6439
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6440
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6441
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6442
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6443
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 6444
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6445
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6448

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

independent SuperHyperSet is 6453
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6456
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6460

Graph which is a SuperHyperEulerian-Cycle-Cut/SuperHyperPath. Then V is a maximal 6461
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6465
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6466
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6467
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6469
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6470
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6474
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6475
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6476
Graph which is a SuperHyperEulerian-Cycle-Cut/SuperHyperPath. Then the number of 6479

(i) : the SuperHyperEulerian-Cycle-Cut; 6480
(ii) : the SuperHyperEulerian-Cycle-Cut; 6481
(iii) : the connected SuperHyperEulerian-Cycle-Cut; 6482
(iv) : the O(ESHG)-SuperHyperEulerian-Cycle-Cut; 6483
(v) : the strong O(ESHG)-SuperHyperEulerian-Cycle-Cut; 6484
(vi) : the connected O(ESHG)-SuperHyperEulerian-Cycle-Cut. 6485
coincide. 6487

Graph which is a SuperHyperWheel. Then the number of 6489
(i) : the dual SuperHyperEulerian-Cycle-Cut; 6490
(ii) : the dual SuperHyperEulerian-Cycle-Cut; 6491
(iii) : the dual connected SuperHyperEulerian-Cycle-Cut; 6492
(iv) : the dual O(ESHG)-SuperHyperEulerian-Cycle-Cut; 6493
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Cycle-Cut; 6494
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Cycle-Cut. 6495
coincide. 6497
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6498

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6510
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6511
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6512
SuperHyperPart is a 6513
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6517
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6518
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 6519
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6521

plete SuperHyperMultipartite. Then Then the number of 6522
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6529
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6530
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6532
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6533
(iv) : SuperHyperEulerian-Cycle-Cut; 6537

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6540
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6541
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6542
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6543

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6551
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6552
of dual 6553
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6557

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6561

SuperHyperEulerian-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6563
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6564
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6568
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6569
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut. 6570


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


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

a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 6586
(i) v ∈ Ns (x); 6587
(ii) vx ∈ E. 6588
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6589

a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut, then 6590
(i) S is SuperHyperEulerian-Cycle-Cut set; 6591
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6592
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6593
(i) Γ ≤ O; 6594
(ii) Γs ≤ On . 6595
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6596
connected. Then 6597
(i) Γ ≤ O − 1; 6598
(ii) Γs ≤ On − Σ3i=1 σi (x). 6599
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6600

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6604
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6605
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6607
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6608
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6609
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6610
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6611
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Cycle-Cut. Then 6613
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6614

Cycle-Cut; 6615
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6616
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6617
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6618
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Cycle-Cut. Then 6620

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6624
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6625
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6627
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Cycle-Cut; 6628
(ii) Γ = 1; 6629
(iii) Γs = Σ3i=1 σi (c); 6630
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle-Cut. 6631
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6632

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6633
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6635
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6636
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6637
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6639
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Cycle- 6640
Cut; 6641
(ii) Γ = b n2 c + 1; 6642

b n c+1 ; 6643
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6644
Cycle-Cut. 6645
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6646
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6647
(ii) Γ = b n2 c; 6648

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

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

Cycle-Cut for N SHF; 6655
(ii) Γ = m for N SHF : (V, E); 6656
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6657
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle- 6658
Cut for N SHF : (V, E). 6659
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6660

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6661
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6662
SuperHyperEulerian-Cycle-Cut for N SHF; 6663

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

b n c+1 for N SHF : (V, E); 6665
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperEulerian-Cycle-Cut for 6666
N SHF : (V, E). 6667
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6668

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6669
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Cycle-Cut 6670
for N SHF : (V, E); 6671
(ii) Γ = b n2 c for N SHF : (V, E); 6672

bnc for N SHF : (V, E); 6673
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Cycle-Cut for 6674
N SHF : (V, E). 6675
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6678

SuperHyperEulerian-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Cycle-Cut; 6679
SuperHyperEulerian-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian-Cycle- 6681

Cut. 6682
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6685

SuperHyperEulerian-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Cycle-Cut; 6686

SuperHyperEulerian-Cycle-Cut, then S is a dual s-SuperHyperPowerful SuperHyperEulerian-Cycle- 6688
Cut. 6689
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6690

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

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

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

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

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


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

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


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

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

(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6732
Cycle-Cut; 6733

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

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

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


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

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

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

CHAPTER 33 6750
Neutrosophic Applications in Cancer’s 6751
Neutrosophic Recognition 6752
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6753
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6754
disease is considered and as the consequences of the model, some parameters are used. The 6755
cells are under attack of this disease but the moves of the cancer in the special region are the 6756
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6757
treatments for this Neutrosophic disease. 6758
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6759
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6760
Neutrosophic function. 6761
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6762
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6763
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6764
easily identified since there are some determinacy, indeterminacy and neutrality about the 6765
moves and the effects of the cancer on that region; this event leads us to choose another 6766
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6767
what’s happened and what’s done. 6768
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6769
known and they’ve got the names, and some general Neutrosophic models. The moves and 6770
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6771
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle- 6772
Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 6773
The aim is to find either the Neutrosophic SuperHyperEulerian-Cycle-Cut or the Neutrosophic 6774
SuperHyperEulerian-Cycle-Cut in those Neutrosophic Neutrosophic SuperHyperModels. 6775
337
CHAPTER 34 6776
Case 1: The Initial Neutrosophic Steps 6777
Toward Neutrosophic 6778
SuperHyperBipartite as Neutrosophic 6779
SuperHyperModel 6780
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6781
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6782
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

339
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6783
perBipartite is obtained. 6784
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6785
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6786
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6787

CHAPTER 35 6789
Case 2: The Increasing Neutrosophic 6790
Steps Toward Neutrosophic 6791
SuperHyperMultipartite as 6792
Neutrosophic SuperHyperModel 6793
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6794
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6795
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6796
perMultipartite is obtained. 6797
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6798
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

341
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6800

CHAPTER 36 6802
Wondering Open Problems But As The 6803
Directions To Forming The Motivations 6804
In what follows, some “problems” and some “questions” are proposed. 6805
The SuperHyperEulerian-Cycle-Cut and the Neutrosophic SuperHyperEulerian-Cycle-Cut are defined on a 6806
real-world application, titled “Cancer’s Recognitions”. 6807
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6808
recognitions? 6809
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Cycle-Cut and 6810
the Neutrosophic SuperHyperEulerian-Cycle-Cut? 6811
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6812
them? 6813
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6814
and the Neutrosophic SuperHyperEulerian-Cycle-Cut?
Cycle-Cut 6815
Problem 36.0.5. The SuperHyperEulerian-Cycle-Cut and the Neutrosophic SuperHyperEulerian-Cycle-Cut 6816

do a SuperHyperModel for the Cancer’s recognitions and they’re based on SuperHyperEulerian-Cycle- 6817
Cut, are there else? 6818
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6819
Numbers types-results? 6820
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6821
the multiple types of SuperHyperNotions? 6822
343
CHAPTER 37 6823
Conclusion and Closing Remarks 6824
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6825
research are illustrated. Some benefits and some advantages of this research are highlighted. 6826
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6827
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Cycle-Cut. 6828
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6829
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6830
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Cycle-Cut, finds 6831
the convenient background to implement some results based on that. Some SuperHyperClasses 6832
and some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6833
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 6834
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 6835
SuperHyperEulerian-Cycle-Cut, the new SuperHyperClasses and SuperHyperClasses, are introduced. 6836
Some general results are gathered in the section on the SuperHyperEulerian-Cycle-Cut and the Neutro- 6837
sophic SuperHyperEulerian-Cycle-Cut. The clarifications, instances and literature reviews have taken 6838
the whole way through. In this research, the literature reviews have fulfilled the lines containing 6839
the notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 6840
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 6841
based on the connectivities of the moves of the cancer in the longest and strongest styles with 6844
the formation of the design and the architecture are formally called “ SuperHyperEulerian-Cycle-Cut” 6845
embedded styles to figure out the background for the SuperHyperNotions. In the Table (37.1), 6847
benefits and avenues for this research are, figured out, pointed out and spoken out. 6848
345
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Cycle-Cut
3. Neutrosophic SuperHyperEulerian-Cycle-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6849
Neutrosophic SuperHyperDuality But As 6850
Super Forms 6852
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6853

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6857

Va ∈ Ei , Ej ; 6858
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6859

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6860
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6861

Vi , Vj ∈ Ea ; 6862
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6863

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6864
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6865

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6866
sophic rv-SuperHyperDuality. 6867
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6868

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6871

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6873
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6874
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6875
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6876
form the Extreme SuperHyperDuality; 6877
347
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6878

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6880
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6881
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6882
such that they form the Neutrosophic SuperHyperDuality; 6884
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6885
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6886

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6887
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6888
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6889
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6890
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6892
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6894

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6896
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6897
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6898
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6899
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6900
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6901
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6902
coefficient; 6903
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6904

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6906
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6907
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6908
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6909
form the Extreme SuperHyperDuality; 6910
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6911

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6912
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6913
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6914
such that they form the Neutrosophic SuperHyperDuality; 6917
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6918

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6919
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6920

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6922
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6925
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6927

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6929

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6932
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6935
coefficient. 6936
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6937
the mentioned Neutrosophic Figures in every Neutrosophic items. 6938

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6940
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6941
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6942
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6943
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6944
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6945
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6946
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 6950
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6951
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6952
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6953
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6954

every given Neutrosophic SuperHyperDuality. 6955




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 .
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6996
Neutrosophic SuperHyperClasses. 6997
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 6999
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. 7006
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 7008
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7015
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 7017


the Neutrosophic SuperHyperDuality. 7026
Then 7028
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 7029
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7035
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7038

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7039
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7048

(V, E). Then 7049

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 7050
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7051


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

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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7068
Then, 7070
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 7071
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 7072


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7077
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7078
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7084

CHAPTER 39 7085
Neutrosophic SuperHyperJoin But As 7086
Super Forms 7088
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7089

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7093
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7095

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7096
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7098

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7100

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7103

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7104
rv-SuperHyperJoin. 7105
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7106

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

361

Extreme SuperHyperJoin; 7115
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7116

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7118
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7119
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7120
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7121

form the Neutrosophic SuperHyperJoin; 7122
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7123

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7124
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7125
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7130
coefficient; 7131
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7132

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7133
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7134
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7135
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7136
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7137
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7138

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7139
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7140
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7141

Extreme SuperHyperJoin; 7147
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7148

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7150
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7151
form the Neutrosophic SuperHyperJoin; 7154

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7155

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7157
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7161

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7162
to its Extreme coefficient; 7163
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7164

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7166
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7167

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7168
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7169
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7172
coefficient. 7173
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7177

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7178

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7243

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7252
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 7254


the Neutrosophic SuperHyperJoin. 7263
Then 7265
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 7266
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 7272
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7274

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


(V, E). Then 7285

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7287


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

Then, 7305

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

.
Proof. Let 7306
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7307


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7311
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7312
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7313
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7318

CHAPTER 40 7319
Neutrosophic SuperHyperPerfect But As 7320
Super Forms 7322
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7323

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

Va ∈ Ei , Ej ; 7328
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7329

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7335

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7336
rv-SuperHyperPerfect. 7337
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7338

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7343
375
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7348

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7350
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7351
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7352
form the Neutrosophic SuperHyperPerfect; 7354
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7355

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7356
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7357
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7360
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7364

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7366
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7372
coefficient; 7373
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7374

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7382
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7383
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7384
such that they form the Neutrosophic SuperHyperPerfect; 7387
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7388

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7390

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7393
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7397

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7399

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7405
coefficient. 7406

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7410

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7476
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 7478
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7496
Then 7498
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 7499
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 7503
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7504
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7505
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7508

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

(V, E). Then 7519

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7542


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7545
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7546
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7547
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7548
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7554

CHAPTER 41 7555
Neutrosophic SuperHyperTotal But As 7556
Super Forms 7558
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7559

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7563

Va ∈ Ei , Ej ; 7564
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7565

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7566
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7567

Vi , Vj ∈ Ea ; 7568
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7569

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7571

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7572
rv-SuperHyperTotal. 7573
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7574

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7579
Extreme SuperHyperTotal; 7583
389
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7584

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7586
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7587
form the Neutrosophic SuperHyperTotal; 7590
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7591
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7592

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7593
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7598
coefficient; 7599
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7600
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7601

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7602
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7603
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7608
cient; 7609
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7610

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7612
Extreme SuperHyperTotal; 7616
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7617

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7619
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7620
form the Neutrosophic SuperHyperTotal; 7623
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7624

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7625
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7626


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7631
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7633

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7634
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7635
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7636

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7641
cient. 7642

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7646
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. 7661




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7712
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 7714
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. 7721
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 7723



the Neutrosophic SuperHyperTotal. 7732
Then 7734
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 7735
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7741
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7743
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7754

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7761
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. 7772
Then, 7774
∗
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 7775
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7776


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7780
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7781

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7782
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7788

CHAPTER 42 7789
Neutrosophic SuperHyperConnected But 7790
As The Extensions Excerpt From Dense 7791
And Super Forms 7792
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7793

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7797
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7798
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7799

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7800
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7801
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7802

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7803
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7804

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7805
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7806
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7807
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7808
rosophic rv-SuperHyperConnected. 7809
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7810

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7813
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7814
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7815
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7816
403
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7817

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7818
that they form the Extreme SuperHyperConnected; 7819
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7820

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7821
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7822

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7826
nected; 7827
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7828

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7829
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7830
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7831
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7832
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7833

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7835
Extreme power is corresponded to its Extreme coefficient; 7836
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7837

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7838
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7839
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7840
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7842

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7845
its Neutrosophic coefficient; 7846
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7847


Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7853
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7854


Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7860
nected; 7861
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7862

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7865
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7866
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7867
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7868

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7869
and the Extreme power is corresponded to its Extreme coefficient; 7870
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7871

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7874

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7876
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7879
its Neutrosophic coefficient. 7880
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7883
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7884
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7886
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7887
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7888
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7889
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7890
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. 7898


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 7942
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. 7949
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 7951
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. 7958
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 7960



the Neutrosophic SuperHyperConnected. 7969
Then 7971
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 7972
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 7977
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7978
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7981

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7992
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 7993
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7994


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7998
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7999
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8000
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. 8011
Then, 8013
∗
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 8014
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8015


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8018
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8019
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8020
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8021
some representatives. The latter is straightforward. 8022
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8027

CHAPTER 43 8028
Background 8029
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 8036
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 8037
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 8038
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 8039
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 8040
results based on initial background. 8041
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8042
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8043
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8050
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8051
and fundamental SuperHyperNumbers. 8052
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 8053
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 8054
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8055
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8056

perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 8057
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 8058
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 8059
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 8060
417


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 8089
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8090
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8091
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 8092
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 8093

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 8094
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 8095
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 8096
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 8097
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 8098

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8099
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8100
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8101
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8102
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 8103
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 8104

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 8105
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 8106
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “Super- 8107
HyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their 8108

Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 8109
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 8110
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 8111
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 8112
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 8113
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 8114
Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 8115
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 8116
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 8117
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 8118
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 8119
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 8120
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 8121

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 8122
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 8123
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 8124
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 8125
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 8126
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8127
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 8128
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8129
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8130
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 8131
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 8132
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 8133

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 8134
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8135
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 8136
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModel- 8137
ing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 8138
Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 8139
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 8140
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 8141
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 8142
in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; 8143

HG251; HG252; HG253], there are some endeavors to formalize the basic SuperHyperNotions 8161
about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific research books 8162

is on [HG32b; HG44b]. 8177
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8178
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8179
than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8180
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8181
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8188
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8189
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8190
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the no- 8191
tions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHy- 8192
perGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; 8193

HG248; HG249; HG250; HG251; HG252; HG253] alongside scientific research books 8211

is on [HG32b; HG44b]. 8226

Bibliography 8227
10.33140/JMTCM.01.03.09) 8234
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8252
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8253
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8254
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8255
423
10.20944/preprints202301.0282.v1). 8262
10.20944/preprints202301.0267.v1). 8265

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8270
prints202301.0262.v1). 8274
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8280
prints202301.0105.v1). 8283
Preprints 2023, 2023010044 8289
(doi: 10.20944/preprints202301.0043.v1). 8292

(doi: 10.20944/preprints202212.0549.v1). 8301
(doi: 10.20944/preprints202212.0500.v1). 8308
10.5281/zenodo.7853867). 8317
10.5281/zenodo.7853922). 8320

(doi: 10.5281/zenodo.7851519). 8323
HG250 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 8324
(doi: 10.5281/zenodo.7851550). 8326
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8331

10.5281/zenodo.7834229). 8335
10.5281/zenodo.7834261). 8338
10.5281/zenodo.7824560). 8341
(doi: 10.5281/zenodo.7824623). 8344
2023, (doi: 10.5281/zenodo.7809365). 8355
2023, (doi: 10.5281/zenodo.7809358). 8358
10.5281/zenodo.7809219). 8361
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 8363
10.5281/zenodo.7809328). 8364
2023, (doi: 10.5281/zenodo.7806767). 8367
2023, (doi: 10.5281/zenodo.7806838). 8370

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8372
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8373
(doi: 10.5281/zenodo.7799902). 8379
2023, (doi: 10.5281/zenodo.7804218). 8382
(doi: 10.5281/zenodo.7796334). 8385
10.5281/zenodo.7791952). 8391
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8393
10.5281/zenodo.7791982). 8394
10.5281/zenodo.7790026). 8397
HG223 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8398
10.5281/zenodo.7790052). 8400
2023, (doi: 10.5281/zenodo.7787066). 8403
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8405
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8406
10.5281/zenodo.7781476). 8409

10.5281/zenodo.7783082). 8412
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8414
10.5281/zenodo.7777857). 8415
10.5281/zenodo.7779286). 8418
(doi: 10.5281/zenodo.7771831). 8421
2023, (doi: 10.5281/zenodo.7772468). 8424
10.13140/RG.2.2.20913.25446). 8427
HG212 [63] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8428
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8429
odo.7764916). 8430
10.13140/RG.2.2.11770.98247). 8433
10.13140/RG.2.2.12400.12808). 8436
2023, (doi: 10.13140/RG.2.2.22545.10089). 8439
10.13140/RG.2.2.11377.76644). 8445
10.13140/RG.2.2.23750.96329). 8448

10.13140/RG.2.2.31366.24641). 8451
10.13140/RG.2.2.34721.68960). 8454
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8456
2023, (doi: 10.13140/RG.2.2.30212.81289). 8457
10.13140/RG.2.2.24288.35842). 8463
10.13140/RG.2.2.32467.25124). 8466
10.13140/RG.2.2.31025.45925). 8469
10.13140/RG.2.2.17184.25602). 8472
10.13140/RG.2.2.23423.28327). 8475
10.13140/RG.2.2.28456.44805). 8478
10.13140/RG.2.2.23525.68320). 8481
HG194 [81] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8482
10.13140/RG.2.2.20170.24000). 8484
10.13140/RG.2.2.36475.59683). 8487

10.13140/RG.2.2.29764.71046). 8490
2023, (doi: 10.13140/RG.2.2.18780.87683). 8493
10.13140/RG.2.2.26134.01603). 8499
HG188 [87] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8500
10.13140/RG.2.2.27392.30721). 8502
10.13140/RG.2.2.33028.40321). 8505
10.13140/RG.2.2.21389.20966). 8508
10.13140/RG.2.2.16356.04489). 8511
10.13140/RG.2.2.21756.21129). 8514
HG183 [92] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8515
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8516
10.13140/RG.2.2.30983.68009). 8517
10.13140/RG.2.2.28552.29445). 8520
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8522
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8523
10.13140/RG.2.2.35105.89447). 8526

(doi: 10.13140/RG.2.2.30072.72960). 8529
10.13140/RG.2.2.31147.52003). 8532
10.13140/RG.2.2.32825.24163). 8535
10.13140/RG.2.2.13059.58401). 8538
10.13140/RG.2.2.11172.14720). 8541
2023, (doi: 10.13140/RG.2.2.22011.80165). 8544
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8547
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8549
2023, (doi: 10.13140/RG.2.2.10493.84962). 8550
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8553
2023, (doi: 10.13140/RG.2.2.19944.14086). 8556
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8559
(doi: 10.13140/RG.2.2.33103.76968). 8562
HG167 [108] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8563
(doi: 10.13140/RG.2.2.23037.44003). 8565

(doi: 10.13140/RG.2.2.35646.56641). 8568
(doi: 10.13140/RG.2.2.18030.48967). 8571
(doi: 10.13140/RG.2.2.13973.81121). 8574
2023, (doi: 10.13140/RG.2.2.34106.47047). 8577
2023, (doi: 10.13140/RG.2.2.31956.88961). 8583
2023, (doi: 10.13140/RG.2.2.15179.67361). 8586
10.13140/RG.2.2.21510.45125). 8589
HG158 [117] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8590
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8591
2023, (doi: 10.13140/RG.2.2.13121.84321). 8592
10.13140/RG.2.2.11758.69441). 8595
2023, (doi: 10.13140/RG.2.2.31891.35367). 8598
10.13140/RG.2.2.19360.87048). 8601
HG154 [121] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8602
10.13140/RG.2.2.32363.21286). 8604

10.13140/RG.2.2.23266.81602). 8607
10.13140/RG.2.2.19911.37285). 8610
10.13140/RG.2.2.11050.90569). 8613
HG150 [125] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8614
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8615
2023, (doi: 10.13140/RG.2.2.17761.79206). 8616
HG149 [126] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8617
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8618
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8621
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8622
(doi: 10.13140/RG.2.2.30182.50241). 8625

2023, (doi: 10.13140/RG.2.2.17252.24968). 8658
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8666
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8667
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8670
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8672
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8673
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8674


HG128 [146] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8679
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8680
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8681

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

10.20944/preprints202301.0282.v1). 8691
10.20944/preprints202301.0267.v1).). 8694

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8699
prints202301.0262.v1). 8703

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

10.13140/RG.2.2.35061.65767). 8712
10.13140/RG.2.2.18494.15680). 8716
10.13140/RG.2.2.32530.73922). 8720

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8722
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8723
10.13140/RG.2.2.15897.70243). 8724
10.13140/RG.2.2.32530.73922). 8728
prints202301.0105.v1). 8731

10.13140/RG.2.2.23172.19849). 8738
10.13140/RG.2.2.17385.36968). 8748
Preprints 2023, 2023010044 8751
(doi: 10.20944/preprints202301.0043.v1). 8754
2023, (doi: 10.13140/RG.2.2.28945.92007). 8757

10.13140/RG.2.2.35774.77123). 8763

10.13140/RG.2.2.29430.88642). 8769
(doi: 10.20944/preprints202212.0549.v1). 8775

10.13140/RG.2.2.19380.94084). 8778
(doi: 10.20944/preprints202212.0500.v1). 8789
10.13140/RG.2.2.20993.12640). 8792
HG952 [180] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8793

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

10.13140/RG.2.2.29173.86244). 8807
HG38 [185] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8808
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8809
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8810
(doi: 10.5281/zenodo.7854561). 8812
2023 (doi: 10.5281/zenodo.7851893). 8814

(doi: 10.5281/zenodo.7835063). 8818
(doi: 10.5281/zenodo.7826705). 8820
2023 (doi: 10.5281/zenodo.7820680). 8822
10.5281/zenodo.7812750). 8824


2023 (doi: 10.5281/zenodo.7807782). 8830
2023 (doi: 10.5281/zenodo.7804449). 8832

(doi: 10.5281/zenodo.7792307). 8836
(doi: 10.5281/zenodo.7790728). 8838
2023 (doi: 10.5281/zenodo.7787712). 8840
10.5281/zenodo.7783791). 8842
10.5281/zenodo.7780123). 8844
(doi: 10.5281/zenodo.7773119). 8846
odo.7637762). 8848
10.5281/zenodo.7766174). 8850
10.5281/zenodo.7762232). 8852
(doi: 10.5281/zenodo.7758601). 8854
10.5281/zenodo.7754661). 8856
10.5281/zenodo.7750995) . 8858
(doi: 10.5281/zenodo.7749875). 8860
10.5281/zenodo.7747236). 8862
10.5281/zenodo.7742587). 8864
(doi: 10.5281/zenodo.7738635). 8866
10.5281/zenodo.7734719). 8868
10.5281/zenodo.7730484). 8870

(doi: 10.5281/zenodo.7730469). 8872
10.5281/zenodo.7722865). 8874
odo.7713563). 8876
odo.7709116). 8878
10.5281/zenodo.7706415). 8880
(doi: 10.5281/zenodo.7706063). 8882
(doi: 10.5281/zenodo.7701906). 8884
odo.7700205). 8886
10.5281/zenodo.7694876). 8888
10.5281/zenodo.7679410). 8890
10.5281/zenodo.7675982). 8892
10.5281/zenodo.7672388). 8894
odo.7668648). 8896
10.5281/zenodo.7662810). 8898
10.5281/zenodo.7659162). 8900
HG120b [231] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8901
10.5281/zenodo.7653233). 8902
odo.7653204). 8904
odo.7653142). 8906

odo.7653117). 8908
odo.7653089). 8910
odo.7651687). 8912
odo.7651619). 8914
odo.7651439). 8916
odo.7650729). 8918
odo.7647868). 8920
odo.7647017). 8922
odo.7644894). 8924
odo.7641880). 8926
odo.7632923). 8928
odo.7623459). 8930
10.5281/zenodo.7606416). 8932
10.5281/zenodo.7606416). 8934
odo.7606404). 8936
10.5281/zenodo.7580018). 8938
odo.7580018). 8940
odo.7580018). 8942

odo.7579929). 8944
10.5281/zenodo.7563170). 8946
odo.7563164). 8948
odo.7563160). 8950
odo.7563160). 8952
10.5281/zenodo.7563160). 8954
10.5281/zenodo.7557063). 8956
10.5281/zenodo.7557009). 8958
10.5281/zenodo.7539484). 8960
10.5281/zenodo.7523390). 8962
10.5281/zenodo.7523390). 8964
10.5281/zenodo.7523390). 8966
odo.7574952). 8968
10.5281/zenodo.7574992). 8970
odo.7523357). 8972
10.5281/zenodo.7523357). 8974
10.5281/zenodo.7504782). 8976
10.5281/zenodo.7504782). 8978

10.5281/zenodo.7504782). 8980
10.5281/zenodo.7499395). 8982
odo.7499395). 8984
10.5281/zenodo.7499395). 8986
10.5281/zenodo.7497450). 8988
10.5281/zenodo.7497450). 8990
10.5281/zenodo.7494862). 8992
odo.7494862). 8994
10.5281/zenodo.7494862). 8996
10.5281/zenodo.7493845). 8998
10.5281/zenodo.7493845). 9000
10.5281/zenodo.7493845). 9002
odo.7539484). 9004
odo.7523390). 9006
odo.7523357). 9008
odo.7504782). 9010
odo.7499395). 9012
odo.7497450). 9014

odo.7494862). 9016
odo.7493845). 9018
odo.7480110). 9020
odo.7378758). 9022
HG32b [292] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 9023
10.5281/zenodo.6320305). 9024
odo.6677173). 9026

CHAPTER 44 9027
Books’ Contributions 9028
“Books’ Contributions”: | Featured Threads 9029

The following references are cited by chapters. 9030
9031
[Ref252] 9032
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut In 9033
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9034
odo.7853922). 9035
9036
[Ref253] 9037
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9038
By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 10.5281/zen- 9039
odo.7853867). 9040
9041
The links to the contributions of this scientific research book are listed below. 9042
[HG252] 9043
odo.7853922). 9046
9047
[TITLE] “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut In Re- 9048
cognition of Cancer With (Neutrosophic) SuperHyperGraph” 9049

9050
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9051
https://www.researchgate.net/publication/370163876 9052
9053
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9054
https://www.scribd.com/document/639925463 9055
9056
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9057
https://zenodo.org/record/7853922 9058
9059
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9060
https://www.academia.edu/100556128 9061
445
Figure 44.1: Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7853922).
9062
[ADDRESSED CITATION] 9063
odo.7853922). 9066
[ASSIGNED NUMBER] #252 Article 9067
[DATE] April 2023 9068

[DOI] 10.5281/zenodo.7853922 9069
[LICENSE] CC BY-NC-ND 4.0 9070
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9071
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9072
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9073
9074
[HG253] 9075
odo.7853867). 9078
9079
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9080

Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA” 9081
9082
https://www.researchgate.net/publication/370161397 9084
9085
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9086

10.5281/zenodo.7853922).
10.5281/zenodo.7853922).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7853867).
https://www.scribd.com/document/639923940 9087
9088
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9089
https://zenodo.org/record/7853867 9090
9091
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9092
https://www.academia.edu/100555560 9093
9094
odo.7853867). 9098
[ASSIGNED NUMBER] #253 Article 9099

[DATE] April 2023 9100
[DOI] 10.5281/zenodo.7853867 9101
[LICENSE] CC BY-NC-ND 4.0 9102
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9103
[AVAILABLE AT TWITTER’S IDS] 9104
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9105
googlebooks GooglePlay 9106
9107
[ASSIGNED NUMBER] | Book #165 9108
Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9110
10.5281/zenodo.7854561). 9111

(doi: 10.5281/zenodo.7853867).
(doi: 10.5281/zenodo.7853867).

[TITLE] Eulerian-Cycle-Cut In SuperHyperGraphs 9112

#Latest_Updates 9113
#The_Links 9114
9118
9120
#The_Links 9121
9122
[ASSIGNED NUMBER] | Book #165 9123

9124
[TITLE] Eulerian-Cycle-Cut In SuperHyperGraphs 9125
9126
9130
– 9131
9132
[PUBLISHER] 9133
(Paperback): https://www.amazon.com/dp/- 9134
(Hardcover): https://www.amazon.com/dp/- 9135

(Kindle Edition): https://www.amazon.com/dp/- 9136
9137
– 9138
9139
[ISBN] 9140
(Paperback): - 9141
(Hardcover): - 9142
(Kindle Edition): CC BY-NC-ND 4.0 9143
(EBook): CC BY-NC-ND 4.0 9144
9145
– 9146
9147
[PRINT LENGTH] 9148
(Paperback): - pages 9149
(Hardcover): - pages 9150
(Kindle Edition): - pages 9151
(E-Book): - pages 9152
9153
– 9154
9155
9157

#The_Links 9158
9159
https://www.researchgate.net/publication/- 9161
9162
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9163
https://drhenrygarrett.wordpress.com/2023/07/22/ 9164
Eulerian-Cycle-Cut-In-SuperHyperGraphs/ 9165
9166
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9167
https://www.scribd.com/document/- 9168
9169
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9170
https://www.academia.edu/- 9171
9172
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9173
https://zenodo.org/record/- 9174
9175
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9176
https://books.google.com/books/about?id=- 9177
9178
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9179
https://play.google.com/store/books/details?id=- 9180

[TITLE] Eulerian-Cycle-Cut In SuperHyperGraphs (Published Version) 9181

9182
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9183
9184
https://drhenrygarrett.wordpress.com/2023/07/22/ 9185
Eulerian-Cycle-Cut-In-SuperHyperGraphs/ 9186
9187
– 9188
9189
[POSTED BY] Dr. Henry Garrett 9190
9191
[DATE] April 022, 2023 9192

9193
[POSTED IN] 165 | Eulerian-Cycle-Cut In SuperHyperGraphs 9194
9195
[TAGS] 9196
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9197
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9198
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9199
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9200
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs, Open 9201
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9202
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific 9203
research Articles, scientific research Book, scientific research Chapter, scientific research 9204
Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph 9205

Theory, SuperHyperGraphs, Eulerian-Cycle-Cut In SuperHyperGraphs, SuperHyperModeling, 9206
SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9207
In this scientific research book, there are some scientific research chapters on “Extreme 9208
Eulerian-Cycle-Cut In SuperHyperGraphs” and “Neutrosophic Eulerian-Cycle-Cut In Supe- 9209
rHyperGraphs” about some scientific research on Eulerian-Cycle-Cut In SuperHyperGraphs 9210
by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Cycle-Cut In SuperHyper- 9211

Graphs and Neutrosophic Eulerian-Cycle-Cut In SuperHyperGraphs. With scientific research 9212
on the basic scientific research properties, the scientific research book starts to make Extreme 9213
Eulerian-Cycle-Cut In SuperHyperGraphs theory and Neutrosophic Eulerian-Cycle-Cut In 9214
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9215

CHAPTER 45 9216
“SuperHyperGraph-Based Books”: | 9217
Featured Tweets 9218
“SuperHyperGraph-Based Books”: | Featured Tweets 9219
453
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 9220
CV 9221
481
9222
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG
My name and affiliation is listed on the journal’s reviewer page:
http://www.sciencepg.com/journal/peerreviewers?journalid=303.
My name and affiliation is listed on the journal’s personal
page:https://membership.sciencepg.com/DrHenryGarrett
PDF: https://drhenrygarrett.files.wordpress.com/2023/04/certificate_for_reviewer.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
9223
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM
Editorial Board Member to Journal of Mathematical Techniques and Computational

Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Editorial Board Member to JCTCSR JCTCSR
Editorial Board Member to Journal of Current Trends in Computer Science

Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
9224
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9225

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9226
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9227
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7793372).
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9228
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9229
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9230
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9231
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9232
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9233
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9234
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9235
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9236
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9237
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9238
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9239
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9240
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9241
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9242
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9243

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9244
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9245

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9246
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9247
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9248
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9249
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9250
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9251
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9252
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9253
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9254
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9255
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9256
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9257
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9258
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9259

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9260
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).
9261
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9262
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9263
[HG157b] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Nhu4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Nhu4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JK83H9
(Hardcover): https://www.amazon.com/dp/B0C1J3J6GZ
(Kindle Edition): https://www.amazon.com/dp/B0C1VXHLYJ
ISBN
(Paperback): 9798390583968
(Hardcover): 9798390584002
2023 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs Amazon
[HG156b] Henry Garrett, “”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7807782).
@googlebooks:https://books.google.com/books/about?id=pu-3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=pu-3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Cut-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1PBHJ
(Hardcover): https://www.amazon.com/dp/B0C1HVLC8V
(Kindle Edition): https://www.amazon.com/dp/B0C1SZJYH8
ISBN
(Paperback): 9798390476758
(Hardcover): 9798390476789
2023 155 | SuperHyperDuality Amazon

9264
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9265
[HG153b] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7792307).
@googlebooks:https://books.google.com/books/about?id=4By3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=4By3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C12DH1TZ
(Hardcover): https://www.amazon.com/dp/B0C12JFJGM
(Kindle Edition): https://www.amazon.com/dp/B0C18V22Y2
ISBN
(Paperback): 9798389815193
(Hardcover): 9798389815209
2023 152 | Hamiltonian-Neighbor In SuperHyperGraphs Amazon
[HG152b] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7790728).
@googlebooks:https://books.google.com/books/about?id=hA63EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hA63EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C128T8FP
(Hardcover): https://www.amazon.com/dp/B0C12DHG8K
(Kindle Edition): https://www.amazon.com/dp/B0C16YJ5KL
ISBN
(Paperback): 9798389655539
(Hardcover): 9798389655638
2023 151 | Hamiltonian-Decomposition In SuperHyperGraphs Amazon

9266
[HG151b] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=84u2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=84u2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-
(Paperback): https://www.amazon.com/dp/B0C12D3JBS
(Hardcover): https://www.amazon.com/dp/B0C12D3K6P
(Kindle Edition): https://www.amazon.com/dp/B0C147QGJC
ISBN
(Paperback): 9798389394353
(Hardcover): 9798389394629
2023 150 | Hamiltonian-Cut In SuperHyperGraphs Amazon
[HG150b] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7783791).
@googlebooks:https://books.google.com/books/about?id=3Gy2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=3Gy2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPJTY4
(Hardcover): https://www.amazon.com/dp/B0C12528LZ
(Kindle Edition): https://www.amazon.com/dp/B0BZYLS8NZ
ISBN
(Paperback): 9798389221505
(Hardcover): 9798389222076
2023 149 | Trace-Neighbor In SuperHyperGraphs Amazon

9267
[HG149b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7780123).
@googlebooks:https://books.google.com/books/about?id=Tie2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Tie2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPDKDF
(Hardcover): https://www.amazon.com/dp/B0BZFP49GT
(Kindle Edition): https://www.amazon.com/dp/B0BZVLWRSD
ISBN
(Paperback): 9798389040786
(Hardcover): 9798389040946
2023 148 | Trace-Decomposition In SuperHyperGraphs Amazon
[HG148b] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7773119).
@googlebooks:https://books.google.com/books/about?id=y8a1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=y8a1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPFVRT
(Hardcover): https://www.amazon.com/dp/B0BZFP491Q
(Kindle Edition): https://www.amazon.com/dp/B0BZP8555H
ISBN
(Paperback): 9798388702937
(Hardcover): 9798388702999

9268
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9269
[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

9270
[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

9271
[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

9272
[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

9273
[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

9274
[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

9275
[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

9276
[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

9277
[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

9278
[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

9279
[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

9280
[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

9281
[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

9282
[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

9283
[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

9284
[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

9285
[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

9286
[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

9287
[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
9288
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

9289
[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

9290
[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

9291
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9292
[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

9293
[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
9294
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

9295
“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

9296
[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
9297
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

9298
[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

9299
[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

9300
[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

9301
[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

9302
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

9303
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
9304
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
9305
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

9306
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

9307
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
-
9308
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

9309
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9310
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
9311
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
9312
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

9313
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
9314
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
...
9315
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/
9316
Certificate of Reviewer
Reference: AJCST Date: December 11, 2022
The certificate is awarded to
Henry Garrett, Department of Mathematics, City University of New York, New York, United States
In recognition of the appointment as a Reviewer of American Journal of Computer Science and Technology(AJCST)
ISSN Print: 2640-0111; ISSN Online: 2640-012X
https://www.sciencepg.com/j/ajcst
from December 11, 2022 to December 11, 2024
9317
9318
9319
Henry Garrett
01/23/2022
9320
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
9321
View publication stats

Eulerian-Cycle-Cut 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-Cycle-Cut in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

457 PUBLICATIONS 13,872 CITATIONS

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

On Fuzzy Logic View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 41

6 New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut In

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59

10 Extreme SuperHyperEulerian-Cycle-Cut 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 135

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 143

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 243

25 Neutrosophic Eulerian-Cycle-Cut 247

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-Cycle-Cut But As The Extensions Ex-

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 337

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 345

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 445

45 “SuperHyperGraph-Based Books”: | Featured Tweets 453

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 454

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 473

Henry Garrett · Independent Researcher · Department of Mathematics ·

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