Eulerian-Type-Cycle-Cut in SuperHyperGraphs

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

DOI: 10.5281/zenodo.7874677
CITATIONS
1 author:
Henry Garrett
466 PUBLICATIONS 15,251 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Combinatorics View project
Neutrosophic Graphs View project
All content following this page was uploaded by Henry Garrett on 28 April 2023.
The user has requested enhancement of the downloaded file.

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

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures vi
List of Tables xi
1 ABSTRACT 1
2 Background 13
Bibliography 19
3 Acknowledgements 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Eulerian-Type-Cycle-Cut 47
6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyper-
Graph 49
7 ABSTRACT 51
8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 219
Bibliography 225
24 Cancer In Neutrosophic SuperHyperGraph 247
25 Neutrosophic Eulerian-Type-Cycle-Cut 251
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Neb-
ulous 253
27 ABSTRACT 255
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 261

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 265
30 Neutrosophic SuperHyperEulerian-Type-Cycle-Cut But As The Extensions

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

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

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

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

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

Motivations 351
37 Conclusion and Closing Remarks 353
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 411
43 Background 425
Bibliography 431
44 Books’ Contributions 453
45 “SuperHyperGraph-Based Books”: | Featured Tweets 461
46 CV 489

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . . . 116
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.11) . . . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . . . 123
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (42.0.15) . . . . . 125
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

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

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 283


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

SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . . . . 322
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-Type-Cycle-Cut in the Example (42.0.11) . 327
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . . . . 329
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7874647). . . . . . . . . . . . . . . . . . . . . . 454
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”,
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 462

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



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

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

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 142

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 348

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

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

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

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

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

. For the sake of having a Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyperGraphs, 65
there’s a need to “redefine” the notion of a “Neutrosophic Eulerian-Type-Cycle-Cut In Super- 66
HyperGraphs” and a “Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyperGraphs ”. The 67
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 68
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 70
the intended Table holds. And a Eulerian-Type-Cycle-Cut In SuperHyperGraphs are redefined 71
to a “Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyperGraphs” if the intended Table 72
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 73
ways to get Neutrosophic type-results to make a Neutrosophic Eulerian-Type-Cycle-Cut In 74
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 75

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

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

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

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

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

any Eulerian-Type-Cycle-Cut In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. 126
A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory 127
are proposed. 128
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Type-Cycle-Cut In SuperHyper- 129
Graphs, Cancer’s Recognition 130

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

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

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

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

values. Assume a Eulerian-Type-Cycle-Cut In SuperHyperGraphs . It’s redefined Neutrosophic 171

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

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

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

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

Eulerian-Type-Cycle-Cut In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutro- 202
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 203
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “Neutrosophic 204
Eulerian-Type-Cycle-Cut In SuperHyperGraphs” where it’s the strongest [the maximum 205
Neutrosophic value from all Eulerian-Type-Cycle-Cut In SuperHyperGraphs amid the maximum 206
value amid all SuperHyperVertices from a Eulerian-Type-Cycle-Cut In SuperHyperGraphs 207
.] Eulerian-Type-Cycle-Cut In SuperHyperGraphs . A graph is SuperHyperUniform if it’s 208
SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume 209
a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Su- 210
perHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 211
with two exceptions; it’s Eulerian-Type-Cycle-Cut In SuperHyperGraphs if it’s only one 212
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 213
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 214
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 215
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 216

one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 217
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 218
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 228
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 229
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 230
and the long cycle of the move from the cancer is identified by this research. Sometimes the 231
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 232
and neutrality about the moves and the effects of the cancer on that region; this event leads us 233
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 234
perception on what’s happened and what’s done. There are some specific models, which are 235
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 236
moves and the traces of the cancer on the complex tracks and between complicated groups of 237
cells could be fantasized by a Neutrosophic SuperHyperPath(-/Eulerian-Type-Cycle-Cut In 238
SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 239
perWheel). The aim is to find either the longest Eulerian-Type-Cycle-Cut In SuperHyperGraphs 240
or the strongest Eulerian-Type-Cycle-Cut In SuperHyperGraphs in those Neutrosophic Su- 241

perHyperModels. For the longest Eulerian-Type-Cycle-Cut In SuperHyperGraphs, called 242
Eulerian-Type-Cycle-Cut In SuperHyperGraphs, and the strongest Eulerian-Type-Cycle-Cut In 243
SuperHyperGraphs, called Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyperGraphs, some 244
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 245
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 246
SuperHyperEdges to form any style of a Eulerian-Type-Cycle-Cut In SuperHyperGraphs. There 247

isn’t any formation of any Eulerian-Type-Cycle-Cut In SuperHyperGraphs but literarily, it’s 248
the deformation of any Eulerian-Type-Cycle-Cut In SuperHyperGraphs. It, literarily, deforms 249
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 250
SuperHyperGraph theory are proposed. 251
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Eulerian-Type-Cycle-Cut In 252
SuperHyperGraphs, Cancer’s Neutrosophic Recognition 253

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

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

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




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

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

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

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

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 358
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 359
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 360
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 361
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 362
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 363

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

Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 368
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 369
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 370
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 371
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 372
Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 373
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 374

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

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 399
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett 400
(2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 401
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] 402
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 403

And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic No- 404
tions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 405
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), 406
“Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyper- 407
Resolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of 408
Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic Super- 409
HyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry 410
Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; 411
HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; HG24; 412

HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; HG121; 415
HG255; HG256; HG257; HG258; HG259], there are some endeavors to formalize the basic 429
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 430
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 431
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 432
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 435
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 436

HG162b; HG163b; HG164b; HG165b; HG166b; HG167b; HG168b]. Two popular 443
scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on 444
neutrosophic science is on [HG32b; HG44b]. 445
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 446
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 447
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 448
by Dr. Henry Garrett. This research book covers different types of notions and settings in 449
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 450
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 451
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 452
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 453
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 454
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 455
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 456
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 457
that what’s done in this research book which is popular in the terms of high readers in Scribd. 458
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 459

the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 460

ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 461
HG251; HG252; HG253; HG254; HG255; HG256; HG257; HG258; HG259] alongside 479


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

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

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 569
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 570
(doi: 10.20944/preprints202212.0549.v1). 571
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 572
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 573
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 574
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 575
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 576
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 577
(doi: 10.20944/preprints202212.0500.v1). 578
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 579
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 580
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 582
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 583
HG259 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 585
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 586
10.5281/zenodo.7871026). 587
HG258 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 588
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 589
2023, (doi: 10.5281/zenodo.7874647). 590
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 592

10.5281/zenodo.7857856). 593
HG256 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 594
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 595
2023, (doi: 10.5281/zenodo.7857841). 596
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 598
Zenodo 2023, (doi: 10.5281/zenodo.7855661). 599
HG254 [30] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 600
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 601

HG253 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 603
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 604
10.5281/zenodo.7853867). 605
HG252 [32] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 606
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 607
10.5281/zenodo.7853922). 608
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 610
(doi: 10.5281/zenodo.7851519). 611
HG250 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 612
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 613
(doi: 10.5281/zenodo.7851550). 614
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 616
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 619
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 622
10.5281/zenodo.7834229). 623
HG246 [38] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 624
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 625
10.5281/zenodo.7834261). 626
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 628
10.5281/zenodo.7824560). 629
HG244 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 630

(doi: 10.5281/zenodo.7824623). 632
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 634
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 637
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 640

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 642
2023, (doi: 10.5281/zenodo.7809365). 643
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 645
2023, (doi: 10.5281/zenodo.7809358). 646
HG238 [46] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 647
10.5281/zenodo.7809219). 649
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 651
10.5281/zenodo.7809328). 652
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 654
2023, (doi: 10.5281/zenodo.7806767). 655
HG235 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 656
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 657
2023, (doi: 10.5281/zenodo.7806838). 658
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 660
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 661
HG233 [51] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 662
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 663
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 664
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 666
10.5281/zenodo.7799902). 667
HG231 [53] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 668
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 669
(doi: 10.5281/zenodo.7804218). 670
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 672
(doi: 10.5281/zenodo.7796334). 673
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 675
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 678
10.5281/zenodo.7791952). 679

HG225 [57] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 680
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 681
10.5281/zenodo.7791982). 682
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 684
10.5281/zenodo.7790026). 685
HG223 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 686
10.5281/zenodo.7790052). 688
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 690
2023, (doi: 10.5281/zenodo.7787066). 691
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 693
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 694
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 696
10.5281/zenodo.7781476). 697
HG219 [63] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 698
10.5281/zenodo.7783082). 700
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 702
10.5281/zenodo.7777857). 703
HG217 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 704
10.5281/zenodo.7779286). 706
HG215 [66] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 707
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 708
(doi: 10.5281/zenodo.7771831). 709
HG214 [67] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 710
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 711
2023, (doi: 10.5281/zenodo.7772468). 712
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.20913.25446). 715
HG212 [69] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 716
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 717
odo.7764916). 718

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.11770.98247). 721
HG210 [71] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 722
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 723
10.13140/RG.2.2.12400.12808). 724
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 726
2023, (doi: 10.13140/RG.2.2.22545.10089). 727
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 729
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 730
HG207 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 731
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.11377.76644). 733
HG206 [75] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 734
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 735
10.13140/RG.2.2.23750.96329). 736
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.31366.24641). 739
HG204 [77] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 740
10.13140/RG.2.2.34721.68960). 742
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 744
2023, (doi: 10.13140/RG.2.2.30212.81289). 745
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 747
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 750
10.13140/RG.2.2.24288.35842). 751
HG200 [81] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 752
10.13140/RG.2.2.32467.25124). 754
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.31025.45925). 757

HG198 [83] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 758
10.13140/RG.2.2.17184.25602). 760
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.23423.28327). 763
HG196 [85] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 764
10.13140/RG.2.2.28456.44805). 766
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 768
10.13140/RG.2.2.23525.68320). 769
HG194 [87] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 770
10.13140/RG.2.2.20170.24000). 772
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 774
10.13140/RG.2.2.36475.59683). 775
HG192 [89] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 776
10.13140/RG.2.2.29764.71046). 778
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 780
2023, (doi: 10.13140/RG.2.2.18780.87683). 781
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 783
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 786
10.13140/RG.2.2.26134.01603). 787
HG188 [93] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 788
10.13140/RG.2.2.27392.30721). 790
HG187 [94] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 791
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 792
10.13140/RG.2.2.33028.40321). 793
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 795
10.13140/RG.2.2.21389.20966). 796

HG185 [96] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 797
10.13140/RG.2.2.16356.04489). 799
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 801
10.13140/RG.2.2.21756.21129). 802
HG183 [98] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 803
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 804
10.13140/RG.2.2.30983.68009). 805
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 807
10.13140/RG.2.2.28552.29445). 808
HG181 [100] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 809
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 810
(doi: 10.13140/RG.2.2.10936.21761). 811
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 813
10.13140/RG.2.2.35105.89447). 814
HG179 [102] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 815
(doi: 10.13140/RG.2.2.30072.72960). 817
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 819
10.13140/RG.2.2.31147.52003). 820
HG177 [104] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 821
10.13140/RG.2.2.32825.24163). 823
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 825
10.13140/RG.2.2.13059.58401). 826
HG175 [106] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 827
10.13140/RG.2.2.11172.14720). 829
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 831
2023, (doi: 10.13140/RG.2.2.22011.80165). 832
HG173 [108] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 833
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 834
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 835

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 837
2023, (doi: 10.13140/RG.2.2.10493.84962). 838
HG171 [110] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 839
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 841
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.19944.14086). 844
HG169 [112] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 845
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 847
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 849
(doi: 10.13140/RG.2.2.33103.76968). 850
HG167 [114] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 851
(doi: 10.13140/RG.2.2.23037.44003). 853
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 855
(doi: 10.13140/RG.2.2.35646.56641). 856
HG165 [116] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 857
10.13140/RG.2.2.18030.48967). 859
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 861
(doi: 10.13140/RG.2.2.13973.81121). 862
HG163 [118] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 863
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 864
2023, (doi: 10.13140/RG.2.2.34106.47047). 865
HG162 [119] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 866
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 867
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 870
2023, (doi: 10.13140/RG.2.2.31956.88961). 871
HG160 [121] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 872
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 873
2023, (doi: 10.13140/RG.2.2.15179.67361). 874

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 876
10.13140/RG.2.2.21510.45125). 877
HG158 [123] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 878
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 879
2023, (doi: 10.13140/RG.2.2.13121.84321). 880
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 882
10.13140/RG.2.2.11758.69441). 883
HG156 [125] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 884
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 885
2023, (doi: 10.13140/RG.2.2.31891.35367). 886
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 888
10.13140/RG.2.2.19360.87048). 889
HG154 [127] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 890
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 891
10.13140/RG.2.2.32363.21286). 892
HG153 [128] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 893
10.13140/RG.2.2.23266.81602). 895
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 897
10.13140/RG.2.2.19911.37285). 898
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.11050.90569). 901
HG150 [131] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 902
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 903
2023, (doi: 10.13140/RG.2.2.17761.79206). 904
HG149 [132] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 905
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 906
HG148 [133] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 908
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 909
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 910
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 912
(doi: 10.13140/RG.2.2.30182.50241). 913

HG146 [135] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 914
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 915
HG145 [136] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 917
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 918
HG144 [137] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 920
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 921
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 922
HG143 [138] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 923
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 924
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 925
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 928
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 931
HG140 [141] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 932
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 933
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 934
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 937
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 940
HG137 [144] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 941
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 942
HG136 [145] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 944
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 945
2023, (doi: 10.13140/RG.2.2.17252.24968). 946
HG135 [146] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 947
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 948
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 949
HG134 [147] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 950
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 951

HG132 [148] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 953
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 954
2023010396 (doi: 10.20944/preprints202301.0396.v1). 955
HG131 [149] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 956
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 957
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 958
HG130 [150] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 959
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 960
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 961

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 962
HG129 [151] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 963

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 964
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 965
HG128 [152] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 967
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 968

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 969
HG127 [153] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 970
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 971
2023,(doi: 10.13140/RG.2.2.36745.93289). 972
HG126 [154] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 973
HG125 [155] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 976

10.20944/preprints202301.0282.v1). 979
HG124 [156] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 980
10.20944/preprints202301.0267.v1).). 982
(doi: 10.20944/preprints202301.0265.v1). 987
HG122 [158] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 988
prints202301.0262.v1). 991


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

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

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

10.13140/RG.2.2.32530.73922). 1008
HG27 [164] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1009
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1010

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1011
10.13140/RG.2.2.15897.70243). 1012

10.13140/RG.2.2.32530.73922). 1016

prints202301.0105.v1). 1019
HG28 [167] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1020
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1021
HG29 [168] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1023
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1024
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1025

10.13140/RG.2.2.23172.19849). 1026

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

10.13140/RG.2.2.17385.36968). 1036
Preprints 2023, 2023010044 1039
10.20944/preprints202301.0043.v1). 1042
HG31 [174] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1043
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1044
2023, (doi: 10.13140/RG.2.2.28945.92007). 1045
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1050
10.13140/RG.2.2.35774.77123). 1051
HG35 [178] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1055
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1056

10.13140/RG.2.2.29430.88642). 1057
(doi: 10.20944/preprints202212.0549.v1). 1063
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1065
10.13140/RG.2.2.19380.94084). 1066

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1074
(doi: 10.20944/preprints202212.0500.v1). 1077
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1079
10.13140/RG.2.2.20993.12640). 1080
HG952 [186] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1081

HG95 [187] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1084
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1085
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1086
HG37 [190] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1093
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1094

10.13140/RG.2.2.29173.86244). 1095
HG38 [191] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1096
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1097
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1098
HG168b [192] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1099
2023 (doi: 10.5281/zenodo.7874677). 1100
HG167b [193] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1101
(doi: 10.5281/zenodo.7857906). 1102
HG166b [194] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1103
2023 (doi: 10.5281/zenodo.7856329). 1104

HG165b [195] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1105
10.5281/zenodo.7854561). 1106
HG164b [196] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1107
2023 (doi: 10.5281/zenodo.7851893). 1108
HG163b [197] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1109

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1110
HG162b [198] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1111
(doi: 10.5281/zenodo.7835063). 1112
HG161b [199] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1113
(doi: 10.5281/zenodo.7826705). 1114
HG160b [200] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1115
2023 (doi: 10.5281/zenodo.7820680). 1116
HG159b [201] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1117
10.5281/zenodo.7812750). 1118
HG158b [202] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1119

HG157b [203] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1121
HG156b [204] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1123
2023 (doi: 10.5281/zenodo.7807782). 1124
HG155b [205] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1125
2023 (doi: 10.5281/zenodo.7804449). 1126
HG154b [206] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1127
HG153b [207] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1129
(doi: 10.5281/zenodo.7792307). 1130
HG152b [208] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1131
(doi: 10.5281/zenodo.7790728). 1132
HG151b [209] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1133
2023 (doi: 10.5281/zenodo.7787712). 1134
HG150b [210] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1135
10.5281/zenodo.7783791). 1136
HG149b [211] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1137
10.5281/zenodo.7780123). 1138
HG148b [212] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1139
(doi: 10.5281/zenodo.7773119). 1140

HG147b [213] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1141
odo.7637762). 1142
HG146b [214] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7766174). 1144
HG145b [215] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1145
10.5281/zenodo.7762232). 1146
HG144b [216] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1147
(doi: 10.5281/zenodo.7758601). 1148
HG143b [217] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1149
10.5281/zenodo.7754661). 1150
HG142b [218] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1151
10.5281/zenodo.7750995) . 1152
HG141b [219] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1153
(doi: 10.5281/zenodo.7749875). 1154
HG140b [220] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1155
10.5281/zenodo.7747236). 1156
HG139b [221] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1157
10.5281/zenodo.7742587). 1158
HG138b [222] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1159
(doi: 10.5281/zenodo.7738635). 1160
HG137b [223] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1161
10.5281/zenodo.7734719). 1162
HG136b [224] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1163
10.5281/zenodo.7730484). 1164
HG135b [225] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1165
(doi: 10.5281/zenodo.7730469). 1166
HG134b [226] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1167
10.5281/zenodo.7722865). 1168
HG133b [227] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1169
odo.7713563). 1170
odo.7709116). 1172
HG131b [229] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1173
10.5281/zenodo.7706415). 1174
HG130b [230] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1175
10.5281/zenodo.7706063). 1176

HG129b [231] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1177
10.5281/zenodo.7701906). 1178
HG128b [232] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1179
odo.7700205). 1180
HG127b [233] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1181
10.5281/zenodo.7694876). 1182
HG126b [234] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1183
10.5281/zenodo.7679410). 1184
HG125b [235] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7675982). 1186
HG124b [236] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7672388). 1188
HG123b [237] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1189
odo.7668648). 1190
HG122b [238] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.7662810). 1192
HG121b [239] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1193
10.5281/zenodo.7659162). 1194
HG120b [240] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1195
odo.7653233). 1196
HG119b [241] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1197
odo.7653204). 1198
HG118b [242] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1199
odo.7653142). 1200
HG117b [243] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1201
odo.7653117). 1202
HG116b [244] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1203
HG115b [245] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1204
odo.7651687). 1205
HG114b [246] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1206
odo.7651619). 1207
HG113b [247] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7651439). 1209
HG112b [248] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1210
odo.7650729). 1211

HG111b [249] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1212
odo.7647868). 1213
HG110b [250] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1214
odo.7647017). 1215
HG109b [251] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1216
odo.7644894). 1217
HG108b [252] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1218
HG107b [253] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1219
odo.7632923). 1220
HG106b [254] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7623459). 1222
HG105b [255] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7606416). 1224
HG104b [256] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1225
10.5281/zenodo.7606416). 1226
HG103b [257] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1227
odo.7606404). 1228
HG102b [258] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7580018). 1230
HG101b [259] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1231
odo.7580018). 1232
odo.7580018). 1234
odo.7579929). 1236
HG98b [262] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7563170). 1238
HG97b [263] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1239
odo.7563164). 1240
HG96b [264] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1241
odo.7563160). 1242
odo.7563160). 1244
HG94b [266] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1245
10.5281/zenodo.7563160). 1246

HG93b [267] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1247
10.5281/zenodo.7557063). 1248
HG92b [268] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7557009). 1250
HG91b [269] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7539484). 1252
HG90b [270] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7523390). 1254
HG89b [271] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7523390). 1256
HG88b [272] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7523390). 1258
HG87b [273] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7574952). 1260
HG86b [274] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7574992). 1262
odo.7523357). 1264
HG84b [276] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.7523357). 1266
HG83b [277] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7504782). 1268
HG82b [278] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1269
10.5281/zenodo.7504782). 1270
HG81b [279] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1271
10.5281/zenodo.7504782). 1272
HG80b [280] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7499395). 1274
HG79b [281] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7499395). 1276
HG78b [282] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1277
10.5281/zenodo.7499395). 1278
HG77b [283] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1279
10.5281/zenodo.7497450). 1280
HG76b [284] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1281
10.5281/zenodo.7497450). 1282

HG75b [285] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1283
10.5281/zenodo.7494862). 1284
HG74b [286] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1285
odo.7494862). 1286
HG73b [287] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1287
10.5281/zenodo.7494862). 1288
HG72b [288] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1289
10.5281/zenodo.7493845). 1290
HG71b [289] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1291
odo.7493845). 1292
HG70b [290] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7493845). 1294
HG69b [291] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1295
odo.7539484). 1296
HG68b [292] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1297
odo.7523390). 1298
HG67b [293] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1299
odo.7523357). 1300
HG66b [294] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1301
odo.7504782). 1302
HG65b [295] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1303
odo.7499395). 1304
HG64b [296] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1305
odo.7497450). 1306
HG63b [297] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1307
odo.7494862). 1308
HG62b [298] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1309
odo.7493845). 1310
HG61b [299] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1311
odo.7480110). 1312
HG60b [300] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1313
odo.7378758). 1314
HG32b [301] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1315
odo.6320305). 1316
HG44b [302] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1317
odo.6677173). 1318

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1368
is going to figure out what’s going on this phenomenon. The special case of this disease is 1369
considered and as the consequences of the model, some parameters are used. The cells are 1370
under attack of this disease but the moves of the cancer in the special region are the matter of 1371
mind. The recognition of the cancer could help to find some treatments for this disease. The 1372
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1373
Recognition” and both bases are the background of this research. Sometimes the cancer has 1374
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1375
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1376
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1377
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1378
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1379
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1380
and neutrality about the moves and the effects of the cancer on that region; this event leads 1384
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1385
perception on what’s happened and what’s done. There are some specific models, which 1386
are well-known and they’ve got the names, and some general models. The moves and the 1387
traces of the cancer on the complex tracks and between complicated groups of cells could 1388
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1389
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1390
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1391

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1392
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1393
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1394
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1395
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1396
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1397
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1398
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1399
based on the fixed groups of cells or the fixed groups of group of cells? 1400
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1401
messy and dense SuperHyperModels where embedded notions are illustrated? 1402
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1403
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1404
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1405

research has taken more motivations to define SuperHyperClasses and to find some connections 1406
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1407
instances and examples to make clarifications about the framework of this research. The general 1408
results and some results about some connections are some avenues to make key point of this 1409
research, “Cancer’s Recognition”, more understandable and more clear. 1410
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1411
on the modeling of the regions where are under the attacks of the cancer to recognize 1412
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1413
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1414
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1415
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1416
instances and literature reviews have taken the whole way through. In this scientific research, 1417
the literature reviews have fulfilled the lines containing the notions and the results. The 1418
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1419
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1420
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1421
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1422
of the moves of the cancer in the longest and strongest styles with the formation of the design 1423
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1424
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1425
out the background for the SuperHyperNotions. 1426

CHAPTER 5 1427
Extreme Eulerian-Type-Cycle-Cut 1428
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1429
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1430
2023, (doi: 10.13140/RG.2.2.34953.52320). 1431

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1432
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1433
(doi: 10.13140/RG.2.2.33275.80161). 1434
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1435
10.13140/RG.2.2.11050.90569). 1437
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1438
10.13140/RG.2.2.17761.79206). 1440
10.13140/RG.2.2.19911.37285). 1443
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1444
10.13140/RG.2.2.23266.81602). 1446
10.13140/RG.2.2.19360.87048). 1449
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1450
10.13140/RG.2.2.32363.21286). 1452
10.13140/RG.2.2.11758.69441). 1455
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1456
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1457
10.13140/RG.2.2.31891.35367). 1458
10.13140/RG.2.2.21510.45125). 1461
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1462
10.13140/RG.2.2.13121.84321). 1464

CHAPTER 6 1465
New Ideas On Super Nebulous By Hyper 1466
Nebbish Of Eulerian-Type-Cycle-Cut In 1467
Recognition of Cancer With 1468
(Neutrosophic) SuperHyperGraph 1469
49
CHAPTER 7 1470
ABSTRACT 1471
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1472
). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Cycle-

Type-Cycle-Cut 1473
0
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1474
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type-Cycle- 1475
Cut if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria 1476
holds 1477
∀E 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic 1478
e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 1479
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1480
SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic v- 1481
SuperHyperEulerian-Type-Cycle-Cut criteria holds 1482
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic 1483
v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 1484
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1485
SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, 1486
51
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, 1487

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperEulerian-Type- 1488
Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1489
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1490
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHy- 1493
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1494
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1495
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1496
they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; a Neutrosophic SuperHyperEulerian- 1497
Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 1498
re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutro- 1499

sophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 1500
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1501
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1502
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1503
the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an Extreme SuperHyperEulerian-Type-Cycle-Cut 1504
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutro- 1505

sophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and 1506
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyper- 1507
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1508
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1509
HyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1510
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1511
SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to its Extreme coef- 1512
ficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of 1513
Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, 1514
Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Type- 1515
Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutro- 1516
sophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1517
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 1518
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 1519
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1520
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded 1521
to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of 1522

Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1525
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1526
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme SuperHy- 1527
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian- 1528
Type-Cycle-Cut; a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 1529
e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 1530
v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and 1531
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 1532

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1533

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1534
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an 1535
Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 1536
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 1539
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 1540
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 1541
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 1542
perVertices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme 1543
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 1544

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyper- 1547
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1548
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1549
the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1550
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 1551

tices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic 1552
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting 1553
is introduced for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Cycle-Cut and 1554
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. Two different types of SuperHyperDefinitions are 1555
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 1556
Recognition” are the under research to figure out the challenges make sense about ongoing and 1563
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1568
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1569
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1570
research. It’s also officially collected in the form of some questions and some problems. Assume 1571
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Cut 1572
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1573
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1574

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1575
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1576
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a 1577
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1578

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 1583
a SuperHyperEulerian-Type-Cycle-Cut . Since there’s more ways to get type-results to make a 1584
SuperHyperEulerian-Type-Cycle-Cut more understandable. For the sake of having Neutrosophic 1585

SuperHyperEulerian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 1586
Type-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1587
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1588
assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Cut . It’s redefined a Neutrosophic 1589
SuperHyperEulerian-Type-Cycle-Cut if the mentioned Table holds, concerning, “The Values of 1590
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 1591
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 1592
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 1593
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Type- 1597

Cycle-Cut . It’s the main. It’ll be disciplinary to have the foundation of previous definition in 1598
the kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Type-Cycle-Cut until 1599
the SuperHyperEulerian-Type-Cycle-Cut, then it’s officially called a “SuperHyperEulerian-Type-Cycle-Cut” 1600
but otherwise, it isn’t a SuperHyperEulerian-Type-Cycle-Cut . There are some instances about the 1601
clarifications for the main definition titled a “SuperHyperEulerian-Type-Cycle-Cut ”. These two 1602
examples get more scrutiny and discernment since there are characterized in the disciplinary 1603
ways of the SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Cut . For the sake of having 1604
a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a 1605
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” and a “Neutrosophic SuperHyperEulerian-Type-Cycle- 1606
Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 1607
letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 1608
perGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Cycle-Cut are redefined to a 1610
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” if the intended Table holds. It’s useful to define 1611
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 1612
results to make a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut more understandable. Assume 1613
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1614

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 1615
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1616
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”, “Neutrosophic SuperHyper- 1617
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1618
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1619
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” where it’s the strongest [the maximum Neutro- 1620
sophic value from all the SuperHyperEulerian-Type-Cycle-Cut amid the maximum value amid all 1621
SuperHyperVertices from a SuperHyperEulerian-Type-Cycle-Cut .] SuperHyperEulerian-Type-Cycle-Cut . 1622
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1623
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1624

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1625
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Cut if it’s 1626
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1627
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1628
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1629
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1630
by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, Su- 1652
perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1653
the longest SuperHyperEulerian-Type-Cycle-Cut or the strongest SuperHyperEulerian-Type-Cycle-Cut 1654
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Cycle-Cut, 1655

called SuperHyperEulerian-Type-Cycle-Cut, and the strongest SuperHyperEulerian-Type-Cycle-Cut, called 1656
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. Beyond that 1657
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1658
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1659
SuperHyperEulerian-Type-Cycle-Cut. There isn’t any formation of any SuperHyperEulerian-Type-Cycle-Cut 1660

but literarily, it’s the deformation of any SuperHyperEulerian-Type-Cycle-Cut. It, literarily, deforms 1661
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 1662
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1663
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Cut, Cancer’s Neut- 1664
rosophic Recognition 1665


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

Then the research has taken more motivations to define SuperHyperClasses and to find some 1727
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1728
some instances and examples to make clarifications about the framework of this research. The 1729
general results and some results about some connections are some avenues to make key point of 1730
this research, “Cancer’s Recognition”, more understandable and more clear. 1731
The framework of this research is as follows. In the beginning, I introduce basic definitions 1732
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1733
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1734
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1735
review literature are applied to make sense about what’s going to figure out about the upcoming 1736
sections. The main definitions and their clarifications alongside some results about new notions, 1737
SuperHyperEulerian-Type-Cycle-Cut and Extreme SuperHyperEulerian-Type-Cycle-Cut, are figured out 1738

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

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1745
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1746
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1747
and as concluding and closing section of theoretical research are contained in the section 1748
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1749
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1750
Results”, “ SuperHyperEulerian-Type-Cycle-Cut”, “Extreme SuperHyperEulerian-Type-Cycle-Cut”, “Results 1751

on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 1752
questions about what’s done about the SuperHyperNotions to make sense about excellency of 1753
this research and going to figure out the word “best” as the description and adjective for this 1754
research as presented in section, “ SuperHyperEulerian-Type-Cycle-Cut”. The keyword of this research 1755
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 1756
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 1757
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 1758
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 1759
research in the terms of “questions” and “problems” to make sense to figure out this research in 1760
featured style. The advantages and the limitations of this research alongside about what’s done 1761
in this research to make sense and to get sense about what’s figured out are included in the 1762
section, “Conclusion and Closing Remarks”. 1763

CHAPTER 9 1764
Extreme Preliminaries Of This Scientific 1765
Research On the Redeemed Ways 1766
In this section, the basic material in this scientific research, is referred to [Single Valued 1767
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1768
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1769

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1770
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1771
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1772
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1773
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1774
their clarifications are addressed to Ref.[HG38]. 1775

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

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

Let X be a Eulerian-Type-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}.
61
Definition 9.0.3. The degree of truth-membership, indeterminacy-membership and

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,
and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1779
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1780
where 1781
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1782
(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); 1783
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1784
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1785
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
(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 . 1791
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1792
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1793
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1794

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1795
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1796
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1797
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1798
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1799
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1800

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

(Ref.[HG38],Definition 2.7,p.3). 1802
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1803
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1804
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1805
(i) If |Vi | = 1, then Vi is called vertex; 1806
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1807
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1808
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1809
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1810
SuperEdge; 1811
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1812
SuperHyperEdge. 1813
If we choose different types of binary operations, then we could get hugely diverse types of 1814
general forms of Neutrosophic SuperHyperGraph (NSHG). 1815
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1816

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1817
x, y, z, w ∈ [0, 1]: 1818
(i) 1 ⊗ x = x; 1819
(ii) x ⊗ y = y ⊗ x; 1820
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1821
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1822

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

where 1825

1, 2, . . . , n0 ); 1830
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1831
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1832
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1833
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1834
0


SuperEdge; 1854
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1857
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1858
makes the patterns and regularities. 1859
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1860
of elements of SuperHyperEdges are the same. 1861

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1862
makes to have SuperHyperUniform more understandable. 1863
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1864
Classes as follows. 1865
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1866
two given SuperHyperEdges with two exceptions; 1867
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1868
SuperHyperEdges; 1869
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1870
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1871
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1872
in common; 1873
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1874
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1875
SuperHyperEdge in common; 1876
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1877
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1878
SuperVertex. 1879
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 1880
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1881
(i) Vi , Vi+1 ∈ Ei0 ; 1882
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1883
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1884
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1885
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1886
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1887
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1888
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1889
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1891
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1892
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1893
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1894
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1895
perPath . 1896
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 1897
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1898
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1899
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1900
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1901
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1902

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1915
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1916
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1917
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Cycle- 1918

Cut). 1919
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1921
or E 0 is called 1922
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 1923

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 1924
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 1925

Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut criteria holds 1926
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1927
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 1928
Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 1929
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 1930
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1932

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 1933

SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut, Neutro- 1934
sophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle- 1935
Cut. 1936
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Cut). 1937

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

Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1943
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1944

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1945
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1946
SuperHyperEulerian-Type-Cycle-Cut; 1947
(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 1948

Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1951
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 1952
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHy- 1953
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1954
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either 1956

of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian- 1957
Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv- 1958
SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : 1959

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 1960
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 1961
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1962
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1963
Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to its 1964
Extreme coefficient; 1965
(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial 1966

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re- 1967
SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neut- 1968
rosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic Super- 1969

HyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1970
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 1971
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1972
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1973
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1974
Type-Cycle-Cut; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 1975

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 1976

the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 1981
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 1984

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1988
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1989
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1990
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 1992

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re- 1993
SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and 1994
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme Su- 1995
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1996
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1997
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1998

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1999
such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power 2000
is corresponded to its Extreme coefficient; 2001
(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial 2002

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic Su- 2005
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 2006
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 2007

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 2011
Neutrosophic coefficient. 2012
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Cut). 2013

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2014
(i) an δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 2015
SuperHyperEulerian-Type-Cycle-Cut such that either of the following expressions hold for the 2016

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
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2017
|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 2018
(29.1), holds if S is an δ−SuperHyperDefensive; 2019
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neut- 2020

rosophic SuperHyperEulerian-Type-Cycle-Cut such that either of the following Neutrosophic 2021
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2022
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2023

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2024
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need to 2025
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2026
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 2027
there’s the usage of the position of labels to assign to the values. 2028
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2029
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2030
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2031
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2032
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 2034
sophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, SuperHyperBipart- 2035
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 2036
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 2037
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 2038
perHyperWheel if the Table (29.2) holds. 2039
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Cycle- 2040

Cut. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Type- 2041
Cycle-Cut more Neutrosophicly understandable. 2042

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

136TBL4

136TBL1

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. The 2044
2047
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Cycle-Cut. It’s redefined a Neutrosophic 2048

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

CHAPTER 10 2050
Extreme SuperHyper But As The Eulerian-Type-Cycle-Cut 2051
Extensions Excerpt From Dense And 2052
Super Forms 2053
Definition 10.0.1. (Extreme event). 2054
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2055
a probability Eulerian-Type-Cycle-Cut. Any Extreme k-subset of A of V is called Extreme k-event 2056
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 2057
is called Extreme probability of A. 2058
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2059

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2060
probability Eulerian-Type-Cycle-Cut. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2061

if the following expression is called Extreme s-independent criteria 2062
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 2063
following expression is called Extreme independent criteria 2064
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2065

a probability Eulerian-Type-Cycle-Cut. Any k-function Eulerian-Type-Cycle-Cut like E is called Extreme 2067

k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Cut like E is called Extreme 2068
Variable. 2069
The notion of independent on Extreme Variable is likewise. 2070
Definition 10.0.4. (Extreme Expectation). 2071
73
a probability Eulerian-Type-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 2073

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

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2076
is a probability Eulerian-Type-Cycle-Cut. an Extreme number is called Extreme Crossing if the 2077

following expression is called Extreme Crossing criteria 2078
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 2079
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let m and n propose special Eulerian-Type-Cycle-Cut. 2080
Then with m ≥ 4n, 2081
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-Type-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: 2082
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2083
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2084
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let P be a SuperHyperSet of n points 2085
in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through 2086
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2087
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2088

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

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

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

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

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

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p is up. Let 2124
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 2125
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 2126
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 2127
of the Extreme SuperHyperGraph G. 2128
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2129
Extreme Variable for this Extreme Event. By equation, we have 2130
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 2131
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2132
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: 2133
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2134
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 2135
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2136
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2137
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2138
Definition 10.0.12. (Extreme Variance). 2139

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

S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be an Extreme Variable and let t be a 2147
positive real number. Then 2148
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2149
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let Xn be an Extreme Variable in a 2151

probability Eulerian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2152
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 2154
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2155
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2156
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2158
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 2159
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2160
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. As in the proof of related Theorem, the result 2162
is straightforward. 2163
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 2165
defined in previous Theorem. Then either: 2166
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2167
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2168
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. The latter is straightforward. 2170
Definition 10.0.17. (Extreme Threshold). 2171
a probability Eulerian-Type-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs (one 2173
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2174
a function f (n) such that: 2175
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2176
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2177

Definition 10.0.18. (Extreme Balanced). 2178

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2179
is a probability Eulerian-Type-Cycle-Cut. Let F be a fixed Extreme SuperHyperGraph. Then 2180
there is a threshold function for the property of containing a copy of F as an Extreme 2181
SubSuperHyperGraph is called Extreme Balanced. 2182
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let F be a nonempty balanced Extreme 2184
SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l is a 2185
threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2186
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2189
the mentioned Extreme Figures in every Extreme items. 2190
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2191
Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are 2192
some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2193
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2194
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2195
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2196
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2197
Extreme SuperHyperEulerian-Type-Cycle-Cut. 2198
C(N SHG)Extreme Eulerian-Type-Cycle-Cut

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

= {E4 }.

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

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

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



= {E4 , E1 , E5 , E4 }.
= 3z 5 + z 3 .
= {V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }.
= 2z 4 + 2z 3 + 3z 2 + 5z.
2213

= {E1 }.
= z5.
= {Vi=15 }.

= z 7 + 2z 4 + z 3 + z 2 .
2216

= {Ei=110 ,Ei=2332 ,E
12 ,E22 }.

= 22z 2 .
= {Vi ∈ VN SHG }.
X
= z |Vi ∈VN SHG | .
2219

= {Ei=110 ,E17 ,E14 ,E13 ,E15 }.

= z 5 + z 4 + 12z 2 .
= {Vi ∈ VN SHG }.
X
2222

= {E3 }.
= z5.
= {}.

= 2z 6 + 2z 5 + z 4 .
2225

= {Ei=110 ,E23 ,E12 ,E22 }.
= z 11 + 12z 2 .
= {Vi ∈ VN SHG }.
X
2228
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2229
SuperHyperEulerian-Type-Cycle-Cut, is up. The Extreme Algorithm is Extremely straightfor- 2230

ward. 2231


= {E4 , E7 , E6 }.
= 3z 2 .
= {V12 , V13 , V14 }.
= 2z 5 + z 3 .
2232

ward. 2235

= {E1 , E6 , E5 , E4 , E7 }.
= z 3 + 4z 2 .
= {Vi ∈ VN SHG }.

X
2236

ward. 2239

= {E1 }.
= z5.
= {V1 , V2 , V3 , V7 , V8 }.
= z 8 + z 7 + 3z 5 .
2240

ward. 2243

= {E1 , E10 , E8 , E4 , E2 , E6 }.
= 6z 2 .
= {Vi ∈ VN SHG }.
= 3z 5 + z 4 + 2z 3 .
2244

ward. 2247

= {E1 }.
= z2.


= {V1 , V3 }.
= 2z 5 .
2248

ward. 2251

= {E1 }.
= z2.
= {V1 , V5 }.
= 2z 5 .
2252


ward. 2255

= {E4 }.
= z 10 .
= {Vi=817 }.
X
2256



ward. 2259

= {E4 }.
= z 10 .
= {Vi=817 }.
X
2260

ward. 2263

= {E4 }.


= z 10 .
= {Vi=817 }.
X
2264

ward. 2267

= {Ei=112 }.
X
= z |Ei ∈EN SHG | .
= {|Vi ∈ VN SHG }.

X
2268

ward. 2271

= {E6 }.
= z |E6 | .
= {VE6 }.
X
= z |VE6 |.
2272
(10.4)
2273


ward. 2276

= {E2 }.
= z |E2 | .
= {VE2 }.
X
= z |VE2 |.
2277
(10.6)
2278

SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (42.0.3) 95NHG1
ward. 2281

= {E4 }.
= z |E4 | .
= {VE4 }.
X
= z |VE4 |.
2282
(10.8)

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

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

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Type-Cycle-Cut. In other words, the least cardinality, the lower 2308
sharp bound for the cardinality, of an Extreme type-result-Eulerian-Type-Cycle-Cut is the cardinality of 2309

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−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-Type-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-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Eulerian-Type-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-Type-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-Type-Cycle-Cut decorates the Extreme SuperHyper-
Vertices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex

in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,

the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Eulerian-Type-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-Type-Cycle-Cut has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Eulerian-Type-Cycle-Cut has the Extreme cardinality at least
an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \V \{z}. This Extreme Su-
perHyperSet isn’t an Extreme R-Eulerian-Type-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-Type-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-Type-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-Type-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-Type-Cycle-Cut. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Eulerian-Type-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-Type-Cycle-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Type-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
is formalized with mathematical literatures on the Extreme R-Eulerian-Type-Cycle-Cut. Let
E
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, 2310
Extreme R-Eulerian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2311
Extreme R-Eulerian-Type-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Type-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-Type-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-Type-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Cut is at least 2312
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2313
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2314
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2315
SuperHyperVertices are renamed to Extreme Eulerian-Type-Cycle-Cut in some cases but the maximum 2316
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2317
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2318

Eulerian-Type-Cycle-Cut. 2319
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2320
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2321
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2322
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2323
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2324

Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2325
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2326
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2327
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2328
Thus it forms an Extreme quasi-R-Eulerian-Type-Cycle-Cut where the Extreme completion of the 2329
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Eulerian-Type-Cycle- 2330
Cut. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. 2331

In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2332
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2333
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2334
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2335
Extreme style of the embedded Extreme R-Eulerian-Type-Cycle-Cut. The interior types of the Extreme 2336
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2337
affected by the interior Extreme SuperHyperVertices. The common connections, more precise 2338
and more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 2339
distinct types of Extreme SuperHyperVertices pose the Extreme R-Eulerian-Type-Cycle-Cut. Thus 2340
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge and 2341
in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that Extreme 2342
SuperHyperEdge. In the embedded Extreme Eulerian-Type-Cycle-Cut, there’s the usage of exterior 2343
Extreme SuperHyperVertices since they’ve more connections inside more than outside. Thus the 2344
title “exterior” is more relevant than the title “interior”. One Extreme SuperHyperVertex has no 2345
connection, inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with 2346
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 2347
the Extreme R-Eulerian-Type-Cycle-Cut. The Extreme R-Eulerian-Type-Cycle-Cut with the exclusion of the 2348
exclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other 2349
terms, the Extreme R-Eulerian-Type-Cycle-Cut with the inclusion of all Extreme SuperHyperVertices 2350
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Eulerian-Type-Cycle-Cut. To sum them 2351
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2352
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2353
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Type-Cycle-Cut 2354
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2355
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2356
Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Cycle-Cut, minus all Extreme 2357
SuperHypeNeighbor to some of them but not all of them. 2358
The main definition of the Extreme R-Eulerian-Type-Cycle-Cut has two titles. an Extreme quasi-R- 2359
Eulerian-Type-Cycle-Cut and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2360

two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2361
Eulerian-Type-Cycle-Cut with that quasi-maximum Extreme SuperHyperCardinality in the terms of 2362
the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, 2363
then the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2364
R-Eulerian-Type-Cycle-Cuts for all Extreme numbers less than its Extreme corresponded maximum 2365
number. The essence of the Extreme Eulerian-Type-Cycle-Cut ends up but this essence starts up 2366
in the terms of the Extreme quasi-R-Eulerian-Type-Cycle-Cut, again and more in the operations of 2367
collecting all the Extreme quasi-R-Eulerian-Type-Cycle-Cuts acted on the all possible used formations 2368
of the Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2369
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Cuts. Let 2370

zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Type-Cycle-Cut be an Extreme number, 2371
an Extreme SuperHyperSet and an Extreme Eulerian-Type-Cycle-Cut. Then 2372
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Cycle-Cut is re-formalized 2373
and redefined as follows. 2374
GExtreme Eulerian-Type-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 2375
definition for the Extreme Eulerian-Type-Cycle-Cut. 2376
GExtreme Eulerian-Type-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-Type- 2377
poses the upcoming expressions.
Cycle-Cut 2378
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2379


= max zExtreme Number

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

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


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

2383

2384


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2385
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2386
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2387
perEdge. It’s, literarily, another name for “Extreme Quasi-Eulerian-Type-Cycle-Cut” but, precisely, 2388
it’s the generalization of “Extreme Quasi-Eulerian-Type-Cycle-Cut” since “Extreme Quasi-Eulerian-Type- 2389
Cycle-Cut” happens “Extreme Eulerian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as initial 2390
framework and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme 2391
Eulerian-Type-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and preliminarily 2392
background since there are some ambiguities about the Extreme SuperHyperCardinality arise 2393
from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme 2394
Quasi-Eulerian-Type-Cycle-Cut”, and “Extreme Eulerian-Type-Cycle-Cut” are up. 2395
Thus, let 2396
zExtreme Number , NExtreme SuperHyperNeighborhood and 2397

GExtreme Eulerian-Type-Cycle-Cut be an Extreme number, an Extreme SuperHyperNeighborhood and 2398
an Extreme Eulerian-Type-Cycle-Cut and the new terms are up. 2399
GExtreme Eulerian-Type-Cycle-Cut ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2400
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2401
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2402


And with go back to initial structure, 2403
GExtreme Eulerian-Type-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

2405

2406

Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Cycle-Cut if for any of them, and
any of other corresponded Extreme SuperHyperVertex, some interior Extreme SuperHyperVer-
tices 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-Type-Cycle-Cut.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Cut. The Extreme

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

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

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2420
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2421
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2422
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2423
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2424
R-Eulerian-Type-Cycle-Cut with the least cardinality, the lower sharp Extreme bound for Extreme 2425
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2426
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2427
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2428
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Eulerian-Type-Cycle-Cut. 2429
Since it doesn’t have 2430
2431
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2432
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2433
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2434
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2435
but it isn’t an Extreme R-Eulerian-Type-Cycle-Cut. Since it doesn’t do the Extreme procedure such 2436
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2437
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2438
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2439
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2440
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2441
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of 2442
Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Eulerian-Type-Cycle-Cut, VESHE 2443

is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Cut, 2444
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2445
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2446
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2447
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2448
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2449

SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2450

Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Eulerian-Type-Cycle-Cut only contains 2451
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2452
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2453
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2454
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2455
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2456

The SuperHyperNotion, namely, Eulerian-Type-Cycle-Cut, is up. There’s neither empty SuperHy- 2457
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2458
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2459
Type-Cycle-Cut. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices], 2460

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

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

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

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2467
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Ex- 2468
treme SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the 2469
intended Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Cycle-Cut is up. 2470
The obvious simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Cut is an 2471
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2472

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2473

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2474
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type- 2475
Cycle-Cut is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2476
perEdges[SuperHyperVertices], 2477

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-Type-Cycle-Cut. 2478

Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2479

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2480

is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no 2481
an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2482
treme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Cut and it’s an Extreme 2483
Eulerian-Type-Cycle-Cut. Since it’s 2484
2485

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2486

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2487
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2488
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2489
intended Extreme SuperHyperSet, 2490

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

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 Eulerian-Type-Cycle-Cut , 2492
not: 2493

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

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 2495
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2496
SuperHyperSet called the 2497
“Extreme Eulerian-Type-Cycle-Cut ” 2498
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2499
Extreme Eulerian-Type-Cycle-Cut, 2500
is only and only 2501

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

CHAPTER 11 2503
The Extreme Departures on The 2504
Theoretical Results Toward Theoretical 2505
Motivations 2506
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2507
SuperHyperClasses. 2508
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2509

= {Ei }|Ei |=maxEj ∈EN SHG |Ej | .
{Ei }|Ei |=maxE |Ej |
=z j ∈EN SHG

= {V{Ei }|Ei |=maxE |Ej |
}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
i Ej ∈EN SHG |Ej |
= z .
Proof. Let 2510
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2511
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
115
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2512
new way to redefine as 2513
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 2514
ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Cut. The latter is straightforward. 2515
2516
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2517
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2518
(31.1), is the SuperHyperEulerian-Type-Cycle-Cut. 2519
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2520

|E |
= {Ei }i=1N SHG .


X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 2521
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2522
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 2523

2527
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2528
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2529
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 2530

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

SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2531

=z j ∈EN SHG

}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
= z .
Proof. Let 2532
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2533
P :
E1 , V1EXT ERN AL ,

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

SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (42.0.9) 136NSHG20a
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2534
way to redefine as 2535


2538
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2539
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2540
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2541
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2542
Type-Cycle-Cut. 2543

Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2544

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

= {Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s .
X
= z |Vi | .
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
N SHG N SHG
Proof. Let 2545
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
2546
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 2547
a new way to redefine as 2548

Then there’s no at least one SuperHyperEulerian-Type-Cycle-Cut. Thus the notion of quasi may be up 2551
but the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle-Cut could be applied. There 2552
are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2553
as the representative in the 2554
P :

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

Extreme SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Extreme SuperHyperBipartite 2555

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2556
SuperHyperPart SuperHyperEdges are attained in any solution 2557
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2558
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2559
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2560
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2561
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2562
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Type-Cycle-Cut. 2563
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2564

Then 2565

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

X
= z |Vi | .
N SHG N SHG
Proof. Let 2566
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2567
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Extreme SuperHyperMulti- 2568

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

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

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2576

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2577
SuperHyperEdges are attained in any solution 2578
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2579
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2581
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2582
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2583
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2584
the Extreme SuperHyperEulerian-Type-Cycle-Cut. 2585
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2586

Then, 2587

|E |
= {Ei }i=1N SHG .
X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 2588
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2589
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Extreme SuperHyperWheel 2590

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

Then there’s at least one SuperHyperEulerian-Type-Cycle-Cut. Thus the notion of quasi isn’t up and 2594
the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle-Cut could be applied. The unique 2595
embedded SuperHyperEulerian-Type-Cycle-Cut proposes some longest SuperHyperEulerian-Type-Cycle-Cut 2596
excerpt from some representatives. The latter is straightforward. 2597
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2598
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2599
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2600
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2601
Extreme SuperHyperEulerian-Type-Cycle-Cut. 2602

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

Extreme SuperHyperEulerian-Type-Cycle-Cut in the Extreme Example (42.0.15) 136NSHG23a

CHAPTER 12 2603
The Surveys of Mathematical Sets On 2604
The Results But As The Initial Motivation 2605
For the SuperHyperEulerian-Type-Cycle-Cut, Extreme SuperHyperEulerian-Type-Cycle-Cut, and the 2606

Extreme SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. 2607
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Type-Cycle-Cut is “redefined” on 2608
the positions of the alphabets. 2609
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Type-Cycle-Cut. Then 2610
Extreme SuperHyperEulerian − T ype − Cycle − Cut =

{theSuperHyperEulerian − T ype − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − Cut
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−Cycle−Cut. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2611
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2612
and the neutrality, for i = 1, 2, 3, respectively. 2613
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2614
alphabet. Then the notion of Extreme SuperHyperEulerian-Type-Cycle-Cut and SuperHyperEulerian-Type- 2615
Cycle-Cut coincide. 2616
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2617
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2618
SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a SuperHyperEulerian-Type-Cycle-Cut. 2619
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2620
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2621
SuperHyperEulerian-Type-Cycle-Cut if and only if it’s a longest SuperHyperEulerian-Type-Cycle-Cut. 2622
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2623
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Cut is its 2624
SuperHyperEulerian-Type-Cycle-Cut and reversely. 2625
127
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, Supe- 2626

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2627
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Cut is its 2628
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2630
isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined.
Type-Cycle-Cut 2631
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2632
Extreme SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian- 2633

Type-Cycle-Cut isn’t well-defined. 2634

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2636
SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut 2637
isn’t well-defined. 2638
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2639
is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut is well-defined.
Type-Cycle-Cut 2640
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2641

Extreme SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Type- 2642
Cycle-Cut is well-defined. 2643

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2645
SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut is 2646
well-defined. 2647
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2648
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2649
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2650
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2651
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2652
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2653
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2654
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2655
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2656
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2657
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2658
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2659
(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2660

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

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

which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then V is a maximal 2671
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2672
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2673
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2674
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2675
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2676
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2677
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2678
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2679

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2680
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2681
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2682
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2683
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2684
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2685
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2686

which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then the number of 2689
(i) : the SuperHyperEulerian-Type-Cycle-Cut; 2690

(ii) : the SuperHyperEulerian-Type-Cycle-Cut; 2691
(iii) : the connected SuperHyperEulerian-Type-Cycle-Cut; 2692
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 2693
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 2694
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 2695
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2696
coincide. 2697

which is a SuperHyperWheel. Then the number of 2699
(i) : the dual SuperHyperEulerian-Type-Cycle-Cut; 2700
(ii) : the dual SuperHyperEulerian-Type-Cycle-Cut; 2701
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Cut; 2702
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 2703
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 2704
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 2705
coincide. 2707
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2709

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2710
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2711
is a 2712
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2716
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2717
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2718

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2721
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2722
SuperHyperPart is a 2723

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2727
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2728
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2729

SuperHyperMultipartite. Then Then the number of 2732
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2739
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2740
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2742
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2743
(iv) : SuperHyperEulerian-Type-Cycle-Cut; 2747
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2748
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2749
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2750
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2751
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2752
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2753

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2760
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2761
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2762
dual 2763
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2767
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2770
perComplete. Then there’s no independent SuperHyperSet. 2771
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2772

SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2773
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2774
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2778
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2779
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 2780
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2781
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2782
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2783
t>
2
setting of a dual 2784



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2791
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2792
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2793
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2794
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2795
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 2796
(i) v ∈ Ns (x); 2797
(ii) vx ∈ E. 2798
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2799
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut, then 2800
(i) S is SuperHyperEulerian-Type-Cycle-Cut set; 2801
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2802
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2803
(i) Γ ≤ O; 2804
(ii) Γs ≤ On . 2805
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2806
connected. Then 2807
(i) Γ ≤ O − 1; 2808
(ii) Γs ≤ On − Σ3i=1 σi (x). 2809
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2810
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2811

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

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

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2834
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2835
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2837
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Cut; 2838
(ii) Γ = 1; 2839
(iii) Γs = Σ3i=1 σi (c); 2840
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle-Cut. 2841
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2842
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2843
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 2844
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2845
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2846
i=1

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

2
; 2853
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2854
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2856
bnc
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2857
Cut; 2858
(ii) Γ = b n2 c; 2859
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

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

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

Type-Cycle-Cut for N SHF; 2866
(ii) Γ = m for N SHF : (V, E); 2867
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2868
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2869
Cycle-Cut for N SHF : (V, E). 2870
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2871
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2872
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2873
SuperHyperEulerian-Type-Cycle-Cut for N SHF; 2874
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2875
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

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

b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEulerian-Type-Cycle-Cut 2877
for N SHF : (V, E). 2878
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2879

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

bnc for N SHF : (V, E); 2884
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Type-Cycle-Cut for 2885
N SHF : (V, E). 2886
following statements hold; 2888
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2889

SuperHyperEulerian-Type-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Type- 2890
Cycle-Cut; 2891
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2892

SuperHyperEulerian-Type-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 2893
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2897

SuperHyperEulerian-Type-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Type- 2898
Cycle-Cut; 2899
SuperHyperEulerian-Type-Cycle-Cut, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2901

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

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

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

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

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

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


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

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


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

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

SuperHyperGraph which is SuperHyperEulerian-Type-Cycle-Cut. Then following statements hold; 2944
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 2945

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

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

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


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

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

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

CHAPTER 13 2963
Extreme Applications in Cancer’s 2964
Extreme Recognition 2965
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2966
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2967
as the consequences of the model, some parameters are used. The cells are under attack of this 2968
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2969
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2970
In the following, some Extreme steps are Extreme devised on this disease. 2971
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2972
function. 2973
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2974
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2975
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2976
since there are some determinacy, indeterminacy and neutrality about the moves and the 2977
effects of the cancer on that region; this event leads us to choose another model [it’s said 2978
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2979
what’s done. 2980
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2981
and they’ve got the names, and some general Extreme models. The moves and the 2982
Extreme traces of the cancer on the complex tracks and between complicated groups of 2983
cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 2984
Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2985
The aim is to find either the Extreme SuperHyperEulerian-Type-Cycle-Cut or the Extreme 2986
SuperHyperEulerian-Type-Cycle-Cut in those Extreme Extreme SuperHyperModels. 2987
139
CHAPTER 14 2988
Case 1: The Initial Extreme Steps 2989
Toward Extreme SuperHyperBipartite 2990
as Extreme SuperHyperModel 2991
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2992
is Extreme highlighted and Extreme featured. 2993
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2994
partite is obtained. 2995
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2996
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Cut 136NSHGaa21aa
141
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3000
Case 2: The Increasing Extreme Steps 3001
Toward Extreme 3002
SuperHyperMultipartite as Extreme 3003
SuperHyperModel 3004
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3005
ite is Extreme highlighted and Extreme featured. 3006
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3007
partite is obtained. 3008
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 3009
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

143
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 3013
Wondering Open Problems But As The 3014
Directions To Forming The Motivations 3015
In what follows, some “problems” and some “questions” are proposed. 3016
The SuperHyperEulerian-Type-Cycle-Cut and the Extreme SuperHyperEulerian-Type-Cycle-Cut are defined 3017
on a real-world application, titled “Cancer’s Recognitions”. 3018
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3019
recognitions? 3020
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle-Cut 3021

and the Extreme SuperHyperEulerian-Type-Cycle-Cut? 3022
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3023
them? 3024
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3025
and the Extreme SuperHyperEulerian-Type-Cycle-Cut?
Type-Cycle-Cut 3026
Problem 16.0.5. The SuperHyperEulerian-Type-Cycle-Cut and the Extreme SuperHyperEulerian-Type-Cycle- 3027

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

CHAPTER 18 3060
Extreme SuperHyperDuality But As The 3061
Super Forms 3063
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3064

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

Va ∈ Ei , Ej ; 3068
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3069
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3070
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3071
Vi , Vj ∈ Ea ; 3072
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3073
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3074
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3075
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3076

SuperHyperDuality. 3077
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3078

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3083
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3084
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3085
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3086
Extreme SuperHyperDuality; 3087
149
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3088

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3089
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3090
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3091
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3092
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3093
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3094

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3095
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3096
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3097
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3098
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3099
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3100
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3101
coefficient; 3102
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3103

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3126
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3127
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3128

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3131

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3139
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3140
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3141
to its Extreme coefficient. 3142
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3143
mentioned Extreme Figures in every Extreme items. 3144
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3145
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3146
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3147
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3148
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3149
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3150
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3151
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- 3153
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3154
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3155
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3156
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3157
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3158
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3159


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

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 3203
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. 3207
(31.1), is the SuperHyperDuality. 3210
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 3212
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3252

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

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

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

∃!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 3277
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3278
Extreme SuperHyperDuality. 3284

CHAPTER 19 3285
Extreme SuperHyperJoin But As The 3286
Super Forms 3288
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3289

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3300
|Vj |NEUTROSOPIC CARDINALITY ; 3301
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3302
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3303
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3304

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3308
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3309
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3310
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3311
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3312
163
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3313

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3320
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3321
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3322
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3323
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3324
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3326
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3327

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3339
SuperHyperJoin; 3341
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3342

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3345
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3346
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3347
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3348
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3349

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3352

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

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

SuperHyperJoin. 3373
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 3375
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3376
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3377
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3378
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3379
V3 , is excluded in every given Extreme SuperHyperJoin. 3380

is up. The Extreme Algorithm is Extremely straightforward. 3382


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3503
Extreme SuperHyperPerfect But As The 3504
Super Forms 3506
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3507

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3519
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3520

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3524
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3525
Extreme SuperHyperPerfect; 3529
177
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3530

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

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

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

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

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

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


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

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


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

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

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

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

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



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

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

Then 3692

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3741
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3742

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3746
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3748
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3749
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3750
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3751

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3752
191

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3758
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3759
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3764
cient; 3765
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3766

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

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3777
SuperHyperTotal; 3781
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3782

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3789
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3790
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3793
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3794
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3795

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3798
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3800
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3801
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3802
cient. 3805
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3808
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3809
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3810
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3811
SuperHyperTotal. 3815
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 3817
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3818
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3819
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3820
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3821

V3 , is excluded in every given Extreme SuperHyperTotal. 3822



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3870
(31.1), is the SuperHyperTotal. 3873
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 3875
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. 3882
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 3884
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

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

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3964
SuperHyperConnected. 3965
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3966
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3969

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3971
205
Extreme SuperHyperConnected; 3975
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3976

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

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


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

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

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

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

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

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

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

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

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


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

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

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 4091
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. 4095
(31.1), is the SuperHyperConnected. 4098
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 4100
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. 4107
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 4109



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4128

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


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

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



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

CHAPTER 23 4173
Background 4174

219














Bibliography 4381
10.33140/JMTCM.01.03.09) 4385


225
10.20944/preprints202301.0282.v1). 4418
10.20944/preprints202301.0267.v1). 4421

(doi: 10.20944/preprints202301.0265.v1). 4426
prints202301.0262.v1). 4430
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4436
prints202301.0105.v1). 4439
Preprints 2023, 2023010044 4445
10.20944/preprints202301.0043.v1). 4448

(doi: 10.20944/preprints202212.0549.v1). 4457
(doi: 10.20944/preprints202212.0500.v1). 4464
10.5281/zenodo.7871026). 4473
2023, (doi: 10.5281/zenodo.7874647). 4476

10.5281/zenodo.7857856). 4479
2023, (doi: 10.5281/zenodo.7857841). 4482

10.5281/zenodo.7853867). 4491
10.5281/zenodo.7853922). 4494
(doi: 10.5281/zenodo.7851519). 4497
(doi: 10.5281/zenodo.7851550). 4500
10.5281/zenodo.7834229). 4509
10.5281/zenodo.7834261). 4512
10.5281/zenodo.7824560). 4515

(doi: 10.5281/zenodo.7824623). 4518

2023, (doi: 10.5281/zenodo.7809365). 4529
2023, (doi: 10.5281/zenodo.7809358). 4532
10.5281/zenodo.7809219). 4535
10.5281/zenodo.7809328). 4538
2023, (doi: 10.5281/zenodo.7806767). 4541
2023, (doi: 10.5281/zenodo.7806838). 4544
10.5281/zenodo.7799902). 4553
(doi: 10.5281/zenodo.7804218). 4556
(doi: 10.5281/zenodo.7796334). 4559
10.5281/zenodo.7791952). 4565

10.5281/zenodo.7791982). 4568
10.5281/zenodo.7790026). 4571
10.5281/zenodo.7790052). 4574
2023, (doi: 10.5281/zenodo.7787066). 4577
10.5281/zenodo.7781476). 4583
10.5281/zenodo.7783082). 4586
10.5281/zenodo.7777857). 4589
10.5281/zenodo.7779286). 4592
(doi: 10.5281/zenodo.7771831). 4595
2023, (doi: 10.5281/zenodo.7772468). 4598
10.13140/RG.2.2.20913.25446). 4601
odo.7764916). 4604

10.13140/RG.2.2.11770.98247). 4607
10.13140/RG.2.2.12400.12808). 4610
2023, (doi: 10.13140/RG.2.2.22545.10089). 4613
10.13140/RG.2.2.11377.76644). 4619
10.13140/RG.2.2.23750.96329). 4622
10.13140/RG.2.2.31366.24641). 4625
10.13140/RG.2.2.34721.68960). 4628
2023, (doi: 10.13140/RG.2.2.30212.81289). 4631
10.13140/RG.2.2.24288.35842). 4637
10.13140/RG.2.2.32467.25124). 4640
10.13140/RG.2.2.31025.45925). 4643

10.13140/RG.2.2.17184.25602). 4646
10.13140/RG.2.2.23423.28327). 4649
10.13140/RG.2.2.28456.44805). 4652
10.13140/RG.2.2.23525.68320). 4655
10.13140/RG.2.2.20170.24000). 4658
10.13140/RG.2.2.36475.59683). 4661
10.13140/RG.2.2.29764.71046). 4664
2023, (doi: 10.13140/RG.2.2.18780.87683). 4667
10.13140/RG.2.2.26134.01603). 4673
10.13140/RG.2.2.27392.30721). 4676
10.13140/RG.2.2.33028.40321). 4679
10.13140/RG.2.2.21389.20966). 4682

10.13140/RG.2.2.16356.04489). 4685
10.13140/RG.2.2.21756.21129). 4688
10.13140/RG.2.2.30983.68009). 4691
10.13140/RG.2.2.28552.29445). 4694
(doi: 10.13140/RG.2.2.10936.21761). 4697
10.13140/RG.2.2.35105.89447). 4700
(doi: 10.13140/RG.2.2.30072.72960). 4703
10.13140/RG.2.2.31147.52003). 4706
10.13140/RG.2.2.32825.24163). 4709
10.13140/RG.2.2.13059.58401). 4712
10.13140/RG.2.2.11172.14720). 4715
2023, (doi: 10.13140/RG.2.2.22011.80165). 4718
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4721

2023, (doi: 10.13140/RG.2.2.10493.84962). 4724
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4727
2023, (doi: 10.13140/RG.2.2.19944.14086). 4730
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4733
(doi: 10.13140/RG.2.2.33103.76968). 4736
(doi: 10.13140/RG.2.2.23037.44003). 4739
(doi: 10.13140/RG.2.2.35646.56641). 4742
10.13140/RG.2.2.18030.48967). 4745
(doi: 10.13140/RG.2.2.13973.81121). 4748
2023, (doi: 10.13140/RG.2.2.34106.47047). 4751
2023, (doi: 10.13140/RG.2.2.31956.88961). 4757
2023, (doi: 10.13140/RG.2.2.15179.67361). 4760

10.13140/RG.2.2.21510.45125). 4763
2023, (doi: 10.13140/RG.2.2.13121.84321). 4766
10.13140/RG.2.2.11758.69441). 4769
2023, (doi: 10.13140/RG.2.2.31891.35367). 4772
10.13140/RG.2.2.19360.87048). 4775
10.13140/RG.2.2.32363.21286). 4778
10.13140/RG.2.2.23266.81602). 4781
10.13140/RG.2.2.19911.37285). 4784
10.13140/RG.2.2.11050.90569). 4787
2023, (doi: 10.13140/RG.2.2.17761.79206). 4790
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4796
(doi: 10.13140/RG.2.2.30182.50241). 4799

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4841
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4844



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

10.20944/preprints202301.0282.v1). 4865
10.20944/preprints202301.0267.v1).). 4868
(doi: 10.20944/preprints202301.0265.v1). 4873
prints202301.0262.v1). 4877


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

10.13140/RG.2.2.35061.65767). 4886

10.13140/RG.2.2.18494.15680). 4890

10.13140/RG.2.2.32530.73922). 4894

10.13140/RG.2.2.15897.70243). 4898

10.13140/RG.2.2.32530.73922). 4902

prints202301.0105.v1). 4905

10.13140/RG.2.2.23172.19849). 4912


10.13140/RG.2.2.17385.36968). 4922
Preprints 2023, 2023010044 4925
10.20944/preprints202301.0043.v1). 4928
2023, (doi: 10.13140/RG.2.2.28945.92007). 4931
10.13140/RG.2.2.35774.77123). 4937

10.13140/RG.2.2.29430.88642). 4943
(doi: 10.20944/preprints202212.0549.v1). 4949
10.13140/RG.2.2.19380.94084). 4952

(doi: 10.20944/preprints202212.0500.v1). 4963
10.13140/RG.2.2.20993.12640). 4966


10.13140/RG.2.2.29173.86244). 4981
2023 (doi: 10.5281/zenodo.7874677). 4986
(doi: 10.5281/zenodo.7857906). 4988
2023 (doi: 10.5281/zenodo.7856329). 4990

10.5281/zenodo.7854561). 4992
2023 (doi: 10.5281/zenodo.7851893). 4994

(doi: 10.5281/zenodo.7835063). 4998
(doi: 10.5281/zenodo.7826705). 5000
2023 (doi: 10.5281/zenodo.7820680). 5002
10.5281/zenodo.7812750). 5004

2023 (doi: 10.5281/zenodo.7807782). 5010
2023 (doi: 10.5281/zenodo.7804449). 5012
(doi: 10.5281/zenodo.7792307). 5016
(doi: 10.5281/zenodo.7790728). 5018
2023 (doi: 10.5281/zenodo.7787712). 5020
10.5281/zenodo.7783791). 5022
10.5281/zenodo.7780123). 5024
(doi: 10.5281/zenodo.7773119). 5026

odo.7637762). 5028
10.5281/zenodo.7766174). 5030
10.5281/zenodo.7762232). 5032
(doi: 10.5281/zenodo.7758601). 5034
10.5281/zenodo.7754661). 5036
10.5281/zenodo.7750995) . 5038
(doi: 10.5281/zenodo.7749875). 5040
10.5281/zenodo.7747236). 5042
10.5281/zenodo.7742587). 5044
(doi: 10.5281/zenodo.7738635). 5046
10.5281/zenodo.7734719). 5048
10.5281/zenodo.7730484). 5050
(doi: 10.5281/zenodo.7730469). 5052
10.5281/zenodo.7722865). 5054
odo.7713563). 5056
odo.7709116). 5058
10.5281/zenodo.7706415). 5060
10.5281/zenodo.7706063). 5062

10.5281/zenodo.7701906). 5064
odo.7700205). 5066
10.5281/zenodo.7694876). 5068
10.5281/zenodo.7679410). 5070
10.5281/zenodo.7675982). 5072
10.5281/zenodo.7672388). 5074
odo.7668648). 5076
10.5281/zenodo.7662810). 5078
10.5281/zenodo.7659162). 5080
odo.7653233). 5082
odo.7653204). 5084
odo.7653142). 5086
odo.7653117). 5088
odo.7651687). 5091
odo.7651619). 5093
odo.7651439). 5095
odo.7650729). 5097

odo.7647868). 5099
odo.7647017). 5101
odo.7644894). 5103
odo.7632923). 5106
odo.7623459). 5108
10.5281/zenodo.7606416). 5110
10.5281/zenodo.7606416). 5112
odo.7606404). 5114
10.5281/zenodo.7580018). 5116
odo.7580018). 5118
odo.7580018). 5120
odo.7579929). 5122
10.5281/zenodo.7563170). 5124
odo.7563164). 5126
odo.7563160). 5128
odo.7563160). 5130
10.5281/zenodo.7563160). 5132

10.5281/zenodo.7557063). 5134
10.5281/zenodo.7557009). 5136
10.5281/zenodo.7539484). 5138
10.5281/zenodo.7523390). 5140
10.5281/zenodo.7523390). 5142
10.5281/zenodo.7523390). 5144
odo.7574952). 5146
10.5281/zenodo.7574992). 5148
odo.7523357). 5150
10.5281/zenodo.7523357). 5152
10.5281/zenodo.7504782). 5154
10.5281/zenodo.7504782). 5156
10.5281/zenodo.7504782). 5158
10.5281/zenodo.7499395). 5160
odo.7499395). 5162
10.5281/zenodo.7499395). 5164
10.5281/zenodo.7497450). 5166
10.5281/zenodo.7497450). 5168

10.5281/zenodo.7494862). 5170
odo.7494862). 5172
10.5281/zenodo.7494862). 5174
10.5281/zenodo.7493845). 5176
odo.7493845). 5178
10.5281/zenodo.7493845). 5180
odo.7539484). 5182
odo.7523390). 5184
odo.7523357). 5186
odo.7504782). 5188
odo.7499395). 5190
odo.7497450). 5192
odo.7494862). 5194
odo.7493845). 5196
odo.7480110). 5198
odo.7378758). 5200
odo.6320305). 5202
odo.6677173). 5204

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5285
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5291
research on the modeling of the regions where are under the attacks of the cancer to 5292
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5293
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5294
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5295
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5296

instances and literature reviews have taken the whole way through. In this scientific research, 5297
the literature reviews have fulfilled the lines containing the notions and the results. The 5298
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5299
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5300
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5301
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5302
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5303
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5304
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5305
to figure out the background for the SuperHyperNotions. 5306

CHAPTER 25 5307
Neutrosophic Eulerian-Type-Cycle-Cut 5308
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5309
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5310
2023, (doi: 10.13140/RG.2.2.34953.52320). 5311

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5312
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5313
(doi: 10.13140/RG.2.2.33275.80161). 5314
10.13140/RG.2.2.11050.90569). 5317
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5318
10.13140/RG.2.2.17761.79206). 5320
10.13140/RG.2.2.19911.37285). 5323
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5324
10.13140/RG.2.2.23266.81602). 5326
10.13140/RG.2.2.19360.87048). 5329
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5330
10.13140/RG.2.2.32363.21286). 5332
10.13140/RG.2.2.11758.69441). 5335
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5336
10.13140/RG.2.2.31891.35367). 5338
10.13140/RG.2.2.21510.45125). 5341
251
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5342
10.13140/RG.2.2.13121.84321). 5344

CHAPTER 26 5345
New Ideas In Recognition of Cancer And 5346
Neutrosophic SuperHyperGraph By 5347
Eulerian-Type-Cycle-Cut As Hyper 5348
Nebbish On Super Nebulous 5349
253
CHAPTER 27 5350
ABSTRACT 5351
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5352
). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Cycle-

Type-Cycle-Cut 5353
0
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5354
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type-Cycle- 5355
Cut if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria 5356
holds 5357
∀E 0 ∈ C : C is
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic 5358
e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 5359
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5360
SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic v- 5361
SuperHyperEulerian-Type-Cycle-Cut criteria holds 5362
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called Neutrosophic 5363
v-SuperHyperEulerian-Type-Cycle-Cut criteria holds 5364
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5365
255

and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut. ((Neutrosophic) SuperHyperEulerian-Type- 5368
Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5369
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5370
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHy- 5373
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5374
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5375
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5376
they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; a Neutrosophic SuperHyperEulerian- 5377
Type-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic 5378
re-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutro- 5379

sophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 5380
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5381
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5382
the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an Extreme SuperHyperEulerian-Type-Cycle-Cut 5384

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyper- 5387
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 5388
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5389
HyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5390
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5391
SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to its Extreme coef- 5392
ficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of 5393
Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutro- 5396
sophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 5397
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 5398
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 5399
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5400
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded 5401
to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of 5402

Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5405
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 5406
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme SuperHy- 5407
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian- 5408
Type-Cycle-Cut; a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic 5409
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 5412

cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5413

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5414
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; an 5415
Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic 5416
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 5419
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 5420
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 5421
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 5422
perVertices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme 5423
power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 5424

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyper- 5427
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5428
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5429
the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5430
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 5431

tices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic 5432
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting 5433
is introduced for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Cycle-Cut and 5434
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. Two different types of SuperHyperDefinitions are 5435
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5436
Recognition” are the under research to figure out the challenges make sense about ongoing and 5443
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5448
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5449
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5450
research. It’s also officially collected in the form of some questions and some problems. Assume 5451
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Cut 5452
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5453
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5454

s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5455
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5456
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a 5457
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5458

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 5463
a SuperHyperEulerian-Type-Cycle-Cut . Since there’s more ways to get type-results to make a 5464
SuperHyperEulerian-Type-Cycle-Cut more understandable. For the sake of having Neutrosophic 5465

SuperHyperEulerian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 5466
Type-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 5467
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5468
assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Cut . It’s redefined a Neutrosophic 5469
SuperHyperEulerian-Type-Cycle-Cut if the mentioned Table holds, concerning, “The Values of 5470
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 5471
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 5472
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 5473
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Type- 5477

Cycle-Cut . It’s the main. It’ll be disciplinary to have the foundation of previous definition in 5478
the kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Type-Cycle-Cut until 5479
the SuperHyperEulerian-Type-Cycle-Cut, then it’s officially called a “SuperHyperEulerian-Type-Cycle-Cut” 5480
but otherwise, it isn’t a SuperHyperEulerian-Type-Cycle-Cut . There are some instances about the 5481
clarifications for the main definition titled a “SuperHyperEulerian-Type-Cycle-Cut ”. These two 5482
examples get more scrutiny and discernment since there are characterized in the disciplinary 5483
ways of the SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Cut . For the sake of having 5484
a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, there’s a need to “redefine” the notion of a 5485
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” and a “Neutrosophic SuperHyperEulerian-Type-Cycle- 5486
Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 5487
letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5488
perGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Cycle-Cut are redefined to a 5490
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” if the intended Table holds. It’s useful to define 5491
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 5492
results to make a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut more understandable. Assume 5493
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5494

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, 5495
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5496
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”, “Neutrosophic SuperHyper- 5497
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5498
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5499
“Neutrosophic SuperHyperEulerian-Type-Cycle-Cut” where it’s the strongest [the maximum Neutro- 5500
sophic value from all the SuperHyperEulerian-Type-Cycle-Cut amid the maximum value amid all 5501
SuperHyperVertices from a SuperHyperEulerian-Type-Cycle-Cut .] SuperHyperEulerian-Type-Cycle-Cut . 5502
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5503
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5504

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5505
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Cut if it’s 5506
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5507
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5508
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 5510
by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, Su- 5532
perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5533
the longest SuperHyperEulerian-Type-Cycle-Cut or the strongest SuperHyperEulerian-Type-Cycle-Cut 5534
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Cycle-Cut, 5535

called SuperHyperEulerian-Type-Cycle-Cut, and the strongest SuperHyperEulerian-Type-Cycle-Cut, called 5536
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. Beyond that 5537
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 5538
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5539

and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 5542
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5543
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Cut, Cancer’s Neut- 5544
rosophic Recognition 5545


CHAPTER 28 5547
Applied Notions Under The Scrutiny Of 5548
The Motivation Of This Scientific 5549
Research 5550
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5551
try to bring the motivations in the narrative ways. Some cells have been faced with some 5552
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5553
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5554
as some groups and some groups or individuals have excessive labels which all are raised from 5555
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5556
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5557
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5558
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5559
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5560
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5561
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5562
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5563
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5564
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5565
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5566
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5567
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5568
is the disease but the model is going to figure out what’s going on this phenomenon. The 5569
special case of this disease is considered and as the consequences of the model, some parameters 5570
are used. The cells are under attack of this disease but the moves of the cancer in the 5571
special region are the matter of mind. The recognition of the cancer could help to find some 5572
treatments for this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 5573
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 5574
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 5575
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 5576
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 5577
formation of the design and the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Cut” 5578
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 5579
261
embedded styles to figure out the background for the SuperHyperNotions. The recognition 5580
of the cancer in the long-term function. The specific region has been assigned by the model 5581
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 5582
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 5583
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5584
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5585
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 5586
are some specific models, which are well-known and they’ve got the names, and some general 5587
models. The moves and the traces of the cancer on the complex tracks and between complicated 5588
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type- 5589
Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5590
The aim is to find either the optimal SuperHyperEulerian-Type-Cycle-Cut or the Neutrosophic 5591
SuperHyperEulerian-Type-Cycle-Cut in those Neutrosophic SuperHyperModels. Some general results 5592

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5593
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 5594
three SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Cut. There isn’t 5595
any formation of any SuperHyperEulerian-Type-Cycle-Cut but literarily, it’s the deformation of any 5596
SuperHyperEulerian-Type-Cycle-Cut. It, literarily, deforms and it doesn’t form. 5597
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 5598
the “ amount of SuperHyperEulerian-Type-Cycle-Cut” of either individual of cells or the groups of cells 5599
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5600
Type-Cycle-Cut” based on the fixed groups of cells or the fixed groups of group of cells? 5601
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5602
these messy and dense SuperHyperModels where embedded notions are illustrated? 5603
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5604
it motivates us to define different types of “ SuperHyperEulerian-Type-Cycle-Cut” and “Neutrosophic 5605
SuperHyperEulerian-Type-Cycle-Cut” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5606

The framework of this research is as follows. In the beginning, I introduce basic definitions 5612
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5613
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5614
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5615
review literature are applied to make sense about what’s going to figure out about the upcoming 5616
sections. The main definitions and their clarifications alongside some results about new notions, 5617
SuperHyperEulerian-Type-Cycle-Cut and Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, are figured out 5618

in sections “ SuperHyperEulerian-Type-Cycle-Cut” and “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. 5619
In the sense of tackling on getting results and in Eulerian-Type-Cycle-Cut to make sense about con- 5620
tinuing the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5621
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5622
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5623
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5624

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

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

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

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

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

Let X be a Eulerian-Type-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}.
265

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

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



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

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

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

where 5706

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


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

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

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

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. 5772
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5773
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5774
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5775
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5776
perPath . 5777
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 5778
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5779
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5780
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5781
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5782
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5783

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

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


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

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

Cut). 5800
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 5804

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut criteria holds 5805
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 5806

Neutrosophic re-SuperHyperEulerian-Type-Cycle-Cut criteria holds 5807
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5808
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 5809
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut if the following expression is called 5811
∀V 0 ∈ C : C is

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 5814

Cut. 5817
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Cut). 5818

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


the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 5826
(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 5829

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 5833
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHy- 5834
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5835
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if it’s either 5837

of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re-SuperHyperEulerian- 5838
Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neutrosophic rv- 5839
SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : 5840

Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power is corresponded to its 5845
(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial 5847

SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Cut, and Neut- 5849
rosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic Super- 5850

HyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5851
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 5852
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5855
Type-Cycle-Cut; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 5856

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut if it’s either of Neutrosophic e- 5857

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

(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial if 5873

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic re- 5874
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for an Extreme Su- 5876
perHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 5877

such that they form the Extreme SuperHyperEulerian-Type-Cycle-Cut; and the Extreme power 5881
is corresponded to its Extreme coefficient; 5882
(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Cut SuperHyperPolynomial 5883

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Cut and C(N SHG) for a Neutrosophic Su- 5886
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5887

SuperHyperEulerian-Type-Cycle-Cut; and the Neutrosophic power is corresponded to its 5892
Neutrosophic coefficient. 5893
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Cut). 5894

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5895
(i) an δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neutrosophic 5896
SuperHyperEulerian-Type-Cycle-Cut such that either of the following expressions hold for the 5897


136TBL3
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5898
|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 5899
(29.1), holds if S is an δ−SuperHyperDefensive; 5900
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Cut is a Neutrosophic kind of Neut- 5901

rosophic SuperHyperEulerian-Type-Cycle-Cut such that either of the following Neutrosophic 5902
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5903
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5904

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5905
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5907
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5908
there’s the usage of the position of labels to assign to the values. 5909
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5911
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5912
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5913
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5915
sophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Cut, SuperHyperStar, SuperHyperBipart- 5916
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5917
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5918
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5919
perHyperWheel if the Table (29.2) holds. 5920
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Cycle- 5921

Cut. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Type- 5922
Cycle-Cut more Neutrosophicly understandable. 5923

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

136TBL4

136TBL1

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Cut”. The 5925
5928
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Cycle-Cut. It’s redefined a Neutrosophic 5929

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

CHAPTER 30 5931
Neutrosophic SuperHyper But As Eulerian-Type-Cycle-Cut 5932
Super Forms 5934
Definition 30.0.1. (Neutrosophic event). 5935
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5936
a probability Eulerian-Type-Cycle-Cut. Any Neutrosophic k-subset of A of V is called Neutrosophic 5937
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5938
following expression is called Neutrosophic probability of A. 5939
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5940

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5941
is a probability Eulerian-Type-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5942

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

is a probability Eulerian-Type-Cycle-Cut. Any k-function Eulerian-Type-Cycle-Cut like E is called 5948

Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Cut like E is called 5949
Neutrosophic Variable. 5950
The notion of independent on Neutrosophic Variable is likewise. 5951
Definition 30.0.4. (Neutrosophic Expectation). 5952
277
is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a number is called 5954

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

is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic number is called Neutrosophic Crossing 5959
if the following expression is called Neutrosophic Crossing criteria 5960
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). 5961
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let m and n propose special Eulerian-Type- 5962
Cycle-Cut. Then with m ≥ 4n, 5963
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-Type-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).
2
Now E(X) = pn, E(Y ) = p 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: 5964
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5965
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5966
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5968
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5969
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5970

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

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

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5988
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5989
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5990
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5991
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5992
4/3 4/3
k < 4n + n < 5n . 5993
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5994
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be a nonnegative Neutrosophic 5995
Variable and t a positive real number. Then 5996
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. 5997
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5998
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let Xn be a nonnegative integer-valued 5999
variable in a probability Eulerian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 6000

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

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6006
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. A special SuperHyperGraph in Gn,p is up. Let 6007
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 6008
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 6009
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 6010
of the Neutrosophic SuperHyperGraph G. 6011
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6012
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6013
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 6014
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6015
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: 6016
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6017
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 6018
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6019
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6020
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6021
Definition 30.0.12. (Neutrosophic Variance). 6022
is a probability Eulerian-Type-Cycle-Cut. A Neutrosophic k-Variable E has a number is called 6024
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6025
criteria 6026
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let X be a Neutrosophic Variable and 6028
let t be a positive real number. Then 6029
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

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

probability Eulerian-Type-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6036
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 6038
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6039
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6040
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6042
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 6043
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6044
S = (V, E) is a probability Eulerian-Type-Cycle-Cut. As in the proof of related Theorem, the result 6046
is straightforward. 6047
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 6049
defined in previous Theorem. Then either: 6050
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6051
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6052
Definition 30.0.17. (Neutrosophic Threshold). 6055
is a probability Eulerian-Type-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs (one 6057
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 6058
P is a function f (n) such that: 6059
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6060
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6061

Definition 30.0.18. (Neutrosophic Balanced). 6062

is a probability Eulerian-Type-Cycle-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6064
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6065
SubSuperHyperGraph is called Neutrosophic Balanced. 6066
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6067

(V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Cut. Let F be a nonempty 6068
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6069
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6070
SubSuperHyperGraph. 6071
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6074
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6075
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6076

SuperHyperEulerian-Type-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 6077
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6078
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6079

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6080
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6081
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6082
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6083
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6084
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Cut

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

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

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Type- 6093

Cycle-Cut. 6094

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


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



= z8 + z4 + z3.
6099


= {E4 , E1 , E5 , E4 }.
= 3z 5 + z 3 .
= {V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }.
= 2z 4 + 2z 3 + 3z 2 + 5z.
6103






= {E1 }.
= z5.
= {Vi=15 }.
= z 7 + 2z 4 + z 3 + z 2 .
6107


= {Ei=110 ,Ei=2332 ,E
12 ,E22 }.

= 22z 2 .



= {Vi ∈ VN SHG }.
X
6111


= {Ei=110 ,E17 ,E14 ,E13 ,E15 }.
= z 5 + z 4 + 12z 2 .
= {Vi ∈ VN SHG }.
X
6115




= {E3 }.
= z5.
= {}.
= 2z 6 + 2z 5 + z 4 .
6119


= {Ei=110 ,E23 ,E12 ,E22 }.


= z 11 + 12z 2 .
= {Vi ∈ VN SHG }.
X
6123


= {E4 , E7 , E6 }.
= 3z 2 .
= {V12 , V13 , V14 }.
= 2z 5 + z 3 .
6127







= {E1 , E6 , E5 , E4 , E7 }.
= z 3 + 4z 2 .
= {Vi ∈ VN SHG }.
X
6131


= {E1 }.



= z5.
= {V1 , V2 , V3 , V7 , V8 }.
= z 8 + z 7 + 3z 5 .
6135


= {E1 , E10 , E8 , E4 , E2 , E6 }.
= 6z 2 .
= {Vi ∈ VN SHG }.
= 3z 5 + z 4 + 2z 3 .


6139


= {E1 }.
= z2.
= {V1 , V3 }.
= 2z 5 .
6143



= {E1 }.
= z2.
= {V1 , V5 }.
= 2z 5 .
6147



= {E4 }.
= z 10 .
= {Vi=817 }.
X
6151


= {E4 }.
= z 10 .


= {Vi=817 }.
X
6155


= {E4 }.
= z 10 .
= {Vi=817 }.
X
6159






= {Ei=112 }.
X
= z |Ei ∈EN SHG | .
= {|Vi ∈ VN SHG }.
X
6163


= {E6 }.
= z |E6 | .
= {VE6 }.



X
= z |VE6 |.
6167
(30.4)
6168


= {E2 }.
= z |E2 | .
= {VE2 }.
X
= z |VE2 |.


Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG1
6172
(30.6)
6173


= {E4 }.
= z |E4 | .


Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG2
= {VE4 }.
X
= z |VE4 |.
6177
(30.8)
6178
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6179
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type- 6180
Cycle-Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6181
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6182
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6183
them. 6184
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6185
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6186
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6187
Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some of 6188
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6189
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6190
quasi-R-Eulerian-Type-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6191
all of them. 6192

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-Type-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Cycle- 6193
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6194
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6195
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6196
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6197
Neutrosophic Eulerian-Type-Cycle-Cut in some cases but the maximum number of the Neutrosophic 6198
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6199
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Cycle-Cut. 6200
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Eulerian-Type-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-Type-Cycle-Cut with the least Neutrosophic cardinality, 6201
the lower sharp Neutrosophic bound for cardinality. 6202
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6203

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

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−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-Type-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-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Eulerian-Type-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-Type-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-Type-Cycle-Cut decorates the Neut-
rosophic SuperHyperVertices don’t have received any Neutrosophic connections so as this
Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with the max-
imum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight.
The lower Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic
SuperHyperVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and
the outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness
of the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the
targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,
the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Eulerian-Type-Cycle-Cut. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic
SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic set-
ting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least
one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Eulerian-Type-Cycle-Cut
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic
R-Eulerian-Type-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-Type-Cycle-Cut since either the Neutrosophic SuperHyperGraph is an obvi-
ous Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic usage
of this Neutrosophic framework and even more there’s no Neutrosophic connection inside or the
Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a Neutrosophic
contradiction with the term “Neutrosophic R-Eulerian-Type-Cycle-Cut” since the maximum Neutro-
sophic cardinality never happens for this Neutrosophic style of the Neutrosophic SuperHyperSet
and beyond that there’s no Neutrosophic connection inside as mentioned in first Neutrosophic
case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Eulerian-Type-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-Type-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-Type-Cycle-Cut.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Eulerian-Type-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-Type-Cycle-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-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
is formalized with mathematical literatures on the Neutrosophic R-Eulerian-Type-Cycle-Cut. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6208
Neutrosophic R-Eulerian-Type-Cycle-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6209
Neutrosophic R-Eulerian-Type-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-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-Type-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-Type-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Cycle- 6210
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6211
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 6212
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6213
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6214
to Neutrosophic Eulerian-Type-Cycle-Cut in some cases but the maximum number of the Neutrosophic 6215
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6216

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Cycle-Cut. 6217
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6218
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6219
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6220
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6221
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6222
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6223
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6224
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6225
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 6226
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6227
Vertices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut where the Neutrosophic 6228

completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6229
embedded R-Eulerian-Type-Cycle-Cut. The SuperHyperNotions of embedded SuperHyperSet and 6230
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6231
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6232
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6233
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6234
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neut- 6235
rosophic R-Eulerian-Type-Cycle-Cut. The interior types of the Neutrosophic SuperHyperVertices 6236
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6237
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6238
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6239
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Eulerian-Type-Cycle- 6240

Cut. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6241
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6242
SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6243
Eulerian-Type-Cycle-Cut, there’s the usage of exterior Neutrosophic SuperHyperVertices since they’ve 6244
more connections inside more than outside. Thus the title “exterior” is more relevant than 6245
the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, the 6246
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyperEle- 6247
ment has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 6248
R-Eulerian-Type-Cycle-Cut. The Neutrosophic R-Eulerian-Type-Cycle-Cut with the exclusion of the exclu- 6249
sion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6250
other terms, the Neutrosophic R-Eulerian-Type-Cycle-Cut with the inclusion of all Neutrosophic 6251
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian- 6252
Type-Cycle-Cut. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6253
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6254
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6255

any given Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor 6256

to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6257
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6258
an Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to 6259
some of them but not all of them. 6260
The main definition of the Neutrosophic R-Eulerian-Type-Cycle-Cut has two titles. a Neutro- 6261
sophic quasi-R-Eulerian-Type-Cycle-Cut and its corresponded quasi-maximum Neutrosophic R- 6262

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6263
ber, there’s a Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut with that quasi-maximum Neutrosophic 6264
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6265
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6266
lead us to take the collection of all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Cuts for all Neut- 6267
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6268
of the Neutrosophic Eulerian-Type-Cycle-Cut ends up but this essence starts up in the terms of 6269
the Neutrosophic quasi-R-Eulerian-Type-Cycle-Cut, again and more in the operations of collecting 6270
all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Cuts acted on the all possible used formations of 6271
the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic 6272
number is 6273
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Cuts. Let 6274
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Cycle-Cut be a Neutro- 6275
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Cycle-Cut. Then 6276
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Cycle-Cut is re-formalized 6277
and redefined as follows. 6278
GNeutrosophic Eulerian-Type-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 6279
definition for the Neutrosophic Eulerian-Type-Cycle-Cut. 6280
GNeutrosophic Eulerian-Type-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- 6281
poses the upcoming expressions.
Type-Cycle-Cut 6282
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6283
= max zNeutrosophic Number

And then, 6284

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


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


6287

6288

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6289
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6290
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6291
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6292
Type-Cycle-Cut” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Type-Cycle-Cut” 6293
since “Neutrosophic Quasi-Eulerian-Type-Cycle-Cut” happens “Neutrosophic Eulerian-Type-Cycle-Cut” in a 6294
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Super- 6295
HyperNeighborhood” may not happens “Neutrosophic Eulerian-Type-Cycle-Cut” in a Neutrosophic 6296
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6297
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6298
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Type-Cycle-Cut”, 6299
and “Neutrosophic Eulerian-Type-Cycle-Cut” are up. 6300
Thus, let 6301

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6302
GNeutrosophic Eulerian-Type-Cycle-Cut be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6303
borhood and a Neutrosophic Eulerian-Type-Cycle-Cut and the new terms are up. 6304
GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number

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

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6306
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6307
And with go back to initial structure, 6308
GNeutrosophic Eulerian-Type-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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


6310

6311

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyper-

Graph 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-Type-Cycle-Cut is related to the Neutrosophic SuperHyperSet of the

Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Cut is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-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-Type-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-Type-

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

, not:
Type-Cycle-Cut

Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6312
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6313
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6314
type-SuperHyperSet called the 6315
“Neutrosophic R-Eulerian-Type-Cycle-Cut” 6316
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6317
Neutrosophic R-Eulerian-Type-Cycle-Cut, 6318
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHy-

perModeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel
and a Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic
stable embedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic R-Eulerian-Type-Cycle-Cut amid those obvious simple Neutro-
sophic type-SuperHyperSets of the Neutrosophic Eulerian-Type-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-Type-Cycle-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Cycle-Cut is the cardinality of
6319
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6320
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Cycle- 6321
Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6322
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6323

with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6324
amount of them. 6325
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6326
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6327
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6328
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6329

exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6330

Consider there’s a Neutrosophic R-Eulerian-Type-Cycle-Cut with the least cardinality, the lower 6331
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6332
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6333
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6334
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6335
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Cycle-Cut. Since it doesn’t 6336

have 6337
6338
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6339
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6340
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6341
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6342

SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6343
Type-Cycle-Cut. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6344
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6345
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6346
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6347
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6348

in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6349
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6350
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6351
obvious Neutrosophic R-Eulerian-Type-Cycle-Cut, VESHE is up. The obvious simple Neutrosophic 6352
type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Cut, VESHE , is a Neutrosophic Supe- 6353
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6354
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6355
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6356
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6357
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6358
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6359
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6360
R-Eulerian-Type-Cycle-Cut only contains all interior Neutrosophic SuperHyperVertices and all exterior 6361
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6362
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6363
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6364
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6365
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6366
The SuperHyperNotion, namely, Eulerian-Type-Cycle-Cut, is up. There’s neither empty SuperHy- 6367
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6368
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6369
the Neutrosophic Eulerian-Type-Cycle-Cut. The Neutrosophic SuperHyperSet of Neutrosophic 6370
SuperHyperEdges[SuperHyperVertices], 6371

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−CutSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type-Cycle-Cut. The 6372
Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6373

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6374
ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6375
6376
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6378
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6379
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6380
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6381
Neutrosophic Eulerian-Type-Cycle-Cut is up. The obvious simple Neutrosophic type-SuperHyperSet 6382

called the Neutrosophic Eulerian-Type-Cycle-Cut is a Neutrosophic SuperHyperSet includes only two 6383
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6384

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- 6386
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6387
Eulerian-Type-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6388

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian- 6390

.
Type-Cycle-Cut Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6391
perEdges[SuperHyperVertices], 6392

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

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6394
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6395
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Cut 6396
and it’s an Neutrosophic Eulerian-Type-Cycle-Cut. Since it’s 6397
6398
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6400
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6401
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6402
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6403

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

Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Cut , 6404

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-Type- 6405
, not:
Cycle-Cut 6406

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

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- 6408
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6409
Neutrosophic type-SuperHyperSet called the 6410
“Neutrosophic Eulerian-Type-Cycle-Cut ” 6411
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6412
Neutrosophic Eulerian-Type-Cycle-Cut , 6413

is only and only 6414

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

CHAPTER 31 6416
The Neutrosophic Departures on The 6417
Theoretical Results Toward Theoretical 6418
Motivations 6419
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6420
Neutrosophic SuperHyperClasses. 6421
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6422

=z j ∈EN SHG

}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
= z .
Proof. Let 6423
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6424
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
321
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

6429
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6430
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6431
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Cycle-Cut. 6432
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6433

|E |
= {Ei }i=1N SHG .


X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 6434
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6435
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). 6436

6440
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6441
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6442
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6443
6444

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6445

=z j ∈EN SHG

}.
j ∈EN SHG

X |{V{Ei }|E |=max }|
= z .
Proof. Let 6446
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6447
P :
E1 , V1EXT ERN AL ,

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.9) 136NSHG20a
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6448

6452
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6453
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6454
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6455
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6456
the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6457

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6458
Then 6459

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

X
= z |Vi | .
N SHG N SHG
Proof. Let 6460
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6461
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). 6462

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHyperBi- 6470

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

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

Then 6481

= {Ei , Ej }Ei ∩Ej 6=∅ .
X
=
{Ei ,Ej }Ei ∩Ej 6=∅ z |Ei | .

X
= z |Vi | .
N SHG N SHG
Proof. Let 6482
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6483
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHyper- 6484

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

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

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6492
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6493
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6497
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6498
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6499
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6500
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6501

6502
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6503

Then, 6504

|E |
= {Ei }i=1N SHG .
X
= z |Ei | .
Ei ∈EN SHG
|V
N SHG |
= {Vi }i=1 .
X
= z |Vi | .
Vi ∈VN SHG
Proof. Let 6505
P :
CEN T ER, E2∗
6506
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Cycle-Cut taken from a connected Neutrosophic SuperHyper- 6507
Wheel ESHW : (V, E). There’s a new way to redefine as 6508

Then there’s at least one SuperHyperEulerian-Type-Cycle-Cut. Thus the notion of quasi isn’t up and 6511
the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle-Cut could be applied. The unique 6512

embedded SuperHyperEulerian-Type-Cycle-Cut proposes some longest SuperHyperEulerian-Type-Cycle-Cut 6513
excerpt from some representatives. The latter is straightforward. 6514
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6515
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6516
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6517
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6518
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6519

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in the Neutrosophic Example (42.0.15) 136NSHG23a

CHAPTER 32 6520
The Surveys of Mathematical Sets On 6521
The Results But As The Initial Motivation 6522
For the SuperHyperEulerian-Type-Cycle-Cut, Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, and the 6523

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, some general results are introduced. 6524
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is “redefined” 6525
on the positions of the alphabets. 6526
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. Then 6527
N eutrosophic SuperHyperEulerian − T ype − Cycle − Cut =

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

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6544
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is its 6545
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6547

SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut 6548
isn’t well-defined. 6549
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6550

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian- 6551

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6554
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut isn’t well-defined if and only if its SuperHyperEulerian- 6555
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6557

SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Cut 6558
is well-defined. 6559
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6560
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian- 6561

Type-Cycle-Cut is well-defined. 6562
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6564

Neutrosophic SuperHyperEulerian-Type-Cycle-Cut is well-defined if and only if its SuperHyperEulerian- 6565
Type-Cycle-Cut is well-defined. 6566
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6567
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6568
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6569
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6570
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6571
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6572
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 6573
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6574
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6577

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

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

Graph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then V is a maximal 6590
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6594
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6595
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6596
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6598
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6599
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6603
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6604
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6605
Graph which is a SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath. Then the number of 6608

(i) : the SuperHyperEulerian-Type-Cycle-Cut; 6609
(ii) : the SuperHyperEulerian-Type-Cycle-Cut; 6610
(iii) : the connected SuperHyperEulerian-Type-Cycle-Cut; 6611
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 6612
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut; 6613
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Cut. 6614
coincide. 6616

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

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6639
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6640
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6641
SuperHyperPart is a 6642
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6646
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6647
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 6648
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6650

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

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

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


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

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6690

SuperHyperEulerian-Type-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6692
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6693
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6697
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut; 6698
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Cut. 6699


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


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

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

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

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

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

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

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

b n c+1 ; 6772
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6773
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6775
bnc
2
Cut; 6777
(ii) Γ = b n2 c; 6778

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

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

Type-Cycle-Cut for N SHF; 6785
(ii) Γ = m for N SHF : (V, E); 6786
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6787
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6788
Cycle-Cut for N SHF : (V, E). 6789
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6790
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6791

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6792
SuperHyperEulerian-Type-Cycle-Cut for N SHF; 6793
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6794

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6799
bnc
2
Cut for N SHF : (V, E); 6801
(ii) Γ = b n2 c for N SHF : (V, E); 6802

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

SuperHyperEulerian-Type-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Type- 6809
Cycle-Cut; 6810

SuperHyperEulerian-Type-Cycle-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 6812
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6816
SuperHyperEulerian-Type-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Type- 6817

Cycle-Cut; 6818

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

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6864
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6866

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

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


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

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

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


CHAPTER 33 6882
Neutrosophic Applications in Cancer’s 6883
Neutrosophic Recognition 6884
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6885
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6886
disease is considered and as the consequences of the model, some parameters are used. The cells 6887
are under attack of this disease but the moves of the cancer in the special region are the matter 6888
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6889
treatments for this Neutrosophic disease. 6890
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6891
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6892
term Neutrosophic function. 6893
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6894
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6895
move from the cancer is identified by this research. Sometimes the move of the cancer 6896
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6897
about the moves and the effects of the cancer on that region; this event leads us to 6898
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6899
perception on what’s happened and what’s done. 6900
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6901
known and they’ve got the names, and some general Neutrosophic models. The moves 6902
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6903
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 6904
Type-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 6905
perWheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 6906

or the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut in those Neutrosophic Neutrosophic 6907
SuperHyperModels. 6908
345
CHAPTER 34 6909
Case 1: The Initial Neutrosophic Steps 6910
Toward Neutrosophic 6911
SuperHyperBipartite as Neutrosophic 6912
SuperHyperModel 6913
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6914
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6915
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

347
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6916
perBipartite is obtained. 6917
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6918
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6919
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6920
(34.1), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6921

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

349
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6933
Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. 6934

CHAPTER 36 6935
Wondering Open Problems But As The 6936
Directions To Forming The Motivations 6937
In what follows, some “problems” and some “questions” are proposed. 6938
The SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut are 6939
defined on a real-world application, titled “Cancer’s Recognitions”. 6940
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6941
recognitions? 6942
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle-Cut 6943

and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut? 6944
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6945
them? 6946
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6947
and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut?
Type-Cycle-Cut 6948
Problem 36.0.5. The SuperHyperEulerian-Type-Cycle-Cut and the Neutrosophic SuperHyperEulerian- 6949

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Type-Cycle-Cut 6950
SuperHyperEulerian-Type-Cycle-Cut, are there else? 6951
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6952
Numbers types-results? 6953
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6954
the multiple types of SuperHyperNotions? 6955
351
CHAPTER 37 6956
Conclusion and Closing Remarks 6957
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6958
research are illustrated. Some benefits and some advantages of this research are highlighted. 6959
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6960
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Cycle-Cut. 6961
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6962
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6963
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Type-Cycle-Cut, 6964
finds the convenient background to implement some results based on that. Some SuperHy- 6965
perClasses and some Neutrosophic SuperHyperClasses are the cases of this research on the 6966
modeling of the regions where are under the attacks of the cancer to recognize this disease as 6967
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 6968
perNotion, SuperHyperEulerian-Type-Cycle-Cut, the new SuperHyperClasses and SuperHyperClasses, 6969
are introduced. Some general results are gathered in the section on the SuperHyperEulerian-Type- 6970
Cycle-Cut and the Neutrosophic SuperHyperEulerian-Type-Cycle-Cut. The clarifications, instances and 6971
literature reviews have taken the whole way through. In this research, the literature reviews 6972
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 6973
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 6974
both bases are the background of this research. Sometimes the cancer has been happened on the 6975
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 6976
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 6977
longest and strongest styles with the formation of the design and the architecture are formally 6978
called “ SuperHyperEulerian-Type-Cycle-Cut” in the themes of jargons and buzzwords. The prefix 6979
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6980
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6981
pointed out and spoken out. 6982
353
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Cycle-Cut
3. Neutrosophic SuperHyperEulerian-Type-Cycle-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6983
Neutrosophic SuperHyperDuality But As 6984
Super Forms 6986
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6987

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6991

Va ∈ Ei , Ej ; 6992
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6993

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6994
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6995

Vi , Vj ∈ Ea ; 6996
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6997

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6998
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6999

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7000
sophic rv-SuperHyperDuality. 7001
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7002

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7005

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7007
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7008
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 7009
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 7010
form the Extreme SuperHyperDuality; 7011
355
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7012

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7014
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 7015
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7016
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 7017
such that they form the Neutrosophic SuperHyperDuality; 7018
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7019
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7020

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7021
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7022
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7023
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7024
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 7026
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7028

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7030
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7031
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7032
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7033
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7036
coefficient; 7037
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7038

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7040
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7041
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 7042
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 7043
form the Extreme SuperHyperDuality; 7044
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7045

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7046
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7047
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7048
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7049
such that they form the Neutrosophic SuperHyperDuality; 7051
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7052

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7053
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7054

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7056
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7059
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7061

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7063

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7066
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7069
coefficient. 7070
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7071
the mentioned Neutrosophic Figures in every Neutrosophic items. 7072

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7074
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7075
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7076
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7077
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7078
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7079
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7080
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 7084
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7085
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7086
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7087
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7088

every given Neutrosophic SuperHyperDuality. 7089




C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .

3 × 3z 2 .



C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.







C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 7133
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. 7140
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 7142
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7149
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 7151


the Neutrosophic SuperHyperDuality. 7160
Then 7162
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 7163
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7169
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7172

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7173
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7182

(V, E). Then 7183

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 7184
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7185


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7189
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7190
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7201
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7202
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7203
Then, 7204
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 7205
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 7206


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7211
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7212
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7218

CHAPTER 39 7219
Neutrosophic SuperHyperJoin But As 7220
Super Forms 7222
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7223

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7227
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7229

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7230
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7232

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7234

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7237

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7238
rv-SuperHyperJoin. 7239
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7240

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

369

Extreme SuperHyperJoin; 7249
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7250

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7252
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7253
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7254
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7255

form the Neutrosophic SuperHyperJoin; 7256
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7257

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7258
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7259
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7264
coefficient; 7265
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7266

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7267
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7268
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7269
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7270

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7273
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7274
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7275

Extreme SuperHyperJoin; 7281
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7282

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7284
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7285
form the Neutrosophic SuperHyperJoin; 7288

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7289

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7291

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7296
to its Extreme coefficient; 7297
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7298

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7300
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7301

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7306
coefficient. 7307
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7311

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7312

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7377

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7386
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 7388


the Neutrosophic SuperHyperJoin. 7397
Then 7399
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 7400
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 7406
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7408

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7419

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7421


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

Then, 7439

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

.
Proof. Let 7440
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7441


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7445
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7446
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7447
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7452

CHAPTER 40 7453
Neutrosophic SuperHyperPerfect But As 7454
Super Forms 7456
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7457

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

Va ∈ Ei , Ej ; 7462
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7463

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7469

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7470
rv-SuperHyperPerfect. 7471
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7472

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7477
383
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7482

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7484
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7485
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7486
form the Neutrosophic SuperHyperPerfect; 7488
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7489

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7490
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7491
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7494
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7498

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7500
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7506
coefficient; 7507
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7508

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7516
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7517
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7518
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7519
such that they form the Neutrosophic SuperHyperPerfect; 7521
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7522

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7524

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7527
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7531

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7533

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7539
coefficient. 7540

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7544

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7610
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 7612
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7630
Then 7632
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 7633
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 7637
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7638
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7639
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7642

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7653

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7676


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7679
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7680
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7681
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7682
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7688

CHAPTER 41 7689
Neutrosophic SuperHyperTotal But As 7690
Super Forms 7692
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7693

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7697

Va ∈ Ei , Ej ; 7698
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7699

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7700
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7701

Vi , Vj ∈ Ea ; 7702
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7703

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7705

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7706
rv-SuperHyperTotal. 7707
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7708

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7713
Extreme SuperHyperTotal; 7717
397
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7718

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7720
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7721
form the Neutrosophic SuperHyperTotal; 7724
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7725
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7726

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7727
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7732
coefficient; 7733
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7734
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7735

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7736
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7737
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7742
cient; 7743
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7744

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7746
Extreme SuperHyperTotal; 7750
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7751

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7753
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7754
form the Neutrosophic SuperHyperTotal; 7757
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7758

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7759
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7760


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7765
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7767

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7768
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7769
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7770

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7775
cient. 7776

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7780
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. 7795




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7846
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 7848
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. 7855
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 7857



the Neutrosophic SuperHyperTotal. 7866
Then 7868
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 7869
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7875
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7877
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7888

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7895
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. 7906
Then, 7908
∗
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 7909
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7910


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7914
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7915

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7916
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7922

CHAPTER 42 7923
Neutrosophic SuperHyperConnected But 7924
As The Extensions Excerpt From Dense 7925
And Super Forms 7926
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7927

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7931
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7932
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7933

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7934
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7935
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7936

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7937
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7938

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7939
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7940
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7941
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7942
rosophic rv-SuperHyperConnected. 7943
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7944

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7947
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7948
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7949
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7950
411
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7951

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7952
that they form the Extreme SuperHyperConnected; 7953
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7954

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7955
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7956
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7957
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7958
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7959

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7960
nected; 7961
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7962

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7963
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7964
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7965
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7966
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7967

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7969
Extreme power is corresponded to its Extreme coefficient; 7970
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7971

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7972
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7973
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7974
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7975
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7976

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7979
its Neutrosophic coefficient; 7980
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7981

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7984
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7985

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7986
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7987
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7988

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7991
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7992
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7993

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7994
nected; 7995
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7996

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7999
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 8000
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 8001
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 8002

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8003
and the Extreme power is corresponded to its Extreme coefficient; 8004
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8005

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8008
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8009

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8010
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 8013
its Neutrosophic coefficient. 8014
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8017
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8018
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8020
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8021
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8022
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8023
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8024
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. 8032


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 8076
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. 8083
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 8085
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. 8092
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 8094



the Neutrosophic SuperHyperConnected. 8103
Then 8105
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 8106
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 8111
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8112
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8115

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8126
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 8127
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8128


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8132
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8133
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8134
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. 8145
Then, 8147
∗
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 8148
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8149


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8152
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8153
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8154
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8155
some representatives. The latter is straightforward. 8156
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8161

CHAPTER 43 8162
Background 8163

425














Bibliography 8370
10.33140/JMTCM.01.03.09) 8374


431
10.20944/preprints202301.0282.v1). 8407
10.20944/preprints202301.0267.v1). 8410

(doi: 10.20944/preprints202301.0265.v1). 8415
prints202301.0262.v1). 8419
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8425
prints202301.0105.v1). 8428
Preprints 2023, 2023010044 8434
10.20944/preprints202301.0043.v1). 8437

(doi: 10.20944/preprints202212.0549.v1). 8446
(doi: 10.20944/preprints202212.0500.v1). 8453
10.5281/zenodo.7871026). 8462
2023, (doi: 10.5281/zenodo.7874647). 8465

10.5281/zenodo.7857856). 8468
2023, (doi: 10.5281/zenodo.7857841). 8471

10.5281/zenodo.7853867). 8480
10.5281/zenodo.7853922). 8483
(doi: 10.5281/zenodo.7851519). 8486
(doi: 10.5281/zenodo.7851550). 8489
10.5281/zenodo.7834229). 8498
10.5281/zenodo.7834261). 8501
10.5281/zenodo.7824560). 8504

(doi: 10.5281/zenodo.7824623). 8507

2023, (doi: 10.5281/zenodo.7809365). 8518
2023, (doi: 10.5281/zenodo.7809358). 8521
10.5281/zenodo.7809219). 8524
10.5281/zenodo.7809328). 8527
2023, (doi: 10.5281/zenodo.7806767). 8530
2023, (doi: 10.5281/zenodo.7806838). 8533
10.5281/zenodo.7799902). 8542
(doi: 10.5281/zenodo.7804218). 8545
(doi: 10.5281/zenodo.7796334). 8548
10.5281/zenodo.7791952). 8554

10.5281/zenodo.7791982). 8557
10.5281/zenodo.7790026). 8560
10.5281/zenodo.7790052). 8563
2023, (doi: 10.5281/zenodo.7787066). 8566
10.5281/zenodo.7781476). 8572
10.5281/zenodo.7783082). 8575
10.5281/zenodo.7777857). 8578
10.5281/zenodo.7779286). 8581
(doi: 10.5281/zenodo.7771831). 8584
2023, (doi: 10.5281/zenodo.7772468). 8587
10.13140/RG.2.2.20913.25446). 8590
odo.7764916). 8593

10.13140/RG.2.2.11770.98247). 8596
10.13140/RG.2.2.12400.12808). 8599
2023, (doi: 10.13140/RG.2.2.22545.10089). 8602
10.13140/RG.2.2.11377.76644). 8608
10.13140/RG.2.2.23750.96329). 8611
10.13140/RG.2.2.31366.24641). 8614
10.13140/RG.2.2.34721.68960). 8617
2023, (doi: 10.13140/RG.2.2.30212.81289). 8620
10.13140/RG.2.2.24288.35842). 8626
10.13140/RG.2.2.32467.25124). 8629
10.13140/RG.2.2.31025.45925). 8632

10.13140/RG.2.2.17184.25602). 8635
10.13140/RG.2.2.23423.28327). 8638
10.13140/RG.2.2.28456.44805). 8641
10.13140/RG.2.2.23525.68320). 8644
10.13140/RG.2.2.20170.24000). 8647
10.13140/RG.2.2.36475.59683). 8650
10.13140/RG.2.2.29764.71046). 8653
2023, (doi: 10.13140/RG.2.2.18780.87683). 8656
10.13140/RG.2.2.26134.01603). 8662
10.13140/RG.2.2.27392.30721). 8665
10.13140/RG.2.2.33028.40321). 8668
10.13140/RG.2.2.21389.20966). 8671

10.13140/RG.2.2.16356.04489). 8674
10.13140/RG.2.2.21756.21129). 8677
10.13140/RG.2.2.30983.68009). 8680
10.13140/RG.2.2.28552.29445). 8683
(doi: 10.13140/RG.2.2.10936.21761). 8686
10.13140/RG.2.2.35105.89447). 8689
(doi: 10.13140/RG.2.2.30072.72960). 8692
10.13140/RG.2.2.31147.52003). 8695
10.13140/RG.2.2.32825.24163). 8698
10.13140/RG.2.2.13059.58401). 8701
10.13140/RG.2.2.11172.14720). 8704
2023, (doi: 10.13140/RG.2.2.22011.80165). 8707
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8710

2023, (doi: 10.13140/RG.2.2.10493.84962). 8713
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8716
2023, (doi: 10.13140/RG.2.2.19944.14086). 8719
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8722
(doi: 10.13140/RG.2.2.33103.76968). 8725
(doi: 10.13140/RG.2.2.23037.44003). 8728
(doi: 10.13140/RG.2.2.35646.56641). 8731
10.13140/RG.2.2.18030.48967). 8734
(doi: 10.13140/RG.2.2.13973.81121). 8737
2023, (doi: 10.13140/RG.2.2.34106.47047). 8740
2023, (doi: 10.13140/RG.2.2.31956.88961). 8746
2023, (doi: 10.13140/RG.2.2.15179.67361). 8749

10.13140/RG.2.2.21510.45125). 8752
2023, (doi: 10.13140/RG.2.2.13121.84321). 8755
10.13140/RG.2.2.11758.69441). 8758
2023, (doi: 10.13140/RG.2.2.31891.35367). 8761
10.13140/RG.2.2.19360.87048). 8764
10.13140/RG.2.2.32363.21286). 8767
10.13140/RG.2.2.23266.81602). 8770
10.13140/RG.2.2.19911.37285). 8773
10.13140/RG.2.2.11050.90569). 8776
2023, (doi: 10.13140/RG.2.2.17761.79206). 8779
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8785
(doi: 10.13140/RG.2.2.30182.50241). 8788

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8830
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8833



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

10.20944/preprints202301.0282.v1). 8854
10.20944/preprints202301.0267.v1).). 8857
(doi: 10.20944/preprints202301.0265.v1). 8862
prints202301.0262.v1). 8866


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

10.13140/RG.2.2.35061.65767). 8875

10.13140/RG.2.2.18494.15680). 8879

10.13140/RG.2.2.32530.73922). 8883

10.13140/RG.2.2.15897.70243). 8887

10.13140/RG.2.2.32530.73922). 8891

prints202301.0105.v1). 8894

10.13140/RG.2.2.23172.19849). 8901


10.13140/RG.2.2.17385.36968). 8911
Preprints 2023, 2023010044 8914
10.20944/preprints202301.0043.v1). 8917
2023, (doi: 10.13140/RG.2.2.28945.92007). 8920
10.13140/RG.2.2.35774.77123). 8926

10.13140/RG.2.2.29430.88642). 8932
(doi: 10.20944/preprints202212.0549.v1). 8938
10.13140/RG.2.2.19380.94084). 8941

(doi: 10.20944/preprints202212.0500.v1). 8952
10.13140/RG.2.2.20993.12640). 8955


10.13140/RG.2.2.29173.86244). 8970
2023 (doi: 10.5281/zenodo.7874677). 8975
(doi: 10.5281/zenodo.7857906). 8977
2023 (doi: 10.5281/zenodo.7856329). 8979

10.5281/zenodo.7854561). 8981
2023 (doi: 10.5281/zenodo.7851893). 8983

(doi: 10.5281/zenodo.7835063). 8987
(doi: 10.5281/zenodo.7826705). 8989
2023 (doi: 10.5281/zenodo.7820680). 8991
10.5281/zenodo.7812750). 8993

2023 (doi: 10.5281/zenodo.7807782). 8999
2023 (doi: 10.5281/zenodo.7804449). 9001
(doi: 10.5281/zenodo.7792307). 9005
(doi: 10.5281/zenodo.7790728). 9007
2023 (doi: 10.5281/zenodo.7787712). 9009
10.5281/zenodo.7783791). 9011
10.5281/zenodo.7780123). 9013
(doi: 10.5281/zenodo.7773119). 9015

odo.7637762). 9017
10.5281/zenodo.7766174). 9019
10.5281/zenodo.7762232). 9021
(doi: 10.5281/zenodo.7758601). 9023
10.5281/zenodo.7754661). 9025
10.5281/zenodo.7750995) . 9027
(doi: 10.5281/zenodo.7749875). 9029
10.5281/zenodo.7747236). 9031
10.5281/zenodo.7742587). 9033
(doi: 10.5281/zenodo.7738635). 9035
10.5281/zenodo.7734719). 9037
10.5281/zenodo.7730484). 9039
(doi: 10.5281/zenodo.7730469). 9041
10.5281/zenodo.7722865). 9043
odo.7713563). 9045
odo.7709116). 9047
10.5281/zenodo.7706415). 9049
10.5281/zenodo.7706063). 9051

10.5281/zenodo.7701906). 9053
odo.7700205). 9055
10.5281/zenodo.7694876). 9057
10.5281/zenodo.7679410). 9059
10.5281/zenodo.7675982). 9061
10.5281/zenodo.7672388). 9063
odo.7668648). 9065
10.5281/zenodo.7662810). 9067
10.5281/zenodo.7659162). 9069
odo.7653233). 9071
odo.7653204). 9073
odo.7653142). 9075
odo.7653117). 9077
odo.7651687). 9080
odo.7651619). 9082
odo.7651439). 9084
odo.7650729). 9086

odo.7647868). 9088
odo.7647017). 9090
odo.7644894). 9092
odo.7632923). 9095
odo.7623459). 9097
10.5281/zenodo.7606416). 9099
10.5281/zenodo.7606416). 9101
odo.7606404). 9103
10.5281/zenodo.7580018). 9105
odo.7580018). 9107
odo.7580018). 9109
odo.7579929). 9111
10.5281/zenodo.7563170). 9113
odo.7563164). 9115
odo.7563160). 9117
odo.7563160). 9119
10.5281/zenodo.7563160). 9121

10.5281/zenodo.7557063). 9123
10.5281/zenodo.7557009). 9125
10.5281/zenodo.7539484). 9127
10.5281/zenodo.7523390). 9129
10.5281/zenodo.7523390). 9131
10.5281/zenodo.7523390). 9133
odo.7574952). 9135
10.5281/zenodo.7574992). 9137
odo.7523357). 9139
10.5281/zenodo.7523357). 9141
10.5281/zenodo.7504782). 9143
10.5281/zenodo.7504782). 9145
10.5281/zenodo.7504782). 9147
10.5281/zenodo.7499395). 9149
odo.7499395). 9151
10.5281/zenodo.7499395). 9153
10.5281/zenodo.7497450). 9155
10.5281/zenodo.7497450). 9157

10.5281/zenodo.7494862). 9159
odo.7494862). 9161
10.5281/zenodo.7494862). 9163
10.5281/zenodo.7493845). 9165
odo.7493845). 9167
10.5281/zenodo.7493845). 9169
odo.7539484). 9171
odo.7523390). 9173
odo.7523357). 9175
odo.7504782). 9177
odo.7499395). 9179
odo.7497450). 9181
odo.7494862). 9183
odo.7493845). 9185
odo.7480110). 9187
odo.7378758). 9189
odo.6320305). 9191
odo.6677173). 9193

CHAPTER 44 9181
Books’ Contributions 9182
“Books’ Contributions”: | Featured Threads 9183

The following references are cited by chapters. 9184
9185
[Ref258] 9186
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle- 9187
10.5281/zenodo.7874647). 9189
9190
[Ref259] 9191
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9192
10.5281/zenodo.7871026). 9194
9195
The links to the contributions of this scientific research book are listed below. 9196
[HG258] 9197
10.5281/zenodo.7874647). 9200
9201
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-Cut In 9202
Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9203

9204
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9205
https://www.researchgate.net/publication/370340917 9206
9207
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9208
https://www.scribd.com/document/641366599 9209
9210
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9211
https://zenodo.org/record/7874647 9212
9213
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9214
https://www.academia.edu/100892954 9215
453
HG2581.png
Figure 44.1: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-
Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7874647).
9216
[ADDRESSED CITATION] 9217
10.5281/zenodo.7874647). 9220
[ASSIGNED NUMBER] #258 Article 9221
[DATE] April 2023 9222
[DOI] 10.5281/zenodo.7874647 9223
[LICENSE] CC BY-NC-ND 4.0 9224
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9225

[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9226
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9227
9228
[HG259] 9229

2023, (doi: 10.5281/zenodo.7874647).
2023, (doi: 10.5281/zenodo.7874647).

10.5281/zenodo.7871026). 9232
9233
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9234
Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous” 9235
9236
https://www.researchgate.net/publication/370305837 9238
9239
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9240
https://www.scribd.com/document/641184010 9241
9242
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9243

9245
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9246
https://www.academia.edu/100858116 9247
9248

10.5281/zenodo.7871026). 9252
[ASSIGNED NUMBER] #259 Article 9253
[DATE] April 2023 9254
[DOI] 10.5281/zenodo.7871026 9255

[LICENSE] CC BY-NC-ND 4.0 9256
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9257
[AVAILABLE AT TWITTER’S IDS] 9258
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9259
googlebooks GooglePlay 9260
9261
[ASSIGNED NUMBER] | Book #168 9262

Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 9264
(doi: 10.5281/zenodo.7874677). 9265
[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs 9266
#Latest_Updates 9267
#The_Links 9268
9272
9274
#The_Links 9275
9276
[ASSIGNED NUMBER] | Book #168 9277

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo
2023, (doi: 10.5281/zenodo.7871026).
2023, (doi: 10.5281/zenodo.7871026).

2023, (doi: 10.5281/zenodo.7871026).
9278
[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs 9279
9280
9284
– 9285
9286
[PUBLISHER] 9287
(Paperback): https://www.amazon.com/dp/- 9288
(Hardcover): https://www.amazon.com/dp/- 9289
(Kindle Edition): https://www.amazon.com/dp/- 9290

9291
– 9292
9293
[ISBN] 9294
(Paperback): - 9295
(Hardcover): - 9296
(Kindle Edition): CC BY-NC-ND 4.0 9297
(EBook): CC BY-NC-ND 4.0 9298
9299
– 9300
9301
[PRINT LENGTH] 9302

(Paperback): - pages 9303

(Hardcover): - pages 9304
(Kindle Edition): - pages 9305
(E-Book): - pages 9306
9307
– 9308
9309
9311
#The_Links 9312
9313

https://www.researchgate.net/publication/- 9315
9316
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9317
https://drhenrygarrett.wordpress.com/2023/07/22/ 9318
Eulerian-Type-Cycle-Cut-In-SuperHyperGraphs/ 9319
9320
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9321
https://www.scribd.com/document/- 9322
9323
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9324
https://www.academia.edu/- 9325
9326
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9327
9329
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9330
https://books.google.com/books/about?id=- 9331
9332
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9333
https://play.google.com/store/books/details?id=- 9334

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9335

9336
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9337
9338
https://drhenrygarrett.wordpress.com/2023/07/22/ 9339
Eulerian-Type-Cycle-Cut-In-SuperHyperGraphs/ 9340
9341
– 9342
9343
[POSTED BY] Dr. Henry Garrett 9344
9345
[DATE] April 028, 2023 9346

9347
[POSTED IN] 168 | Eulerian-Type-Cycle-Cut In SuperHyperGraphs 9348
9349
[TAGS] 9350
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9351
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9352
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9353
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9354
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyper- 9355
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9356
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9357
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9358
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Supe- 9359

rHyperGraph Theory, SuperHyperGraphs, Eulerian-Type-Cycle-Cut In SuperHyperGraphs, 9360
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9361
In this scientific research book, there are some scientific research chapters on “Extreme 9362
Eulerian-Type-Cycle-Cut In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Cycle-Cut 9363
In SuperHyperGraphs” about some scientific research on Eulerian-Type-Cycle-Cut In SuperHy- 9364
perGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Type-Cycle-Cut 9365

In SuperHyperGraphs and Neutrosophic Eulerian-Type-Cycle-Cut In SuperHyperGraphs. With 9366
scientific research on the basic scientific research properties, the scientific research book starts 9367
to make Extreme Eulerian-Type-Cycle-Cut In SuperHyperGraphs theory and Neutrosophic 9368
Eulerian-Type-Cycle-Cut In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9369
understandable. 9370

CHAPTER 45 9371
“SuperHyperGraph-Based Books”: | 9372
Featured Tweets 9373
“SuperHyperGraph-Based Books”: | Featured Tweets 9374
461
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 9375
CV 9376
489
9377
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
9378
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)
9379
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

9380

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

9381
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

9382
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

9383
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9384
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9385
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).
9386
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

9387
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

9388
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

9389
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

9390
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

9391
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

9392
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

9393
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

9394
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

9395
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

9396
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).
9397
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

9398

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

9399
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

9400

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: -
9401
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

9402
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).
9403
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
9404
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
9405
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
9406
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).
9407
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

9408
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).
9409
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”,

9410
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).
9411
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).
9412
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
9413
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).
9414

(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).
9415
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).
9416
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

9417
[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

9418
[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

9419
[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

9420
[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

9421
[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

9422
[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

9423
[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

9424
[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

9425
[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

9426
[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

9427
[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

9428
[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

9429
[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

9430
[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

9431
[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

9432
[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

9433
[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

9434
[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

9435
[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

9436
[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

9437
[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

9438
[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

9439
[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

9440
[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

9441
[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

9442
[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
9443
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

9444
[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

9445
[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

9446
[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

9447
[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

9448
[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
9449
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

9450
“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

9451
[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
9452
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

9453
[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

9454
[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

9455
[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

9456
[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

9457
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

9458
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
9459
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
9460
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

9461
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

9462
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
-
9463
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

9464
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9465
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
9466
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
9467
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

9468
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
9469
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
...
9470
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/
9471
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
9472
9473
9474
Henry Garrett
01/23/2022
9475
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
9476
View publication stats

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

466 PUBLICATIONS 15,251 CITATIONS

On Combinatorics View project

Neutrosophic Graphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEulerian-Type-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 139

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 147

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 247

25 Neutrosophic Eulerian-Type-Cycle-Cut 251

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

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

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 345

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 353

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 453

45 “SuperHyperGraph-Based Books”: | Featured Tweets 461

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 481

Henry Garrett · Independent Researcher · Department of Mathematics ·

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