Eulerian-Cycle-Neighbor in SuperHyperGraphs

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

DOI: 10.5281/zenodo.7857906
CITATIONS
1 author:
Henry Garrett
463 PUBLICATIONS 14,530 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic Graphs View project
Featured Articles View project
All content following this page was uploaded by Henry Garrett on 24 April 2023.
The user has requested enhancement of the downloaded file.

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

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

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

Graph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebu-
lous 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-Cycle-Neighbor But As The Extensions

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

Theoretical Motivations 319
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-Cycle-Neighbor in the Extreme Example (42.0.3) . . . . . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

SuperHyperEulerian-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 281


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

SuperHyperEulerian-Cycle-Neighbor in the Example (42.0.5) . . . . . . . . . . . . . . . . 320
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Cycle-Neighbor in the Example (42.0.11) . 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperEulerian-Cycle-Neighbor in the Example (42.0.13) . . . . . . . . . . . . . . . 327
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic No-
tions of Neutrosophic SuperHyperEulerian-Cycle-Neighbor in the Neutrosophic Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7857841). . . . . . . . . . . . . . . . . . . . . . 450
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
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) 70
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 71

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 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-Cycle-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Cycle-Neighbor 2
In SuperHyperGraphs” about some scientific research on Eulerian-Cycle-Neighbor In SuperHy- 3

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 217
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 218
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 219
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 220
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 221
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 222
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 223
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 224
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 225
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 226
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 227
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 228
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific 229
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 230
the move from the cancer is identified by this research. Sometimes the move of the cancer 231
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about 232
the moves and the effects of the cancer on that region; this event leads us to choose another 233
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s 234
happened and what’s done. There are some specific models, which are well-known and they’ve 235
got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces 236
of the cancer on the complex tracks and between complicated groups of cells could be fantas- 237
ized by a Neutrosophic SuperHyperPath(-/Eulerian-Cycle-Neighbor In SuperHyperGraphs, 238
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 239
is to find either the longest Eulerian-Cycle-Neighbor In SuperHyperGraphs or the strongest 240
Eulerian-Cycle-Neighbor In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 241

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

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

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

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




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

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

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

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

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

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

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

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

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

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

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

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

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

Graphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; 461
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 462
HG250; HG251; HG252; HG253; HG254; HG255; HG256; HG257] alongside scientific 479
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 480

HG163b; HG164b; HG165b; HG166b; HG167b]. Two popular scientific research books 492
in Scribd in the terms of high readers, 4331 and 5327 respectively, on neutrosophic science is on 493
[HG32b; HG44b]. 494

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

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

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

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

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

Zenodo 2023, (doi: 10.5281/zenodo.7855661). 593
HG254 [28] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 594
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 595
HG253 [29] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 597
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 598
10.5281/zenodo.7853867). 599
HG252 [30] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 600
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 601
10.5281/zenodo.7853922). 602

By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 604
(doi: 10.5281/zenodo.7851519). 605
HG250 [32] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 606
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 607
(doi: 10.5281/zenodo.7851550). 608
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 610
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 613
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 616
10.5281/zenodo.7834229). 617
HG246 [36] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 618
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 619
10.5281/zenodo.7834261). 620
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 622
10.5281/zenodo.7824560). 623
HG244 [38] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 624
(doi: 10.5281/zenodo.7824623). 626
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 628
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 631

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 634
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 636
2023, (doi: 10.5281/zenodo.7809365). 637
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 639
2023, (doi: 10.5281/zenodo.7809358). 640

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

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

By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 720
2023, (doi: 10.13140/RG.2.2.22545.10089). 721
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 723
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 724
HG207 [72] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 725
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.11377.76644). 727
HG206 [73] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 728
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 729
10.13140/RG.2.2.23750.96329). 730
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.31366.24641). 733
HG204 [75] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 734
10.13140/RG.2.2.34721.68960). 736
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 738
2023, (doi: 10.13140/RG.2.2.30212.81289). 739
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 741
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.24288.35842). 745
HG200 [79] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 746
10.13140/RG.2.2.32467.25124). 748
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 750
10.13140/RG.2.2.31025.45925). 751
HG198 [81] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 752
10.13140/RG.2.2.17184.25602). 754
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.23423.28327). 757

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

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

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

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 876
10.13140/RG.2.2.11758.69441). 877
HG156 [123] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 878
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 879
2023, (doi: 10.13140/RG.2.2.31891.35367). 880
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 882
10.13140/RG.2.2.19360.87048). 883
HG154 [125] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 884
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 885
10.13140/RG.2.2.32363.21286). 886
HG153 [126] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 887
10.13140/RG.2.2.23266.81602). 889
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 891
10.13140/RG.2.2.19911.37285). 892
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 894
10.13140/RG.2.2.11050.90569). 895
HG150 [129] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 896
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 897
2023, (doi: 10.13140/RG.2.2.17761.79206). 898
HG149 [130] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 899
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 900
HG148 [131] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 902
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 903
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 904
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 906
(doi: 10.13140/RG.2.2.30182.50241). 907
HG146 [133] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 908
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 909
HG145 [134] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 911
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 912

HG144 [135] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 914
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 915
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 916
HG143 [136] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 917
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 918
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 919
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 922
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 925
HG140 [139] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 926
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 927
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 928
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 931
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 934
HG137 [142] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 935
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 936
HG136 [143] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 938
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 939
2023, (doi: 10.13140/RG.2.2.17252.24968). 940
HG135 [144] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 941
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 942
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 943
HG134 [145] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 944
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 945
HG132 [146] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 947
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 948
2023010396 (doi: 10.20944/preprints202301.0396.v1). 949
HG131 [147] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 950
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 951
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 952

HG130 [148] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 953
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 954
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 955
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 956
HG129 [149] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 957

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 958
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 959
HG128 [150] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 961
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 962
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 963
HG127 [151] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 964
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 965
2023,(doi: 10.13140/RG.2.2.36745.93289). 966
HG126 [152] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 967

HG125 [153] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 970
10.20944/preprints202301.0282.v1). 973
HG124 [154] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 974
10.20944/preprints202301.0267.v1).). 976
(doi: 10.20944/preprints202301.0265.v1). 981
HG122 [156] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 982
prints202301.0262.v1). 985
2023010224, (doi: 10.20944/preprints202301.0224.v1). 991

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 993
10.13140/RG.2.2.35061.65767). 994
HG25 [160] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 995
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 996
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 997
10.13140/RG.2.2.18494.15680). 998
HG26 [161] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 999
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1000

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1001
10.13140/RG.2.2.32530.73922). 1002
HG27 [162] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1003
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1004
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1005
10.13140/RG.2.2.15897.70243). 1006
10.13140/RG.2.2.32530.73922). 1010
prints202301.0105.v1). 1013
HG28 [165] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1014
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1015

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

HG30 [169] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1027
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1028
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1029
10.13140/RG.2.2.17385.36968). 1030

Preprints 2023, 2023010044 1033

10.20944/preprints202301.0043.v1). 1036
HG31 [172] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1037
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1038
2023, (doi: 10.13140/RG.2.2.28945.92007). 1039
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1044
10.13140/RG.2.2.35774.77123). 1045

HG35 [176] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1049
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1050
10.13140/RG.2.2.29430.88642). 1051
(doi: 10.20944/preprints202212.0549.v1). 1057
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1059

10.13140/RG.2.2.19380.94084). 1060
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1068

(doi: 10.20944/preprints202212.0500.v1). 1071
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1073
10.13140/RG.2.2.20993.12640). 1074
HG952 [184] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1075

HG95 [185] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1078
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1079

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1080
HG37 [188] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1087
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1088
10.13140/RG.2.2.29173.86244). 1089
HG38 [189] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1090
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1091
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1092
HG167b [190] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1093
(doi: 10.5281/zenodo.7857906). 1094
HG166b [191] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1095
2023 (doi: 10.5281/zenodo.7856329). 1096
HG165b [192] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1097
10.5281/zenodo.7854561). 1098
HG164b [193] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1099
2023 (doi: 10.5281/zenodo.7851893). 1100
HG163b [194] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1101

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1102
HG162b [195] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1103
(doi: 10.5281/zenodo.7835063). 1104
HG161b [196] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1105
(doi: 10.5281/zenodo.7826705). 1106

HG160b [197] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1107
2023 (doi: 10.5281/zenodo.7820680). 1108
HG159b [198] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1109
10.5281/zenodo.7812750). 1110
HG158b [199] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1111

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

HG156b [201] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1115
2023 (doi: 10.5281/zenodo.7807782). 1116
HG155b [202] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1117
2023 (doi: 10.5281/zenodo.7804449). 1118
HG154b [203] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1119

HG153b [204] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1121
(doi: 10.5281/zenodo.7792307). 1122
HG152b [205] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1123
(doi: 10.5281/zenodo.7790728). 1124
HG151b [206] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1125
2023 (doi: 10.5281/zenodo.7787712). 1126
HG150b [207] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1127
10.5281/zenodo.7783791). 1128
HG149b [208] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1129
10.5281/zenodo.7780123). 1130
HG148b [209] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1131
(doi: 10.5281/zenodo.7773119). 1132
HG147b [210] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1133
odo.7637762). 1134
HG146b [211] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1135
10.5281/zenodo.7766174). 1136
HG145b [212] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1137
10.5281/zenodo.7762232). 1138
HG144b [213] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1139
(doi: 10.5281/zenodo.7758601). 1140
HG143b [214] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7754661). 1142

HG142b [215] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7750995) . 1144
HG141b [216] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1145
(doi: 10.5281/zenodo.7749875). 1146
HG140b [217] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1147
10.5281/zenodo.7747236). 1148
HG139b [218] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1149
10.5281/zenodo.7742587). 1150
HG138b [219] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1151
(doi: 10.5281/zenodo.7738635). 1152
HG137b [220] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1153
10.5281/zenodo.7734719). 1154
HG136b [221] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1155
10.5281/zenodo.7730484). 1156
HG135b [222] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1157
(doi: 10.5281/zenodo.7730469). 1158
HG134b [223] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1159
10.5281/zenodo.7722865). 1160
HG133b [224] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1161
odo.7713563). 1162
odo.7709116). 1164
HG131b [226] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1165
10.5281/zenodo.7706415). 1166
HG130b [227] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1167
10.5281/zenodo.7706063). 1168
HG129b [228] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1169
10.5281/zenodo.7701906). 1170
HG128b [229] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1171
odo.7700205). 1172
HG127b [230] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1173
10.5281/zenodo.7694876). 1174
HG126b [231] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1175
10.5281/zenodo.7679410). 1176
HG125b [232] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1177
10.5281/zenodo.7675982). 1178

HG124b [233] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1179
10.5281/zenodo.7672388). 1180
HG123b [234] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1181
odo.7668648). 1182
HG122b [235] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1183
10.5281/zenodo.7662810). 1184
HG121b [236] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7659162). 1186
HG120b [237] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1187
odo.7653233). 1188
HG119b [238] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1189
odo.7653204). 1190
HG118b [239] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1191
odo.7653142). 1192
HG117b [240] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1193
odo.7653117). 1194
HG116b [241] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1195
HG115b [242] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1196
odo.7651687). 1197
HG114b [243] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1198
odo.7651619). 1199
HG113b [244] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1200
odo.7651439). 1201
HG112b [245] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1202
odo.7650729). 1203
HG111b [246] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1204
odo.7647868). 1205
HG110b [247] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1206
odo.7647017). 1207
HG109b [248] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7644894). 1209
HG108b [249] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1210
HG107b [250] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1211
odo.7632923). 1212

HG106b [251] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1213
odo.7623459). 1214
HG105b [252] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1215
10.5281/zenodo.7606416). 1216
HG104b [253] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7606416). 1218
HG103b [254] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1219
odo.7606404). 1220
HG102b [255] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1221
10.5281/zenodo.7580018). 1222
HG101b [256] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1223
odo.7580018). 1224
odo.7580018). 1226
odo.7579929). 1228
HG98b [259] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7563170). 1230
HG97b [260] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1231
odo.7563164). 1232
HG96b [261] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1233
odo.7563160). 1234
odo.7563160). 1236
HG94b [263] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7563160). 1238
HG93b [264] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1239
10.5281/zenodo.7557063). 1240
HG92b [265] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7557009). 1242
HG91b [266] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7539484). 1244
HG90b [267] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1245
10.5281/zenodo.7523390). 1246
HG89b [268] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1247
10.5281/zenodo.7523390). 1248

HG88b [269] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7523390). 1250
HG87b [270] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1251
odo.7574952). 1252
HG86b [271] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7574992). 1254
odo.7523357). 1256
HG84b [273] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1257
10.5281/zenodo.7523357). 1258
HG83b [274] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1259
10.5281/zenodo.7504782). 1260
HG82b [275] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1261
10.5281/zenodo.7504782). 1262
HG81b [276] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1263
10.5281/zenodo.7504782). 1264
HG80b [277] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1265
10.5281/zenodo.7499395). 1266
HG79b [278] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7499395). 1268
HG78b [279] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1269
10.5281/zenodo.7499395). 1270
HG77b [280] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1271
10.5281/zenodo.7497450). 1272
HG76b [281] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1273
10.5281/zenodo.7497450). 1274
HG75b [282] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1275
10.5281/zenodo.7494862). 1276
HG74b [283] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.7494862). 1278
HG73b [284] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1279
10.5281/zenodo.7494862). 1280
HG72b [285] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1281
10.5281/zenodo.7493845). 1282
HG71b [286] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1283
odo.7493845). 1284

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

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

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

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

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

CHAPTER 5 1419
Extreme Eulerian-Cycle-Neighbor 1420
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1421
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1422
2023, (doi: 10.13140/RG.2.2.34953.52320). 1423

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1424
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1425
(doi: 10.13140/RG.2.2.33275.80161). 1426
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1427
10.13140/RG.2.2.11050.90569). 1429
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1430
10.13140/RG.2.2.17761.79206). 1432
10.13140/RG.2.2.19911.37285). 1435
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1436
10.13140/RG.2.2.23266.81602). 1438
10.13140/RG.2.2.19360.87048). 1441
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1442
10.13140/RG.2.2.32363.21286). 1444
10.13140/RG.2.2.11758.69441). 1447
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1448
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1449
10.13140/RG.2.2.31891.35367). 1450
10.13140/RG.2.2.21510.45125). 1453
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1454
10.13140/RG.2.2.13121.84321). 1456

CHAPTER 6 1457
New Ideas On Super Nebulous By Hyper 1458
Nebbish Of Eulerian-Cycle-Neighbor In 1459
Recognition of Cancer With 1460
(Neutrosophic) SuperHyperGraph 1461
49
CHAPTER 7 1462
ABSTRACT 1463
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1464
Cycle-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Cycle-Neighbor 1465

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 1466
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor 1467
if the following expression is called Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor criteria holds 1468
∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the all number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic 1469

e-SuperHyperEulerian-Cycle-Neighbor criteria holds 1470
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1471

SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic v- 1472
SuperHyperEulerian-Cycle-Neighbor criteria holds 1473
∀N (Va ) ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic 1474

v-SuperHyperEulerian-Cycle-Neighbor criteria holds 1475
∀N (Va ) ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1476
SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, 1477
51
Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, 1478

and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor. ((Neutrosophic) SuperHyperEulerian-Cycle- 1479
Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1480
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1481
and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 1484
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1485
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 1486
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1487
the Extreme SuperHyperEulerian-Cycle-Neighbor; a Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s 1488
either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle- 1489
Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian- 1490

Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1491
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 1492
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges 1493
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1494
Cycle-Neighbor; an Extreme SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either of 1495
Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor, 1496

Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Cycle- 1497
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1498
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1499
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 1500
S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 1501
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Neighbor; and the 1502
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Cycle- 1503
Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, 1504
and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Su- 1506
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1507
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1508
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 1509
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1510
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Cycle-Neighbor; 1511
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 1512
V-SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, 1513

and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHy- 1515
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1516
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1517
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1518
they form the Extreme SuperHyperEulerian-Cycle-Neighbor; a Neutrosophic V-SuperHyperEulerian- 1519

Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re- 1520
SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutro- 1521
sophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1522
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 1523

tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1524

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1525
the Neutrosophic SuperHyperEulerian-Cycle-Neighbor; an Extreme V-SuperHyperEulerian-Cycle-Neighbor 1526
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutro- 1527
sophic re-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and 1528
Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 1529
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1530
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1531
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1532
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1533
SuperHyperEulerian-Cycle-Neighbor; and the Extreme power is corresponded to its Extreme coef- 1534
ficient; a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either of 1535

Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1538
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1539
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 1540
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1541
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1542
SuperHyperEulerian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic 1543
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 1544
namely, a SuperHyperEulerian-Cycle-Neighbor and Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 1545
Two different types of SuperHyperDefinitions are debut for them but the research goes further 1546
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1553
under research to figure out the challenges make sense about ongoing and upcoming research. 1554
The special case is up. The cells are viewed in the deemed ways. There are different types 1555
of them. Some of them are individuals and some of them are well-modeled by the group of 1556
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 1557
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 1558
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1559
these complex and dense SuperHyperModels open up some avenues to research on theoret- 1560
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 1561
It’s also officially collected in the form of some questions and some problems. Assume a 1562
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Cycle-Neighbor is 1563
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1564
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1565

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

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 1574
a SuperHyperEulerian-Cycle-Neighbor . Since there’s more ways to get type-results to make a 1575
SuperHyperEulerian-Cycle-Neighbor more understandable. For the sake of having Neutrosophic 1576

SuperHyperEulerian-Cycle-Neighbor, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 1577
Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1578
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 1579
to assign to the values. Assume a SuperHyperEulerian-Cycle-Neighbor . It’s redefined a Neutrosophic 1580
SuperHyperEulerian-Cycle-Neighbor if the mentioned Table holds, concerning, “The Values of 1581
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 1582
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 1583
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Cycle- 1588

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

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Cycle-Neighbor, SuperHyperStar, 1606
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1607
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”, “Neutrosophic SuperHyper- 1608
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1609
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1610
“Neutrosophic SuperHyperEulerian-Cycle-Neighbor” where it’s the strongest [the maximum Neutro- 1611
sophic value from all the SuperHyperEulerian-Cycle-Neighbor amid the maximum value amid all 1612
SuperHyperVertices from a SuperHyperEulerian-Cycle-Neighbor .] SuperHyperEulerian-Cycle-Neighbor . 1613
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1614
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1615

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1616
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Cycle-Neighbor if it’s 1617
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1618
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1619
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1620
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1621
and the common and intended properties between “specific” cells and “specific group” of 1629
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1630
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1631
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1632
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 1633
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 1634
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 1635
of the move from the cancer is identified by this research. Sometimes the move of the cancer 1636
of the cancer on the complex tracks and between complicated groups of cells could be fan- 1642
tasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Neighbor, SuperHyperStar, 1643
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1644
the longest SuperHyperEulerian-Cycle-Neighbor or the strongest SuperHyperEulerian-Cycle-Neighbor 1645
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Cycle-Neighbor, 1646

called SuperHyperEulerian-Cycle-Neighbor, and the strongest SuperHyperEulerian-Cycle-Neighbor, called 1647
Neutrosophic SuperHyperEulerian-Cycle-Neighbor, some general results are introduced. Beyond that 1648
in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 1649
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1650
SuperHyperEulerian-Cycle-Neighbor. There isn’t any formation of any SuperHyperEulerian-Cycle-Neighbor 1651

but literarily, it’s the deformation of any SuperHyperEulerian-Cycle-Neighbor. It, literarily, deforms 1652
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Cycle-Neighbor 1653
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1654
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Cycle-Neighbor, Cancer’s Neut- 1655
rosophic Recognition 1656


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

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

out in sections “ SuperHyperEulerian-Cycle-Neighbor” and “Extreme SuperHyperEulerian-Cycle-Neighbor”. 1730
In the sense of tackling on getting results and in Eulerian-Cycle-Neighbor to make sense about 1731
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1732
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1733
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1734
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1735

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1736
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1737
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1738
and as concluding and closing section of theoretical research are contained in the section 1739
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1740
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1741
Results”, “ SuperHyperEulerian-Cycle-Neighbor”, “Extreme SuperHyperEulerian-Cycle-Neighbor”, “Results 1742

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

CHAPTER 9 1755
Extreme Preliminaries Of This Scientific 1756
Research On the Redeemed Ways 1757
In this section, the basic material in this scientific research, is referred to [Single Valued 1758
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1759
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1760

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1761
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1762
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1763
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1764
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1765
their clarifications are addressed to Ref.[HG38]. 1766

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

Let X be a Eulerian-Cycle-Neighbor of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}

+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 1769
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1786
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1787
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1788
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1789
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1790
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1791

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

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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1808
x, y, z, w ∈ [0, 1]: 1809
(i) 1 ⊗ x = x; 1810
(ii) x ⊗ y = y ⊗ x; 1811
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1812
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1813

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

where 1816

1, 2, . . . , n0 ); 1821
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1822
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1823
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1824
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1825
0


SuperEdge; 1845
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1848
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1849
makes the patterns and regularities. 1850
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1851
of elements of SuperHyperEdges are the same. 1852

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

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

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. 1882
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1883
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1884
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1885
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1886
perPath . 1887
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 1888
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1889
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1890
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1891
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1892
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1893

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

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


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

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

Neighbor). 1910
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1912
or E 0 is called 1913
(i) Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 1914

Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor criteria holds 1915
∀N (Ea ) ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 1916

Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor criteria holds 1917
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1918
(iii) Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 1919
Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor criteria holds 1920
∀N (Va ) ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 1921
∀N (Va ) ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1923

(v) Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e- 1924

SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor, Neutro- 1925
sophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Cycle- 1926
Neighbor. 1927
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Cycle-Neighbor). 1928

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

Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1934
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1935

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1936
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1937
SuperHyperEulerian-Cycle-Neighbor; 1938
(ii) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e- 1939

Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1942
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1943
sophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1944
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 1945
sophic SuperHyperEulerian-Cycle-Neighbor; 1946
(iii) an Extreme SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either 1947

of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian- 1948
Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv- 1949
SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1950

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 1951
cients defined as the Extreme number of the maximum Extreme cardinality of the 1952
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1953
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1954
that they form the Extreme SuperHyperEulerian-Cycle-Neighbor; and the Extreme power is 1955
corresponded to its Extreme coefficient; 1956
(iv) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial 1957

if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re- 1958
SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neut- 1959
rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Super- 1960

HyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1961
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 1962
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1963
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1964
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 1965
Cycle-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 1966

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

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1971
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 1972
(vi) a Neutrosophic V-SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic 1975

e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor, Neut- 1976
rosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Cycle- 1977
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 1979
(vii) an Extreme V-SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if 1983

it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re- 1984
rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 1986
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1987
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1988
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1989

(viii) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial 1993

rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Supe- 1996
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1997
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1998
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1999
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 2000

sophic SuperHyperEulerian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 2002
Neutrosophic coefficient. 2003
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Cycle-Neighbor). 2004

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2005
(i) an δ−SuperHyperEulerian-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 2006
SuperHyperEulerian-Cycle-Neighbor such that either of the following expressions hold for the 2007

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2008
|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 2009
(29.1), holds if S is an δ−SuperHyperDefensive; 2010
(ii) a Neutrosophic δ−SuperHyperEulerian-Cycle-Neighbor is a Neutrosophic kind of Neut- 2011

rosophic SuperHyperEulerian-Cycle-Neighbor such that either of the following Neutrosophic 2012
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2013
|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 2014

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

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Cycle- 2032
Neighbor more Neutrosophicly understandable. 2033

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

136TBL4

136TBL1

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”. The 2035
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 2036
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 2037
2038
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Cycle-Neighbor. It’s redefined a Neutrosophic 2039

SuperHyperEulerian-Cycle-Neighbor if the Table (29.3) holds. 2040

CHAPTER 10 2041
Extreme SuperHyper But As The Eulerian-Cycle-Neighbor 2042
Extensions Excerpt From Dense And 2043
Super Forms 2044
Definition 10.0.1. (Extreme event). 2045

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2046
a probability Eulerian-Cycle-Neighbor. Any Extreme k-subset of A of V is called Extreme k-event 2047
and if k = 2, then Extreme subset of A of V is called Extreme event. The following expression 2048
is called Extreme probability of A. 2049
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2050

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2051
probability Eulerian-Cycle-Neighbor. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 2052
if the following expression is called Extreme s-independent criteria 2053
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 2054
following expression is called Extreme independent criteria 2055
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2056

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2057
probability Eulerian-Cycle-Neighbor. Any k-function Eulerian-Cycle-Neighbor like E is called Extreme k- 2058
Variable. If k = 2, then any 2-function Eulerian-Cycle-Neighbor like E is called Extreme Variable. 2059
The notion of independent on Extreme Variable is likewise. 2060
Definition 10.0.4. (Extreme Expectation). 2061
73
a probability Eulerian-Cycle-Neighbor. an Extreme k-Variable E has a number is called Extreme 2063

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

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2066
is a probability Eulerian-Cycle-Neighbor. an Extreme number is called Extreme Crossing if the 2067

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

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

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

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

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

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

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

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

S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let X be an Extreme Variable and let t be a 2137
positive real number. Then 2138
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2139
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let Xn be an Extreme Variable in a 2141

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

Definition 10.0.18. (Extreme Balanced). 2168

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

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

= {E4 }.

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

= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
2197
Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. 2199

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



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

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

= 0z 0 .
2206

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

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

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

= 0z 0 .
2215

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

SuperHyperEulerian-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightfor- 2220
ward. 2221


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

ward. 2225

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

= 0z 0 .
2226

ward. 2229

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

ward. 2233

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

ward. 2237

= {}.
= 0z 0 .


= {}.
= 0z 0 .
2238

ward. 2241

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


ward. 2245

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



ward. 2249

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

ward. 2253

= {}.


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

ward. 2257

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

= 0z 0 .
2258

ward. 2261

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

ward. 2265

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

ward. 2269

= {}.

SuperHyperEulerian-Cycle-Neighbor in the Extreme Example (42.0.3) 95NHG1
= 0z 0 .
= {}.
= 0z 0 .
2270
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2271
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Cycle-Neighbor if for 2272
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2273
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2274
all minus all Extreme SuperHypeNeighbors to any amount of them. 2275
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2276
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2277

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

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Cycle-Neighbor is at least 2283
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2284
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2285
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2286
SuperHyperVertices are renamed to Extreme Eulerian-Cycle-Neighbor in some cases but the maximum 2287
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2288
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2289

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

sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Eulerian-Cycle-Neighbor with the least Extreme cardinality, the 2291
lower sharp Extreme bound for cardinality. 2292
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2293
Then in the worst case, literally, 2294
C(N SHG)ExtremeQuasi−Eulerian−Cycle−N eighbor

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−Cycle−N eighborSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Eulerian-Cycle-Neighbor since
neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where amount
refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than one to
form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider the
Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Eulerian-Cycle-Neighbor. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Eulerian-Cycle-Neighbor is the cardinality of
Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the
SuperHyperStable is only up in this quasi-R-Eulerian-Cycle-Neighbor. It’s the contradiction to that
fact on the generality. There are some counterexamples to deny this statement. One of them
comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-Eulerian-Cycle-Neighbor decorates the Extreme SuperHyper-
Vertices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Eulerian-Cycle-Neighbor. Since at least two Extreme SuperHyperVertices involve to
make a title in the Extreme background of the Extreme SuperHyperGraph. The Extreme
SuperHyperGraph is obvious if it has no Extreme SuperHyperEdge but at least two Extreme
SuperHyperVertices make the Extreme version of Extreme SuperHyperEdge. Thus in the
Extreme setting of non-obvious Extreme SuperHyperGraph, there are at least one Extreme
SuperHyperEdge. It’s necessary to mention that the word “Simple” is used as Extreme adjective
for the initial Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop
Extreme version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said

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

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

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-Eulerian-Cycle-Neighbor for the Extreme SuperHyperGraph as used Extreme

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

z
and

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

fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but in
an Extreme Eulerian-Cycle-Neighbor, Ex = E ∈ EESHG:(V,E) could be different and it’s not unique.
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If an Extreme
SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Cycle-Neighbor is at least 2299
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2300
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2301
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2302
SuperHyperVertices are renamed to Extreme Eulerian-Cycle-Neighbor in some cases but the maximum 2303
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2304
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2305
Eulerian-Cycle-Neighbor. 2306
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2307
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2308
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2309
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2310
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2311
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2312
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2313
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2314
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2315
Thus it forms an Extreme quasi-R-Eulerian-Cycle-Neighbor where the Extreme completion of the 2316
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Eulerian-Cycle- 2317
Neighbor. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. 2318

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

the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, 2350
then the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2351
R-Eulerian-Cycle-Neighbors for all Extreme numbers less than its Extreme corresponded maximum 2352
number. The essence of the Extreme Eulerian-Cycle-Neighbor ends up but this essence starts up 2353
in the terms of the Extreme quasi-R-Eulerian-Cycle-Neighbor, again and more in the operations of 2354
collecting all the Extreme quasi-R-Eulerian-Cycle-Neighbors acted on the all possible used formations 2355
of the Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2356
considered as the equivalence class for all corresponded quasi-R-Eulerian-Cycle-Neighbors. Let 2357
zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Cycle-Neighbor be an Extreme number, 2358
an Extreme SuperHyperSet and an Extreme Eulerian-Cycle-Neighbor. Then 2359
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

As its consequences, the formal definition of the Extreme Eulerian-Cycle-Neighbor is re-formalized 2360
and redefined as follows. 2361
GExtreme Eulerian-Cycle-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2362
definition for the Extreme Eulerian-Cycle-Neighbor. 2363
GExtreme Eulerian-Cycle-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Eulerian-Cycle- 2364
poses the upcoming expressions.
Neighbor 2365
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2366
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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



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


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

2370

2371

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2372
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2373
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2374
It’s, literarily, another name for “Extreme Quasi-Eulerian-Cycle-Neighbor” but, precisely, it’s the 2375
generalization of “Extreme Quasi-Eulerian-Cycle-Neighbor” since “Extreme Quasi-Eulerian-Cycle-Neighbor” 2376
happens “Extreme Eulerian-Cycle-Neighbor” in an Extreme SuperHyperGraph as initial framework 2377
and background but “Extreme SuperHyperNeighborhood” may not happens “Extreme Eulerian- 2378
Cycle-Neighbor” in an Extreme SuperHyperGraph as initial framework and preliminarily background 2379

since there are some ambiguities about the Extreme SuperHyperCardinality arise from it. To 2380
get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Eulerian- 2381
Cycle-Neighbor”, and “Extreme Eulerian-Cycle-Neighbor” are up. 2382
Thus, let 2383
zExtreme Number , NExtreme SuperHyperNeighborhood and 2384
GExtreme Eulerian-Cycle-Neighbor be an Extreme number, an Extreme SuperHyperNeighborhood and 2385
an Extreme Eulerian-Cycle-Neighbor and the new terms are up. 2386
GExtreme Eulerian-Cycle-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2387
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2388
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2389
And with go back to initial structure, 2390
GExtreme Eulerian-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =



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

2392

2393

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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Neighbor. The Extreme

SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Eulerian-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Eulerian-Cycle-Neighbor is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Eulerian-Cycle-Neighbor is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Eulerian-Cycle-Neighbor is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Neighbor is up. To sum them up, the
Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Neighbor.

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

. There isn’t only less than two Extreme SuperHyperVertices inside the
Eulerian-Cycle-Neighbor
intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Eulerian-Cycle-Neighbor,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Cycle-Neighbor,

not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2394
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2395
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2396
the 2397
“Extreme R-Eulerian-Cycle-Neighbor” 2398
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2399
Extreme R-Eulerian-Cycle-Neighbor, 2400
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Eulerian-Cycle-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Eulerian-Cycle-Neighbor is the cardinality of

2401
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2402
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Cycle-Neighbor if for any of 2403
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2404
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2405
all minus all Extreme SuperHypeNeighbors to any amount of them. 2406
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2407
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2408
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2409
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2410
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2411
R-Eulerian-Cycle-Neighbor with the least cardinality, the lower sharp Extreme bound for Extreme 2412
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2413
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2414
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2415
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Eulerian-Cycle-Neighbor. Since 2416
it doesn’t have 2417
2418
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2419

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2420
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2421
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2422
but it isn’t an Extreme R-Eulerian-Cycle-Neighbor. Since it doesn’t do the Extreme procedure such 2423
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2424
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2425
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2426
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2427
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2428
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2429
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Eulerian-Cycle-Neighbor, VESHE 2430
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Cycle-Neighbor, 2431
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2432
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2433
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2434
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2435
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2436

SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2437
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Eulerian-Cycle-Neighbor only contains 2438
all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2439
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2440
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2441
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2442
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2443
The SuperHyperNotion, namely, Eulerian-Cycle-Neighbor, is up. There’s neither empty SuperHy- 2444
perEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme SuperHy- 2445
perEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2446

. The Extreme SuperHyperSet of Extreme SuperHyperEdges[SuperHyperVertices],

Cycle-Neighbor 2447

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

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

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

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2454
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2455
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2456
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Cycle-Neighbor is up. The obvious 2457
simple Extreme type-SuperHyperSet called the Extreme Eulerian-Cycle-Neighbor is an Extreme Supe- 2458
rHyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2459
of the Extreme SuperHyperEdges[SuperHyperVertices], 2460

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- 2461
perSet. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian- 2462
Cycle-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2463
perEdges[SuperHyperVertices], 2464

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

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

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

is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no 2468
an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2469
treme type-SuperHyperSet called the Extreme Eulerian-Cycle-Neighbor and it’s an Extreme 2470
Eulerian-Cycle-Neighbor. Since it’s 2471
2472
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2473

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

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


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

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

Eulerian-Cycle-Neighbor 2479

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

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 2481
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2482
SuperHyperSet called the 2483
“Extreme Eulerian-Cycle-Neighbor ” 2484
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2485
Extreme Eulerian-Cycle-Neighbor , 2486

is only and only 2487

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

CHAPTER 11 2489
The Extreme Departures on The 2490
Theoretical Results Toward Theoretical 2491
Motivations 2492
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2493
SuperHyperClasses. 2494
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2495

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

SuperHyperEulerian-Cycle-Neighbor in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2498
new way to redefine as 2499
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 2500
ViEXT ERN AL in the literatures of SuperHyperEulerian-Cycle-Neighbor. The latter is straightforward. 2501
2502
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2503
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2504
(31.1), is the SuperHyperEulerian-Cycle-Neighbor. 2505
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2506

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 2507
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2508
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2509

2513
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2514
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2515
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Cycle-Neighbor. 2516
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2517

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

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

SuperHyperEulerian-Cycle-Neighbor in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2518
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2519
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2520
way to redefine as 2521

2524

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

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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 2531
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
2532
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 2533
a new way to redefine as 2534

Then there’s no at least one SuperHyperEulerian-Cycle-Neighbor. Thus the notion of quasi may be up 2537
but the SuperHyperNotions based on SuperHyperEulerian-Cycle-Neighbor could be applied. There 2538
are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 2539
as the representative in the 2540
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Cycle-Neighbor taken from a connected Extreme SuperHyperBipartite 2541
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2542
SuperHyperPart SuperHyperEdges are attained in any solution 2543
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2544
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2545
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2546
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2547
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2548
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Cycle-Neighbor. 2549

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

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

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

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

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2563
SuperHyperEdges are attained in any solution 2564
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2565
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2567
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2568
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2569
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2570
the Extreme SuperHyperEulerian-Cycle-Neighbor. 2571
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2572

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

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


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

Extreme SuperHyperEulerian-Cycle-Neighbor in the Extreme Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEulerian-Cycle-Neighbor. Thus the notion of quasi isn’t up and 2579
the SuperHyperNotions based on SuperHyperEulerian-Cycle-Neighbor could be applied. The unique 2580
embedded SuperHyperEulerian-Cycle-Neighbor proposes some longest SuperHyperEulerian-Cycle-Neighbor 2581
excerpt from some representatives. The latter is straightforward. 2582
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2583
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2584
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2585
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2586
Extreme SuperHyperEulerian-Cycle-Neighbor. 2587

CHAPTER 12 2588
The Surveys of Mathematical Sets On 2589
The Results But As The Initial Motivation 2590
For the SuperHyperEulerian-Cycle-Neighbor, Extreme SuperHyperEulerian-Cycle-Neighbor, and the 2591

Extreme SuperHyperEulerian-Cycle-Neighbor, some general results are introduced. 2592
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Cycle-Neighbor is “redefined” on 2593
the positions of the alphabets. 2594
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Cycle-Neighbor. Then 2595
Extreme SuperHyperEulerian − Cycle − N eighbor =

{theSuperHyperEulerian − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − Cycle − N eighbor
|ExtremecardinalityamidthoseSuperHyperEulerian−Cycle−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2596
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2597
and the neutrality, for i = 1, 2, 3, respectively. 2598
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2599
alphabet. Then the notion of Extreme SuperHyperEulerian-Cycle-Neighbor and SuperHyperEulerian-Cycle- 2600
Neighbor coincide. 2601
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2602
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2603
SuperHyperEulerian-Cycle-Neighbor if and only if it’s a SuperHyperEulerian-Cycle-Neighbor. 2604
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2605
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2606
SuperHyperEulerian-Cycle-Neighbor if and only if it’s a longest SuperHyperEulerian-Cycle-Neighbor. 2607
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2608
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Cycle-Neighbor is its 2609
SuperHyperEulerian-Cycle-Neighbor and reversely. 2610
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Cycle-Neighbor, Supe- 2611

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2612
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Cycle-Neighbor is its 2613
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2615
isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Neighbor isn’t well-defined.
Cycle-Neighbor 2616
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2617
Extreme SuperHyperEulerian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 2618

Cycle-Neighbor isn’t well-defined. 2619

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2621
SuperHyperEulerian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Neighbor 2622
isn’t well-defined. 2623
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2624
is well-defined if and only if its SuperHyperEulerian-Cycle-Neighbor is well-defined.
Cycle-Neighbor 2625
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2626

Extreme SuperHyperEulerian-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian-Cycle- 2627
Neighbor is well-defined. 2628

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

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

independent SuperHyperSet is 2648
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2651
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2655

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

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2665
(i) : dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2666
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2667
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2668
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2669
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2670
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2671

which is a SuperHyperEulerian-Cycle-Neighbor/SuperHyperPath. Then the number of 2674
(i) : the SuperHyperEulerian-Cycle-Neighbor; 2675

(ii) : the SuperHyperEulerian-Cycle-Neighbor; 2676
(iii) : the connected SuperHyperEulerian-Cycle-Neighbor; 2677
(iv) : the O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 2678
(v) : the strong O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 2679
(vi) : the connected O(ESHG)-SuperHyperEulerian-Cycle-Neighbor. 2680
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2681
coincide. 2682

which is a SuperHyperWheel. Then the number of 2684
(i) : the dual SuperHyperEulerian-Cycle-Neighbor; 2685
(ii) : the dual SuperHyperEulerian-Cycle-Neighbor; 2686
(iii) : the dual connected SuperHyperEulerian-Cycle-Neighbor; 2687
(iv) : the dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 2688
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 2689
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor. 2690
coincide. 2692
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2694

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

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

(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2712
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2713
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor. 2714

SuperHyperMultipartite. Then Then the number of 2717
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2724
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2725
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2727
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2728
(iv) : SuperHyperEulerian-Cycle-Neighbor; 2732
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 2733
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor. 2734
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2735
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2736
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2737
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2738

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

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

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

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

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



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

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

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

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

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

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

b n c+1 ; 2838
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2839
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2841
bnc
2
Neighbor; 2843
(ii) Γ = b n2 c; 2844

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

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

Cycle-Neighbor for N SHF; 2851
(ii) Γ = m for N SHF : (V, E); 2852
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2853
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle- 2854
Neighbor for N SHF : (V, E). 2855
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2856
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2857
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2858
SuperHyperEulerian-Cycle-Neighbor for N SHF; 2859
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2860

b n c+1 for N SHF : (V, E); 2861
S={vi }i=1

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2865
bnc
2
Neighbor for N SHF : (V, E); 2867
(ii) Γ = b n2 c for N SHF : (V, E); 2868

bnc for N SHF : (V, E); 2869
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Cycle-Neighbor for 2870
N SHF : (V, E). 2871
following statements hold; 2873
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2874

SuperHyperEulerian-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian-Cycle- 2875
Neighbor; 2876
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2877

SuperHyperEulerian-Cycle-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 2878
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2882

SuperHyperEulerian-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian-Cycle- 2883
Neighbor; 2884
SuperHyperEulerian-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2886

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

SuperHyperGraph. Then following statements hold; 2889
(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, 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 V-SuperHyperDefensive 2894

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

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

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

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


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


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

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

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

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

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

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


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

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

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

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

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

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

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

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

141
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 2998
Wondering Open Problems But As The 2999
Directions To Forming The Motivations 3000
In what follows, some “problems” and some “questions” are proposed. 3001
The SuperHyperEulerian-Cycle-Neighbor and the Extreme SuperHyperEulerian-Cycle-Neighbor are defined 3002
on a real-world application, titled “Cancer’s Recognitions”. 3003
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3004
recognitions? 3005
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Cycle-Neighbor 3006

and the Extreme SuperHyperEulerian-Cycle-Neighbor? 3007
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3008
them? 3009
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3010
and the Extreme SuperHyperEulerian-Cycle-Neighbor?
Cycle-Neighbor 3011
Problem 16.0.5. The SuperHyperEulerian-Cycle-Neighbor and the Extreme SuperHyperEulerian- 3012

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

CHAPTER 18 3045
Extreme SuperHyperDuality But As The 3046
Super Forms 3048
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3049

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

Va ∈ Ei , Ej ; 3053
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3054
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3055
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3056
Vi , Vj ∈ Ea ; 3057
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3058
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3059
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3060
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3061

SuperHyperDuality. 3062
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3063

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3068
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3069
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3070
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3071
Extreme SuperHyperDuality; 3072
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3073

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3074
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3075
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3076
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3077
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3078
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3079

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3080
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3081
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3082
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3083
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3084
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3085
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3086
coefficient; 3087
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3088

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3111
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3112
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3113
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3114
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3115

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3116

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

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


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

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 3188
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. 3192
(31.1), is the SuperHyperDuality. 3195
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 3197
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3214
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 3216
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 3219
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3220
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3221
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3222
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3223
representative in the 3224
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 : 3225

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3237

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3241
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3242
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. 3254
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 3256
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 : 3257

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

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

CHAPTER 19 3270
Extreme SuperHyperJoin But As The 3271
Super Forms 3273
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3274

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3285
|Vj |NEUTROSOPIC CARDINALITY ; 3286
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3287
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3288
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3289

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3293
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3294
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3295
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3296
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3297
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3298

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3305
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3306
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3307
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3308
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3309
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3311
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3312

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

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

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

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3330
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3331
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3332
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3333
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3334

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3337

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

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

SuperHyperJoin. 3358
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 3360
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3361
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3362
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3363
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3364
V3 , is excluded in every given Extreme SuperHyperJoin. 3365

is up. The Extreme Algorithm is Extremely straightforward. 3367


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3488
Extreme SuperHyperPerfect But As The 3489
Super Forms 3491
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3492

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3504
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3505

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3509
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3510
Extreme SuperHyperPerfect; 3514
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3515

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

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

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

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

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

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


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

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


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

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

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

SuperHyperModel (31.2), is 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



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

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

Then 3677

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3726
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3727

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3731
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3733
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3734
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3735
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3736

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3743
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3744
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3745
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3746
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3747
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3748
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3749
cient; 3750
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3751

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3752
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3754
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3755
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3756

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

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

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3774
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3775
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3778
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3779
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3780
Extreme coefficient; 3781

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3783
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3785
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3786
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3787
cient. 3790
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3793
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3794
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3795
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3796
SuperHyperTotal. 3800
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 3802
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3803
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3804
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3805
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3806

V3 , is excluded in every given Extreme SuperHyperTotal. 3807



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

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

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

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

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

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

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



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

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



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

CHAPTER 22 3931
Extreme SuperHyperConnected But As 3932
The Extensions Excerpt From Dense And 3933
Super Forms 3934
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3935

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3949
SuperHyperConnected. 3950
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3951
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3954

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

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3963
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3964
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3965
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3966
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3967

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3968
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3969
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3970
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3971
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3972
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3973
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3974
power is corresponded to its Extreme coefficient; 3975
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3976


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

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

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

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

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

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

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

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

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


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

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

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 4076
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. 4080
(31.1), is the SuperHyperConnected. 4083
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 4085
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. 4092
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 4094



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4113

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4148
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4149
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4150
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4151
some representatives. The latter is straightforward. 4152
Extreme SuperHyperConnected. 4157

CHAPTER 23 4158
Background 4159

217













[HG32b; HG44b]. 4365

Bibliography 4366
10.33140/JMTCM.01.03.09) 4370


223
10.20944/preprints202301.0282.v1). 4403
10.20944/preprints202301.0267.v1). 4406

(doi: 10.20944/preprints202301.0265.v1). 4411
prints202301.0262.v1). 4415
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4421
prints202301.0105.v1). 4424
Preprints 2023, 2023010044 4430
10.20944/preprints202301.0043.v1). 4433

(doi: 10.20944/preprints202212.0549.v1). 4442
(doi: 10.20944/preprints202212.0500.v1). 4449
10.5281/zenodo.7857856). 4458
2023, (doi: 10.5281/zenodo.7857841). 4461

10.5281/zenodo.7853867). 4470
10.5281/zenodo.7853922). 4473

(doi: 10.5281/zenodo.7851519). 4476
(doi: 10.5281/zenodo.7851550). 4479
10.5281/zenodo.7834229). 4488
10.5281/zenodo.7834261). 4491
10.5281/zenodo.7824560). 4494
(doi: 10.5281/zenodo.7824623). 4497

2023, (doi: 10.5281/zenodo.7809365). 4508
2023, (doi: 10.5281/zenodo.7809358). 4511

10.5281/zenodo.7809219). 4514
10.5281/zenodo.7809328). 4517
2023, (doi: 10.5281/zenodo.7806767). 4520
2023, (doi: 10.5281/zenodo.7806838). 4523
10.5281/zenodo.7799902). 4532
(doi: 10.5281/zenodo.7804218). 4535
(doi: 10.5281/zenodo.7796334). 4538
10.5281/zenodo.7791952). 4544
10.5281/zenodo.7791982). 4547
10.5281/zenodo.7790026). 4550

10.5281/zenodo.7790052). 4553
2023, (doi: 10.5281/zenodo.7787066). 4556
10.5281/zenodo.7781476). 4562
10.5281/zenodo.7783082). 4565
10.5281/zenodo.7777857). 4568
10.5281/zenodo.7779286). 4571
(doi: 10.5281/zenodo.7771831). 4574
2023, (doi: 10.5281/zenodo.7772468). 4577
10.13140/RG.2.2.20913.25446). 4580
odo.7764916). 4583
10.13140/RG.2.2.11770.98247). 4586
10.13140/RG.2.2.12400.12808). 4589

2023, (doi: 10.13140/RG.2.2.22545.10089). 4592
10.13140/RG.2.2.11377.76644). 4598
10.13140/RG.2.2.23750.96329). 4601
10.13140/RG.2.2.31366.24641). 4604
10.13140/RG.2.2.34721.68960). 4607
2023, (doi: 10.13140/RG.2.2.30212.81289). 4610
10.13140/RG.2.2.24288.35842). 4616
10.13140/RG.2.2.32467.25124). 4619
10.13140/RG.2.2.31025.45925). 4622
10.13140/RG.2.2.17184.25602). 4625
10.13140/RG.2.2.23423.28327). 4628

10.13140/RG.2.2.28456.44805). 4631
10.13140/RG.2.2.23525.68320). 4634
10.13140/RG.2.2.20170.24000). 4637
10.13140/RG.2.2.36475.59683). 4640
10.13140/RG.2.2.29764.71046). 4643
2023, (doi: 10.13140/RG.2.2.18780.87683). 4646
10.13140/RG.2.2.26134.01603). 4652
10.13140/RG.2.2.27392.30721). 4655
10.13140/RG.2.2.33028.40321). 4658
10.13140/RG.2.2.21389.20966). 4661
10.13140/RG.2.2.16356.04489). 4664
10.13140/RG.2.2.21756.21129). 4667

10.13140/RG.2.2.30983.68009). 4670
10.13140/RG.2.2.28552.29445). 4673
(doi: 10.13140/RG.2.2.10936.21761). 4676
10.13140/RG.2.2.35105.89447). 4679
(doi: 10.13140/RG.2.2.30072.72960). 4682
10.13140/RG.2.2.31147.52003). 4685
10.13140/RG.2.2.32825.24163). 4688
10.13140/RG.2.2.13059.58401). 4691
10.13140/RG.2.2.11172.14720). 4694
2023, (doi: 10.13140/RG.2.2.22011.80165). 4697
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4700
2023, (doi: 10.13140/RG.2.2.10493.84962). 4703
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4706

2023, (doi: 10.13140/RG.2.2.19944.14086). 4709
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4712
(doi: 10.13140/RG.2.2.33103.76968). 4715
(doi: 10.13140/RG.2.2.23037.44003). 4718
(doi: 10.13140/RG.2.2.35646.56641). 4721
10.13140/RG.2.2.18030.48967). 4724
(doi: 10.13140/RG.2.2.13973.81121). 4727
2023, (doi: 10.13140/RG.2.2.34106.47047). 4730
2023, (doi: 10.13140/RG.2.2.31956.88961). 4736
2023, (doi: 10.13140/RG.2.2.15179.67361). 4739
10.13140/RG.2.2.21510.45125). 4742
2023, (doi: 10.13140/RG.2.2.13121.84321). 4745

10.13140/RG.2.2.11758.69441). 4748
2023, (doi: 10.13140/RG.2.2.31891.35367). 4751
10.13140/RG.2.2.19360.87048). 4754
10.13140/RG.2.2.32363.21286). 4757
10.13140/RG.2.2.23266.81602). 4760
10.13140/RG.2.2.19911.37285). 4763
10.13140/RG.2.2.11050.90569). 4766
2023, (doi: 10.13140/RG.2.2.17761.79206). 4769
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4775
(doi: 10.13140/RG.2.2.30182.50241). 4778

2023, (doi: 10.13140/RG.2.2.17252.24968). 4811
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4820
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4823


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

10.20944/preprints202301.0282.v1). 4844
10.20944/preprints202301.0267.v1).). 4847
(doi: 10.20944/preprints202301.0265.v1). 4852
prints202301.0262.v1). 4856
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4862


10.13140/RG.2.2.35061.65767). 4865
10.13140/RG.2.2.18494.15680). 4869

10.13140/RG.2.2.32530.73922). 4873
10.13140/RG.2.2.15897.70243). 4877
10.13140/RG.2.2.32530.73922). 4881
prints202301.0105.v1). 4884

10.13140/RG.2.2.23172.19849). 4891

10.13140/RG.2.2.17385.36968). 4901

Preprints 2023, 2023010044 4904

10.20944/preprints202301.0043.v1). 4907
2023, (doi: 10.13140/RG.2.2.28945.92007). 4910
10.13140/RG.2.2.35774.77123). 4916

10.13140/RG.2.2.29430.88642). 4922
(doi: 10.20944/preprints202212.0549.v1). 4928

10.13140/RG.2.2.19380.94084). 4931

(doi: 10.20944/preprints202212.0500.v1). 4942
10.13140/RG.2.2.20993.12640). 4945


10.13140/RG.2.2.29173.86244). 4960
(doi: 10.5281/zenodo.7857906). 4965
2023 (doi: 10.5281/zenodo.7856329). 4967
10.5281/zenodo.7854561). 4969
2023 (doi: 10.5281/zenodo.7851893). 4971

(doi: 10.5281/zenodo.7835063). 4975
(doi: 10.5281/zenodo.7826705). 4977

2023 (doi: 10.5281/zenodo.7820680). 4979
10.5281/zenodo.7812750). 4981


2023 (doi: 10.5281/zenodo.7807782). 4987
2023 (doi: 10.5281/zenodo.7804449). 4989

(doi: 10.5281/zenodo.7792307). 4993
(doi: 10.5281/zenodo.7790728). 4995
2023 (doi: 10.5281/zenodo.7787712). 4997
10.5281/zenodo.7783791). 4999
10.5281/zenodo.7780123). 5001
(doi: 10.5281/zenodo.7773119). 5003
odo.7637762). 5005
10.5281/zenodo.7766174). 5007
10.5281/zenodo.7762232). 5009
(doi: 10.5281/zenodo.7758601). 5011
10.5281/zenodo.7754661). 5013

10.5281/zenodo.7750995) . 5015
(doi: 10.5281/zenodo.7749875). 5017
10.5281/zenodo.7747236). 5019
10.5281/zenodo.7742587). 5021
(doi: 10.5281/zenodo.7738635). 5023
10.5281/zenodo.7734719). 5025
10.5281/zenodo.7730484). 5027
(doi: 10.5281/zenodo.7730469). 5029
10.5281/zenodo.7722865). 5031
odo.7713563). 5033
odo.7709116). 5035
10.5281/zenodo.7706415). 5037
10.5281/zenodo.7706063). 5039
10.5281/zenodo.7701906). 5041
odo.7700205). 5043
10.5281/zenodo.7694876). 5045
10.5281/zenodo.7679410). 5047
10.5281/zenodo.7675982). 5049

10.5281/zenodo.7672388). 5051
odo.7668648). 5053
10.5281/zenodo.7662810). 5055
10.5281/zenodo.7659162). 5057
odo.7653233). 5059
odo.7653204). 5061
odo.7653142). 5063
odo.7653117). 5065
odo.7651687). 5068
odo.7651619). 5070
odo.7651439). 5072
odo.7650729). 5074
odo.7647868). 5076
odo.7647017). 5078
odo.7644894). 5080
odo.7632923). 5083

odo.7623459). 5085
10.5281/zenodo.7606416). 5087
10.5281/zenodo.7606416). 5089
odo.7606404). 5091
10.5281/zenodo.7580018). 5093
odo.7580018). 5095
odo.7580018). 5097
odo.7579929). 5099
10.5281/zenodo.7563170). 5101
odo.7563164). 5103
odo.7563160). 5105
odo.7563160). 5107
10.5281/zenodo.7563160). 5109
10.5281/zenodo.7557063). 5111
10.5281/zenodo.7557009). 5113
10.5281/zenodo.7539484). 5115
10.5281/zenodo.7523390). 5117
10.5281/zenodo.7523390). 5119

10.5281/zenodo.7523390). 5121
odo.7574952). 5123
10.5281/zenodo.7574992). 5125
odo.7523357). 5127
10.5281/zenodo.7523357). 5129
10.5281/zenodo.7504782). 5131
10.5281/zenodo.7504782). 5133
10.5281/zenodo.7504782). 5135
10.5281/zenodo.7499395). 5137
odo.7499395). 5139
10.5281/zenodo.7499395). 5141
10.5281/zenodo.7497450). 5143
10.5281/zenodo.7497450). 5145
10.5281/zenodo.7494862). 5147
odo.7494862). 5149
10.5281/zenodo.7494862). 5151
10.5281/zenodo.7493845). 5153
odo.7493845). 5155

10.5281/zenodo.7493845). 5157
odo.7539484). 5159
odo.7523390). 5161
odo.7523357). 5163
odo.7504782). 5165
odo.7499395). 5167
odo.7497450). 5169
odo.7494862). 5171
odo.7493845). 5173
odo.7480110). 5175
odo.7378758). 5177
odo.6320305). 5179
odo.6677173). 5181

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5262
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5268
research on the modeling of the regions where are under the attacks of the cancer to 5269
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5270
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5271
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5272
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5273

instances and literature reviews have taken the whole way through. In this scientific research, 5274
the literature reviews have fulfilled the lines containing the notions and the results. The 5275
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5276
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5277
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5278
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5279
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5280
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5281
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5282
to figure out the background for the SuperHyperNotions. 5283

CHAPTER 25 5284
Neutrosophic Eulerian-Cycle-Neighbor 5285
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5286
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5287
2023, (doi: 10.13140/RG.2.2.34953.52320). 5288

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5289
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5290
(doi: 10.13140/RG.2.2.33275.80161). 5291
10.13140/RG.2.2.11050.90569). 5294
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5295
10.13140/RG.2.2.17761.79206). 5297
10.13140/RG.2.2.19911.37285). 5300
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5301
10.13140/RG.2.2.23266.81602). 5303
10.13140/RG.2.2.19360.87048). 5306
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5307
10.13140/RG.2.2.32363.21286). 5309
10.13140/RG.2.2.11758.69441). 5312
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5313
10.13140/RG.2.2.31891.35367). 5315
10.13140/RG.2.2.21510.45125). 5318
249
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5319
10.13140/RG.2.2.13121.84321). 5321

CHAPTER 26 5322
New Ideas In Recognition of Cancer And 5323
Neutrosophic SuperHyperGraph By 5324
Eulerian-Cycle-Neighbor As Hyper 5325
Nebbish On Super Nebulous 5326
251
CHAPTER 27 5327
ABSTRACT 5328
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5329
Cycle-Neighbor ). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Cycle-Neighbor 5330

pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = 5331
{E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor 5332
if the following expression is called Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor criteria holds 5333
∀N (Ea ) ∈ C : C is
Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic 5334

e-SuperHyperEulerian-Cycle-Neighbor criteria holds 5335
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5336

SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic v- 5337
SuperHyperEulerian-Cycle-Neighbor criteria holds 5338
∀N (Va ) ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor if the following expression is called Neutrosophic 5339

v-SuperHyperEulerian-Cycle-Neighbor criteria holds 5340
∀N (Va ) ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5341
253

and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor. ((Neutrosophic) SuperHyperEulerian-Cycle- 5344
Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5345
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5346
and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 5349
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 5350
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 5351
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5352
the Extreme SuperHyperEulerian-Cycle-Neighbor; a Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s 5353
either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle- 5354
Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian- 5355

Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 5356
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic Super- 5357
HyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges 5358
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5359
Cycle-Neighbor; an Extreme SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either of 5360

Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5363
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 5364
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 5365
S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 5366
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Cycle-Neighbor; and the 5367
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Cycle- 5368
Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, 5369
and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Su- 5371
perHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5372
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5373
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 5374
Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5375
SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Cycle-Neighbor; 5376
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme 5377
V-SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, 5378

and Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHy- 5380
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5381
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5382
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5383
they form the Extreme SuperHyperEulerian-Cycle-Neighbor; a Neutrosophic V-SuperHyperEulerian- 5384

Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re- 5385
SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutro- 5386
sophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 5387
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVer- 5388

tices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5389

the Neutrosophic SuperHyperEulerian-Cycle-Neighbor; an Extreme V-SuperHyperEulerian-Cycle-Neighbor 5391
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutro- 5392
sophic re-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and 5393
Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 5394
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 5395
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5396
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5397
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5398
SuperHyperEulerian-Cycle-Neighbor; and the Extreme power is corresponded to its Extreme coef- 5399
ficient; a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either of 5400

Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 5403
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 5405
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5406
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5407
SuperHyperEulerian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic 5408
coefficient. In this scientific research, new setting is introduced for new SuperHyperNotions, 5409
namely, a SuperHyperEulerian-Cycle-Neighbor and Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 5410
Two different types of SuperHyperDefinitions are debut for them but the research goes further 5411
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 5418
under research to figure out the challenges make sense about ongoing and upcoming research. 5419
The special case is up. The cells are viewed in the deemed ways. There are different types 5420
of them. Some of them are individuals and some of them are well-modeled by the group of 5421
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 5422
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 5423
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5424
these complex and dense SuperHyperModels open up some avenues to research on theoret- 5425
ical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5426
It’s also officially collected in the form of some questions and some problems. Assume a 5427
SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Cycle-Neighbor is 5428
a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5429
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5430

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

a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 5439
a SuperHyperEulerian-Cycle-Neighbor . Since there’s more ways to get type-results to make a 5440
SuperHyperEulerian-Cycle-Neighbor more understandable. For the sake of having Neutrosophic 5441

SuperHyperEulerian-Cycle-Neighbor, there’s a need to “redefine” the notion of a “SuperHyperEulerian- 5442
Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 5443
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 5444
to assign to the values. Assume a SuperHyperEulerian-Cycle-Neighbor . It’s redefined a Neutrosophic 5445
SuperHyperEulerian-Cycle-Neighbor if the mentioned Table holds, concerning, “The Values of 5446
Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic 5447
SuperHyperGraph” with the key points, “The Values of The Vertices & The Number 5448
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperEulerian-Cycle- 5453

Neighbor . It’s the main. It’ll be disciplinary to have the foundation of previous definition in 5454
the kind of SuperHyperClass. If there’s a need to have all SuperHyperEulerian-Cycle-Neighbor until 5455
the SuperHyperEulerian-Cycle-Neighbor, then it’s officially called a “SuperHyperEulerian-Cycle-Neighbor” 5456
but otherwise, it isn’t a SuperHyperEulerian-Cycle-Neighbor . There are some instances about the 5457
clarifications for the main definition titled a “SuperHyperEulerian-Cycle-Neighbor ”. These two 5458
examples get more scrutiny and discernment since there are characterized in the disciplinary 5459
ways of the SuperHyperClass based on a SuperHyperEulerian-Cycle-Neighbor . For the sake of 5460
having a Neutrosophic SuperHyperEulerian-Cycle-Neighbor, there’s a need to “redefine” the notion of 5461
a “Neutrosophic SuperHyperEulerian-Cycle-Neighbor” and a “Neutrosophic SuperHyperEulerian-Cycle- 5462
Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 5463
letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5464
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHy- 5465
perGraph” if the intended Table holds. And a SuperHyperEulerian-Cycle-Neighbor are redefined to a 5466
“Neutrosophic SuperHyperEulerian-Cycle-Neighbor” if the intended Table holds. It’s useful to define 5467
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 5468
results to make a Neutrosophic SuperHyperEulerian-Cycle-Neighbor more understandable. Assume 5469
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5470

intended Table holds. Thus SuperHyperPath, SuperHyperEulerian-Cycle-Neighbor, SuperHyperStar, 5471
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5472
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”, “Neutrosophic SuperHyper- 5473
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5474
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5475
“Neutrosophic SuperHyperEulerian-Cycle-Neighbor” where it’s the strongest [the maximum Neutro- 5476
sophic value from all the SuperHyperEulerian-Cycle-Neighbor amid the maximum value amid all 5477
SuperHyperVertices from a SuperHyperEulerian-Cycle-Neighbor .] SuperHyperEulerian-Cycle-Neighbor . 5478
A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5479
SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5480

SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5481
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Cycle-Neighbor if it’s 5482
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5483
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5484
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 5486
and the common and intended properties between “specific” cells and “specific group” of 5494
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 5495
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 5496
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 5497
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 5498
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 5499
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 5500
of the move from the cancer is identified by this research. Sometimes the move of the cancer 5501
of the cancer on the complex tracks and between complicated groups of cells could be fan- 5507
tasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Neighbor, SuperHyperStar, 5508
the longest SuperHyperEulerian-Cycle-Neighbor or the strongest SuperHyperEulerian-Cycle-Neighbor 5510
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Cycle-Neighbor, 5511

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

and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Cycle-Neighbor 5518
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5519
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Cycle-Neighbor, Cancer’s Neut- 5520
rosophic Recognition 5521


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

are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5569
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 5570
three SuperHyperEdges to form any style of a SuperHyperEulerian-Cycle-Neighbor. There isn’t 5571
any formation of any SuperHyperEulerian-Cycle-Neighbor but literarily, it’s the deformation of any 5572
SuperHyperEulerian-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. 5573
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 5574
the “ amount of SuperHyperEulerian-Cycle-Neighbor” of either individual of cells or the groups of cells 5575
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5576
Cycle-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 5577
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5578
these messy and dense SuperHyperModels where embedded notions are illustrated? 5579
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5580
it motivates us to define different types of “ SuperHyperEulerian-Cycle-Neighbor” and “Neutrosophic 5581
SuperHyperEulerian-Cycle-Neighbor” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5582

The framework of this research is as follows. In the beginning, I introduce basic definitions 5588
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5589
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5590
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5591
review literature are applied to make sense about what’s going to figure out about the upcoming 5592
sections. The main definitions and their clarifications alongside some results about new notions, 5593
SuperHyperEulerian-Cycle-Neighbor and Neutrosophic SuperHyperEulerian-Cycle-Neighbor, are figured out 5594

in sections “ SuperHyperEulerian-Cycle-Neighbor” and “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”. 5595
In the sense of tackling on getting results and in Eulerian-Cycle-Neighbor to make sense about continu- 5596
ing the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5597
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5598
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5599
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5600

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5601
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results 5602
on Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRela- 5603
tions and as concluding and closing section of theoretical research are contained in the section 5604
“General Results”. Some general SuperHyperRelations are fundamental and they are well-known 5605
as fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5606
“ SuperHyperEulerian-Cycle-Neighbor”, “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”, “Results on 5607

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5608
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5609
this research and going to figure out the word “best” as the description and adjective for this 5610
research as presented in section, “ SuperHyperEulerian-Cycle-Neighbor”. The keyword of this research 5611
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5612
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5613
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5614
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5615
research in the terms of “questions” and “problems” to make sense to figure out this research in 5616
featured style. The advantages and the limitations of this research alongside about what’s done 5617
in this research to make sense and to get sense about what’s figured out are included in the 5618
section, “Conclusion and Closing Remarks”. 5619

CHAPTER 29 5620
Neutrosophic Preliminaries Of This 5621
Scientific Research On the Redeemed 5622
Ways 5623
In this section, the basic material in this scientific research, is referred to [Single Valued 5624
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5625

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5626
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5627
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5628
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5629
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5630
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5631
their clarifications are addressed to Ref.[HG38]. 5632
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5633
the new ideas and their clarifications are elicited. 5634
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Eulerian-Cycle-Neighbor of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 5635
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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

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

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5674
x, y, z, w ∈ [0, 1]: 5675
(i) 1 ⊗ x = x; 5676
(ii) x ⊗ y = y ⊗ x; 5677
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5678
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5679

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

where 5682

1, 2, . . . , n0 ); 5687
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5688
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5689
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5690
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5691
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5703
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5704
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5705
SuperEdge; 5711
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5714
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5715
makes the patterns and regularities. 5716
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5717
of elements of SuperHyperEdges are the same. 5718

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5719
makes to have SuperHyperUniform more understandable. 5720
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5721
Classes as follows. 5722
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5723
two given SuperHyperEdges with two exceptions; 5724
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5725
SuperHyperEdges; 5726
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5727
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5728
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5729
in common; 5730
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5731
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5732
SuperHyperEdge in common; 5733
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5734
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5735
SuperVertex. 5736
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 5737
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5738
(i) Vi , Vi+1 ∈ Ei0 ; 5739
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5740
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5741
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5742
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5743
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5744
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5745
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5746
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5748
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5749
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5750
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5751
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5752
perPath . 5753
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 5754
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5755
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5756
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5757
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5758
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5759

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

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


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

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

Neighbor). 5776
(i) Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 5780

Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor criteria holds 5781
∀N (Ea ) ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 5782

Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor criteria holds 5783
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5784
(iii) Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 5785
∀N (Va ) ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Cycle-Neighbor if the following expression is called 5787
∀N (Va ) ∈ C : C is

(v) Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e- 5790

Neighbor. 5793
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Cycle-Neighbor). 5794

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


the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 5802
(ii) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic e- 5805

maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5809
(iii) an Extreme SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if it’s either 5813

of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian- 5814
Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv- 5815
SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 5816

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coeffi- 5817
cients defined as the Extreme number of the maximum Extreme cardinality of the 5818
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5819
(iv) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial 5823

rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Super- 5826

HyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5827
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 5828
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperEulerian- 5831
Cycle-Neighbor; and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 5832

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

Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 5837
(vi) a Neutrosophic V-SuperHyperEulerian-Cycle-Neighbor if it’s either of Neutrosophic 5841

e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Cycle-Neighbor, Neut- 5842
rosophic v-SuperHyperEulerian-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Cycle- 5843
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 5845
(vii) an Extreme V-SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial if 5849

it’s either of Neutrosophic e-SuperHyperEulerian-Cycle-Neighbor, Neutrosophic re- 5850
rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyper- 5852
Graph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5853
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5854
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5855

(viii) a Neutrosophic SuperHyperEulerian-Cycle-Neighbor SuperHyperPolynomial 5859

rosophic rv-SuperHyperEulerian-Cycle-Neighbor and C(N SHG) for a Neutrosophic Supe- 5862
rHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5863
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 5866

sophic SuperHyperEulerian-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 5868
Neutrosophic coefficient. 5869
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Cycle-Neighbor). 5870

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5871
(i) an δ−SuperHyperEulerian-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 5872
SuperHyperEulerian-Cycle-Neighbor such that either of the following expressions hold for the 5873


136TBL3
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5874
|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 5875
(29.1), holds if S is an δ−SuperHyperDefensive; 5876
(ii) a Neutrosophic δ−SuperHyperEulerian-Cycle-Neighbor is a Neutrosophic kind of Neut- 5877

rosophic SuperHyperEulerian-Cycle-Neighbor such that either of the following Neutrosophic 5878
expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5879
|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 5880

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5881
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5883
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5884
there’s the usage of the position of labels to assign to the values. 5885
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5887
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5888
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5889
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5891
sophic SuperHyperPath , SuperHyperEulerian-Cycle-Neighbor, SuperHyperStar, SuperHyperBipart- 5892
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5893
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5894
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5895
perHyperWheel if the Table (29.2) holds. 5896
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 5897

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian-Cycle- 5898
Neighbor more Neutrosophicly understandable. 5899

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

136TBL4

136TBL1

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Cycle-Neighbor”. The 5901
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5902
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5903
5904
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Cycle-Neighbor. It’s redefined a Neutrosophic 5905

SuperHyperEulerian-Cycle-Neighbor if the Table (29.3) holds. 5906

CHAPTER 30 5907
Neutrosophic SuperHyper But As Eulerian-Cycle-Neighbor 5908
Super Forms 5910
Definition 30.0.1. (Neutrosophic event). 5911
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5912
a probability Eulerian-Cycle-Neighbor. Any Neutrosophic k-subset of A of V is called Neutrosophic 5913
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5914
following expression is called Neutrosophic probability of A. 5915
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5916

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

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

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

called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Cycle-Neighbor like E is 5925
called Neutrosophic Variable. 5926
The notion of independent on Neutrosophic Variable is likewise. 5927
Definition 30.0.4. (Neutrosophic Expectation). 5928
275
is a probability Eulerian-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 5930

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5931
criteria 5932
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5933
is a probability Eulerian-Cycle-Neighbor. A Neutrosophic number is called Neutrosophic Crossing 5935
if the following expression is called Neutrosophic Crossing criteria 5936
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). 5937
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let m and n propose special Eulerian-Cycle- 5938
Neighbor. Then with m ≥ 4n, 5939
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Eulerian-Cycle-Neighbor p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5940
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5941
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5942

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

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

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

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

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5964
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5965
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5966
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5967
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5968
4/3 4/3
k < 4n + n < 5n . 5969
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5970
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let X be a nonnegative Neutrosophic 5971
Variable and t a positive real number. Then 5972
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. 5973
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5974
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let Xn be a nonnegative integer-valued 5975
variable in a probability Eulerian-Cycle-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 5976

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

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5982
S = (V, E) is a probability Eulerian-Cycle-Neighbor. A special SuperHyperGraph in Gn,p is up. Let 5983
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 5984
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 5985
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 5986
of the Neutrosophic SuperHyperGraph G. 5987
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5988
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5989
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 5990
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5991
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: 5992
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5993
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 5994
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5995
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5996
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5997
Definition 30.0.12. (Neutrosophic Variance). 5998
is a probability Eulerian-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 6000
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6001
criteria 6002
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let X be a Neutrosophic Variable and 6004
let t be a positive real number. Then 6005
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let X be a Neutrosophic Variable and let t be a 6007
positive real number. Then 6008
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6009
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let Xn be a Neutrosophic Variable in a 6011

probability Eulerian-Cycle-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 6012
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Cycle-Neighbor. Set X := Xn and t := |Ex(Xn )| in 6014
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6015
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6016
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6018
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 6019
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6020
S = (V, E) is a probability Eulerian-Cycle-Neighbor. As in the proof of related Theorem, the result is 6022
Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be as 6025
defined in previous Theorem. Then either: 6026
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6027
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6028
Definition 30.0.17. (Neutrosophic Threshold). 6031
is a probability Eulerian-Cycle-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 6033
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 6034
P is a function f (n) such that: 6035
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6036
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6037

Definition 30.0.18. (Neutrosophic Balanced). 6038

is a probability Eulerian-Cycle-Neighbor. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6040
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6041
SubSuperHyperGraph is called Neutrosophic Balanced. 6042
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6043

(V, E). Consider S = (V, E) is a probability Eulerian-Cycle-Neighbor. Let F be a nonempty 6044
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6045
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6046
SubSuperHyperGraph. 6047
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6050
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6051
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6052

SuperHyperEulerian-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 6053
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6054
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6055

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6056
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6057
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6058
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6059
Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6060
C(N SHG)Neutrosophic Eulerian-Cycle-Neighbor

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

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

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

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

Neighbor. 6070

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


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



= z8 + z4 + z3.
6075


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






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


= {}.
= 0z 0 .



= {}.
= 0z 0 .
6087


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




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


= {}.


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


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







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


= {}.


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


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




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


= {}.


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


= {}.


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


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







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


= {}.



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


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


= 0z 0 .
6143


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


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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
6151
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6152
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Cycle- 6153


Neutrosophic SuperHyperEulerian-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 95NHG2
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6154
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6155
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6156
them. 6157
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6158
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6159
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6160
Neutrosophic quasi-R-Eulerian-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to some of 6161
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6162
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6163
quasi-R-Eulerian-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but not 6164
all of them. 6165
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Neighbor 6166
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6167
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6168
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6169
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6170

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

Then the Neutrosophic number of type-result-R-Eulerian-Cycle-Neighbor has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Eulerian-Cycle-Neighbor with the least Neutrosophic cardinality, 6174

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

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

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−Cycle−N eighborSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Eulerian-Cycle-Neighbor since
neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges) more
than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us
consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of

Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Eulerian-Cycle-Neighbor. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Eulerian-Cycle-Neighbor is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types
but the SuperHyperStable is only up in this quasi-R-Eulerian-Cycle-Neighbor. It’s the contradiction
to that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Eulerian-Cycle-Neighbor decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower
Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHy-
perVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the
outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of
the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the

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

the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Eulerian-Cycle-Neighbor. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic
SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic set-
ting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least
one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Eulerian-Cycle-Neighbor
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic
R-Eulerian-Cycle-Neighbor has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Eulerian-Cycle-Neighbor since either the Neutrosophic SuperHyperGraph is an obvi-
ous Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic usage
of this Neutrosophic framework and even more there’s no Neutrosophic connection inside or the
Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a Neutrosophic
contradiction with the term “Neutrosophic R-Eulerian-Cycle-Neighbor” since the maximum Neutro-
sophic cardinality never happens for this Neutrosophic style of the Neutrosophic SuperHyperSet
and beyond that there’s no Neutrosophic connection inside as mentioned in first Neutrosophic
case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Eulerian-Cycle-Neighbor is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic

SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes

a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices
Is a Neutrosophic R-Eulerian-Cycle-Neighbor for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Eulerian-Cycle-Neighbor.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Eulerian-Cycle-Neighbor. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices

Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Eulerian-Cycle-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Cycle-Neighbor but with
slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

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

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended SuperHyperVertices
but in a Neutrosophic Eulerian-Cycle-Neighbor, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E).
If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices,
then the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Cycle-Neighbor 6183
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the Neut- 6184
rosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6185
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains the max- 6186
imum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6187

in some cases but the maximum number of the Neutrosophic SuperHy-

perEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, has the 6189
Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Cycle-Neighbor. 6190
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6191
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6192
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6193
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6194
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6195
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6196
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6197
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6198
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6199
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6200

Neutrosophic quasi-R-Eulerian-Cycle-Neighbor where the Neutrosophic completion of the Neutrosophic 6201
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Eulerian-Cycle-Neighbor. 6202
The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In 6203
the original setting, these types of SuperHyperSets only don’t satisfy on the maximum Super- 6204
HyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 6205
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 6206

timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 6207
minimum Neutrosophic style of the embedded Neutrosophic R-Eulerian-Cycle-Neighbor. The interior 6208
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 6209
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 6210
common connections, more precise and more formal, the perfect unique connections inside the 6211
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 6212
the Neutrosophic R-Eulerian-Cycle-Neighbor. Thus Neutrosophic exterior SuperHyperVertices could 6213
be used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation 6214
with the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. 6215
In the embedded Neutrosophic Eulerian-Cycle-Neighbor, there’s the usage of exterior Neutrosophic 6216
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 6217
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no 6218
connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6219
tices with one SuperHyperElement has been ignored in the exploring to lead on the optimal 6220
case implying the Neutrosophic R-Eulerian-Cycle-Neighbor. The Neutrosophic R-Eulerian-Cycle-Neighbor 6221
with the exclusion of the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic 6222
SuperHyperEdge and with other terms, the Neutrosophic R-Eulerian-Cycle-Neighbor with the in- 6223
clusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a 6224
Neutrosophic quasi-R-Eulerian-Cycle-Neighbor. To sum them up, in a connected non-obvious Neut- 6225
rosophic SuperHyperGraph ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge 6226
E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct interior Neutrosophic 6227
SuperHyperVertices inside of any given Neutrosophic quasi-R-Eulerian-Cycle-Neighbor minus all Neut- 6228
rosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only 6229
an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic 6230
SuperHyperVertices in an Neutrosophic quasi-R-Eulerian-Cycle-Neighbor, minus all Neutrosophic 6231
SuperHypeNeighbor to some of them but not all of them. 6232
The main definition of the Neutrosophic R-Eulerian-Cycle-Neighbor has two titles. a Neut- 6233

rosophic quasi-R-Eulerian-Cycle-Neighbor and its corresponded quasi-maximum Neutrosophic R- 6234

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 6235
ber, there’s a Neutrosophic quasi-R-Eulerian-Cycle-Neighbor with that quasi-maximum Neutrosophic 6236
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 6237
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 6238
lead us to take the collection of all the Neutrosophic quasi-R-Eulerian-Cycle-Neighbors for all Neut- 6239
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 6240
of the Neutrosophic Eulerian-Cycle-Neighbor ends up but this essence starts up in the terms of the 6241
Neutrosophic quasi-R-Eulerian-Cycle-Neighbor, again and more in the operations of collecting all the 6242
Neutrosophic quasi-R-Eulerian-Cycle-Neighbors acted on the all possible used formations of the Neut- 6243
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 6244
considered as the equivalence class for all corresponded quasi-R-Eulerian-Cycle-Neighbors. Let 6245
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Cycle-Neighbor be a Neutro- 6246

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

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Cycle-Neighbor is re-formalized 6248
and redefined as follows. 6249
GNeutrosophic Eulerian-Cycle-Neighbor ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6250
definition for the Neutrosophic Eulerian-Cycle-Neighbor. 6251
GNeutrosophic Eulerian-Cycle-Neighbor =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class

In more concise and more convenient ways, the modified definition for the Neutrosophic Eulerian- 6252
poses the upcoming expressions.
Cycle-Neighbor 6253
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6254
= max zNeutrosophic Number

And then, 6255

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


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


6258
[zNeutrosophic
Number ]Neutrosophic Class

6259

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6260
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6261
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6262
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6263
Cycle-Neighbor” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Cycle-Neighbor” 6264
since “Neutrosophic Quasi-Eulerian-Cycle-Neighbor” happens “Neutrosophic Eulerian-Cycle-Neighbor” in a 6265
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Super- 6266
HyperNeighborhood” may not happens “Neutrosophic Eulerian-Cycle-Neighbor” in a Neutrosophic 6267
SuperHyperGraph as initial framework and preliminarily background since there are some am- 6268
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 6269
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Cycle-Neighbor”, 6270
and “Neutrosophic Eulerian-Cycle-Neighbor” are up. 6271
Thus, let 6272
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6273

GNeutrosophic Eulerian-Cycle-Neighbor be a Neutrosophic number, a Neutrosophic SuperHyperNeigh- 6274
borhood and a Neutrosophic Eulerian-Cycle-Neighbor and the new terms are up. 6275
GNeutrosophic Eulerian-Cycle-Neighbor ∈ ∪zNeutrosophic Number

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

6277
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6278
And with go back to initial structure, 6279
GNeutrosophic Eulerian-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6281


6282

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Eulerian-Cycle-Neighbor is related to the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Cycle-Neighbor is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Cycle-Neighbor is a
Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Cycle-Neighbor is up. To sum
them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Cycle-

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Eulerian-Cycle-Neighbor. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Eulerian-Cycle-Neighbor,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-
Cycle-Neighbor, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6283
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6284
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6285
type-SuperHyperSet called the 6286
“Neutrosophic R-Eulerian-Cycle-Neighbor” 6287

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6288
Neutrosophic R-Eulerian-Cycle-Neighbor, 6289
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-Cycle-Neighbor amid those obvious simple Neutro-
sophic type-SuperHyperSets of the Neutrosophic Eulerian-Cycle-Neighbor, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Eulerian-Cycle-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Eulerian-Cycle-Neighbor is the cardinality of
6290
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all in- 6291
terior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Cycle-Neighbor 6292
if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6293
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6294
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6295
them. 6296
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6297
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6298
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6299
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6300
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6301
Consider there’s a Neutrosophic R-Eulerian-Cycle-Neighbor with the least cardinality, the lower 6302
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6303
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6304
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6305
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6306
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Cycle-Neighbor. Since it doesn’t 6307
have 6308
6309

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6310

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6311
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6312
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6313
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6314
Cycle-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6315
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6316

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6317
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVer- 6318
tex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6319
in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6320
There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6321
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6322
obvious Neutrosophic R-Eulerian-Cycle-Neighbor, VESHE is up. The obvious simple Neutrosophic 6323
type-SuperHyperSet of the Neutrosophic R-Eulerian-Cycle-Neighbor, VESHE , is a Neutrosophic Supe- 6324
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6325
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6326
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6327
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6328

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6329
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6330
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6331
R-Eulerian-Cycle-Neighbor only contains all interior Neutrosophic SuperHyperVertices and all exterior 6332
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6333
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6334
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6335
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6336
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6337
The SuperHyperNotion, namely, Eulerian-Cycle-Neighbor, is up. There’s neither empty SuperHy- 6338
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6339
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6340

the Neutrosophic Eulerian-Cycle-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic 6341
SuperHyperEdges[SuperHyperVertices], 6342

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6344

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

ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6346
6347
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6349
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6350
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6351
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6352
Neutrosophic Eulerian-Cycle-Neighbor is up. The obvious simple Neutrosophic type-SuperHyperSet 6353

called the Neutrosophic Eulerian-Cycle-Neighbor is a Neutrosophic SuperHyperSet includes only two 6354
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6355

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- 6357
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6358
Eulerian-Cycle-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6359

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

Cycle-Neighbor. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6362
perEdges[SuperHyperVertices], 6363

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6366
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Cycle-Neighbor 6367
and it’s an Neutrosophic Eulerian-Cycle-Neighbor. Since it’s 6368
6369
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6371

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

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

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


= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Cycle- 6376
, not:
Neighbor 6377

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

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- 6379
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6380
Neutrosophic type-SuperHyperSet called the 6381
“Neutrosophic Eulerian-Cycle-Neighbor ” 6382
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6383
Neutrosophic ,
is only and only 6385

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


= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6386

CHAPTER 31 6387
The Neutrosophic Departures on The 6388
Theoretical Results Toward Theoretical 6389
Motivations 6390
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6391
Neutrosophic SuperHyperClasses. 6392
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6393

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

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

6400
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6401
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6402
SuperHyperModel (31.1), is the SuperHyperEulerian-Cycle-Neighbor. 6403
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6404

= {}.
= 0z 0 .

= {}.
= 0z 0 .
Proof. Let 6405
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6406
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6407

6411
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6412
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6413
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6414
6415
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6416

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

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

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

6423

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

Neutrosophic SuperHyperEulerian-Cycle-Neighbor in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6424
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6425
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6426
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6427
the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6428
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6429
Then 6430

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

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

are only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6439
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Cycle-Neighbor taken from a connected Neutrosophic SuperHyperBi- 6441
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6442
of-SuperHyperPart SuperHyperEdges are attained in any solution 6443
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6445
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6446
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6447
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6448
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6449

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

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

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

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

are only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex 6461
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6463
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6464
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6468
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6469
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6470
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6471
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6472
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6473
Then, 6474

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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
Proof. Let 6475
P :
CEN T ER, E2∗
6476
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Cycle-Neighbor taken from a connected Neutrosophic SuperHyper- 6477
Wheel ESHW : (V, E). There’s a new way to redefine as 6478


Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Cycle-Neighbor in the Neutrosophic Example (42.0.15) 136NSHG23a
Then there’s at least one SuperHyperEulerian-Cycle-Neighbor. Thus the notion of quasi isn’t up and 6481
the SuperHyperNotions based on SuperHyperEulerian-Cycle-Neighbor could be applied. The unique 6482
embedded SuperHyperEulerian-Cycle-Neighbor proposes some longest SuperHyperEulerian-Cycle-Neighbor 6483
excerpt from some representatives. The latter is straightforward. 6484
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6485
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6486
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6487
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6488
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6489

CHAPTER 32 6490
The Surveys of Mathematical Sets On 6491
The Results But As The Initial Motivation 6492
For the SuperHyperEulerian-Cycle-Neighbor, Neutrosophic SuperHyperEulerian-Cycle-Neighbor, and the 6493

Neutrosophic SuperHyperEulerian-Cycle-Neighbor, some general results are introduced. 6494
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Cycle-Neighbor is “redefined” 6495
on the positions of the alphabets. 6496
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Cycle-Neighbor. Then 6497
N eutrosophic SuperHyperEulerian − Cycle − N eighbor =

{theSuperHyperEulerian − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − Cycle − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−Cycle−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6498
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6499
the neutrality, for i = 1, 2, 3, respectively. 6500
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6501
alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Cycle-Neighbor and SuperHyperEulerian- 6502
Cycle-Neighbor coincide. 6503
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6504
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6505
SuperHyperEulerian-Cycle-Neighbor if and only if it’s a SuperHyperEulerian-Cycle-Neighbor. 6506
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6507
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6508
SuperHyperEulerian-Cycle-Neighbor if and only if it’s a longest SuperHyperEulerian-Cycle-Neighbor. 6509
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6510
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Cycle-Neighbor is its 6511
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Cycle-Neighbor, 6513

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6514
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Cycle-Neighbor is its 6515
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6517

SuperHyperEulerian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Cycle-Neighbor 6518
isn’t well-defined. 6519
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6520

Neutrosophic SuperHyperEulerian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 6521

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6524
Neutrosophic SuperHyperEulerian-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 6525
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6527

SuperHyperEulerian-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian-Cycle-Neighbor is 6528
well-defined. 6529
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6530
Neutrosophic SuperHyperEulerian-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian- 6531

Cycle-Neighbor is well-defined. 6532
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 6534

Neutrosophic SuperHyperEulerian-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian- 6535
Cycle-Neighbor is well-defined. 6536
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6537
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6538
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6539
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6540
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6541
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6542
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor. 6543
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6544
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6547

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

independent SuperHyperSet is 6552
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6555
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6559

Graph which is a SuperHyperEulerian-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 6560
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6564
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6565
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6566
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6568
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6569
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6573
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6574
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6575
Graph which is a SuperHyperEulerian-Cycle-Neighbor/SuperHyperPath. Then the number of 6578

(i) : the SuperHyperEulerian-Cycle-Neighbor; 6579
(ii) : the SuperHyperEulerian-Cycle-Neighbor; 6580
(iii) : the connected SuperHyperEulerian-Cycle-Neighbor; 6581
(iv) : the O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 6582
(v) : the strong O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 6583
(vi) : the connected O(ESHG)-SuperHyperEulerian-Cycle-Neighbor. 6584
coincide. 6586

Graph which is a SuperHyperWheel. Then the number of 6588
(i) : the dual SuperHyperEulerian-Cycle-Neighbor; 6589
(ii) : the dual SuperHyperEulerian-Cycle-Neighbor; 6590
(iii) : the dual connected SuperHyperEulerian-Cycle-Neighbor; 6591
(iv) : the dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 6592
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor; 6593
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Cycle-Neighbor. 6594
coincide. 6596
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6597

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6609
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6610
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6611
SuperHyperPart is a 6612
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6616
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6617
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor. 6618
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6620

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6639
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6640
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6641
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6642

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


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

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6660

SuperHyperEulerian-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6662
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6663
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6667
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor; 6668
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Cycle-Neighbor. 6669


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


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

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

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

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

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6723
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6724
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6726
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Cycle-Neighbor; 6727
(ii) Γ = 1; 6728
(iii) Γs = Σ3i=1 σi (c); 6729
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle-Neighbor. 6730
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6731

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

b n c+1 ; 6742
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6743
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6745
bnc
2
Neighbor; 6747
(ii) Γ = b n2 c; 6748

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

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

Cycle-Neighbor for N SHF; 6755
(ii) Γ = m for N SHF : (V, E); 6756
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6757
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Cycle- 6758
Neighbor for N SHF : (V, E). 6759
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6760
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6761

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

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

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

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

SuperHyperEulerian-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian-Cycle- 6779
Neighbor; 6780

SuperHyperEulerian-Cycle-Neighbor, then S is a dual s-SuperHyperDefensive SuperHyperEulerian- 6782
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6786
SuperHyperEulerian-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian-Cycle- 6787

Neighbor; 6788

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

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6834
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6836

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

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


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

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

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


CHAPTER 33 6852
Neutrosophic Applications in Cancer’s 6853
Neutrosophic Recognition 6854
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6855
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6856
disease is considered and as the consequences of the model, some parameters are used. The cells 6857
are under attack of this disease but the moves of the cancer in the special region are the matter 6858
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6859
treatments for this Neutrosophic disease. 6860
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6861
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6862
term Neutrosophic function. 6863
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6864
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6865
move from the cancer is identified by this research. Sometimes the move of the cancer 6866
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6867
about the moves and the effects of the cancer on that region; this event leads us to 6868
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6869
perception on what’s happened and what’s done. 6870
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6871
known and they’ve got the names, and some general Neutrosophic models. The moves 6872
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6873
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 6874
Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 6875
perWheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Cycle-Neighbor 6876

or the Neutrosophic SuperHyperEulerian-Cycle-Neighbor in those Neutrosophic Neutrosophic 6877
SuperHyperModels. 6878
341
CHAPTER 34 6879
Case 1: The Initial Neutrosophic Steps 6880
Toward Neutrosophic 6881
SuperHyperBipartite as Neutrosophic 6882
SuperHyperModel 6883
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6884
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6885
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- 6886
perBipartite is obtained. 6887
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6888
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6889
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6890
(34.1), is the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6891

CHAPTER 35 6892
Case 2: The Increasing Neutrosophic 6893
Steps Toward Neutrosophic 6894
SuperHyperMultipartite as 6895
Neutrosophic SuperHyperModel 6896
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6897
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6898
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6899
perMultipartite is obtained. 6900
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6901
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- 6902

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6903
Neutrosophic SuperHyperEulerian-Cycle-Neighbor. 6904

CHAPTER 36 6905
Wondering Open Problems But As The 6906
Directions To Forming The Motivations 6907
In what follows, some “problems” and some “questions” are proposed. 6908
The SuperHyperEulerian-Cycle-Neighbor and the Neutrosophic SuperHyperEulerian-Cycle-Neighbor are 6909
defined on a real-world application, titled “Cancer’s Recognitions”. 6910
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6911
recognitions? 6912
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Cycle-Neighbor 6913

and the Neutrosophic SuperHyperEulerian-Cycle-Neighbor? 6914
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6915
them? 6916
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6917
and the Neutrosophic SuperHyperEulerian-Cycle-Neighbor?
Cycle-Neighbor 6918
Problem 36.0.5. The SuperHyperEulerian-Cycle-Neighbor and the Neutrosophic SuperHyperEulerian- 6919

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
Cycle-Neighbor 6920
SuperHyperEulerian-Cycle-Neighbor, are there else? 6921
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6922
Numbers types-results? 6923
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6924
the multiple types of SuperHyperNotions? 6925
347
CHAPTER 37 6926
Conclusion and Closing Remarks 6927
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6928
research are illustrated. Some benefits and some advantages of this research are highlighted. 6929
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6930
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Cycle-Neighbor. 6931
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6932
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6933
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian-Cycle-Neighbor, 6934
finds the convenient background to implement some results based on that. Some SuperHy- 6935
perClasses and some Neutrosophic SuperHyperClasses are the cases of this research on the 6936
modeling of the regions where are under the attacks of the cancer to recognize this disease as 6937
it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHy- 6938
perNotion, SuperHyperEulerian-Cycle-Neighbor, the new SuperHyperClasses and SuperHyperClasses, 6939
are introduced. Some general results are gathered in the section on the SuperHyperEulerian-Cycle- 6940
Neighbor and the Neutrosophic SuperHyperEulerian-Cycle-Neighbor. The clarifications, instances and 6941
literature reviews have taken the whole way through. In this research, the literature reviews 6942
have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 6943
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 6944
both bases are the background of this research. Sometimes the cancer has been happened on the 6945
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 6946
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 6947
longest and strongest styles with the formation of the design and the architecture are formally 6948
called “ SuperHyperEulerian-Cycle-Neighbor” in the themes of jargons and buzzwords. The prefix 6949
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6950
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6951
pointed out and spoken out. 6952
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Cycle-Neighbor
3. Neutrosophic SuperHyperEulerian-Cycle-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6953
Neutrosophic SuperHyperDuality But As 6954
Super Forms 6956
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6957

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6961

Va ∈ Ei , Ej ; 6962
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6963

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6964
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6965

Vi , Vj ∈ Ea ; 6966
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6967

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6968
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6969

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6970
sophic rv-SuperHyperDuality. 6971
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6972

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6975

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6977
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6978
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6979
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6980
form the Extreme SuperHyperDuality; 6981
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6982

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6984
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6985
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6986
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6987
such that they form the Neutrosophic SuperHyperDuality; 6988
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6989
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6990

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6991
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6992
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6993
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6994
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6996
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6998

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7000
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7001
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7002
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7003
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 7004
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7005
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7006
coefficient; 7007
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7008

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7010
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7011
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 7012
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 7013
form the Extreme SuperHyperDuality; 7014
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7015

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7016
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7017
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7018
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7019
such that they form the Neutrosophic SuperHyperDuality; 7021
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7022

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7023
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7024

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7026
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7029
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7031

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7033

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7036
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7039
coefficient. 7040
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7041
the mentioned Neutrosophic Figures in every Neutrosophic items. 7042

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7044
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7045
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7046
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7047
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7048
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7049
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7050
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 7054
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7055
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7056
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7057
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7058

every given Neutrosophic SuperHyperDuality. 7059




C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .

3 × 3z 2 .



C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.







C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 7103
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. 7110
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 7112
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7119
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 7121


the Neutrosophic SuperHyperDuality. 7130
Then 7132
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 7133
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7139
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7142

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7143
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7152

(V, E). Then 7153

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 7154
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7155


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7159
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7160
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), 7171
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7172
Then, 7174
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 7175
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 7176


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7181
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7182
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7188

CHAPTER 39 7189
Neutrosophic SuperHyperJoin But As 7190
Super Forms 7192
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7193

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7197
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7199

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7200
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7202

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7204

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7207

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7208
rv-SuperHyperJoin. 7209
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7210

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

365

Extreme SuperHyperJoin; 7219
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7220

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7222
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7223
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7224
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7225

form the Neutrosophic SuperHyperJoin; 7226
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7227

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7228
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7229
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7234
coefficient; 7235
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7236

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7237
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7238
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7239
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7240

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7243
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7244
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7245

Extreme SuperHyperJoin; 7251
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7252

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7254
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7255
form the Neutrosophic SuperHyperJoin; 7258

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7259

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7261
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7265

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7266
to its Extreme coefficient; 7267
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7268

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7270
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7271

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7276
coefficient. 7277
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7281

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7282

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7347

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7356
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 7358


the Neutrosophic SuperHyperJoin. 7367
Then 7369
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 7370
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 7376
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7378

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7389

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7391


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

Then, 7409

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

.
Proof. Let 7410
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7411


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7415
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7416
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7417
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7422

CHAPTER 40 7423
Neutrosophic SuperHyperPerfect But As 7424
Super Forms 7426
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7427

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

Va ∈ Ei , Ej ; 7432
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7433

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7439

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7440
rv-SuperHyperPerfect. 7441
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7442

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7447
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7452

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7454
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7455
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7456
form the Neutrosophic SuperHyperPerfect; 7458
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7459

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7460
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7461
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7464
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7468

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7470
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7476
coefficient; 7477
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7478

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7486
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7487
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7488
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7489
such that they form the Neutrosophic SuperHyperPerfect; 7491
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7492

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7494

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7497
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7501

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7503

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7509
coefficient. 7510

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7514

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7580
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 7582
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7600
Then 7602
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 7603
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 7607
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7608
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7609
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7612

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7623

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7646


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7649
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7650
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7651
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7652
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7658

CHAPTER 41 7659
Neutrosophic SuperHyperTotal But As 7660
Super Forms 7662
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7663

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7667

Va ∈ Ei , Ej ; 7668
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7669

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7670
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7671

Vi , Vj ∈ Ea ; 7672
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7673

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7675

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7676
rv-SuperHyperTotal. 7677
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7678

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7683
Extreme SuperHyperTotal; 7687
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7688

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7690
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7691
form the Neutrosophic SuperHyperTotal; 7694
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7695
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7696

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7697
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7702
coefficient; 7703
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7704
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7705

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7706
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7707
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7712
cient; 7713
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7714

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7716
Extreme SuperHyperTotal; 7720
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7721

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7723
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7724
form the Neutrosophic SuperHyperTotal; 7727
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7728

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7729
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7730


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7735
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7737

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7738
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7739
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7740

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7745
cient. 7746

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7750
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. 7765




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7816
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 7818
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. 7825
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 7827



the Neutrosophic SuperHyperTotal. 7836
Then 7838
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 7839
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7845
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7847
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7858

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7865
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. 7876
Then, 7878
∗
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 7879
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7880


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7884
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7885

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7886
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7892

CHAPTER 42 7893
Neutrosophic SuperHyperConnected But 7894
As The Extensions Excerpt From Dense 7895
And Super Forms 7896
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7897

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7901
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7902
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7903

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7904
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7905
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7906

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7907
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7908

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7909
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7910
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7911
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7912
rosophic rv-SuperHyperConnected. 7913
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7914

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7917
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7918
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7919
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7920
407
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7921

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7922
that they form the Extreme SuperHyperConnected; 7923
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7924

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7925
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7926
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7927
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7928
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7929

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7930
nected; 7931
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7932

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7933
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7934
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7935
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7936
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7937

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7939
Extreme power is corresponded to its Extreme coefficient; 7940
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7941

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7942
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7943
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7944
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7946

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7949
its Neutrosophic coefficient; 7950
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7951

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7954
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7955

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7956
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7957
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7958

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7961
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7962
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7963

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7964
nected; 7965
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7966

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7969
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7970
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7971
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7972

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7973
and the Extreme power is corresponded to its Extreme coefficient; 7974
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7975

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7978

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7980
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7983
its Neutrosophic coefficient. 7984
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7987
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7988
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7990
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7991
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7992
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7993
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7994
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. 8002


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 8046
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. 8053
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 8055
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. 8062
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 8064



the Neutrosophic SuperHyperConnected. 8073
Then 8075
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 8076
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 8081
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8082
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8085

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8096
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 8097
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8098


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8102
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8103
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8104
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. 8115
Then, 8117
∗
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 8118
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8119


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8122
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8123
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8124
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8125
some representatives. The latter is straightforward. 8126
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8131

CHAPTER 43 8132
Background 8133

421













[HG32b; HG44b]. 8339

Bibliography 8340
10.33140/JMTCM.01.03.09) 8344


427
10.20944/preprints202301.0282.v1). 8377
10.20944/preprints202301.0267.v1). 8380

(doi: 10.20944/preprints202301.0265.v1). 8385
prints202301.0262.v1). 8389
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8395
prints202301.0105.v1). 8398
Preprints 2023, 2023010044 8404
10.20944/preprints202301.0043.v1). 8407

(doi: 10.20944/preprints202212.0549.v1). 8416
(doi: 10.20944/preprints202212.0500.v1). 8423
10.5281/zenodo.7857856). 8432
2023, (doi: 10.5281/zenodo.7857841). 8435

10.5281/zenodo.7853867). 8444
10.5281/zenodo.7853922). 8447

(doi: 10.5281/zenodo.7851519). 8450
(doi: 10.5281/zenodo.7851550). 8453
10.5281/zenodo.7834229). 8462
10.5281/zenodo.7834261). 8465
10.5281/zenodo.7824560). 8468
(doi: 10.5281/zenodo.7824623). 8471

2023, (doi: 10.5281/zenodo.7809365). 8482
2023, (doi: 10.5281/zenodo.7809358). 8485

10.5281/zenodo.7809219). 8488
10.5281/zenodo.7809328). 8491
2023, (doi: 10.5281/zenodo.7806767). 8494
2023, (doi: 10.5281/zenodo.7806838). 8497
10.5281/zenodo.7799902). 8506
(doi: 10.5281/zenodo.7804218). 8509
(doi: 10.5281/zenodo.7796334). 8512
10.5281/zenodo.7791952). 8518
10.5281/zenodo.7791982). 8521
10.5281/zenodo.7790026). 8524

10.5281/zenodo.7790052). 8527
2023, (doi: 10.5281/zenodo.7787066). 8530
10.5281/zenodo.7781476). 8536
10.5281/zenodo.7783082). 8539
10.5281/zenodo.7777857). 8542
10.5281/zenodo.7779286). 8545
(doi: 10.5281/zenodo.7771831). 8548
2023, (doi: 10.5281/zenodo.7772468). 8551
10.13140/RG.2.2.20913.25446). 8554
odo.7764916). 8557
10.13140/RG.2.2.11770.98247). 8560
10.13140/RG.2.2.12400.12808). 8563

2023, (doi: 10.13140/RG.2.2.22545.10089). 8566
10.13140/RG.2.2.11377.76644). 8572
10.13140/RG.2.2.23750.96329). 8575
10.13140/RG.2.2.31366.24641). 8578
10.13140/RG.2.2.34721.68960). 8581
2023, (doi: 10.13140/RG.2.2.30212.81289). 8584
10.13140/RG.2.2.24288.35842). 8590
10.13140/RG.2.2.32467.25124). 8593
10.13140/RG.2.2.31025.45925). 8596
10.13140/RG.2.2.17184.25602). 8599
10.13140/RG.2.2.23423.28327). 8602

10.13140/RG.2.2.28456.44805). 8605
10.13140/RG.2.2.23525.68320). 8608
10.13140/RG.2.2.20170.24000). 8611
10.13140/RG.2.2.36475.59683). 8614
10.13140/RG.2.2.29764.71046). 8617
2023, (doi: 10.13140/RG.2.2.18780.87683). 8620
10.13140/RG.2.2.26134.01603). 8626
10.13140/RG.2.2.27392.30721). 8629
10.13140/RG.2.2.33028.40321). 8632
10.13140/RG.2.2.21389.20966). 8635
10.13140/RG.2.2.16356.04489). 8638
10.13140/RG.2.2.21756.21129). 8641

10.13140/RG.2.2.30983.68009). 8644
10.13140/RG.2.2.28552.29445). 8647
(doi: 10.13140/RG.2.2.10936.21761). 8650
10.13140/RG.2.2.35105.89447). 8653
(doi: 10.13140/RG.2.2.30072.72960). 8656
10.13140/RG.2.2.31147.52003). 8659
10.13140/RG.2.2.32825.24163). 8662
10.13140/RG.2.2.13059.58401). 8665
10.13140/RG.2.2.11172.14720). 8668
2023, (doi: 10.13140/RG.2.2.22011.80165). 8671
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8674
2023, (doi: 10.13140/RG.2.2.10493.84962). 8677
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8680

2023, (doi: 10.13140/RG.2.2.19944.14086). 8683
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8686
(doi: 10.13140/RG.2.2.33103.76968). 8689
(doi: 10.13140/RG.2.2.23037.44003). 8692
(doi: 10.13140/RG.2.2.35646.56641). 8695
10.13140/RG.2.2.18030.48967). 8698
(doi: 10.13140/RG.2.2.13973.81121). 8701
2023, (doi: 10.13140/RG.2.2.34106.47047). 8704
2023, (doi: 10.13140/RG.2.2.31956.88961). 8710
2023, (doi: 10.13140/RG.2.2.15179.67361). 8713
10.13140/RG.2.2.21510.45125). 8716
2023, (doi: 10.13140/RG.2.2.13121.84321). 8719

10.13140/RG.2.2.11758.69441). 8722
2023, (doi: 10.13140/RG.2.2.31891.35367). 8725
10.13140/RG.2.2.19360.87048). 8728
10.13140/RG.2.2.32363.21286). 8731
10.13140/RG.2.2.23266.81602). 8734
10.13140/RG.2.2.19911.37285). 8737
10.13140/RG.2.2.11050.90569). 8740
2023, (doi: 10.13140/RG.2.2.17761.79206). 8743
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8749
(doi: 10.13140/RG.2.2.30182.50241). 8752

2023, (doi: 10.13140/RG.2.2.17252.24968). 8785
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8794
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8797


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

10.20944/preprints202301.0282.v1). 8818
10.20944/preprints202301.0267.v1).). 8821
(doi: 10.20944/preprints202301.0265.v1). 8826
prints202301.0262.v1). 8830
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8836


10.13140/RG.2.2.35061.65767). 8839
10.13140/RG.2.2.18494.15680). 8843

10.13140/RG.2.2.32530.73922). 8847
10.13140/RG.2.2.15897.70243). 8851
10.13140/RG.2.2.32530.73922). 8855
prints202301.0105.v1). 8858

10.13140/RG.2.2.23172.19849). 8865

10.13140/RG.2.2.17385.36968). 8875

Preprints 2023, 2023010044 8878

10.20944/preprints202301.0043.v1). 8881
2023, (doi: 10.13140/RG.2.2.28945.92007). 8884
10.13140/RG.2.2.35774.77123). 8890

10.13140/RG.2.2.29430.88642). 8896
(doi: 10.20944/preprints202212.0549.v1). 8902

10.13140/RG.2.2.19380.94084). 8905

(doi: 10.20944/preprints202212.0500.v1). 8916
10.13140/RG.2.2.20993.12640). 8919


10.13140/RG.2.2.29173.86244). 8934
(doi: 10.5281/zenodo.7857906). 8939
2023 (doi: 10.5281/zenodo.7856329). 8941
10.5281/zenodo.7854561). 8943
2023 (doi: 10.5281/zenodo.7851893). 8945

(doi: 10.5281/zenodo.7835063). 8949
(doi: 10.5281/zenodo.7826705). 8951

2023 (doi: 10.5281/zenodo.7820680). 8953
10.5281/zenodo.7812750). 8955


2023 (doi: 10.5281/zenodo.7807782). 8961
2023 (doi: 10.5281/zenodo.7804449). 8963

(doi: 10.5281/zenodo.7792307). 8967
(doi: 10.5281/zenodo.7790728). 8969
2023 (doi: 10.5281/zenodo.7787712). 8971
10.5281/zenodo.7783791). 8973
10.5281/zenodo.7780123). 8975
(doi: 10.5281/zenodo.7773119). 8977
odo.7637762). 8979
10.5281/zenodo.7766174). 8981
10.5281/zenodo.7762232). 8983
(doi: 10.5281/zenodo.7758601). 8985
10.5281/zenodo.7754661). 8987

10.5281/zenodo.7750995) . 8989
(doi: 10.5281/zenodo.7749875). 8991
10.5281/zenodo.7747236). 8993
10.5281/zenodo.7742587). 8995
(doi: 10.5281/zenodo.7738635). 8997
10.5281/zenodo.7734719). 8999
10.5281/zenodo.7730484). 9001
(doi: 10.5281/zenodo.7730469). 9003
10.5281/zenodo.7722865). 9005
odo.7713563). 9007
odo.7709116). 9009
10.5281/zenodo.7706415). 9011
10.5281/zenodo.7706063). 9013
10.5281/zenodo.7701906). 9015
odo.7700205). 9017
10.5281/zenodo.7694876). 9019
10.5281/zenodo.7679410). 9021
10.5281/zenodo.7675982). 9023

10.5281/zenodo.7672388). 9025
odo.7668648). 9027
10.5281/zenodo.7662810). 9029
10.5281/zenodo.7659162). 9031
odo.7653233). 9033
odo.7653204). 9035
odo.7653142). 9037
odo.7653117). 9039
odo.7651687). 9042
odo.7651619). 9044
odo.7651439). 9046
odo.7650729). 9048
odo.7647868). 9050
odo.7647017). 9052
odo.7644894). 9054
odo.7632923). 9057

odo.7623459). 9059
10.5281/zenodo.7606416). 9061
10.5281/zenodo.7606416). 9063
odo.7606404). 9065
10.5281/zenodo.7580018). 9067
odo.7580018). 9069
odo.7580018). 9071
odo.7579929). 9073
10.5281/zenodo.7563170). 9075
odo.7563164). 9077
odo.7563160). 9079
odo.7563160). 9081
10.5281/zenodo.7563160). 9083
10.5281/zenodo.7557063). 9085
10.5281/zenodo.7557009). 9087
10.5281/zenodo.7539484). 9089
10.5281/zenodo.7523390). 9091
10.5281/zenodo.7523390). 9093

10.5281/zenodo.7523390). 9095
odo.7574952). 9097
10.5281/zenodo.7574992). 9099
odo.7523357). 9101
10.5281/zenodo.7523357). 9103
10.5281/zenodo.7504782). 9105
10.5281/zenodo.7504782). 9107
10.5281/zenodo.7504782). 9109
10.5281/zenodo.7499395). 9111
odo.7499395). 9113
10.5281/zenodo.7499395). 9115
10.5281/zenodo.7497450). 9117
10.5281/zenodo.7497450). 9119
10.5281/zenodo.7494862). 9121
odo.7494862). 9123
10.5281/zenodo.7494862). 9125
10.5281/zenodo.7493845). 9127
odo.7493845). 9129

10.5281/zenodo.7493845). 9131
odo.7539484). 9133
odo.7523390). 9135
odo.7523357). 9137
odo.7504782). 9139
odo.7499395). 9141
odo.7497450). 9143
odo.7494862). 9145
odo.7493845). 9147
odo.7480110). 9149
odo.7378758). 9151
odo.6320305). 9153
odo.6677173). 9155

CHAPTER 44 9156
Books’ Contributions 9157
“Books’ Contributions”: | Featured Threads 9158

The following references are cited by chapters. 9159
9160
[Ref256] 9161
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-Neighbor In 9162
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 9163
odo.7857841). 9164
9165
[Ref257] 9166
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9167
10.5281/zenodo.7857856). 9169
9170
The links to the contributions of this scientific research book are listed below. 9171
[HG256] 9172
odo.7857841). 9175
9176
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-Neighbor In 9177
Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9178

9179
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9180
https://www.researchgate.net/publication/370214377 9181
9182
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9183
https://www.scribd.com/document/640364974 9184
9185
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9186
https://zenodo.org/record/7857841 9187
9188
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9189
https://www.academia.edu/100664613 9190
449
Figure 44.1: Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-
Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7857841).
9191
[ADDRESSED CITATION] 9192
odo.7857841). 9195
[ASSIGNED NUMBER] #256 Article 9196
[DATE] April 2023 9197

[DOI] 10.5281/zenodo.7857841 9198
[LICENSE] CC BY-NC-ND 4.0 9199
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9200
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9201
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9202
9203
[HG257] 9204
10.5281/zenodo.7857856). 9207
9208
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9209

Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous” 9210
9211
https://www.researchgate.net/publication/370214523 9213
9214
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9215

2023, (doi: 10.5281/zenodo.7857841).
2023, (doi: 10.5281/zenodo.7857841).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo
2023, (doi: 10.5281/zenodo.7857856).
https://www.scribd.com/document/640365864 9216
9217
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9218
https://zenodo.org/record/7857856 9219
9220
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9221
https://www.academia.edu/100665128 9222
9223
10.5281/zenodo.7857856). 9227
[ASSIGNED NUMBER] #257 Article 9228

[DATE] April 2023 9229
[DOI] 10.5281/zenodo.7857856 9230
[LICENSE] CC BY-NC-ND 4.0 9231
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9232
[AVAILABLE AT TWITTER’S IDS] 9233
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9234
googlebooks GooglePlay 9235
9236
[ASSIGNED NUMBER] | Book #167 9237
Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 9239
(doi: 10.5281/zenodo.7856329). 9240

2023, (doi: 10.5281/zenodo.7857856).
2023, (doi: 10.5281/zenodo.7857856).

[TITLE] Eulerian-Cycle-Neighbor In SuperHyperGraphs 9241

#Latest_Updates 9242
#The_Links 9243
9247
9249
#The_Links 9250
9251
[ASSIGNED NUMBER] | Book #167 9252

9253
[TITLE] Eulerian-Cycle-Neighbor In SuperHyperGraphs 9254
9255
9259
– 9260
9261
[PUBLISHER] 9262
(Paperback): https://www.amazon.com/dp/- 9263
(Hardcover): https://www.amazon.com/dp/- 9264

(Kindle Edition): https://www.amazon.com/dp/- 9265
9266
– 9267
9268
[ISBN] 9269
(Paperback): - 9270
(Hardcover): - 9271
(Kindle Edition): CC BY-NC-ND 4.0 9272
(EBook): CC BY-NC-ND 4.0 9273
9274
– 9275
9276
[PRINT LENGTH] 9277
(Paperback): - pages 9278
(Hardcover): - pages 9279
(Kindle Edition): - pages 9280
(E-Book): - pages 9281
9282
– 9283
9284
9286

#The_Links 9287
9288
https://www.researchgate.net/publication/- 9290
9291
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9292
https://drhenrygarrett.wordpress.com/2023/07/22/ 9293
Eulerian-Cycle-Neighbor-In-SuperHyperGraphs/ 9294
9295
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9296
https://www.scribd.com/document/- 9297
9298
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9299
https://www.academia.edu/- 9300
9301
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9302
https://zenodo.org/record/- 9303
9304
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9305
https://books.google.com/books/about?id=- 9306
9307
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9308
https://play.google.com/store/books/details?id=- 9309

[TITLE] Eulerian-Cycle-Neighbor In SuperHyperGraphs (Published Version) 9310

9311
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9312
9313
https://drhenrygarrett.wordpress.com/2023/07/22/ 9314
Eulerian-Cycle-Neighbor-In-SuperHyperGraphs/ 9315
9316
– 9317
9318
[POSTED BY] Dr. Henry Garrett 9319
9320
[DATE] April 024, 2023 9321

9322
[POSTED IN] 167 | Eulerian-Cycle-Neighbor In SuperHyperGraphs 9323
9324
[TAGS] 9325
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9326
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9327
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9328
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9329
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Cycle-Neighbor In SuperHyperGraphs, 9330
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 9331
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9332
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9333
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Supe- 9334

rHyperGraph Theory, SuperHyperGraphs, Eulerian-Cycle-Neighbor In SuperHyperGraphs, 9335
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9336
In this scientific research book, there are some scientific research chapters on “Extreme 9337
Eulerian-Cycle-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Cycle-Neighbor 9338
In SuperHyperGraphs” about some scientific research on Eulerian-Cycle-Neighbor In SuperHy- 9339
perGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Cycle-Neighbor 9340

In SuperHyperGraphs and Neutrosophic Eulerian-Cycle-Neighbor In SuperHyperGraphs. With 9341
scientific research on the basic scientific research properties, the scientific research book starts 9342
to make Extreme Eulerian-Cycle-Neighbor In SuperHyperGraphs theory and Neutrosophic 9343
Eulerian-Cycle-Neighbor In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9344
understandable. 9345

CHAPTER 45 9346
“SuperHyperGraph-Based Books”: | 9347
Featured Tweets 9348
“SuperHyperGraph-Based Books”: | Featured Tweets 9349
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 9350
CV 9351
485
9352
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
9353
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)
9354
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

9355

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

9356
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

9357
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

9358
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

9359
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

9360
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).
9361
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

9362
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

9363
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

9364
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

9365
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

9366
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

9367
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

9368
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

9369
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

9370
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

9371
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).
9372
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

9373

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

9374
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

9375

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: -
9376
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

9377
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).
9378
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
9379
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
9380
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
9381
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).
9382
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

9383
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).
9384
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”,

9385
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).
9386
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).
9387
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
9388
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).
9389

(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).
9390
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).
9391
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

9392
[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

9393
[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

9394
[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

9395
[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

9396
[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

9397
[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

9398
[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

9399
[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

9400
[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

9401
[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

9402
[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

9403
[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

9404
[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

9405
[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

9406
[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

9407
[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

9408
[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

9409
[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

9410
[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

9411
[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

9412
[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

9413
[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

9414
[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

9415
[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

9416
[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

9417
[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
9418
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

9419
[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

9420
[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

9421
[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

9422
[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

9423
[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
9424
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

9425
“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

9426
[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
9427
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

9428
[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

9429
[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

9430
[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

9431
[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

9432
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

9433
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
9434
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
9435
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

9436
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

9437
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
-
9438
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

9439
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9440
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
9441
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
9442
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

9443
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
9444
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
...
9445
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/
9446
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
9447
9448
9449
Henry Garrett
01/23/2022
9450
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
9451
View publication stats

Eulerian-Cycle-Neighbor in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Eulerian-Cycle-Neighbor in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

463 PUBLICATIONS 14,530 CITATIONS

Neutrosophic Graphs View project

Featured Articles View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEulerian-Cycle-Neighbor But As The Extensions Excerpt

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Cycle-Neighbor 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperEulerian-Cycle-Neighbor But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 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