Eulerian-Type-Path-Cut in SuperHyperGraphs

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

DOI: 10.5281/zenodo.7835063
CITATIONS
1 author:
Henry Garrett
448 PUBLICATIONS 12,569 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Metric Dimension in fuzzy(neutrosophic) Graphs View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 17 April 2023.
The user has requested enhancement of the downloaded file.

Eulerian-Type-Path-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 11
Bibliography 17
3 Acknowledgements 39
4 Cancer In Extreme SuperHyperGraph 41
5 Extreme Eulerian-Type-Path-Cut 45
6 New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

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

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

deemed Ways 263

30 Neutrosophic SuperHyperEulerian-Type-Path-Cut But As The Extensions

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

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

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

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

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

Motivations 347
37 Conclusion and Closing Remarks 349
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 407
43 Background 421
Bibliography 427
44 Books’ Contributions 449
45 “SuperHyperGraph-Based Books”: | Featured Tweets 457
46 CV 485

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

SuperHyperEulerian-Type-Path-Cut . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
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-Path-Cut in the Neutrosophic Example (42.0.3) 281


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

SuperHyperEulerian-Type-Path-Cut in the Example (42.0.5) . . . . . . . . . . . . . . . . 319
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-Path-Cut in the Example (42.0.11) . 323
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEulerian-Type-Path-Cut in the Example (42.0.13) . . . . . . . . . . . . . . . 325
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic No-
tions of Neutrosophic SuperHyperEulerian-Type-Path-Cut in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-
Path-Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7834261). . . . . . . . . . . . . . . . . . . . . . . . . . . 450
2023, (doi: 10.5281/zenodo.7834261). . . . . . . . . . . . . . . . . . . . . . . . . . . 451
2023, (doi: 10.5281/zenodo.7834261). . . . . . . . . . . . . . . . . . . . . . . . . . . 451
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo
2023, (doi: 10.5281/zenodo.7834229). . . . . . . . . . . . . . . . . . . . . . . . . . . 452
2023, (doi: 10.5281/zenodo.7834229). . . . . . . . . . . . . . . . . . . . . . . . . . . 453
2023, (doi: 10.5281/zenodo.7834229). . . . . . . . . . . . . . . . . . . . . . . . . . . 453
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 458

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 459
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 460
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 466



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

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

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 344

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

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

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

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

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

need to “redefine” the notion of a “Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs” 65
and a “Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs ”. The SuperHyperVertices 66
this procedure, there’s the usage of the position of labels to assign to the values. Assume 68
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 69

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

SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 80

Eulerian-Type-Path-Cut In SuperHyperGraphs” where it’s the strongest [the maximum Neutro- 81
sophic value from all the Eulerian-Type-Path-Cut In SuperHyperGraphs amid the maximum 82
value amid all SuperHyperVertices from a Eulerian-Type-Path-Cut In SuperHyperGraphs .] 83
Eulerian-Type-Path-Cut In SuperHyperGraphs . A graph is a SuperHyperUniform if it’s a 84
SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume 85
a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Su- 86

perHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 87
with two exceptions; it’s Eulerian-Type-Path-Cut In SuperHyperGraphs if it’s only one Su- 88
perVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 89
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 90
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 91
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 92
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 93
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 94
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 95
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 96
the specific designs and the specific architectures. The SuperHyperModel is officially called 97
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 98

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

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

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

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

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

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

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

Eulerian-Type-Path-Cut In SuperHyperGraphs if the mentioned Table holds, concerning, 171

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

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

The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 190
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 191
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 192
the intended Table holds. And Eulerian-Type-Path-Cut In SuperHyperGraphs are redefined 193
“Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs” if the intended Table holds. It’s 194
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 195
Neutrosophic type-results to make Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs 196
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 197
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Eulerian-Type-Path-Cut 198
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Su- 199
perHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Eulerian-Type-Path-Cut 200
In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 201

ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 202
intended Table holds. A SuperHyperGraph has “Neutrosophic Eulerian-Type-Path-Cut In 203
SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 204
Eulerian-Type-Path-Cut In SuperHyperGraphs amid the maximum value amid all SuperHy- 205
perVertices from a Eulerian-Type-Path-Cut In SuperHyperGraphs .] Eulerian-Type-Path-Cut 206

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

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

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

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

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

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




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

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

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

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

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

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

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

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

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

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

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

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

HG240; HG241; HG242; HG243; HG244; HG245; HG246; HG247] alongside scientific 468
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 469

HG155b; HG156b; HG157b; HG158b; HG159b; HG160b; HG161b; HG162b]. Two 480
popular scientific research books in Scribd in the terms of high readers, 4276 and 5274 481
respectively, on neutrosophic science is on [HG32b; HG44b]. 482

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

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

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

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 592
2023, (doi: 10.5281/zenodo.7809365). 593
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 595
2023, (doi: 10.5281/zenodo.7809358). 596
HG238 [34] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 597
10.5281/zenodo.7809219). 599
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 601
10.5281/zenodo.7809328). 602
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 604
2023, (doi: 10.5281/zenodo.7806767). 605
HG235 [37] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 606
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 607
2023, (doi: 10.5281/zenodo.7806838). 608
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 610
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 611
HG233 [39] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 612
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 613
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 614
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 616
(doi: 10.5281/zenodo.7799902). 617
HG231 [41] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 618
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 619
2023, (doi: 10.5281/zenodo.7804218). 620
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 622
(doi: 10.5281/zenodo.7796334). 623
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 625
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 628
10.5281/zenodo.7791952). 629

HG225 [45] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 630
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 631
(doi: 10.5281/zenodo.7791982). 632
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 634
10.5281/zenodo.7790026). 635
HG223 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 636
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 637
2023, (doi: 10.5281/zenodo.7790052). 638
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 640
2023, (doi: 10.5281/zenodo.7787066). 641
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 643
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 644
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 646
10.5281/zenodo.7781476). 647
HG219 [51] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 648
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 649
10.5281/zenodo.7783082). 650
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 652
10.5281/zenodo.7777857). 653
HG217 [53] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 654
10.5281/zenodo.7779286). 656
HG215 [54] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 657
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 658
(doi: 10.5281/zenodo.7771831). 659
HG214 [55] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 660
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 661
2023, (doi: 10.5281/zenodo.7772468). 662
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 664
10.13140/RG.2.2.20913.25446). 665
HG212 [57] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 666
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 667
10.5281/zenodo.7764916). 668

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 670
10.13140/RG.2.2.11770.98247). 671
HG210 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 672
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 673
10.13140/RG.2.2.12400.12808). 674
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 676
2023, (doi: 10.13140/RG.2.2.22545.10089). 677
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 679
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 680
HG207 [62] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 681
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 682
10.13140/RG.2.2.11377.76644). 683
HG206 [63] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 684
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 685
10.13140/RG.2.2.23750.96329). 686
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 688
10.13140/RG.2.2.31366.24641). 689
HG204 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 690
10.13140/RG.2.2.34721.68960). 692
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 694
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 697
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 700
10.13140/RG.2.2.24288.35842). 701
HG200 [69] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 702
10.13140/RG.2.2.32467.25124). 704
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 706
10.13140/RG.2.2.31025.45925). 707

HG198 [71] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 708
10.13140/RG.2.2.17184.25602). 710
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 712
10.13140/RG.2.2.23423.28327). 713
HG196 [73] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 714
10.13140/RG.2.2.28456.44805). 716
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 718
10.13140/RG.2.2.23525.68320). 719
HG194 [75] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 720
10.13140/RG.2.2.20170.24000). 722
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 724
10.13140/RG.2.2.36475.59683). 725
HG192 [77] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 726
10.13140/RG.2.2.29764.71046). 728
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 730
2023, (doi: 10.13140/RG.2.2.18780.87683). 731
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 733
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 736
10.13140/RG.2.2.26134.01603). 737
HG188 [81] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 738
10.13140/RG.2.2.27392.30721). 740
HG187 [82] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 741
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 742
10.13140/RG.2.2.33028.40321). 743
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 745
10.13140/RG.2.2.21389.20966). 746

HG185 [84] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 747
10.13140/RG.2.2.16356.04489). 749
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 751
10.13140/RG.2.2.21756.21129). 752
HG183 [86] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 753
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 754
10.13140/RG.2.2.30983.68009). 755
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 757
10.13140/RG.2.2.28552.29445). 758
HG181 [88] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 759
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 760
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 761
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 763
10.13140/RG.2.2.35105.89447). 764
HG179 [90] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 765
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 766
(doi: 10.13140/RG.2.2.30072.72960). 767
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 769
10.13140/RG.2.2.31147.52003). 770
HG177 [92] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 771
10.13140/RG.2.2.32825.24163). 773
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 775
10.13140/RG.2.2.13059.58401). 776
HG175 [94] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 777
10.13140/RG.2.2.11172.14720). 779
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 781
2023, (doi: 10.13140/RG.2.2.22011.80165). 782
HG173 [96] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 783
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 784
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 785

Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 787
HG171 [98] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 789
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 791
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 793
2023, (doi: 10.13140/RG.2.2.19944.14086). 794
HG169 [100] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 795
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 797
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 799
(doi: 10.13140/RG.2.2.33103.76968). 800
HG167 [102] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 801
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 802
2023, (doi: 10.13140/RG.2.2.23037.44003). 803
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 805
(doi: 10.13140/RG.2.2.35646.56641). 806
HG165 [104] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 807
(doi: 10.13140/RG.2.2.18030.48967). 809
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 811
(doi: 10.13140/RG.2.2.13973.81121). 812
HG163 [106] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 813
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 814
2023, (doi: 10.13140/RG.2.2.34106.47047). 815
HG162 [107] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 816
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 817
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 820
2023, (doi: 10.13140/RG.2.2.31956.88961). 821
HG160 [109] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 822
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 823
2023, (doi: 10.13140/RG.2.2.15179.67361). 824

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 826
10.13140/RG.2.2.21510.45125). 827
HG158 [111] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 828
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 829
2023, (doi: 10.13140/RG.2.2.13121.84321). 830
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 832
10.13140/RG.2.2.11758.69441). 833
HG156 [113] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 834
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 835
2023, (doi: 10.13140/RG.2.2.31891.35367). 836
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 838
10.13140/RG.2.2.19360.87048). 839
HG154 [115] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 840
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 841
2023, (doi: 10.13140/RG.2.2.32363.21286). 842
HG153 [116] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 843
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 844
(doi: 10.13140/RG.2.2.23266.81602). 845
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 847
10.13140/RG.2.2.19911.37285). 848
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 850
10.13140/RG.2.2.11050.90569). 851
HG150 [119] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 852
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 853
HG149 [120] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 855
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 856
HG148 [121] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 858
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 859
HG147 [122] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 861
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 862
(doi: 10.13140/RG.2.2.30182.50241). 863

HG146 [123] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 864
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 865
HG145 [124] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 867
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 868
HG144 [125] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 870
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 871
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 872
HG143 [126] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 873
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 874
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 875
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 878
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 881
HG140 [129] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 882
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 883
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 884
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 887
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 890
HG137 [132] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 891
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 892
HG136 [133] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 894
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 895
2023, (doi: 10.13140/RG.2.2.17252.24968). 896
HG135 [134] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 897
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 898
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 899
HG134 [135] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 900
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 901
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 902

HG132 [136] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 903
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 904
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 905
HG131 [137] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 906
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 907
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 908
HG130 [138] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 909
Recognition in The Confrontation With Super Attacks In Hyper Situations By 910
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 911

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

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

SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 919
HG127 [141] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 920
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 921
2023,(doi: 10.13140/RG.2.2.36745.93289). 922
HG126 [142] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 923
HG125 [143] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 926

10.20944/preprints202301.0282.v1). 929
HG124 [144] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 930
10.20944/preprints202301.0267.v1).). 932
HG123 [145] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 933
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 934
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 935
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 936
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 937
HG122 [146] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 938
prints202301.0262.v1). 941

HG121 [147] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 942
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 943
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 944

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

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

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

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

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

10.13140/RG.2.2.32530.73922). 966

prints202301.0105.v1). 969
HG28 [155] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 970
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 971
HG29 [156] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 973
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 974
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 975

10.13140/RG.2.2.23172.19849). 976

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

10.13140/RG.2.2.17385.36968). 986
HG107 [160] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 987
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 988
Beyond”, Preprints 2023, 2023010044 989
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 991
(doi: 10.20944/preprints202301.0043.v1). 992
HG31 [162] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 993
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 994
2023, (doi: 10.13140/RG.2.2.28945.92007). 995
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1000
10.13140/RG.2.2.35774.77123). 1001
HG35 [166] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1005
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1006

10.13140/RG.2.2.29430.88642). 1007
(doi: 10.20944/preprints202212.0549.v1). 1013
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1015
10.13140/RG.2.2.19380.94084). 1016

SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 1020
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1024
(doi: 10.20944/preprints202212.0500.v1). 1027
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1029
10.13140/RG.2.2.20993.12640). 1030
HG952 [174] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1031
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1032
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1035
ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1036
HG942 [176] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1037

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1038
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1039
HG94 [177] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1040

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1041
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1042
HG37 [178] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1043
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1044

10.13140/RG.2.2.29173.86244). 1045
HG38 [179] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1046
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1047
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1048
HG162b [180] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1049
(doi: 10.5281/zenodo.7835063). 1050
HG161b [181] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1051
(doi: 10.5281/zenodo.7826705). 1052
HG160b [182] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1053
2023 (doi: 10.5281/zenodo.7820680). 1054

HG159b [183] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1055
10.5281/zenodo.7812750). 1056
HG158b [184] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1057

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

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1060
HG156b [186] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1061
2023 (doi: 10.5281/zenodo.7807782). 1062
HG155b [187] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1063
2023 (doi: 10.5281/zenodo.7804449). 1064
HG154b [188] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1065

HG153b [189] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1067
(doi: 10.5281/zenodo.7792307). 1068
HG152b [190] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1069
(doi: 10.5281/zenodo.7790728). 1070
HG151b [191] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1071
2023 (doi: 10.5281/zenodo.7787712). 1072
HG150b [192] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1073
10.5281/zenodo.7783791). 1074
HG149b [193] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1075
10.5281/zenodo.7780123). 1076
HG148b [194] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1077
(doi: 10.5281/zenodo.7773119). 1078
HG147b [195] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1079
odo.7637762). 1080
HG146b [196] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1081
10.5281/zenodo.7766174). 1082
HG145b [197] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1083
10.5281/zenodo.7762232). 1084
HG144b [198] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1085
(doi: 10.5281/zenodo.7758601). 1086
HG143b [199] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1087
10.5281/zenodo.7754661). 1088
HG142b [200] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1089
10.5281/zenodo.7750995) . 1090

HG141b [201] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1091
(doi: 10.5281/zenodo.7749875). 1092
HG140b [202] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1093
10.5281/zenodo.7747236). 1094
HG139b [203] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1095
10.5281/zenodo.7742587). 1096
HG138b [204] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1097
(doi: 10.5281/zenodo.7738635). 1098
HG137b [205] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1099
10.5281/zenodo.7734719). 1100
HG136b [206] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1101
10.5281/zenodo.7730484). 1102
HG135b [207] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1103
(doi: 10.5281/zenodo.7730469). 1104
HG134b [208] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1105
10.5281/zenodo.7722865). 1106
HG133b [209] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1107
odo.7713563). 1108
odo.7709116). 1110
HG131b [211] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1111
10.5281/zenodo.7706415). 1112
HG130b [212] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1113
(doi: 10.5281/zenodo.7706063). 1114
HG129b [213] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1115
(doi: 10.5281/zenodo.7701906). 1116
HG128b [214] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1117
odo.7700205). 1118
HG127b [215] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1119
10.5281/zenodo.7694876). 1120
HG126b [216] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1121
10.5281/zenodo.7679410). 1122
HG125b [217] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1123
10.5281/zenodo.7675982). 1124
HG124b [218] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1125
10.5281/zenodo.7672388). 1126

HG123b [219] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1127
odo.7668648). 1128
HG122b [220] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1129
10.5281/zenodo.7662810). 1130
HG121b [221] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1131
10.5281/zenodo.7659162). 1132
HG120b [222] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1133
odo.7653233). 1134
HG119b [223] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1135
odo.7653204). 1136
HG118b [224] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1137
odo.7653142). 1138
HG117b [225] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1139
odo.7653117). 1140
HG116b [226] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1141
odo.7653089). 1142
HG115b [227] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1143
odo.7651687). 1144
HG114b [228] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1145
odo.7651619). 1146
HG113b [229] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1147
odo.7651439). 1148
HG112b [230] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1149
odo.7650729). 1150
HG111b [231] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1151
odo.7647868). 1152
HG110b [232] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1153
odo.7647017). 1154
HG109b [233] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1155
odo.7644894). 1156
HG108b [234] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1157
odo.7641880). 1158
HG107b [235] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1159
odo.7632923). 1160
HG106b [236] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1161
odo.7623459). 1162

HG105b [237] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1163
10.5281/zenodo.7606416). 1164
HG104b [238] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1165
10.5281/zenodo.7606416). 1166
HG103b [239] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1167
odo.7606404). 1168
HG102b [240] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1169
10.5281/zenodo.7580018). 1170
HG101b [241] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1171
odo.7580018). 1172
odo.7580018). 1174
odo.7579929). 1176
HG98b [244] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1177
10.5281/zenodo.7563170). 1178
HG97b [245] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1179
odo.7563164). 1180
HG96b [246] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1181
odo.7563160). 1182
odo.7563160). 1184
HG94b [248] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7563160). 1186
HG93b [249] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7557063). 1188
HG92b [250] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1189
10.5281/zenodo.7557009). 1190
HG91b [251] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.7539484). 1192
HG90b [252] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1193
10.5281/zenodo.7523390). 1194
HG89b [253] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1195
10.5281/zenodo.7523390). 1196
HG88b [254] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7523390). 1198

HG87b [255] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1199
odo.7574952). 1200
HG86b [256] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1201
10.5281/zenodo.7574992). 1202
odo.7523357). 1204
HG84b [258] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1205
10.5281/zenodo.7523357). 1206
HG83b [259] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1207
10.5281/zenodo.7504782). 1208
HG82b [260] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1209
10.5281/zenodo.7504782). 1210
HG81b [261] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7504782). 1212
HG80b [262] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1213
10.5281/zenodo.7499395). 1214
HG79b [263] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1215
odo.7499395). 1216
HG78b [264] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7499395). 1218
HG77b [265] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1219
10.5281/zenodo.7497450). 1220
HG76b [266] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1221
10.5281/zenodo.7497450). 1222
HG75b [267] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7494862). 1224
HG74b [268] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1225
odo.7494862). 1226
HG73b [269] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1227
10.5281/zenodo.7494862). 1228
HG72b [270] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7493845). 1230
HG71b [271] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1231
10.5281/zenodo.7493845). 1232
HG70b [272] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1233
10.5281/zenodo.7493845). 1234

HG69b [273] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1235
odo.7539484). 1236
HG68b [274] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1237
odo.7523390). 1238
HG67b [275] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1239
odo.7523357). 1240
HG66b [276] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1241
odo.7504782). 1242
HG65b [277] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1243
odo.7499395). 1244
HG64b [278] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1245
odo.7497450). 1246
HG63b [279] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1247
odo.7494862). 1248
HG62b [280] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1249
odo.7493845). 1250
HG61b [281] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1251
odo.7480110). 1252
HG60b [282] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1253
odo.7378758). 1254
HG32b [283] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1255
odo.6320305). 1256
HG44b [284] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1257
odo.6677173). 1258

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

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

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

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

CHAPTER 5 1367
Extreme Eulerian-Type-Path-Cut 1368
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1369
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1370
2023, (doi: 10.13140/RG.2.2.34953.52320). 1371

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1372
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1373
(doi: 10.13140/RG.2.2.33275.80161). 1374
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1375
10.13140/RG.2.2.11050.90569). 1377
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1378
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1379
10.13140/RG.2.2.17761.79206). 1380
10.13140/RG.2.2.19911.37285). 1383
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1384
10.13140/RG.2.2.23266.81602). 1386
10.13140/RG.2.2.19360.87048). 1389
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1390
10.13140/RG.2.2.32363.21286). 1392
10.13140/RG.2.2.11758.69441). 1395
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1396
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1397
10.13140/RG.2.2.31891.35367). 1398
10.13140/RG.2.2.21510.45125). 1401
45
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1402
10.13140/RG.2.2.13121.84321). 1404

CHAPTER 6 1405
New Ideas On Super EULA By Hyper 1406
Eulogy Of Eulerian-Type-Path-Cut In 1407
Cancer’s Recognition With 1408
(Neutrosophic) SuperHyperGraph 1409
47
CHAPTER 7 1410
ABSTRACT 1411
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1412
Type-Path-Cut ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path- 1413

0
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1414
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type- 1415
Path-Cut if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path-Cut criteria 1416
holds 1417
∀Ea ∈ P : P is
a SuperHyperPath and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic 1418
e-SuperHyperEulerian-Type-Path-Cut criteria holds 1419
∀Ea ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1420
SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic v- 1421
SuperHyperEulerian-Type-Path-Cut criteria holds 1422
∀Va ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic 1423
v-SuperHyperEulerian-Type-Path-Cut criteria holds 1424
∀Va ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1425
SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 1426
49
Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, 1427

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut. ((Neutrosophic) SuperHyperEulerian-Type- 1428
Path-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1429
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1430
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyper- 1433
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1434
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 1435
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1436
the Extreme SuperHyperEulerian-Type-Path-Cut; a Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s 1437
either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type- 1438
Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian- 1439

Type-Path-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1440
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 1441
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges 1442
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1443
Type-Path-Cut; an Extreme SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either of 1444
Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, 1445

Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type- 1446
Path-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1447
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1448
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 1449
S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 1450
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Path-Cut; and the 1451
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type- 1452
Path-Cut SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 1453
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic Su- 1455
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1456
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1457
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1458
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1459
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Cut; 1460
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 1461
V-SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path- 1462

Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type- 1463
Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme 1464
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1465
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 1466
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHy- 1467
perVertices such that they form the Extreme SuperHyperEulerian-Type-Path-Cut; a Neutrosophic 1468
V-SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 1469
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic Super- 1471
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1472

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

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 1474
they form the Neutrosophic SuperHyperEulerian-Type-Path-Cut; an Extreme V-SuperHyperEulerian- 1475
Type-Path-Cut SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 1476
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme Super- 1478
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1479
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1480
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 1481
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1482
Extreme SuperHyperEulerian-Type-Path-Cut; and the Extreme power is corresponded to its Extreme 1483
coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either of 1484

Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path- 1486
Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1487
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1488
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 1489
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1490
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1491
SuperHyperEulerian-Type-Path-Cut; and the Neutrosophic power is corresponded to its Neutrosophic 1492
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1493
namely, a SuperHyperEulerian-Type-Path-Cut and Neutrosophic SuperHyperEulerian-Type-Path-Cut. Two 1494
different types of SuperHyperDefinitions are debut for them but the research goes further 1495
and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 1496
well-defined and well-reviewed. The literature review is implemented in the whole of this 1497
research. For shining the elegancy and the significancy of this research, the comparison between 1498
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 1499
bers are featured. The definitions are followed by the examples and the instances thus the 1500
clarifications are driven with different tools. The applications are figured out to make sense 1501
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1502
under research to figure out the challenges make sense about ongoing and upcoming research. 1503
The special case is up. The cells are viewed in the deemed ways. There are different types 1504
of them. Some of them are individuals and some of them are well-modeled by the group of 1505
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1506
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1507
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1508
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1509
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1510
It’s also officially collected in the form of some questions and some problems. Assume a 1511
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Path-Cut is 1512
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1513
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1514

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

that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 1519
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1520
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1521
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 1522
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 1523
a SuperHyperEulerian-Type-Path-Cut . Since there’s more ways to get type-results to make a 1524
SuperHyperEulerian-Type-Path-Cut more understandable. For the sake of having Neutrosophic 1525

SuperHyperEulerian-Type-Path-Cut, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 1526
Type-Path-Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1527
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 1528
to assign to the values. Assume a SuperHyperEulerian-Type-Path-Cut . It’s redefined a Neutrosophic 1529
SuperHyperEulerian-Type-Path-Cut if the mentioned Table holds, concerning, “The Values of 1530
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 1531
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 1532
of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 1533
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 1534
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 1535
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 1536
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Type- 1537

Path-Cut . It’s the main. It’ll be disciplinary to have the foundation of previous definition in 1538
the kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Type-Path-Cut until 1539
the SuperHyperEulerian-Type-Path-Cut, then it’s officially called a “SuperHyperEulerian-Type-Path-Cut” 1540
but otherwise, it isn’t a SuperHyperEulerian-Type-Path-Cut . There are some instances about the 1541
clarifications for the main definition titled a “SuperHyperEulerian-Type-Path-Cut ”. These two 1542
examples get more scrutiny and discernment since there are characterized in the disciplinary 1543
ways of the SuperHyperClass based on a SuperHyperEulerian-Type-Path-Cut . For the sake of having 1544
a Neutrosophic SuperHyperEulerian-Type-Path-Cut, there’s a need to “redefine” the notion of a 1545
“Neutrosophic SuperHyperEulerian-Type-Path-Cut” and a “Neutrosophic SuperHyperEulerian-Type-Path- 1546
Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 1547
letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 1548
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHy- 1549
perGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Path-Cut are redefined to a 1550
“Neutrosophic SuperHyperEulerian-Type-Path-Cut” if the intended Table holds. It’s useful to define 1551
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 1552
results to make a Neutrosophic SuperHyperEulerian-Type-Path-Cut more understandable. Assume 1553
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1554

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Path-Cut, SuperHyperStar, 1555
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1556
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Path-Cut”, “Neutrosophic SuperHyper- 1557
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1558
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1559
“Neutrosophic SuperHyperEulerian-Type-Path-Cut” where it’s the strongest [the maximum Neutro- 1560
sophic value from all the SuperHyperEulerian-Type-Path-Cut amid the maximum value amid all 1561
SuperHyperVertices from a SuperHyperEulerian-Type-Path-Cut .] SuperHyperEulerian-Type-Path-Cut . 1562
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1563
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1564

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1565
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Cut if it’s 1566
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1567
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1568
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1569
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1570
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1571
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1577
and the common and intended properties between “specific” cells and “specific group” of 1578
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1579
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1580
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1581
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 1582
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 1583
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 1584
of the move from the cancer is identified by this research. Sometimes the move of the cancer 1585
fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Cut, SuperHyper- 1592
Star, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1593
either the longest SuperHyperEulerian-Type-Path-Cut or the strongest SuperHyperEulerian-Type-Path-Cut 1594
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Path-Cut, 1595

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

but literarily, it’s the deformation of any SuperHyperEulerian-Type-Path-Cut. It, literarily, deforms 1601
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Path-Cut 1602
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1603
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Cut, Cancer’s Neut- 1604
rosophic Recognition 1605


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

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

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

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1685
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1686
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1687
and as concluding and closing section of theoretical research are contained in the section 1688
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1689
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1690
Results”, “ SuperHyperEulerian-Type-Path-Cut”, “Extreme SuperHyperEulerian-Type-Path-Cut”, “Results 1691

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

CHAPTER 9 1704
Extreme Preliminaries Of This Scientific 1705
Research On the Redeemed Ways 1706
In this section, the basic material in this scientific research, is referred to [Single Valued 1707
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1708
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1709

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1710
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1711
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1712
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1713
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1714
their clarifications are addressed to Ref.[HG38]. 1715

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1735
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1736
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1737
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1738
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1739
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1740

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

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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1757
x, y, z, w ∈ [0, 1]: 1758
(i) 1 ⊗ x = x; 1759
(ii) x ⊗ y = y ⊗ x; 1760
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1761
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1762

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

where 1765

1, 2, . . . , n0 ); 1770
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1771
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1772
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1773
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1774
0


SuperEdge; 1794
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1797
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1798
makes the patterns and regularities. 1799
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1800
of elements of SuperHyperEdges are the same. 1801

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

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

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

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

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


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

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

Cut). 1859
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1861
or E 0 is called 1862
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Cut if the following expression is called 1863

Neutrosophic e-SuperHyperEulerian-Type-Path-Cut criteria holds 1864
∀Ea ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Cut if the following expression is called 1865

Neutrosophic re-SuperHyperEulerian-Type-Path-Cut criteria holds 1866
∀Ea ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1867
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Cut if the following expression is called 1868
Neutrosophic v-SuperHyperEulerian-Type-Path-Cut criteria holds 1869
∀Va ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut if the following expression is called 1870
∀Va ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1872

(v) Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e- 1873

SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutro- 1874
sophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path- 1875
Cut. 1876
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Cut). 1877

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

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

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1885
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1886
SuperHyperEulerian-Type-Path-Cut; 1887
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e- 1888

Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1891
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 1892
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHy- 1893
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1894
(iii) an Extreme SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either 1896

of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian- 1897
Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv- 1898
SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyperGraph 1899

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 1900
cients defined as the Extreme number of the maximum Extreme cardinality of the 1901
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1902
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1903
that they form the Extreme SuperHyperEulerian-Type-Path-Cut; and the Extreme power is 1904
corresponded to its Extreme coefficient; 1905
(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial 1906

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re- 1907
SuperHyperEulerian-Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neut- 1908
rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic SuperHy- 1909

perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1910
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 1911
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1912
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1913
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1914
Type-Path-Cut; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 1915

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

the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 1921
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e- 1924

Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1928
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1929
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1930
(vii) an Extreme V-SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if 1932

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re- 1933
rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyper- 1935
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1936
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1937
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1938

(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial 1942

rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic Supe- 1945
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1946
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1947
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1949

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 1950
sophic SuperHyperEulerian-Type-Path-Cut; and the Neutrosophic power is corresponded to its 1951
Neutrosophic coefficient. 1952
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Cut). 1953

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

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1957
|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 1958
(29.1), holds if S is an δ−SuperHyperDefensive; 1959
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Cut is a Neutrosophic kind of Neut- 1960

rosophic SuperHyperEulerian-Type-Path-Cut such that either of the following Neutrosophic 1961
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1962
|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 1963

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

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Type-Path- 1981
Cut more Neutrosophicly understandable. 1982

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

136TBL4

136TBL1

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Cut”. The 1984
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1985
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1986
1987
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Path-Cut. It’s redefined a Neutrosophic 1988

SuperHyperEulerian-Type-Path-Cut if the Table (29.3) holds. 1989

CHAPTER 10 1990
Extreme SuperHyper But As The Eulerian-Type-Path-Cut 1991
Extensions Excerpt From Dense And 1992
Super Forms 1993
Definition 10.0.1. (Extreme event). 1994

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1995
a probability Eulerian-Type-Path-Cut. Any Extreme k-subset of A of V is called Extreme k-event 1996
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 1997
is called Extreme probability of A. 1998
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1999

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2000
probability Eulerian-Type-Path-Cut. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2001
if the following expression is called Extreme s-independent criteria 2002
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 2003
following expression is called Extreme independent criteria 2004
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2005

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2006
probability Eulerian-Type-Path-Cut. Any k-function Eulerian-Type-Path-Cut like E is called Extreme k- 2007
Variable. If k = 2, then any 2-function Eulerian-Type-Path-Cut like E is called Extreme Variable. 2008
The notion of independent on Extreme Variable is likewise. 2009
Definition 10.0.4. (Extreme Expectation). 2010
71
a probability Eulerian-Type-Path-Cut. an Extreme k-Variable E has a number is called Extreme 2012

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

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

following expression is called Extreme Crossing criteria 2017
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 2018
S = (V, E) is a probability Eulerian-Type-Path-Cut. Let m and n propose special Eulerian-Type-Path-Cut. 2019
Then with m ≥ 4n, 2020
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-Path-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: 2021
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2022
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2023
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let P be a SuperHyperSet of n points in 2024
the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing through at 2025
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2026
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2027

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

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

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

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

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

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

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

S = (V, E) is a probability Eulerian-Type-Path-Cut. Let X be an Extreme Variable and let t be a 2086
positive real number. Then 2087
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2088
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let Xn be an Extreme Variable in a 2090

probability Eulerian-Type-Path-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2091
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Path-Cut. Set X := Xn and t := |Ex(Xn )| in 2093
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2094
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2095
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2097
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 2098
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2099
S = (V, E) is a probability Eulerian-Type-Path-Cut. As in the proof of related Theorem, the result is 2101
straightforward. 2102
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 2104
defined in previous Theorem. Then either: 2105
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2106
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2107
S = (V, E) is a probability Eulerian-Type-Path-Cut. The latter is straightforward. 2109
Definition 10.0.17. (Extreme Threshold). 2110
is a probability Eulerian-Type-Path-Cut. Let P be a monotone property of SuperHyperGraphs (one 2112
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2113
a function f (n) such that: 2114
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2115
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2116

Definition 10.0.18. (Extreme Balanced). 2117

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

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

= {E4 }.

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

= z3.
= {V1 , V2 , V4 }.
= z 5 + 2z 3 + z.
2146
Type-Path-Cut, is up. The Extreme Algorithm is Extremely straightforward. 2148

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



= {E4 (E5 ), E1 , E2 }.
= z 5 + 2z 3 .
= {Vi ∈ VN SHG }.
= z 4 + z 3 + 2z 2 + 4z.
2152

= {E1 , E4 }.
= 2z 5 .
= {Vi ∈ VE1 , Vi ∈ VE4 }.

= z 7 + 2z 4 + 5z 3 + z 2 .
2155

= {Eii=110 , Eii=2232 }.
= 10z 2 .
= {Vii=122 }.
= z Vii=122 .
2158

= {Eii=110 , E17 , E14 , E13 }

= z 5 + 12z 2 .
= {Vi ∈ VN SHG }.
= 3z 6 + 5z 5 + 2z 4 + z 3 .
2161

= {E3 , E4 , E2 }.
= 2z 5 + z 3 .
= {Vii=414 , }.

= 3z 6 + 5z 5 + 2z 4 + z 3 .
2164

= {Eii=110 , E22 , E23 }.
= z 11 + 11z 2 .
= {Vii=122 }.
= z Vii=122 .
2167
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2168
SuperHyperEulerian-Type-Path-Cut, is up. The Extreme Algorithm is Extremely straightfor- 2169

ward. 2170


= {E2 , E7 , E3 }.
= 2z 5 + z 3 .
= {Vii=414 }.
= 3z 6 + 5z 5 + 2z 4 + z 3 .
2171

ward. 2174

= {E1 , E6 , E5 , E4 }.
= z 3 + 3z 2 .
= {Vii=16 }.

= 3z 5 + z 4 + 2z 3 .
2175

ward. 2178

= {E1 , E6 }.
= z5 + z2.
= {Vii=13 , Vii=79 }
= z 8 + z 7 + z 6 + 3z 5 .
2179

ward. 2182

= {E10 , E1 , E6 , E5 , E4 }.
= 5z 2 .
= {Vii=16 }.
= 3z 5 + z 4 + 2z 3 .
2183

ward. 2186

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


= {V1 , V2 , V3 }.
= 2z 5 + z 3 .
2187

ward. 2190

= {E1 , E2 , E3 , E4 , E5 }.
= 5z 2 .
= {V1 , V2 , V3 , V4 , V5 , V6 }.
= 3z 5 + z 4 + 2z 3 .
2191


ward. 2194

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



ward. 2198

= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
2199

ward. 2202

= {Ei ∈ EN SHG }.


X
= {Vi ∈ VN SHG }.
X
2203

ward. 2206

= {Ei ∈ EN SHG \ {Ej }}.
X
= z |Ei ∈EN SHG \{Ej }| .
= {Vi ∈ VN SHG \ {VEj }}.


X |V ∈V
= z i N SHG \{VEj }| .
2207

ward. 2210

= {Ei , Ej }.
= z |Ei | + z |Ej | .
= {VEi , VEj }.
X
= z VEi + z VEj .
2211

ward. 2214

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

ward. 2218

= {Ei ∈ EN SHG \ {E1 }}.

SuperHyperEulerian-Type-Path-Cut in the Extreme Example (42.0.3) 95NHG1
X
= z |Ei ∈EN SHG \{E1 }| .
= {Vi ∈ VN SHG \ {VE1 }}.
X
= z |Vi ∈VN SHG \{VE1 }| .
2219
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2220
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Cut if for 2221
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2222
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2223

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

SuperHyperEulerian-Type-Path-Cut in the Extreme Example (42.0.3) 95NHG2
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2225

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2226
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2227
quasi-R-Eulerian-Type-Path-Cut minus all Extreme SuperHypeNeighbor to some of them but not all of 2228
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2229
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Path-Cut, minus 2230
all Extreme SuperHypeNeighbor to some of them but not all of them. 2231
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-Path-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Cut is at least 2232
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2233
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2234
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2235
SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Cut in some cases but the maximum 2236
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2237
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2238
Eulerian-Type-Path-Cut. 2239
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Type-Path-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-Path-Cut with the least Extreme cardinality, the 2240
lower sharp Extreme bound for cardinality. 2241
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2242
Then in the worst case, literally, 2243
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−Cut

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−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-Path-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-Path-Cut. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Eulerian-Type-Path-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-Path-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-Path-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-Path-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-Path-Cut has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Eulerian-Type-Path-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-Path-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-Path-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-Path-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-Path-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-Path-Cut. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Eulerian-Type-Path-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-Path-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Eulerian-Type-Path-Cut but with slightly
differences in the maximum Extreme cardinality amid those Extreme type-SuperHyperSets
of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,
z
and
E
is formalized with mathematical literatures on the Extreme R-Eulerian-Type-Path-Cut. Let Zi ∼ Zj ,
be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.

Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2246
Extreme R-Eulerian-Type-Path-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2247
Extreme R-Eulerian-Type-Path-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Eulerian-Type-Path-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-Path-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-Path-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Cut is at least 2248
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2249
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2250
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2251
SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Cut in some cases but the maximum 2252
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2253
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2254
Eulerian-Type-Path-Cut. 2255
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2256
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2257
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2258
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2259
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2260
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2261
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2262
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2263
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2264
Thus it forms an Extreme quasi-R-Eulerian-Type-Path-Cut where the Extreme completion of the 2265
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Eulerian-Type-Path- 2266
Cut. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. 2267

In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2268
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2269
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2270
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2271
Extreme style of the embedded Extreme R-Eulerian-Type-Path-Cut. The interior types of the Extreme 2272
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2273

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

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Path-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Path-Cut is re-formalized 2309
and redefined as follows. 2310
GExtreme Eulerian-Type-Path-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 2311
definition for the Extreme Eulerian-Type-Path-Cut. 2312
GExtreme Eulerian-Type-Path-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- 2313
poses the upcoming expressions.
Path-Cut 2314
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2315
= max zExtreme Number

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

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



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

2319
[zExtreme
Number ]Extreme Class

2320

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2321
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2322
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2323
It’s, literarily, another name for “Extreme Quasi-Eulerian-Type-Path-Cut” but, precisely, it’s the 2324
generalization of “Extreme Quasi-Eulerian-Type-Path-Cut” since “Extreme Quasi-Eulerian-Type-Path-Cut” 2325
happens “Extreme Eulerian-Type-Path-Cut” in an Extreme SuperHyperGraph as initial framework 2326
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme Eulerian- 2327
Type-Path-Cut” in an Extreme SuperHyperGraph as initial framework and preliminarily background 2328

since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To 2329
get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Eulerian- 2330
Type-Path-Cut”, and “Extreme Eulerian-Type-Path-Cut” are up. 2331
Thus, let 2332
zExtreme Number , NExtreme SuperHyperNeighborhood and 2333
GExtreme Eulerian-Type-Path-Cut be an Extreme number, an Extreme SuperHyperNeighborhood and 2334

an Extreme Eulerian-Type-Path-Cut and the new terms are up. 2335
GExtreme Eulerian-Type-Path-Cut ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2336
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2337
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2338
And with go back to initial structure, 2339
GExtreme Eulerian-Type-Path-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2340

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

2341

2342

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

SuperHyperSet of the Extreme SuperHyperVertices,

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

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

not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2343
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2344
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2345
the 2346
“Extreme R-Eulerian-Type-Path-Cut” 2347
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2348
Extreme R-Eulerian-Type-Path-Cut, 2349
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-Path-Cut amid those obvious simple Extreme type-SuperHyperSets of the
Extreme Eulerian-Type-Path-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-Path-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Eulerian-Type-Path-Cut is the cardinality of
2350
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2351
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Cut if for any of 2352

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

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

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

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

(V, E) is an Extreme type-SuperHyperSet with 2400
2401
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2402
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2403

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2404
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2405
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Path-Cut is up. The obvious 2406
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Cut is an Extreme Supe- 2407
rHyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2408
of the Extreme SuperHyperEdges[SuperHyperVertices], 2409

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHy- 2410
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2411

is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy-
Type-Path-Cut 2412
perEdges[SuperHyperVertices], 2413

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-Path-Cut. 2414

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

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

Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme type- 2418
SuperHyperSet called the Extreme Eulerian-Type-Path-Cut and it’s an Extreme Eulerian-Type-Path-Cut. 2419
Since it’s 2420
2421
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2422
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2423

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

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

= az s + bz t .
Thus the non-obvious Extreme Eulerian-Type-Path-Cut , 2427

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

Eulerian-Type-Path-Cut 2428

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

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 2430
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2431
SuperHyperSet called the 2432
“Extreme Eulerian-Type-Path-Cut ” 2433
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2434
Extreme Eulerian-Type-Path-Cut , 2435

is only and only 2436

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

CHAPTER 11 2438
The Extreme Departures on The 2439
Theoretical Results Toward Theoretical 2440
Motivations 2441
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2442
SuperHyperClasses. 2443
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2444

= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
= z |Vi ∈VN SHG |.
2445
(11.2)
Proof. Let 2446
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
113
2447
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2448
new way to redefine as 2449
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 2450
ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Path-Cut. The latter is straightforward. 2451
2452
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2453
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2454
(31.1), is the SuperHyperEulerian-Type-Path-Cut. 2455
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2456

= {Ei ∈ EN SHG \ {Ej }}.
X
X |V ∈V
Proof. Let 2457
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2458
P :

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

SuperHyperEulerian-Type-Path-Cut in the Example (42.0.5) 136NSHG18a
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 2459

2463
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2464
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2465
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Type-Path-Cut. 2466

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

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

= {Ei , Ej }.
= z |Ei | + z |Ej | .
= {VEi , VEj }.
z |VEi | + z |VEj | .
X
=
Proof. Let 2468
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2469
P :
E1 , V1EXT ERN AL ,

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

SuperHyperEulerian-Type-Path-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 2470
way to redefine as 2471


2474
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2475
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2476
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2477
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2478
Type-Path-Cut. 2479

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

= {Ei ∈ PNmin
SHG }.
X min
= z |Ei ∈PN SHG | .
= {VEi ∈PNmin
SHG
}.
X |V min |
= z Ei ∈PN SHG .
Proof. Let 2481
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
2482
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 2483
a new way to redefine as 2484

Then there’s no at least one SuperHyperEulerian-Type-Path-Cut. Thus the notion of quasi may be up 2487
but the SuperHyperNotions based on SuperHyperEulerian-Type-Path-Cut could be applied. There 2488

are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2489
as the representative in the 2490
P :
V1EXT ERN AL , E1 ,

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

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

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2492
SuperHyperPart SuperHyperEdges are attained in any solution 2493
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2494
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2495
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2496
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2497
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2498
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Type-Path-Cut. 2499
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2500

Then 2501

= {Ei ∈ PNmin
SHG }.
X min
= {VEi ∈PNmin
SHG
}.
X |V min |
= z Ei ∈PN SHG .
Proof. Let 2502
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2503
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Path-Cut taken from a connected Extreme SuperHyperMulti- 2504

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


are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2510
P :
V1EXT ERN AL , E1 ,

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

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

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

= {Ei ∈ (EN SHG \ {Ej }) ∪ {Ek∗ }}.
X ∗
= z |Ei ∈(EN SHG \{Ej })∪{Ek }| .


= {VEi ∈(EN SHG \{Ej })∪{Ek∗ } }.
X |V ∗ |
= z Ei ∈(EN SHG \{Ej })∪{Ek } .
Proof. Let 2523
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2524
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Path-Cut taken from a connected Extreme SuperHyperWheel 2525

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


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

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

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

CHAPTER 12 2538
The Surveys of Mathematical Sets On 2539
The Results But As The Initial Motivation 2540
For the SuperHyperEulerian-Type-Path-Cut, Extreme SuperHyperEulerian-Type-Path-Cut, and the Extreme 2541

SuperHyperEulerian-Type-Path-Cut, some general results are introduced. 2542
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Type-Path-Cut is “redefined” on 2543
the positions of the alphabets. 2544
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Type-Path-Cut. Then 2545
Extreme SuperHyperEulerian − T ype − P ath − Cut =

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

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2562
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Cut is its 2563
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2565
isn’t well-defined if and only if its SuperHyperEulerian-Type-Path-Cut isn’t well-defined.
Type-Path-Cut 2566
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2567
Extreme SuperHyperEulerian-Type-Path-Cut isn’t well-defined if and only if its SuperHyperEulerian- 2568

Type-Path-Cut isn’t well-defined. 2569
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path-Cut, Super- 2570

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2571
SuperHyperEulerian-Type-Path-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Path-Cut 2572
isn’t well-defined. 2573
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2574
is well-defined if and only if its SuperHyperEulerian-Type-Path-Cut is well-defined.
Type-Path-Cut 2575
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2576

Extreme SuperHyperEulerian-Type-Path-Cut is well-defined if and only if its SuperHyperEulerian-Type- 2577
Path-Cut is well-defined. 2578
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path-Cut, Super- 2579

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

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

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

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

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2615
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2616
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2617
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2618
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2619
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2620
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2621

which is a SuperHyperEulerian-Type-Path-Cut/SuperHyperPath. Then the number of 2624
(i) : the SuperHyperEulerian-Type-Path-Cut; 2625

(ii) : the SuperHyperEulerian-Type-Path-Cut; 2626
(iii) : the connected SuperHyperEulerian-Type-Path-Cut; 2627
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 2628
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 2629
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Cut. 2630
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2631
coincide. 2632

which is a SuperHyperWheel. Then the number of 2634
(i) : the dual SuperHyperEulerian-Type-Path-Cut; 2635
(ii) : the dual SuperHyperEulerian-Type-Path-Cut; 2636
(iii) : the dual connected SuperHyperEulerian-Type-Path-Cut; 2637
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 2638
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 2639
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut. 2640
coincide. 2642
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2644

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2645
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2646
is a 2647
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2651
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2652
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 2653

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2656
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2657
SuperHyperPart is a 2658

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2662
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2663
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 2664

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

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 2695
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2696
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2697
dual 2698
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 2702
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2705
perComplete. Then there’s no independent SuperHyperSet. 2706
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2707

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



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

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

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

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

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

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

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

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

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

Type-Path-Cut for N SHF; 2801
(ii) Γ = m for N SHF : (V, E); 2802
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2803
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2804
Path-Cut for N SHF : (V, E). 2805
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2806
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2807
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2808
SuperHyperEulerian-Type-Path-Cut for N SHF; 2809
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2810
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

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

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

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

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

SuperHyperEulerian-Type-Path-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Type- 2825
Path-Cut; 2826
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2827

SuperHyperEulerian-Type-Path-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 2828
Type-Path-Cut. 2829
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2832

SuperHyperEulerian-Type-Path-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Type- 2833
Path-Cut; 2834
SuperHyperEulerian-Type-Path-Cut, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2836

Type-Path-Cut. 2837
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2838

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

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

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

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

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


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

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


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

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

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

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

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

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


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

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

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

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

SuperHyperEulerian-Type-Path-Cut 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEulerian- 2933
Type-Path-Cut. 2934

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

141
Belong to The Extreme SuperHyperMultipartite

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

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEulerian-Type-Path- 2946
Cut. 2947

CHAPTER 16 2948
Wondering Open Problems But As The 2949
Directions To Forming The Motivations 2950
In what follows, some “problems” and some “questions” are proposed. 2951
The SuperHyperEulerian-Type-Path-Cut and the Extreme SuperHyperEulerian-Type-Path-Cut are defined on 2952
a real-world application, titled “Cancer’s Recognitions”. 2953
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2954
recognitions? 2955
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path-Cut 2956

and the Extreme SuperHyperEulerian-Type-Path-Cut? 2957
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2958
them? 2959
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 2960
and the Extreme SuperHyperEulerian-Type-Path-Cut?
Type-Path-Cut 2961
Problem 16.0.5. The SuperHyperEulerian-Type-Path-Cut and the Extreme SuperHyperEulerian-Type-Path- 2962

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

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

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

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

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

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

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

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

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

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

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

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

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

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3066

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3074
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3076
to its Extreme coefficient. 3077
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3078
mentioned Extreme Figures in every Extreme items. 3079
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3080
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3081
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3082
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3083
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3084
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3085
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3086
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- 3088
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3089
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3090
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3091
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3092
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3093
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3094


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

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 3138
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. 3142
(31.1), is the SuperHyperDuality. 3145
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 3147
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3187

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3287

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

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

SuperHyperJoin. 3308
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 3310
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3311
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3312
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3313
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3314
V3 , is excluded in every given Extreme SuperHyperJoin. 3315

is up. The Extreme Algorithm is Extremely straightforward. 3317


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

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

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


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

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



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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3516
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3518
to its Extreme coefficient. 3519
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3522
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3523
SuperHyperPerfect. 3529
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 3531
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3532
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3536


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

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

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

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

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



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

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

Then 3627

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



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

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

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


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

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

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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3681
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3683
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3684
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3685
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3686

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

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

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

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

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

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

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3733
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3735
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3736
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3737
cient. 3740
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3743
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3744
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3745
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3746
SuperHyperTotal. 3750
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 3752
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3753
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3754
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3755
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3756

V3 , is excluded in every given Extreme SuperHyperTotal. 3757



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

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

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

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

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

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

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



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

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



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

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

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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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


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

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

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 4026
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. 4030
(31.1), is the SuperHyperConnected. 4033
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 4035
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. 4042
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 4044



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4063

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


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

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



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

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

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


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

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

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

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

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

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

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

HG242; HG243; HG244; HG245; HG246; HG247], there are some endeavors to formalize 4240
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4241
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4242


HG158b; HG159b; HG160b; HG161b; HG162b]. Two popular scientific research 4254
books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutrosophic science 4255
is on [HG32b; HG44b]. 4256
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4257
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4258
than 4276 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4259
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4260
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4267
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4268
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4269

HG239; HG240; HG241; HG242; HG243; HG244; HG245; HG246; HG247] along- 4289

is on [HG32b; HG44b]. 4304

Bibliography 4305
10.33140/JMTCM.01.03.09) 4312
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4330
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4331
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4332
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4333
223
10.20944/preprints202301.0282.v1). 4340
10.20944/preprints202301.0267.v1). 4343
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4347

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4348
prints202301.0262.v1). 4352
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4358
prints202301.0105.v1). 4361
Preprints 2023, 2023010044 4367
(doi: 10.20944/preprints202301.0043.v1). 4370

(doi: 10.20944/preprints202212.0549.v1). 4379
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4380
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4381
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4382
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4383
(doi: 10.20944/preprints202212.0500.v1). 4386
10.5281/zenodo.7834229). 4395
10.5281/zenodo.7834261). 4398
10.5281/zenodo.7824560). 4401
(doi: 10.5281/zenodo.7824623). 4404

2023, (doi: 10.5281/zenodo.7809365). 4415
2023, (doi: 10.5281/zenodo.7809358). 4418
10.5281/zenodo.7809219). 4421
HG237 [35] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4422
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 4423
10.5281/zenodo.7809328). 4424
2023, (doi: 10.5281/zenodo.7806767). 4427
2023, (doi: 10.5281/zenodo.7806838). 4430
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4432
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4433
(doi: 10.5281/zenodo.7799902). 4439
2023, (doi: 10.5281/zenodo.7804218). 4442
(doi: 10.5281/zenodo.7796334). 4445
10.5281/zenodo.7791952). 4451

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4453
10.5281/zenodo.7791982). 4454
10.5281/zenodo.7790026). 4457
HG223 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4458
10.5281/zenodo.7790052). 4460
2023, (doi: 10.5281/zenodo.7787066). 4463
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4465
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4466
10.5281/zenodo.7781476). 4469
10.5281/zenodo.7783082). 4472
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4474
10.5281/zenodo.7777857). 4475
10.5281/zenodo.7779286). 4478
(doi: 10.5281/zenodo.7771831). 4481
2023, (doi: 10.5281/zenodo.7772468). 4484
10.13140/RG.2.2.20913.25446). 4487
HG212 [57] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4488
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4489
odo.7764916). 4490

10.13140/RG.2.2.11770.98247). 4493
10.13140/RG.2.2.12400.12808). 4496
2023, (doi: 10.13140/RG.2.2.22545.10089). 4499
10.13140/RG.2.2.11377.76644). 4505
10.13140/RG.2.2.23750.96329). 4508
10.13140/RG.2.2.31366.24641). 4511
10.13140/RG.2.2.34721.68960). 4514
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4516
2023, (doi: 10.13140/RG.2.2.30212.81289). 4517
10.13140/RG.2.2.24288.35842). 4523
10.13140/RG.2.2.32467.25124). 4526
10.13140/RG.2.2.31025.45925). 4529

10.13140/RG.2.2.17184.25602). 4532
10.13140/RG.2.2.23423.28327). 4535
10.13140/RG.2.2.28456.44805). 4538
10.13140/RG.2.2.23525.68320). 4541
HG194 [75] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4542
10.13140/RG.2.2.20170.24000). 4544
10.13140/RG.2.2.36475.59683). 4547
10.13140/RG.2.2.29764.71046). 4550
2023, (doi: 10.13140/RG.2.2.18780.87683). 4553
10.13140/RG.2.2.26134.01603). 4559
HG188 [81] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4560
10.13140/RG.2.2.27392.30721). 4562
10.13140/RG.2.2.33028.40321). 4565
10.13140/RG.2.2.21389.20966). 4568

10.13140/RG.2.2.16356.04489). 4571
10.13140/RG.2.2.21756.21129). 4574
HG183 [86] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4575
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4576
10.13140/RG.2.2.30983.68009). 4577
10.13140/RG.2.2.28552.29445). 4580
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4582
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4583
10.13140/RG.2.2.35105.89447). 4586
(doi: 10.13140/RG.2.2.30072.72960). 4589
10.13140/RG.2.2.31147.52003). 4592
10.13140/RG.2.2.32825.24163). 4595
10.13140/RG.2.2.13059.58401). 4598
10.13140/RG.2.2.11172.14720). 4601
2023, (doi: 10.13140/RG.2.2.22011.80165). 4604
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4607

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4609
2023, (doi: 10.13140/RG.2.2.10493.84962). 4610
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4613
2023, (doi: 10.13140/RG.2.2.19944.14086). 4616
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4619
(doi: 10.13140/RG.2.2.33103.76968). 4622
HG167 [102] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4623
(doi: 10.13140/RG.2.2.23037.44003). 4625
(doi: 10.13140/RG.2.2.35646.56641). 4628
(doi: 10.13140/RG.2.2.18030.48967). 4631
(doi: 10.13140/RG.2.2.13973.81121). 4634
2023, (doi: 10.13140/RG.2.2.34106.47047). 4637
2023, (doi: 10.13140/RG.2.2.31956.88961). 4643
2023, (doi: 10.13140/RG.2.2.15179.67361). 4646

10.13140/RG.2.2.21510.45125). 4649
HG158 [111] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4650
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4651
2023, (doi: 10.13140/RG.2.2.13121.84321). 4652
10.13140/RG.2.2.11758.69441). 4655
2023, (doi: 10.13140/RG.2.2.31891.35367). 4658
10.13140/RG.2.2.19360.87048). 4661
HG154 [115] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4662
10.13140/RG.2.2.32363.21286). 4664
10.13140/RG.2.2.23266.81602). 4667
10.13140/RG.2.2.19911.37285). 4670
10.13140/RG.2.2.11050.90569). 4673
HG150 [119] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4674
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4675
2023, (doi: 10.13140/RG.2.2.17761.79206). 4676
HG149 [120] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4677
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4678
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4681
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4682
(doi: 10.13140/RG.2.2.30182.50241). 4685

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

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4726
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4727
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4730
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4732
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4733

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4734

HG128 [140] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4739
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4740

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4741
2023,(doi: 10.13140/RG.2.2.36745.93289). 4744

10.20944/preprints202301.0282.v1). 4751
10.20944/preprints202301.0267.v1).). 4754
2023010265 (doi: 10.20944/preprints202301.0265.v1). 4759
prints202301.0262.v1). 4763


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

10.13140/RG.2.2.35061.65767). 4772

10.13140/RG.2.2.18494.15680). 4776

10.13140/RG.2.2.32530.73922). 4780
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4782

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4783
10.13140/RG.2.2.15897.70243). 4784

10.13140/RG.2.2.32530.73922). 4788

prints202301.0105.v1). 4791

10.13140/RG.2.2.23172.19849). 4798


10.13140/RG.2.2.17385.36968). 4808
Preprints 2023, 2023010044 4811
(doi: 10.20944/preprints202301.0043.v1). 4814
2023, (doi: 10.13140/RG.2.2.28945.92007). 4817
10.13140/RG.2.2.35774.77123). 4823

10.13140/RG.2.2.29430.88642). 4829
(doi: 10.20944/preprints202212.0549.v1). 4835
10.13140/RG.2.2.19380.94084). 4838

(doi: 10.20944/preprints202212.0500.v1). 4849
10.13140/RG.2.2.20993.12640). 4852
HG952 [174] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4853

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

10.13140/RG.2.2.29173.86244). 4867
HG38 [179] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4868
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4869
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4870
(doi: 10.5281/zenodo.7835063). 4872
(doi: 10.5281/zenodo.7826705). 4874
2023 (doi: 10.5281/zenodo.7820680). 4876

10.5281/zenodo.7812750). 4878


2023 (doi: 10.5281/zenodo.7807782). 4884
2023 (doi: 10.5281/zenodo.7804449). 4886

(doi: 10.5281/zenodo.7792307). 4890
(doi: 10.5281/zenodo.7790728). 4892
2023 (doi: 10.5281/zenodo.7787712). 4894
10.5281/zenodo.7783791). 4896
10.5281/zenodo.7780123). 4898
(doi: 10.5281/zenodo.7773119). 4900
odo.7637762). 4902
10.5281/zenodo.7766174). 4904
10.5281/zenodo.7762232). 4906
(doi: 10.5281/zenodo.7758601). 4908
10.5281/zenodo.7754661). 4910
10.5281/zenodo.7750995) . 4912

(doi: 10.5281/zenodo.7749875). 4914
10.5281/zenodo.7747236). 4916
10.5281/zenodo.7742587). 4918
(doi: 10.5281/zenodo.7738635). 4920
10.5281/zenodo.7734719). 4922
10.5281/zenodo.7730484). 4924
(doi: 10.5281/zenodo.7730469). 4926
10.5281/zenodo.7722865). 4928
odo.7713563). 4930
odo.7709116). 4932
10.5281/zenodo.7706415). 4934
(doi: 10.5281/zenodo.7706063). 4936
(doi: 10.5281/zenodo.7701906). 4938
odo.7700205). 4940
10.5281/zenodo.7694876). 4942
10.5281/zenodo.7679410). 4944
10.5281/zenodo.7675982). 4946
10.5281/zenodo.7672388). 4948

odo.7668648). 4950
10.5281/zenodo.7662810). 4952
10.5281/zenodo.7659162). 4954
HG120b [222] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4955
10.5281/zenodo.7653233). 4956
odo.7653204). 4958
odo.7653142). 4960
odo.7653117). 4962
odo.7653089). 4964
odo.7651687). 4966
odo.7651619). 4968
odo.7651439). 4970
odo.7650729). 4972
odo.7647868). 4974
odo.7647017). 4976
odo.7644894). 4978
odo.7641880). 4980
odo.7632923). 4982
odo.7623459). 4984

10.5281/zenodo.7606416). 4986
10.5281/zenodo.7606416). 4988
odo.7606404). 4990
10.5281/zenodo.7580018). 4992
odo.7580018). 4994
odo.7580018). 4996
odo.7579929). 4998
10.5281/zenodo.7563170). 5000
odo.7563164). 5002
odo.7563160). 5004
odo.7563160). 5006
10.5281/zenodo.7563160). 5008
10.5281/zenodo.7557063). 5010
10.5281/zenodo.7557009). 5012
10.5281/zenodo.7539484). 5014
10.5281/zenodo.7523390). 5016
10.5281/zenodo.7523390). 5018
10.5281/zenodo.7523390). 5020

odo.7574952). 5022
10.5281/zenodo.7574992). 5024
odo.7523357). 5026
10.5281/zenodo.7523357). 5028
10.5281/zenodo.7504782). 5030
10.5281/zenodo.7504782). 5032
10.5281/zenodo.7504782). 5034
10.5281/zenodo.7499395). 5036
odo.7499395). 5038
10.5281/zenodo.7499395). 5040
10.5281/zenodo.7497450). 5042
10.5281/zenodo.7497450). 5044
10.5281/zenodo.7494862). 5046
odo.7494862). 5048
10.5281/zenodo.7494862). 5050
10.5281/zenodo.7493845). 5052
10.5281/zenodo.7493845). 5054
10.5281/zenodo.7493845). 5056

odo.7539484). 5058
odo.7523390). 5060
odo.7523357). 5062
odo.7504782). 5064
odo.7499395). 5066
odo.7497450). 5068
odo.7494862). 5070
odo.7493845). 5072
odo.7480110). 5074
odo.7378758). 5076
HG32b [283] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5077
10.5281/zenodo.6320305). 5078
odo.6677173). 5080

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

is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5145
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5146
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5147
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5149
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5150
deforms and it doesn’t form. 5151
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5153
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5154
based on the fixed groups of cells or the fixed groups of group of cells? 5155
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5156
these messy and dense SuperHyperModels where embedded notions are illustrated? 5157

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5158
it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5159
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5160
the research has taken more motivations to define SuperHyperClasses and to find some 5161
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5166
research on the modeling of the regions where are under the attacks of the cancer to 5167
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5168
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5169
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5170
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5171
instances and literature reviews have taken the whole way through. In this scientific research, 5172
the literature reviews have fulfilled the lines containing the notions and the results. The 5173
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5174
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5175
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5176
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5177
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5178
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5179
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5180
figure out the background for the SuperHyperNotions. 5181

CHAPTER 25 5182
Neutrosophic Eulerian-Type-Path-Cut 5183
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5184
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5185
2023, (doi: 10.13140/RG.2.2.34953.52320). 5186

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5187
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5188
(doi: 10.13140/RG.2.2.33275.80161). 5189
10.13140/RG.2.2.11050.90569). 5192
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5193
10.13140/RG.2.2.17761.79206). 5195
10.13140/RG.2.2.19911.37285). 5198
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5199
10.13140/RG.2.2.23266.81602). 5201
10.13140/RG.2.2.19360.87048). 5204
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5205
10.13140/RG.2.2.32363.21286). 5207
10.13140/RG.2.2.11758.69441). 5210
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5211
10.13140/RG.2.2.31891.35367). 5213
10.13140/RG.2.2.21510.45125). 5216
249
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5217
10.13140/RG.2.2.13121.84321). 5219

CHAPTER 26 5220
New Ideas In Recognition of Cancer And 5221
Neutrosophic SuperHyperGraph By 5222
Eulerian-Type-Path-Cut As Hyper Eulogy 5223
On Super EULA 5224
251
CHAPTER 27 5225
ABSTRACT 5226
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5227
Type-Path-Cut ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path-Cut 5228

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5229
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Type-Path-Cut if 5230
the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path-Cut criteria holds 5231
∀Ea ∈ P : P is
Neutrosophic re-SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic 5232

e-SuperHyperEulerian-Type-Path-Cut criteria holds 5233
∀Ea ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 5234

v-SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic v- 5235
SuperHyperEulerian-Type-Path-Cut criteria holds 5236
∀Va ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut if the following expression is called Neutrosophic 5237

v-SuperHyperEulerian-Type-Path-Cut criteria holds 5238
∀Va ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5239
253

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut. ((Neutrosophic) SuperHyperEulerian-Type-Path- 5242
Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5243
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5244
SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neut- 5245
rosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and 5246
Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyperGraph 5247

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5248
high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 5249
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 5250
Extreme SuperHyperEulerian-Type-Path-Cut; a Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s either 5251
of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, 5252
Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut 5253

and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 5254
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5255
high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5256
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Cut; an 5257
Extreme SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either of Neutrosophic 5258
e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v- 5259

SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) 5260
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 5261
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5262
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality con- 5263
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5264
the Extreme SuperHyperEulerian-Type-Path-Cut; and the Extreme power is corresponded to its Extreme 5265
coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either 5266
of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, 5267
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5269
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 5271

SuperHyperEulerian-Type-Path-Cut; and the Neutrosophic power is corresponded to its Neutro- 5274
sophic coefficient; an Extreme V-SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic 5275
e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v- 5276

SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) 5277
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of 5278
an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 5279
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme Super- 5280
HyperVertices such that they form the Extreme SuperHyperEulerian-Type-Path-Cut; a Neutrosophic 5281
V-SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 5282

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic Super- 5284
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5285
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 5286

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 5287

they form the Neutrosophic SuperHyperEulerian-Type-Path-Cut; an Extreme V-SuperHyperEulerian- 5288
Type-Path-Cut SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, 5289
Neutrosophic re-SuperHyperEulerian-Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and 5290
Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyperGraph 5291
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5293
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5294
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5295
SuperHyperEulerian-Type-Path-Cut; and the Extreme power is corresponded to its Extreme coef- 5296
ficient; a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either of 5297

and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5300
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 5302
SuperHyperEulerian-Type-Path-Cut; and the Neutrosophic power is corresponded to its Neutrosophic 5305

coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5306
namely, a SuperHyperEulerian-Type-Path-Cut and Neutrosophic SuperHyperEulerian-Type-Path-Cut. Two 5307
different types of SuperHyperDefinitions are debut for them but the research goes further and the 5308
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 5309
and well-reviewed. The literature review is implemented in the whole of this research. For 5310
shining the elegancy and the significancy of this research, the comparison between this SuperHy- 5311
perNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. 5312
The definitions are followed by the examples and the instances thus the clarifications are driven 5313
with different tools. The applications are figured out to make sense about the theoretical aspect 5314
of this ongoing research. The “Cancer’s Recognition” are the under research to figure out the 5315
challenges make sense about ongoing and upcoming research. The special case is up. The cells 5316
are viewed in the deemed ways. There are different types of them. Some of them are individuals 5317
and some of them are well-modeled by the group of cells. These types are all officially called 5318
“SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The 5319
frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to 5320
research about “Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up 5321
some avenues to research on theoretical segments and “Cancer’s Recognition”. Some avenues are 5322
posed to pursue this research. It’s also officially collected in the form of some questions and some 5323
problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian- 5324
Type-Path-Cut is a maximal of SuperHyperVertices with a maximum cardinality such that either 5325
of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5326
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5327
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5328
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Path-Cut is a max- 5329
imal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such 5330
that either of the following expressions hold for the Neutrosophic cardinalities of SuperHy- 5331
perNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5332

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is 5333
a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 5334
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperEulerian- 5335
Type-Path-Cut . Since there’s more ways to get type-results to make a SuperHyperEulerian-Type-Path-Cut 5336
more understandable. For the sake of having Neutrosophic SuperHyperEulerian-Type-Path-Cut, there’s 5337
a need to “redefine” the notion of a “SuperHyperEulerian-Type-Path-Cut ”. The SuperHyperVertices 5338
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 5340
SuperHyperEulerian-Type-Path-Cut . It’s redefined a Neutrosophic SuperHyperEulerian-Type-Path-Cut if the 5341
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 5342
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 5343
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 5344
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 5345
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 5346
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5347
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5348
based on a SuperHyperEulerian-Type-Path-Cut . It’s the main. It’ll be disciplinary to have the 5349
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5350
SuperHyperEulerian-Type-Path-Cut until the SuperHyperEulerian-Type-Path-Cut, then it’s officially called a 5351

“SuperHyperEulerian-Type-Path-Cut” but otherwise, it isn’t a SuperHyperEulerian-Type-Path-Cut . There are 5352
some instances about the clarifications for the main definition titled a “SuperHyperEulerian-Type- 5353
Path-Cut ”. These two examples get more scrutiny and discernment since there are characterized 5354
in the disciplinary ways of the SuperHyperClass based on a SuperHyperEulerian-Type-Path-Cut . For 5355
the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Cut, there’s a need to “redefine” the 5356
notion of a “Neutrosophic SuperHyperEulerian-Type-Path-Cut” and a “Neutrosophic SuperHyperEulerian- 5357

Type-Path-Cut ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 5358
the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign 5359
to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Super- 5360
HyperGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Path-Cut are redefined to 5361
a “Neutrosophic SuperHyperEulerian-Type-Path-Cut” if the intended Table holds. It’s useful to define 5362
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5363
type-results to make a Neutrosophic SuperHyperEulerian-Type-Path-Cut more understandable. Assume 5364
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5365
intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Path-Cut, SuperHyperStar, 5366
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic Su- 5367
perHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Path-Cut”, “Neutrosophic SuperHyperStar”, 5368

“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 5369
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 5370
SuperHyperEulerian-Type-Path-Cut” where it’s the strongest [the maximum Neutrosophic value from 5371
all the SuperHyperEulerian-Type-Path-Cut amid the maximum value amid all SuperHyperVertices 5372
from a SuperHyperEulerian-Type-Path-Cut .] SuperHyperEulerian-Type-Path-Cut . A graph is a SuperHy- 5373
perUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are 5374
the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5375
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5376
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Cut if it’s only one Su- 5377
perVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5378

SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5379
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5380
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5381
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5382
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and 5388
the common and intended properties between “specific” cells and “specific group” of cells are 5389
SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5390
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in 5391
this case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 5392
will be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5393
in redeemed ways. The recognition of the cancer in the long-term function. The specific 5394
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 5395
the move from the cancer is identified by this research. Sometimes the move of the cancer 5396
fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Cut, SuperHyperStar, 5403

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5404
the longest SuperHyperEulerian-Type-Path-Cut or the strongest SuperHyperEulerian-Type-Path-Cut in 5405
those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Type-Path-Cut, called 5406
SuperHyperEulerian-Type-Path-Cut, and the strongest SuperHyperEulerian-Type-Path-Cut, called Neutro- 5407
sophic SuperHyperEulerian-Type-Path-Cut, some general results are introduced. Beyond that in 5408
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 5409
enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5410
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Path-Cut theory, 5413
SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5414

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Cut, Cancer’s Neutro- 5415
sophic Recognition 5416

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

Type-Path-Cut”. In the sense of tackling on getting results and in Eulerian-Type-Path-Cut to make 5490
sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5491
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5492
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5493
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5494
there are some smart steps toward the common notions to extend the new notions in new 5495

frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 5496

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5497
about the general SuperHyperRelations and as concluding and closing section of theoretical 5498
research are contained in the section “General Results”. Some general SuperHyperRelations 5499
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 5500
discussed in the sections, “General Results”, “ SuperHyperEulerian-Type-Path-Cut”, “Neutrosophic 5501
SuperHyperEulerian-Type-Path-Cut”, “Results on SuperHyperClasses” and “Results on Neutrosophic 5502

SuperHyperClasses”. There are curious questions about what’s done about the SuperHyperNotions 5503
to make sense about excellency of this research and going to figure out the word “best” as the 5504
description and adjective for this research as presented in section, “ SuperHyperEulerian-Type-Path- 5505
Cut”. The keyword of this research debut in the section “Applications in Cancer’s Recognition” 5506
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 5507
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 5508

SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 5509
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 5510
to make sense to figure out this research in featured style. The advantages and the limitations of 5511
this research alongside about what’s done in this research to make sense and to get sense about 5512
what’s figured out are included in the section, “Conclusion and Closing Remarks”. 5513

CHAPTER 29 5514
Neutrosophic Preliminaries Of This 5515
Scientific Research On the Redeemed 5516
Ways 5517
In this section, the basic material in this scientific research, is referred to [Single Valued 5518
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5519

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5520
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5521
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5522
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5523
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5524
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5525
their clarifications are addressed to Ref.[HG38]. 5526
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5527
the new ideas and their clarifications are elicited. 5528
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

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

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

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5568
x, y, z, w ∈ [0, 1]: 5569
(i) 1 ⊗ x = x; 5570
(ii) x ⊗ y = y ⊗ x; 5571
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5572
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5573

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

where 5576

1, 2, . . . , n0 ); 5581
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5582
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5583
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5584
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5585
0


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

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

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

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. 5642
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5643
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5644
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5645
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5646
perPath . 5647
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 5648
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5649
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5650
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5651
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5652
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5653

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

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


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

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

Cut). 5670
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Cut if the following expression is called 5674

Neutrosophic e-SuperHyperEulerian-Type-Path-Cut criteria holds 5675
∀Ea ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Cut if the following expression is called 5676

Neutrosophic re-SuperHyperEulerian-Type-Path-Cut criteria holds 5677
∀Ea ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5678
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Cut if the following expression is called 5679
∀Va ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Cut if the following expression is called 5681
∀Va ∈ P : P is

(v) Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e- 5684

Cut. 5687
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Cut). 5688

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


the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 5696
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Cut if it’s either of Neutrosophic e- 5699

Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 5703
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHy- 5704
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5705
(iii) an Extreme SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if it’s either 5707

of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re-SuperHyperEulerian- 5708
Type-Path-Cut, Neutrosophic v-SuperHyperEulerian-Type-Path-Cut, and Neutrosophic rv- 5709
SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyperGraph 5710

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 5711
cients defined as the Extreme number of the maximum Extreme cardinality of the 5712
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5713
(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial 5717

rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic SuperHy- 5720

perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5721
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 5722
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5725
Type-Path-Cut; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 5726

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

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

(vii) an Extreme V-SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial if 5743

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Cut, Neutrosophic re- 5744
rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for an Extreme SuperHyper- 5746
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5747
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5748
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5749

(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Cut SuperHyperPolynomial 5753

rosophic rv-SuperHyperEulerian-Type-Path-Cut and C(N SHG) for a Neutrosophic Supe- 5756
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5757
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5760

SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 5761
sophic SuperHyperEulerian-Type-Path-Cut; and the Neutrosophic power is corresponded to its 5762
Neutrosophic coefficient. 5763
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Cut). 5764

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


136TBL3
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5768
|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 5769

(29.1), holds if S is an δ−SuperHyperDefensive; 5770
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Cut is a Neutrosophic kind of Neut- 5771

rosophic SuperHyperEulerian-Type-Path-Cut such that either of the following Neutrosophic 5772
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5773
|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 5774

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5775
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5777
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5778
there’s the usage of the position of labels to assign to the values. 5779
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5781
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5782
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5783
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5785
sophic SuperHyperPath , SuperHyperEulerian-Type-Path-Cut, SuperHyperStar, SuperHyperBipart- 5786

ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5787
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5788
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5789
perHyperWheel if the Table (29.2) holds. 5790
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Path-Cut. 5791
Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Type-Path-Cut 5792

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

136TBL4

136TBL1
more Neutrosophicly understandable. 5793

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Cut”. The 5795
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5796
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5797
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Path-Cut. It’s redefined a Neutrosophic 5798

SuperHyperEulerian-Type-Path-Cut if the Table (29.3) holds. 5799

CHAPTER 30 5800
Neutrosophic SuperHyper But As Eulerian-Type-Path-Cut 5801
Super Forms 5803
Definition 30.0.1. (Neutrosophic event). 5804
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5805
is a probability Eulerian-Type-Path-Cut. Any Neutrosophic k-subset of A of V is called Neutrosophic 5806
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5807
following expression is called Neutrosophic probability of A. 5808
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5809

is a probability Eulerian-Type-Path-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5811

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5816
S = (V, E) is a probability Eulerian-Type-Path-Cut. Any k-function Eulerian-Type-Path-Cut like E is 5817

called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Path-Cut like E is 5818
called Neutrosophic Variable. 5819
The notion of independent on Neutrosophic Variable is likewise. 5820
Definition 30.0.4. (Neutrosophic Expectation). 5821
275
is a probability Eulerian-Type-Path-Cut. A Neutrosophic k-Variable E has a number is called 5823

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5824
criteria 5825
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5826
is a probability Eulerian-Type-Path-Cut. A Neutrosophic number is called Neutrosophic Crossing 5828
if the following expression is called Neutrosophic Crossing criteria 5829
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). 5830
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let m and n propose special Eulerian-Type- 5831
Path-Cut. Then with m ≥ 4n, 5832
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-Path-Cut p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5833
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5834
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5835

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

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

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

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5857
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5858
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5859
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5860
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5861
4/3 4/3
k < 4n + n < 5n . 5862
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5863
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let X be a nonnegative Neutrosophic 5864
Variable and t a positive real number. Then 5865
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. 5866
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5867
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let Xn be a nonnegative integer-valued 5868
variable in a probability Eulerian-Type-Path-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 5869

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

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5875
S = (V, E) is a probability Eulerian-Type-Path-Cut. A special SuperHyperGraph in Gn,p is up. Let 5876
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 5877
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 5878
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 5879
of the Neutrosophic SuperHyperGraph G. 5880
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5881
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5882
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 5883
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5884
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: 5885
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5886
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 5887
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5888
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5889
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5890
Definition 30.0.12. (Neutrosophic Variance). 5891
is a probability Eulerian-Type-Path-Cut. A Neutrosophic k-Variable E has a number is called 5893
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5894
criteria 5895
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let X be a Neutrosophic Variable and 5897
let t be a positive real number. Then 5898
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Type-Path-Cut. Let X be a Neutrosophic Variable and let t be a 5900
positive real number. Then 5901
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5902
Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let Xn be a Neutrosophic Variable in a 5904

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

Definition 30.0.18. (Neutrosophic Balanced). 5931

is a probability Eulerian-Type-Path-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5933
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5934
SubSuperHyperGraph is called Neutrosophic Balanced. 5935
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5936

(V, E). Consider S = (V, E) is a probability Eulerian-Type-Path-Cut. Let F be a nonempty 5937
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5938
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5939
SubSuperHyperGraph. 5940
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5943
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5944
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5945

SuperHyperEulerian-Type-Path-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5946
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5947
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5948

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5949
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5950
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5951
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5952
Neutrosophic SuperHyperEulerian-Type-Path-Cut. 5953
C(N SHG)Neutrosophic Eulerian-Type-Path-Cut

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

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

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

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

Path-Cut. 5963

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


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



= z8 + z4 + z3.
5968


= {E4 (E5 ), E1 , E2 }.
= z 5 + 2z 3 .
= {Vi ∈ VN SHG }.
= z 4 + z 3 + 2z 2 + 4z.
5972






= {E1 , E4 }.
= 2z 5 .
= {Vi ∈ VE1 , Vi ∈ VE4 }.
= z 7 + 2z 4 + 5z 3 + z 2 .
5976


= {Eii=110 , Eii=2232 }.
= 10z 2 .



= {Vii=122 }.
= z Vii=122 .
5980


= {Eii=110 , E17 , E14 , E13 }
= z 5 + 12z 2 .
= {Vi ∈ VN SHG }.
= 3z 6 + 5z 5 + 2z 4 + z 3 .
5984




= {E3 , E4 , E2 }.
= 2z 5 + z 3 .
= {Vii=414 , }.
= 3z 6 + 5z 5 + 2z 4 + z 3 .
5988


= {Eii=110 , E22 , E23 }.


= z 11 + 11z 2 .
= {Vii=122 }.
= z Vii=122 .
5992


= {E2 , E7 , E3 }.
= 2z 5 + z 3 .
= {Vii=414 }.
= 3z 6 + 5z 5 + 2z 4 + z 3 .
5996







= {E1 , E6 , E5 , E4 }.
= z 3 + 3z 2 .
= {Vii=16 }.
= 3z 5 + z 4 + 2z 3 .
6000


= {E1 , E6 }.


= z5 + z2.
= {Vii=13 , Vii=79 }
= z 8 + z 7 + z 6 + 3z 5 .
6004


= {E10 , E1 , E6 , E5 , E4 }.
= 5z 2 .
= {Vii=16 }.
= 3z 5 + z 4 + 2z 3 .
6008




= {E1 , E2 }.
= 2z 2 .
= {V1 , V2 , V3 }.
= 2z 5 + z 3 .
6012


= {E1 , E2 , E3 , E4 , E5 }.


= 5z 2 .
= {V1 , V2 , V3 , V4 , V5 , V6 }.
= 3z 5 + z 4 + 2z 3 .
6016


= {Ei ∈ EN SHG }.


X
= {Vi ∈ VN SHG }.
X
6020


= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
6024







= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
6028


= {Ei ∈ EN SHG \ {Ej }}.



X
X |V ∈V
6032


= {Ei , Ej }.
= z |Ei | + z |Ej | .
= {VEi , VEj }.


X
= z VEi + z VEj .
6036


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


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

= {Ei ∈ EN SHG \ {E1 }}.
X
= z |Ei ∈EN SHG \{E1 }| .
= {Vi ∈ VN SHG \ {VE1 }}.
X
= z |Vi ∈VN SHG \{VE1 }| .
6044
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6045
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type- 6046


Neutrosophic SuperHyperEulerian-Type-Path-Cut in the Neutrosophic Example (42.0.3) 95NHG2
Path-Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6047
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6048
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6049
them. 6050
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6051
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6052
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6053
Neutrosophic quasi-R-Eulerian-Type-Path-Cut minus all Neutrosophic SuperHypeNeighbor to some of 6054
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6055
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6056
quasi-R-Eulerian-Type-Path-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6057
all of them. 6058
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-Path-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6059
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6060
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6061
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6062
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6063

Neutrosophic Eulerian-Type-Path-Cut in some cases but the maximum number of the Neutrosophic 6064
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6065
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Path-Cut. 6066
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

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

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

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

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

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

targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,

the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Eulerian-Type-Path-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-Path-Cut
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic
R-Eulerian-Type-Path-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-Path-Cut since either the Neutrosophic SuperHyperGraph is an obvious
Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic usage of
this Neutrosophic framework and even more there’s no Neutrosophic connection inside or the
Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a Neutrosophic
contradiction with the term “Neutrosophic R-Eulerian-Type-Path-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-Path-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-Path-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-Path-Cut.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Eulerian-Type-Path-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-Path-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Path-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-Path-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, 6074
Neutrosophic R-Eulerian-Type-Path-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6075
Neutrosophic R-Eulerian-Type-Path-Cut =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Path-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-Path-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-Path-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6076
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6077
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 6078
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6079
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6080
to Neutrosophic Eulerian-Type-Path-Cut in some cases but the maximum number of the Neutrosophic 6081

SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6082

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Path-Cut. 6083
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6084
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6085
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6086
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6087
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6088

to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6089
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6090
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6091
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6092
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6093
Neutrosophic quasi-R-Eulerian-Type-Path-Cut where the Neutrosophic completion of the Neutrosophic 6094

incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Eulerian-Type-Path-Cut. 6095
The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In 6096
the original setting, these types of SuperHyperSets only don’t satisfy on the maximum Super- 6097
HyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6098
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6099
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6100
minimum Neutrosophic style of the embedded Neutrosophic R-Eulerian-Type-Path-Cut. The interior 6101
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6102
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6103
common connections, more precise and more formal, the perfect unique connections inside the 6104
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the 6105
Neutrosophic R-Eulerian-Type-Path-Cut. Thus Neutrosophic exterior SuperHyperVertices could be 6106

used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6107
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6108
embedded Neutrosophic Eulerian-Type-Path-Cut, there’s the usage of exterior Neutrosophic SuperHy- 6109
perVertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6110
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6111
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6112
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6113
Neutrosophic R-Eulerian-Type-Path-Cut. The Neutrosophic R-Eulerian-Type-Path-Cut with the exclusion of 6114
the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and 6115
with other terms, the Neutrosophic R-Eulerian-Type-Path-Cut with the inclusion of all Neutrosophic 6116
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian- 6117

Type-Path-Cut. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6118
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6119
the maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of 6120
any given Neutrosophic quasi-R-Eulerian-Type-Path-Cut minus all Neutrosophic SuperHypeNeighbor 6121
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6122
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices 6123

in an Neutrosophic quasi-R-Eulerian-Type-Path-Cut, minus all Neutrosophic SuperHypeNeighbor to 6124
some of them but not all of them. 6125
The main definition of the Neutrosophic R-Eulerian-Type-Path-Cut has two titles. a Neut- 6126
rosophic quasi-R-Eulerian-Type-Path-Cut and its corresponded quasi-maximum Neutrosophic R- 6127

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6128
ber, there’s a Neutrosophic quasi-R-Eulerian-Type-Path-Cut with that quasi-maximum Neutrosophic 6129
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6130
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6131
lead us to take the collection of all the Neutrosophic quasi-R-Eulerian-Type-Path-Cuts for all Neut- 6132
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6133
of the Neutrosophic Eulerian-Type-Path-Cut ends up but this essence starts up in the terms of the 6134
Neutrosophic quasi-R-Eulerian-Type-Path-Cut, again and more in the operations of collecting all the 6135
Neutrosophic quasi-R-Eulerian-Type-Path-Cuts acted on the all possible used formations of the Neut- 6136
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 6137
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Path-Cuts. Let 6138
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Path-Cut be a Neutro- 6139
sophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Path-Cut. Then 6140
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Path-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Path-Cut is re-formalized 6141
and redefined as follows. 6142
GNeutrosophic Eulerian-Type-Path-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 6143
definition for the Neutrosophic Eulerian-Type-Path-Cut. 6144
GNeutrosophic Eulerian-Type-Path-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- 6145
poses the upcoming expressions.
Type-Path-Cut 6146

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

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

And then, 6148

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


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

6151


6152

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6153
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6154
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6155
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6156
Type-Path-Cut” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Type-Path-Cut” 6157
since “Neutrosophic Quasi-Eulerian-Type-Path-Cut” happens “Neutrosophic Eulerian-Type-Path-Cut” in a 6158
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Super- 6159
HyperNeighborhood” may not happens “Neutrosophic Eulerian-Type-Path-Cut” in a Neutrosophic 6160
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6161
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6162
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Type-Path-Cut”, 6163
and “Neutrosophic Eulerian-Type-Path-Cut” are up. 6164
Thus, let 6165
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6166
GNeutrosophic Eulerian-Type-Path-Cut be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6167
borhood and a Neutrosophic Eulerian-Type-Path-Cut and the new terms are up. 6168
GNeutrosophic Eulerian-Type-Path-Cut ∈ ∪zNeutrosophic Number

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

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |

6171
And with go back to initial structure, 6172
GNeutrosophic Eulerian-Type-Path-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6174

6175


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

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Eulerian-Type-Path-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-Path-Cut is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-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-Path-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-

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

, not:
Type-Path-Cut
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6176
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6177
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6178
type-SuperHyperSet called the 6179
“Neutrosophic R-Eulerian-Type-Path-Cut” 6180
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6181
Neutrosophic R-Eulerian-Type-Path-Cut, 6182
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-Path-Cut amid those obvious simple Neutro-
sophic type-SuperHyperSets of the Neutrosophic Eulerian-Type-Path-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-Path-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Path-Cut is the cardinality of
6183
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6184
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Path- 6185

Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6186
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6187
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6188
amount of them. 6189
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6190
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6191

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6192
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6193
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6194
Consider there’s a Neutrosophic R-Eulerian-Type-Path-Cut with the least cardinality, the lower 6195
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6196
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6197
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6198
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6199
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Path-Cut. Since it doesn’t 6200
have 6201
6202
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6203

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6204
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6205
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6206
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6207
Type-Path-Cut. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6208
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6209

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6210
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6211
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6212
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6213
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6214
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6215
obvious Neutrosophic R-Eulerian-Type-Path-Cut, VESHE is up. The obvious simple Neutrosophic 6216
type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-Path-Cut, VESHE , is a Neutrosophic Supe- 6217
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6218
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6219
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6220
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6221
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6222

a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6223
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6224
R-Eulerian-Type-Path-Cut only contains all interior Neutrosophic SuperHyperVertices and all exterior 6225
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6226
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6227
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6228

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6229
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6230
The SuperHyperNotion, namely, Eulerian-Type-Path-Cut, is up. There’s neither empty SuperHy- 6231
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6232
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6233
the Neutrosophic Eulerian-Type-Path-Cut. The Neutrosophic SuperHyperSet of Neutrosophic 6234

SuperHyperEdges[SuperHyperVertices], 6235

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

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


= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6238

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

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6244
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6245
Neutrosophic Eulerian-Type-Path-Cut is up. The obvious simple Neutrosophic type-SuperHyperSet 6246
called the Neutrosophic Eulerian-Type-Path-Cut is a Neutrosophic SuperHyperSet includes only two 6247
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6248

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- 6250
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6251
Eulerian-Type-Path-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6252

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

.
Type-Path-Cut Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6255
perEdges[SuperHyperVertices], 6256

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

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6258
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6259
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Cut 6260
and it’s an Neutrosophic Eulerian-Type-Path-Cut. Since it’s 6261

6262
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6264
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6265
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6266
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6267

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

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- 6269

, not:
Path-Cut 6270

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

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- 6272
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6273
Neutrosophic type-SuperHyperSet called the 6274
“Neutrosophic Eulerian-Type-Path-Cut ” 6275
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6276
Neutrosophic ,
Eulerian-Type-Path-Cut 6277
is only and only 6278

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

CHAPTER 31 6280
The Neutrosophic Departures on The 6281
Theoretical Results Toward Theoretical 6282
Motivations 6283
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6284
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6286

= {Ei ∈ EN SHG }.
X
= {Vi ∈ VN SHG }.
X
= z |Vi ∈VN SHG |.
6287
(31.2)
Proof. Let 6288
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
317
6289
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6290

6294
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6295
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6296
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Path-Cut. 6297
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6298

= {Ei ∈ EN SHG \ {Ej }}.
X
X |V ∈V
Proof. Let 6299
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6300
P :

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

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

6305
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6306
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6307
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Path-Cut. 6308

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

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

= {Ei , Ej }.
= z |Ei | + z |Ej | .
= {VEi , VEj }.
z |VEi | + z |VEj | .
X
=
Proof. Let 6310
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6311
P :
E1 , V1EXT ERN AL ,

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

Neutrosophic SuperHyperEulerian-Type-Path-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 6312

6316
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6317
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6318
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6319
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6320
the Neutrosophic SuperHyperEulerian-Type-Path-Cut. 6321

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

= {Ei ∈ PNmin
SHG }.
X min
= {VEi ∈PNmin
SHG
}.
X |V min |
= z Ei ∈PN SHG .
Proof. Let 6324
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6325
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). 6326

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

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

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

Then 6345

= {Ei ∈ PNmin
SHG }.
X min
= {VEi ∈PNmin
SHG
}.
X |V min |
= z Ei ∈PN SHG .
Proof. Let 6346
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6347
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Path-Cut taken from a connected Neutrosophic SuperHyper- 6348

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


are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6354
P :
V1EXT ERN AL , E1 ,

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

V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6356
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6357
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6361
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6362
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6363
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6364
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Path-Cut. 6365
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6366
Then, 6367

= {Ei ∈ (EN SHG \ {Ej }) ∪ {Ek∗ }}.

X ∗
= z |Ei ∈(EN SHG \{Ej })∪{Ek }| .
= {VEi ∈(EN SHG \{Ej })∪{Ek∗ } }.
X |V ∗ |
= z Ei ∈(EN SHG \{Ej })∪{Ek } .
Proof. Let 6368
P :
CEN T ER, E2∗
6369
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Path-Cut taken from a connected Neutrosophic SuperHyper- 6370

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

Then there’s at least one SuperHyperEulerian-Type-Path-Cut. Thus the notion of quasi isn’t up and 6374
the SuperHyperNotions based on SuperHyperEulerian-Type-Path-Cut could be applied. The unique 6375
embedded SuperHyperEulerian-Type-Path-Cut proposes some longest SuperHyperEulerian-Type-Path-Cut 6376
excerpt from some representatives. The latter is straightforward. 6377
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6378
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6379
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6380
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6381
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Path-Cut. 6382

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6383
The Surveys of Mathematical Sets On 6384
The Results But As The Initial Motivation 6385
For the SuperHyperEulerian-Type-Path-Cut, Neutrosophic SuperHyperEulerian-Type-Path-Cut, and the 6386

Neutrosophic SuperHyperEulerian-Type-Path-Cut, some general results are introduced. 6387
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Path-Cut is “redefined” 6388
on the positions of the alphabets. 6389
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Path-Cut. Then 6390
N eutrosophic SuperHyperEulerian − T ype − P ath − Cut =

{theSuperHyperEulerian − T ype − P ath − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − Cut
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−P ath−Cut. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6391
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6392
the neutrality, for i = 1, 2, 3, respectively. 6393
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6394
alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Path-Cut and SuperHyperEulerian- 6395
Type-Path-Cut coincide. 6396
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6397
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6398
SuperHyperEulerian-Type-Path-Cut if and only if it’s a SuperHyperEulerian-Type-Path-Cut. 6399
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6400
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6401
SuperHyperEulerian-Type-Path-Cut if and only if it’s a longest SuperHyperEulerian-Type-Path-Cut. 6402
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6403
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path-Cut is its 6404
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Cut, 6406

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6407
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path-Cut is its 6408
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6410

SuperHyperEulerian-Type-Path-Cut isn’t well-defined if and only if its SuperHyperEulerian-Type-Path- 6411
Cut isn’t well-defined. 6412
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6413

Neutrosophic SuperHyperEulerian-Type-Path-Cut isn’t well-defined if and only if its SuperHyperEulerian- 6414

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6417
Neutrosophic SuperHyperEulerian-Type-Path-Cut isn’t well-defined if and only if its SuperHyperEulerian- 6418
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6420

SuperHyperEulerian-Type-Path-Cut is well-defined if and only if its SuperHyperEulerian-Type-Path-Cut is 6421
well-defined. 6422
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6423
Neutrosophic SuperHyperEulerian-Type-Path-Cut is well-defined if and only if its SuperHyperEulerian- 6424

Type-Path-Cut is well-defined. 6425
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6427

Neutrosophic SuperHyperEulerian-Type-Path-Cut is well-defined if and only if its SuperHyperEulerian- 6428
Type-Path-Cut is well-defined. 6429
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6430
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6431
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6432
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6433
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6434
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6435
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 6436
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6437
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6440

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

independent SuperHyperSet is 6445
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6448
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6452

Graph which is a SuperHyperEulerian-Type-Path-Cut/SuperHyperPath. Then V is a maximal 6453
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6457
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6458
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6459
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6461
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6462
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6466
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6467
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6468
Graph which is a SuperHyperEulerian-Type-Path-Cut/SuperHyperPath. Then the number of 6471

(i) : the SuperHyperEulerian-Type-Path-Cut; 6472
(ii) : the SuperHyperEulerian-Type-Path-Cut; 6473
(iii) : the connected SuperHyperEulerian-Type-Path-Cut; 6474
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 6475
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 6476
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Cut. 6477
coincide. 6479

Graph which is a SuperHyperWheel. Then the number of 6481
(i) : the dual SuperHyperEulerian-Type-Path-Cut; 6482
(ii) : the dual SuperHyperEulerian-Type-Path-Cut; 6483
(iii) : the dual connected SuperHyperEulerian-Type-Path-Cut; 6484
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 6485
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut; 6486
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Cut. 6487
coincide. 6489
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6490

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6502
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6503
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6504
SuperHyperPart is a 6505
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6509
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6510
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 6511
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6513

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6532
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6533
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6534
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6535

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6543
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6544
of dual 6545
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6549

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6553

SuperHyperEulerian-Type-Path-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6555
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6556
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6560
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6561
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut. 6562


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


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

a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 6578
(i) v ∈ Ns (x); 6579
(ii) vx ∈ E. 6580
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6581

a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut, then 6582
(i) S is SuperHyperEulerian-Type-Path-Cut set; 6583
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6584
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6585
(i) Γ ≤ O; 6586
(ii) Γs ≤ On . 6587
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6588
connected. Then 6589
(i) Γ ≤ O − 1; 6590
(ii) Γs ≤ On − Σ3i=1 σi (x). 6591
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6592

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6596
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6597
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6599
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Cut; 6600
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6601
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6602
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6603
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Cut. Then 6605
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6606

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6616
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6617
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6619
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Cut; 6620
(ii) Γ = 1; 6621
(iii) Γs = Σ3i=1 σi (c); 6622
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Path-Cut. 6623
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6624

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6625
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6627
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6628
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6629
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6631
b n c+1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type- 6632
Path-Cut; 6633
(ii) Γ = b n2 c + 1; 6634

b n c+1 ; 6635
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6636
Type-Path-Cut. 6637
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6638
bnc
2
Cut; 6640
(ii) Γ = b n2 c; 6641

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

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

Type-Path-Cut for N SHF; 6648
(ii) Γ = m for N SHF : (V, E); 6649
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6650
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6651
Path-Cut for N SHF : (V, E). 6652
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6653
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6654

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

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

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

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

SuperHyperEulerian-Type-Path-Cut, then S is an s-SuperHyperDefensive SuperHyperEulerian-Type- 6672
Path-Cut; 6673

SuperHyperEulerian-Type-Path-Cut, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 6675
Type-Path-Cut. 6676
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6679
SuperHyperEulerian-Type-Path-Cut, then S is an s-SuperHyperPowerful SuperHyperEulerian-Type- 6680

Path-Cut; 6681

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

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6727
Type-Path-Cut; 6728
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6729

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

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


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

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

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


CHAPTER 33 6745
Neutrosophic Applications in Cancer’s 6746
Neutrosophic Recognition 6747
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6748
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6749
disease is considered and as the consequences of the model, some parameters are used. The 6750
cells are under attack of this disease but the moves of the cancer in the special region are the 6751
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6752
treatments for this Neutrosophic disease. 6753
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6754
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6755
Neutrosophic function. 6756
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6757
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6758
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6759
easily identified since there are some determinacy, indeterminacy and neutrality about the 6760
moves and the effects of the cancer on that region; this event leads us to choose another 6761
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6762
what’s happened and what’s done. 6763
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6764
known and they’ve got the names, and some general Neutrosophic models. The moves and 6765
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6766
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path- 6767
Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 6768
The aim is to find either the Neutrosophic SuperHyperEulerian-Type-Path-Cut or the Neutrosophic 6769
SuperHyperEulerian-Type-Path-Cut in those Neutrosophic Neutrosophic SuperHyperModels. 6770
341
CHAPTER 34 6771
Case 1: The Initial Neutrosophic Steps 6772
Toward Neutrosophic 6773
SuperHyperBipartite as Neutrosophic 6774
SuperHyperModel 6775
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6776
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6777
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6778
perBipartite is obtained. 6779
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6780
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6781
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6782

CHAPTER 35 6784
Case 2: The Increasing Neutrosophic 6785
Steps Toward Neutrosophic 6786
SuperHyperMultipartite as 6787
Neutrosophic SuperHyperModel 6788
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6789
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6790
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6791
perMultipartite is obtained. 6792
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6793
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6795

CHAPTER 36 6797
Wondering Open Problems But As The 6798
Directions To Forming The Motivations 6799
In what follows, some “problems” and some “questions” are proposed. 6800
The SuperHyperEulerian-Type-Path-Cut and the Neutrosophic SuperHyperEulerian-Type-Path-Cut are defined 6801
on a real-world application, titled “Cancer’s Recognitions”. 6802
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6803
recognitions? 6804
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path-Cut 6805

and the Neutrosophic SuperHyperEulerian-Type-Path-Cut? 6806
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6807
them? 6808
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6809
and the Neutrosophic SuperHyperEulerian-Type-Path-Cut?
Type-Path-Cut 6810
Problem 36.0.5. The SuperHyperEulerian-Type-Path-Cut and the Neutrosophic SuperHyperEulerian- 6811

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Type-Path-Cut 6812
SuperHyperEulerian-Type-Path-Cut, are there else? 6813
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6814
Numbers types-results? 6815
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6816
the multiple types of SuperHyperNotions? 6817
347
CHAPTER 37 6818
Conclusion and Closing Remarks 6819
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6820
research are illustrated. Some benefits and some advantages of this research are highlighted. 6821
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6822
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Path-Cut. 6823
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6824
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6825
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Type-Path-Cut, finds 6826
the convenient background to implement some results based on that. Some SuperHyperClasses 6827
and some Neutrosophic SuperHyperClasses are the cases of this research on the modeling of the 6828
regions where are under the attacks of the cancer to recognize this disease as it’s mentioned 6829
on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 6830
SuperHyperEulerian-Type-Path-Cut, the new SuperHyperClasses and SuperHyperClasses, are intro- 6831
duced. Some general results are gathered in the section on the SuperHyperEulerian-Type-Path-Cut 6832
and the Neutrosophic SuperHyperEulerian-Type-Path-Cut. The clarifications, instances and literature 6833
reviews have taken the whole way through. In this research, the literature reviews have fulfilled 6834
the lines containing the notions and the results. The SuperHyperGraph and Neutrosophic Su- 6835
perHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are 6836
the background of this research. Sometimes the cancer has been happened on the region, full 6837
of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 6838
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 6839
and strongest styles with the formation of the design and the architecture are formally called “ 6840
SuperHyperEulerian-Type-Path-Cut” in the themes of jargons and buzzwords. The prefix “SuperHyper” 6841
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 6842
In the Table (37.1), benefits and avenues for this research are, figured out, pointed out and 6843
spoken out. 6844
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Cut
3. Neutrosophic SuperHyperEulerian-Type-Path-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6845
Neutrosophic SuperHyperDuality But As 6846
Super Forms 6848
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6849

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6853

Va ∈ Ei , Ej ; 6854
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6855

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6856
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6857

Vi , Vj ∈ Ea ; 6858
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6859

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6860
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6861

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6862
sophic rv-SuperHyperDuality. 6863
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6864

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6867

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6869
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6870
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6871
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6872
form the Extreme SuperHyperDuality; 6873
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6874

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6876
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6877
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6878
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6879
such that they form the Neutrosophic SuperHyperDuality; 6880
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6881
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6882

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6883
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6884
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6885
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6886
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6888
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6890

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6892
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6893
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6894
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6895
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6898
coefficient; 6899
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6900

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6902
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6903
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6904
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6905
form the Extreme SuperHyperDuality; 6906
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6907

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6908
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6909
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6910
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6911
such that they form the Neutrosophic SuperHyperDuality; 6913
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6914

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6915
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6916

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6918
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6921
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6923

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6925

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6928
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6931
coefficient. 6932
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6933
the mentioned Neutrosophic Figures in every Neutrosophic items. 6934

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6936
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6937
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6938
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6939
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6940
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6941
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6942
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 6946
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6947
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6948
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6949
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6950

every given Neutrosophic SuperHyperDuality. 6951




C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .

3 × 3z 2 .



C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.







C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6992
Neutrosophic SuperHyperClasses. 6993
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 6995
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. 7002
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 7004
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7011
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 7013


the Neutrosophic SuperHyperDuality. 7022
Then 7024
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 7025
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7031
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7034

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7035
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7044

(V, E). Then 7045

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 7046
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7047


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7051
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7052
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), 7063
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7064
Then, 7066
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 7067
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 7068


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7073
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7074
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7080

CHAPTER 39 7081
Neutrosophic SuperHyperJoin But As 7082
Super Forms 7084
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7085

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7089
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7091

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7092
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7094

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7096

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7099

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7100
rv-SuperHyperJoin. 7101
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7102

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

365

Extreme SuperHyperJoin; 7111
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7112

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7114
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7115
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7116
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7117

form the Neutrosophic SuperHyperJoin; 7118
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7119

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7120
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7121
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7126
coefficient; 7127
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7128

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7129
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7130
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7131
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7132

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7135
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7136
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7137

Extreme SuperHyperJoin; 7143
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7144

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7146
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7147
form the Neutrosophic SuperHyperJoin; 7150

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7151

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7153
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7157

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7158
to its Extreme coefficient; 7159
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7160

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7162
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7163

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7168
coefficient. 7169
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7173

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7174

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7239

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7248
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 7250


the Neutrosophic SuperHyperJoin. 7259
Then 7261
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 7262
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 7268
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7270

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7281

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7283


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

Then, 7301

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

.
Proof. Let 7302
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7303


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7307
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7308
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7309
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7314

CHAPTER 40 7315
Neutrosophic SuperHyperPerfect But As 7316
Super Forms 7318
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7319

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

Va ∈ Ei , Ej ; 7324
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7325

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7331

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7332
rv-SuperHyperPerfect. 7333
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7334

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7339
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7344

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7346
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7347
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7348
form the Neutrosophic SuperHyperPerfect; 7350
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7351

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7352
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7353
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7356
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7360

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7362
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7368
coefficient; 7369
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7370

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7378
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7379
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7380
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7381
such that they form the Neutrosophic SuperHyperPerfect; 7383
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7384

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7386

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7389
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7393

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7395

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7401
coefficient. 7402

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7406

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7472
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 7474
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7492
Then 7494
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 7495
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 7499
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7500
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7501
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7504

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7515

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7538


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7541
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7542
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7543
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7544
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7550

CHAPTER 41 7551
Neutrosophic SuperHyperTotal But As 7552
Super Forms 7554
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7555

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7559

Va ∈ Ei , Ej ; 7560
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7561

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7562
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7563

Vi , Vj ∈ Ea ; 7564
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7565

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7567

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7568
rv-SuperHyperTotal. 7569
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7570

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7575
Extreme SuperHyperTotal; 7579
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7580

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7582
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7583
form the Neutrosophic SuperHyperTotal; 7586
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7587
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7588

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7589
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7594
coefficient; 7595
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7596
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7597

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7598
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7599
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7604
cient; 7605
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7606

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7608
Extreme SuperHyperTotal; 7612
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7613

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7615
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7616
form the Neutrosophic SuperHyperTotal; 7619
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7620

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7621
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7622


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7627
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7629

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7630
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7631
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7632

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7637
cient. 7638

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7642
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. 7657




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7708
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 7710
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. 7717
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 7719



the Neutrosophic SuperHyperTotal. 7728
Then 7730
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 7731
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7737
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7739
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7750

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7757
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. 7768
Then, 7770
∗
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 7771
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7772


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7776
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7777

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7778
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7784

CHAPTER 42 7785
Neutrosophic SuperHyperConnected But 7786
As The Extensions Excerpt From Dense 7787
And Super Forms 7788
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7789

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7793
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7794
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7795

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7796
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7797
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7798

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7799
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7800

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7801
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7802
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7803
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7804
rosophic rv-SuperHyperConnected. 7805
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7806

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7809
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7810
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7811
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7812
407
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7813

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7814
that they form the Extreme SuperHyperConnected; 7815
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7816

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7817
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7818
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7819
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7820
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7821

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7822
nected; 7823
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7824

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7825
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7826
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7827
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7828
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7829

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7831
Extreme power is corresponded to its Extreme coefficient; 7832
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7833

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7834
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7835
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7836
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7838

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7840
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7841
its Neutrosophic coefficient; 7842
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7843

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7846
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7847

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7848
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7849
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7850

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7853
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7854
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7855

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7856
nected; 7857
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7858

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7861
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7862
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7863
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7864

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7865
and the Extreme power is corresponded to its Extreme coefficient; 7866
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7867

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7870

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7872
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7874
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7875
its Neutrosophic coefficient. 7876
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7879
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7880
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7882
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7883
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7884
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7885
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7886
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. 7894


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 7938
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. 7945
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 7947
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. 7954
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 7956



the Neutrosophic SuperHyperConnected. 7965
Then 7967
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 7968
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 7973
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7974
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7977

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7988
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 7989
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7990


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7994
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7995
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7996
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. 8007
Then, 8009
∗
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 8010
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8011


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8014
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8015
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8016
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8017
some representatives. The latter is straightforward. 8018
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8023

CHAPTER 43 8024
Background 8025
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 8032
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 8033
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 8034
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 8035
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 8036
results based on initial background. 8037
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8038
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8039
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8046
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8047
and fundamental SuperHyperNumbers. 8048
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 8049
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 8050
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8051
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8052

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


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 8085
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 8086
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 8087
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 8088
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 8089

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

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 8095
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 8096
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 8097
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 8098
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 8099
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 8100

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

Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry 8105
Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s 8106
Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), 8107
“The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 8108
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) Su- 8109
perHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique 8110
Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks 8111
By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry 8112
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s 8113
Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition 8114
called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 8115
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 8116
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 8117

(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 8118
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 8119
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 8120
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 8121
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 8122
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 8123
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 8124
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8125
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8126
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 8127
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 8128
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 8129

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 8130
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 8131
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 8132
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 8133
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 8134
Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 8135
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 8136
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based 8137
on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 8138
Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 8139

HG242; HG243; HG244; HG245; HG246; HG247], there are some endeavors to formalize 8156
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8157


is on [HG32b; HG44b]. 8172
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8173
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8174
than 4276 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8175
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8176
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8183
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8184
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8185

HG239; HG240; HG241; HG242; HG243; HG244; HG245; HG246; HG247] along- 8205

is on [HG32b; HG44b]. 8220

Bibliography 8221
10.33140/JMTCM.01.03.09) 8228
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8246
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8247
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8248
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8249
427
10.20944/preprints202301.0282.v1). 8256
10.20944/preprints202301.0267.v1). 8259

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8264
prints202301.0262.v1). 8268
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8274
prints202301.0105.v1). 8277
Preprints 2023, 2023010044 8283
(doi: 10.20944/preprints202301.0043.v1). 8286

(doi: 10.20944/preprints202212.0549.v1). 8295
(doi: 10.20944/preprints202212.0500.v1). 8302
10.5281/zenodo.7834229). 8311
10.5281/zenodo.7834261). 8314
10.5281/zenodo.7824560). 8317
(doi: 10.5281/zenodo.7824623). 8320

2023, (doi: 10.5281/zenodo.7809365). 8331
2023, (doi: 10.5281/zenodo.7809358). 8334
10.5281/zenodo.7809219). 8337
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 8339
10.5281/zenodo.7809328). 8340
2023, (doi: 10.5281/zenodo.7806767). 8343
2023, (doi: 10.5281/zenodo.7806838). 8346
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8348
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8349
(doi: 10.5281/zenodo.7799902). 8355
2023, (doi: 10.5281/zenodo.7804218). 8358
(doi: 10.5281/zenodo.7796334). 8361
10.5281/zenodo.7791952). 8367

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8369
10.5281/zenodo.7791982). 8370
10.5281/zenodo.7790026). 8373
HG223 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8374
10.5281/zenodo.7790052). 8376
2023, (doi: 10.5281/zenodo.7787066). 8379
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8381
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8382
10.5281/zenodo.7781476). 8385
10.5281/zenodo.7783082). 8388
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8390
10.5281/zenodo.7777857). 8391
10.5281/zenodo.7779286). 8394
(doi: 10.5281/zenodo.7771831). 8397
2023, (doi: 10.5281/zenodo.7772468). 8400
10.13140/RG.2.2.20913.25446). 8403
HG212 [57] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8404
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8405
odo.7764916). 8406

10.13140/RG.2.2.11770.98247). 8409
10.13140/RG.2.2.12400.12808). 8412
2023, (doi: 10.13140/RG.2.2.22545.10089). 8415
10.13140/RG.2.2.11377.76644). 8421
10.13140/RG.2.2.23750.96329). 8424
10.13140/RG.2.2.31366.24641). 8427
10.13140/RG.2.2.34721.68960). 8430
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8432
2023, (doi: 10.13140/RG.2.2.30212.81289). 8433
10.13140/RG.2.2.24288.35842). 8439
10.13140/RG.2.2.32467.25124). 8442
10.13140/RG.2.2.31025.45925). 8445

10.13140/RG.2.2.17184.25602). 8448
10.13140/RG.2.2.23423.28327). 8451
10.13140/RG.2.2.28456.44805). 8454
10.13140/RG.2.2.23525.68320). 8457
HG194 [75] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8458
10.13140/RG.2.2.20170.24000). 8460
10.13140/RG.2.2.36475.59683). 8463
10.13140/RG.2.2.29764.71046). 8466
2023, (doi: 10.13140/RG.2.2.18780.87683). 8469
10.13140/RG.2.2.26134.01603). 8475
HG188 [81] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8476
10.13140/RG.2.2.27392.30721). 8478
10.13140/RG.2.2.33028.40321). 8481
10.13140/RG.2.2.21389.20966). 8484

10.13140/RG.2.2.16356.04489). 8487
10.13140/RG.2.2.21756.21129). 8490
HG183 [86] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8491
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8492
10.13140/RG.2.2.30983.68009). 8493
10.13140/RG.2.2.28552.29445). 8496
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8498
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8499
10.13140/RG.2.2.35105.89447). 8502
(doi: 10.13140/RG.2.2.30072.72960). 8505
10.13140/RG.2.2.31147.52003). 8508
10.13140/RG.2.2.32825.24163). 8511
10.13140/RG.2.2.13059.58401). 8514
10.13140/RG.2.2.11172.14720). 8517
2023, (doi: 10.13140/RG.2.2.22011.80165). 8520
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8523

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8525
2023, (doi: 10.13140/RG.2.2.10493.84962). 8526
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8529
2023, (doi: 10.13140/RG.2.2.19944.14086). 8532
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8535
(doi: 10.13140/RG.2.2.33103.76968). 8538
HG167 [102] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8539
(doi: 10.13140/RG.2.2.23037.44003). 8541
(doi: 10.13140/RG.2.2.35646.56641). 8544
(doi: 10.13140/RG.2.2.18030.48967). 8547
(doi: 10.13140/RG.2.2.13973.81121). 8550
2023, (doi: 10.13140/RG.2.2.34106.47047). 8553
2023, (doi: 10.13140/RG.2.2.31956.88961). 8559
2023, (doi: 10.13140/RG.2.2.15179.67361). 8562

10.13140/RG.2.2.21510.45125). 8565
HG158 [111] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8566
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8567
2023, (doi: 10.13140/RG.2.2.13121.84321). 8568
10.13140/RG.2.2.11758.69441). 8571
2023, (doi: 10.13140/RG.2.2.31891.35367). 8574
10.13140/RG.2.2.19360.87048). 8577
HG154 [115] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8578
10.13140/RG.2.2.32363.21286). 8580
10.13140/RG.2.2.23266.81602). 8583
10.13140/RG.2.2.19911.37285). 8586
10.13140/RG.2.2.11050.90569). 8589
HG150 [119] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8590
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8591
2023, (doi: 10.13140/RG.2.2.17761.79206). 8592
HG149 [120] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8593
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8594
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8597
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8598
(doi: 10.13140/RG.2.2.30182.50241). 8601

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

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8642
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8643
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8646
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8648
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8649

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8650

HG128 [140] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8655
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8656

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8657
2023,(doi: 10.13140/RG.2.2.36745.93289). 8660

10.20944/preprints202301.0282.v1). 8667
10.20944/preprints202301.0267.v1).). 8670
2023010265 (doi: 10.20944/preprints202301.0265.v1). 8675
prints202301.0262.v1). 8679


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

10.13140/RG.2.2.35061.65767). 8688

10.13140/RG.2.2.18494.15680). 8692

10.13140/RG.2.2.32530.73922). 8696
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8698

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8699
10.13140/RG.2.2.15897.70243). 8700

10.13140/RG.2.2.32530.73922). 8704

prints202301.0105.v1). 8707

10.13140/RG.2.2.23172.19849). 8714


10.13140/RG.2.2.17385.36968). 8724
Preprints 2023, 2023010044 8727
(doi: 10.20944/preprints202301.0043.v1). 8730
2023, (doi: 10.13140/RG.2.2.28945.92007). 8733
10.13140/RG.2.2.35774.77123). 8739

10.13140/RG.2.2.29430.88642). 8745
(doi: 10.20944/preprints202212.0549.v1). 8751
10.13140/RG.2.2.19380.94084). 8754

(doi: 10.20944/preprints202212.0500.v1). 8765
10.13140/RG.2.2.20993.12640). 8768
HG952 [174] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8769

HG95 [175] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 8772
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 8773

10.13140/RG.2.2.29173.86244). 8783
HG38 [179] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8784
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8785
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8786
(doi: 10.5281/zenodo.7835063). 8788
(doi: 10.5281/zenodo.7826705). 8790
2023 (doi: 10.5281/zenodo.7820680). 8792

10.5281/zenodo.7812750). 8794


2023 (doi: 10.5281/zenodo.7807782). 8800
2023 (doi: 10.5281/zenodo.7804449). 8802

(doi: 10.5281/zenodo.7792307). 8806
(doi: 10.5281/zenodo.7790728). 8808
2023 (doi: 10.5281/zenodo.7787712). 8810
10.5281/zenodo.7783791). 8812
10.5281/zenodo.7780123). 8814
(doi: 10.5281/zenodo.7773119). 8816
odo.7637762). 8818
10.5281/zenodo.7766174). 8820
10.5281/zenodo.7762232). 8822
(doi: 10.5281/zenodo.7758601). 8824
10.5281/zenodo.7754661). 8826
10.5281/zenodo.7750995) . 8828

(doi: 10.5281/zenodo.7749875). 8830
10.5281/zenodo.7747236). 8832
10.5281/zenodo.7742587). 8834
(doi: 10.5281/zenodo.7738635). 8836
10.5281/zenodo.7734719). 8838
10.5281/zenodo.7730484). 8840
(doi: 10.5281/zenodo.7730469). 8842
10.5281/zenodo.7722865). 8844
odo.7713563). 8846
odo.7709116). 8848
10.5281/zenodo.7706415). 8850
(doi: 10.5281/zenodo.7706063). 8852
(doi: 10.5281/zenodo.7701906). 8854
odo.7700205). 8856
10.5281/zenodo.7694876). 8858
10.5281/zenodo.7679410). 8860
10.5281/zenodo.7675982). 8862
10.5281/zenodo.7672388). 8864

odo.7668648). 8866
10.5281/zenodo.7662810). 8868
10.5281/zenodo.7659162). 8870
HG120b [222] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8871
10.5281/zenodo.7653233). 8872
odo.7653204). 8874
odo.7653142). 8876
odo.7653117). 8878
odo.7653089). 8880
odo.7651687). 8882
odo.7651619). 8884
odo.7651439). 8886
odo.7650729). 8888
odo.7647868). 8890
odo.7647017). 8892
odo.7644894). 8894
odo.7641880). 8896
odo.7632923). 8898
odo.7623459). 8900

10.5281/zenodo.7606416). 8902
10.5281/zenodo.7606416). 8904
odo.7606404). 8906
10.5281/zenodo.7580018). 8908
odo.7580018). 8910
odo.7580018). 8912
odo.7579929). 8914
10.5281/zenodo.7563170). 8916
odo.7563164). 8918
odo.7563160). 8920
odo.7563160). 8922
10.5281/zenodo.7563160). 8924
10.5281/zenodo.7557063). 8926
10.5281/zenodo.7557009). 8928
10.5281/zenodo.7539484). 8930
10.5281/zenodo.7523390). 8932
10.5281/zenodo.7523390). 8934
10.5281/zenodo.7523390). 8936

odo.7574952). 8938
10.5281/zenodo.7574992). 8940
odo.7523357). 8942
10.5281/zenodo.7523357). 8944
10.5281/zenodo.7504782). 8946
10.5281/zenodo.7504782). 8948
10.5281/zenodo.7504782). 8950
10.5281/zenodo.7499395). 8952
odo.7499395). 8954
10.5281/zenodo.7499395). 8956
10.5281/zenodo.7497450). 8958
10.5281/zenodo.7497450). 8960
10.5281/zenodo.7494862). 8962
odo.7494862). 8964
10.5281/zenodo.7494862). 8966
10.5281/zenodo.7493845). 8968
10.5281/zenodo.7493845). 8970
10.5281/zenodo.7493845). 8972

odo.7539484). 8974
odo.7523390). 8976
odo.7523357). 8978
odo.7504782). 8980
odo.7499395). 8982
odo.7497450). 8984
odo.7494862). 8986
odo.7493845). 8988
odo.7480110). 8990
odo.7378758). 8992
HG32b [283] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 8993
10.5281/zenodo.6320305). 8994
odo.6677173). 8996

CHAPTER 44 8997
Books’ Contributions 8998
“Books’ Contributions”: | Featured Threads 8999

The following references are cited by chapters. 9000
9001
[Ref246] 9002
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut In 9003
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9004
odo.7834261). 9005
9006
[Ref247] 9007
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9008
Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 10.5281/zen- 9009
odo.7834229). 9010
9011
The links to the contributions of this scientific research book are listed below. 9012
[HG246] 9013
odo.7834261). 9016
9017
[TITLE] “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut In 9018
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9019

9020
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9021
https://www.researchgate.net/publication/370057375 9022
9023
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9024
https://www.scribd.com/document/638736156 9025
9026
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9027
https://zenodo.org/record/7834261 9028
9029
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9030
https://www.academia.edu/100283835 9031
449
Figure 44.1: Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-
Path-Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7834261).
9032
[ADDRESSED CITATION] 9033
odo.7834261). 9036
[ASSIGNED NUMBER] #246 Article 9037
[DATE] April 2023 9038

[DOI] 10.5281/zenodo.7834261 9039
[LICENSE] CC BY-NC-ND 4.0 9040
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9041
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9042
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9043
9044
[HG247] 9045
odo.7834229). 9048
9049
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9050

Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA” 9051
9052
https://www.researchgate.net/publication/370057529 9054
9055
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9056

10.5281/zenodo.7834261).
10.5281/zenodo.7834261).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo
2023, (doi: 10.5281/zenodo.7834229).
https://www.scribd.com/document/638732515 9057
9058
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9059
9061
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9062
https://www.academia.edu/100282561 9063
9064
odo.7834229). 9068
[ASSIGNED NUMBER] #247 Article 9069

[DATE] April 2023 9070
[DOI] 10.5281/zenodo.7834229 9071
[LICENSE] CC BY-NC-ND 4.0 9072
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9073
[AVAILABLE AT TWITTER’S IDS] 9074
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9075
googlebooks GooglePlay 9076
9077
[ASSIGNED NUMBER] | Book #162 9078
Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 9080
10.5281/zenodo.7835063). 9081

2023, (doi: 10.5281/zenodo.7834229).
2023, (doi: 10.5281/zenodo.7834229).

[TITLE] Eulerian-Type-Path-Cut In SuperHyperGraphs 9082

#Latest_Updates 9083
#The_Links 9084
9088
9090
#The_Links 9091
9092
[ASSIGNED NUMBER] | Book #162 9093

9094
[TITLE] Eulerian-Type-Path-Cut In SuperHyperGraphs 9095
9096
9100
– 9101
9102
[PUBLISHER] 9103
(Paperback): https://www.amazon.com/dp/- 9104
(Hardcover): https://www.amazon.com/dp/- 9105

(Kindle Edition): https://www.amazon.com/dp/- 9106
9107
– 9108
9109
[ISBN] 9110
(Paperback): - 9111
(Hardcover): - 9112
(Kindle Edition): CC BY-NC-ND 4.0 9113
(EBook): CC BY-NC-ND 4.0 9114
9115
– 9116
9117
[PRINT LENGTH] 9118
(Paperback): - pages 9119
(Hardcover): - pages 9120
(Kindle Edition): - pages 9121
(E-Book): - pages 9122
9123
– 9124
9125
9127

#The_Links 9128
9129
https://www.researchgate.net/publication/- 9131
9132
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9133
https://drhenrygarrett.wordpress.com/2023/07/22/ 9134
Eulerian-Type-Path-Cut-In-SuperHyperGraphs/ 9135
9136
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9137
https://www.scribd.com/document/- 9138
9139
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9140
https://www.academia.edu/- 9141
9142
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9143
9145
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9146
https://books.google.com/books/about?id=- 9147
9148
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9149
https://play.google.com/store/books/details?id=- 9150

[TITLE] Eulerian-Type-Path-Cut In SuperHyperGraphs (Published Version) 9151

9152
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9153
9154
https://drhenrygarrett.wordpress.com/2023/04/22/ 9155
Eulerian-Type-Path-Cut-In-SuperHyperGraphs/ 9156
9157
– 9158
9159
[POSTED BY] Dr. Henry Garrett 9160
9161
[DATE] April 017, 2023 9162

9163
[POSTED IN] 162 | Eulerian-Type-Path-Cut In SuperHyperGraphs 9164
9165
[TAGS] 9166
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9167
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9168
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9169
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9170
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs, 9171
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 9172
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9173
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9174
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Su- 9175

perHyperGraph Theory, SuperHyperGraphs, Eulerian-Type-Path-Cut In SuperHyperGraphs, 9176
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9177
In this scientific research book, there are some scientific research chapters on “Extreme 9178
Eulerian-Type-Path-Cut In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Path-Cut 9179
In SuperHyperGraphs” about some scientific research on Eulerian-Type-Path-Cut In SuperHy- 9180
perGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Type-Path-Cut 9181

In SuperHyperGraphs and Neutrosophic Eulerian-Type-Path-Cut In SuperHyperGraphs. With 9182
scientific research on the basic scientific research properties, the scientific research book 9183
starts to make Extreme Eulerian-Type-Path-Cut In SuperHyperGraphs theory and Neutro- 9184
sophic Eulerian-Type-Path-Cut In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9185
understandable. 9186

CHAPTER 45 9187
“SuperHyperGraph-Based Books”: | 9188
Featured Tweets 9189
“SuperHyperGraph-Based Books”: | Featured Tweets 9190
457
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 9191
CV 9192
485
9193
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
9194
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)
9195
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

9196

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

9197
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

9198
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

9199
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

9200
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

9201
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).
9202
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

9203
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

9204
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

9205
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

9206
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

9207
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

9208
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

9209
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

9210
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

9211
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

9212
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).
9213
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

9214

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

9215
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

9216

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: -
9217
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

9218
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).
9219
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
9220
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
9221
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
9222
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).
9223
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

9224
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).
9225
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”,

9226
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).
9227
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).
9228
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
9229
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).
9230

(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).
9231
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).
9232
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

9233
[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

9234
[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

9235
[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

9236
[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

9237
[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

9238
[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

9239
[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

9240
[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

9241
[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

9242
[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

9243
[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

9244
[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

9245
[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

9246
[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

9247
[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

9248
[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

9249
[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

9250
[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

9251
[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

9252
[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

9253
[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

9254
[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

9255
[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

9256
[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

9257
[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

9258
[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
9259
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

9260
[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

9261
[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

9262
[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

9263
[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

9264
[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
9265
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

9266
“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

9267
[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
9268
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

9269
[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

9270
[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

9271
[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

9272
[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

9273
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

9274
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
9275
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
9276
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

9277
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

9278
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
-
9279
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

9280
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9281
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
9282
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
9283
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

9284
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
9285
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
...
9286
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/
9287
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
9288
9289
9290
Henry Garrett
01/23/2022
9291
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
9292
View publication stats

Eulerian-Type-Path-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-Path-Cut in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

448 PUBLICATIONS 12,569 CITATIONS

Metric Dimension in fuzzy(neutrosophic) Graphs View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 41

6 New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59

10 Extreme SuperHyperEulerian-Type-Path-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 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Type-Path-Cut 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Neutrosophic SuperHyperEulerian-Type-Path-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 341

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 349

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 449

45 “SuperHyperGraph-Based Books”: | Featured Tweets 457

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 477

Henry Garrett · Independent Researcher · Department of Mathematics ·

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