Hamiltonian-Cycle-Cut in SuperHyperGraphs

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

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures vi
List of Tables xi
1 ABSTRACT 1
2 Background 13
Bibliography 19
3 Acknowledgements 39
4 Cancer In Extreme SuperHyperGraph 41
5 Extreme Hamiltonian-Cycle-Cut 45
6 New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 215
Bibliography 221
24 Cancer In Neutrosophic SuperHyperGraph 241
25 Neutrosophic Hamiltonian-Cycle-Cut 245
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy 247
27 ABSTRACT 249
28 Applied Notions Under The Scrutiny Of The Motivation Of This

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

deemed Ways 259

30 Neutrosophic SuperHyperHamiltonian-Cycle-Cut But As The Exten-

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

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

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

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

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

Motivations 343
37 Conclusion and Closing Remarks 345
38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 403
43 Background 417
Bibliography 423
44 Books’ Contributions 443
45 “SuperHyperGraph-Based Books”: | Featured Tweets 451
46 CV 479

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

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

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.5) . . . . . . . . . . . . . 314
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 316
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.11) 319
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.13) . . . . . . . . . . . . 321
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
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 Hammy By Hyper Hamper Of Hamiltonian-
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.7791982). . . . . . . . . . . . . . . . . . . . . . 444
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”,

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 452

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

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

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

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

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

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

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

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

Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian-Cycle-Cut In 4
SuperHyperGraphs and Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs. With 5
scientific research on the basic scientific research properties, the scientific research book starts 6
to make Extreme Hamiltonian-Cycle-Cut In SuperHyperGraphs theory and Neutrosophic 7
Hamiltonian-Cycle-Cut In SuperHyperGraphs theory more (Extremely/Neutrosophicly) under- 8
standable. 9
10
In the some chapters, in some researches, new setting is introduced for new SuperHyperNotions, 11
namely, a Hamiltonian-Cycle-Cut In SuperHyperGraphs and Neutrosophic Hamiltonian-Cycle- 12
Cut In SuperHyperGraphs . Two different types of SuperHyperDefinitions are debut for them 13
but the scientific research goes further and the SuperHyperNotion, SuperHyperUniform, and 14
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 δ−Hamiltonian-Cycle-Cut In SuperHyper- 30
Graphs is a maximal of SuperHyperVertices with a maximum cardinality such that either of 31
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 32
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 33
1
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 34

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

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

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

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

of having a Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs, there’s a need to 65
“redefine” the notion of a “Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs” and 66
a “Neutrosophic Hamiltonian-Cycle-Cut 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 Hamiltonian-Cycle-Cut In SuperHyperGraphs are redefined to a 71
“Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs” if the intended Table holds. It’s 72
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get 73
Neutrosophic type-results to make a Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs 74
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 75

SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Hamiltonian-Cycle-Cut 76
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 77
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Hamiltonian-Cycle-Cut 78
In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 79

ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 80

intended Table holds. A SuperHyperGraph has a “Neutrosophic Hamiltonian-Cycle-Cut In 81
SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all the 82
Hamiltonian-Cycle-Cut In SuperHyperGraphs amid the maximum value amid all SuperHy- 83
perVertices from a Hamiltonian-Cycle-Cut In SuperHyperGraphs .] Hamiltonian-Cycle-Cut 84
In SuperHyperGraphs . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and 85
the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 86
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 87
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 88
Hamiltonian-Cycle-Cut In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 89
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 90
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 91
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 92
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 93
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 94
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 95
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 96
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 97
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 98

“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 99
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 100
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 101
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 102
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 103
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 104
Recognition” and the results and the definitions will be introduced in redeemed ways. The 105
recognition of the cancer in the long-term function. The specific region has been assigned 106
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 107
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 108
since there are some determinacy, indeterminacy and neutrality about the moves and the 109
effects of the cancer on that region; this event leads us to choose another model [it’s said 110
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(-/Hamiltonian-Cycle-Cut In SuperHyperGraphs, Supe- 115

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

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

Hamiltonian-Cycle-Cut 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) Hamiltonian-Cycle-Cut In SuperHyperGraphs, 129
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 Hamiltonian-Cycle-Cut In SuperHyperGraphs . Two different 134

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

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

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

the values. Assume a Hamiltonian-Cycle-Cut In SuperHyperGraphs . It’s redefined Neutro- 171

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

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

In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs ”. The 190
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 191
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” 193
if the intended Table holds. And Hamiltonian-Cycle-Cut In SuperHyperGraphs are redefined 194
“Neutrosophic Hamiltonian-Cycle-Cut 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 Hamiltonian-Cycle-Cut In SuperHyperGraphs 197
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 198
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Hamiltonian-Cycle-Cut 199
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 200
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Hamiltonian-Cycle-Cut 201

In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipart- 202
ite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the 203
intended Table holds. A SuperHyperGraph has “Neutrosophic Hamiltonian-Cycle-Cut In 204
SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 205
Hamiltonian-Cycle-Cut In SuperHyperGraphs amid the maximum value amid all SuperHy- 206
perVertices from a Hamiltonian-Cycle-Cut In SuperHyperGraphs .] Hamiltonian-Cycle-Cut 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
Hamiltonian-Cycle-Cut 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 232
about the moves and the effects of the cancer on that region; this event leads us to choose 233
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 234
on what’s happened and what’s done. There are some specific models, which are well-known 235
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 236
the traces of the cancer on the complex tracks and between complicated groups of cells could be 237
fantasized by a Neutrosophic SuperHyperPath(-/Hamiltonian-Cycle-Cut In SuperHyperGraphs, 238
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 239
is to find either the longest Hamiltonian-Cycle-Cut In SuperHyperGraphs or the strongest 240
Hamiltonian-Cycle-Cut In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 241

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

any Hamiltonian-Cycle-Cut In SuperHyperGraphs but literarily, it’s the deformation of any 248
Hamiltonian-Cycle-Cut 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 Hamiltonian-Cycle-Cut In Super- 252
HyperGraphs, 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 Hamiltonian-Cycle-Cut In SuperHyperGraphs in the setting of duality in neutrosophic 276
graph theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on 277
the complement of the intended set and the intended set, simultaneously. It’s smart to consider 278
a set but acting on its complement that what’s done in this research book which is popular in 279
the terms of high readers in Scribd. 280
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 281
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 282
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 283
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 284
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 285

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




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

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

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

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

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

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

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

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

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

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

HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; HG153b]. Two popular 430
scientific research books in Scribd in the terms of high readers, 4087 and 5084 respectively, on 431
neutrosophic science is on [HG32b; HG44b]. 432

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

HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226] alongside scientific 464


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

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

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

10.5281/zenodo.7790026). 574
HG223 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 575
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 576
2023, (doi: 10.5281/zenodo.7790052). 577
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 579
2023, (doi: 10.5281/zenodo.7787066). 580
HG221 [30] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 581
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 582
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 583

By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 585
10.5281/zenodo.7781476). 586
HG219 [32] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 587
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 588
10.5281/zenodo.7783082). 589
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 591
10.5281/zenodo.7777857). 592
HG217 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 593
10.5281/zenodo.7779286). 595
HG215 [35] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 596
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 597
(doi: 10.5281/zenodo.7771831). 598
HG214 [36] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 599
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 600
2023, (doi: 10.5281/zenodo.7772468). 601
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 603
10.13140/RG.2.2.20913.25446). 604
HG212 [38] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 605
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 606
10.5281/zenodo.7764916). 607
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 609
10.13140/RG.2.2.11770.98247). 610
HG210 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 611
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 612
10.13140/RG.2.2.12400.12808). 613
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 615
2023, (doi: 10.13140/RG.2.2.22545.10089). 616
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 618
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 619
HG207 [43] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 620
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 621
10.13140/RG.2.2.11377.76644). 622

HG206 [44] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 623
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 624
10.13140/RG.2.2.23750.96329). 625
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 627
10.13140/RG.2.2.31366.24641). 628
HG204 [46] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 629
10.13140/RG.2.2.34721.68960). 631
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 633
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 636
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 639
10.13140/RG.2.2.24288.35842). 640
HG200 [50] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 641
10.13140/RG.2.2.32467.25124). 643
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 645
10.13140/RG.2.2.31025.45925). 646
HG198 [52] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 647
10.13140/RG.2.2.17184.25602). 649
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 651
10.13140/RG.2.2.23423.28327). 652
HG196 [54] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 653
10.13140/RG.2.2.28456.44805). 655
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 657
10.13140/RG.2.2.23525.68320). 658
HG194 [56] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 659
10.13140/RG.2.2.20170.24000). 661

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 663
10.13140/RG.2.2.36475.59683). 664
HG192 [58] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 665
10.13140/RG.2.2.29764.71046). 667
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 669
2023, (doi: 10.13140/RG.2.2.18780.87683). 670
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 672
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 675
10.13140/RG.2.2.26134.01603). 676
HG188 [62] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 677
10.13140/RG.2.2.27392.30721). 679
HG187 [63] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 680
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 681
10.13140/RG.2.2.33028.40321). 682
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 684
10.13140/RG.2.2.21389.20966). 685
HG185 [65] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 686
10.13140/RG.2.2.16356.04489). 688
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 690
10.13140/RG.2.2.21756.21129). 691
HG183 [67] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 692
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 693
10.13140/RG.2.2.30983.68009). 694
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 696
10.13140/RG.2.2.28552.29445). 697
HG181 [69] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 698
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 699
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 700

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.35105.89447). 703
HG179 [71] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 704
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 705
(doi: 10.13140/RG.2.2.30072.72960). 706
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 708
10.13140/RG.2.2.31147.52003). 709
HG177 [73] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 710
10.13140/RG.2.2.32825.24163). 712
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.13059.58401). 715
HG175 [75] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 716
10.13140/RG.2.2.11172.14720). 718
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 720
2023, (doi: 10.13140/RG.2.2.22011.80165). 721
HG173 [77] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 722
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 723
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 724
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 726
HG171 [79] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 728
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 730
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 732
2023, (doi: 10.13140/RG.2.2.19944.14086). 733
HG169 [81] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 734
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 736
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 738
(doi: 10.13140/RG.2.2.33103.76968). 739

HG167 [83] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 740
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 741
2023, (doi: 10.13140/RG.2.2.23037.44003). 742
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 744
(doi: 10.13140/RG.2.2.35646.56641). 745
HG165 [85] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 746
(doi: 10.13140/RG.2.2.18030.48967). 748
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 750
(doi: 10.13140/RG.2.2.13973.81121). 751
HG163 [87] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 752
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 753
2023, (doi: 10.13140/RG.2.2.34106.47047). 754
HG162 [88] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 755
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 756
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 759
2023, (doi: 10.13140/RG.2.2.31956.88961). 760
HG160 [90] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 761
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 762
2023, (doi: 10.13140/RG.2.2.15179.67361). 763
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 765
10.13140/RG.2.2.21510.45125). 766
HG158 [92] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 767
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 768
2023, (doi: 10.13140/RG.2.2.13121.84321). 769
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 771
10.13140/RG.2.2.11758.69441). 772
HG156 [94] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 773
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 774
2023, (doi: 10.13140/RG.2.2.31891.35367). 775
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 777
10.13140/RG.2.2.19360.87048). 778

HG154 [96] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 779
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 780
2023, (doi: 10.13140/RG.2.2.32363.21286). 781
HG153 [97] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 782
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 783
(doi: 10.13140/RG.2.2.23266.81602). 784
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 786
10.13140/RG.2.2.19911.37285). 787
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 789
10.13140/RG.2.2.11050.90569). 790
HG150 [100] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 791
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 792
HG149 [101] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 794
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 795
HG148 [102] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 797
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 798
HG147 [103] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 800
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 801
(doi: 10.13140/RG.2.2.30182.50241). 802
HG146 [104] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 803
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 804
HG145 [105] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 806
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 807
HG144 [106] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 809
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 810
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 811
HG143 [107] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 812
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 813
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 814
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 817

Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 820
HG140 [110] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 821
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 822
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 823
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 826
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 829
HG137 [113] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 830
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 831
HG136 [114] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 833
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 834

2023, (doi: 10.13140/RG.2.2.17252.24968). 835
HG135 [115] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 836
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 837
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 838
HG134 [116] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 839
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 840
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 841
HG132 [117] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 842
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 843
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 844
HG131 [118] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 845
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 846

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 847
HG130 [119] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 848
Recognition in The Confrontation With Super Attacks In Hyper Situations By 849
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 850
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 851
HG129 [120] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 852

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

HG128 [121] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 856
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 857
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 858
HG127 [122] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 859
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 860

2023,(doi: 10.13140/RG.2.2.36745.93289). 861
HG126 [123] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 862

HG125 [124] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 865

10.20944/preprints202301.0282.v1). 868
HG124 [125] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 869
10.20944/preprints202301.0267.v1).). 871
HG123 [126] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 872
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 873
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 874

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 875
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 876
HG122 [127] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 877
prints202301.0262.v1). 880
HG121 [128] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 881
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 882

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 888
10.13140/RG.2.2.35061.65767). 889
HG25 [131] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 890
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 891
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 892
10.13140/RG.2.2.18494.15680). 893

HG26 [132] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 894
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 895
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 896
10.13140/RG.2.2.32530.73922). 897
HG27 [133] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 898
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 899
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 900
10.13140/RG.2.2.15897.70243). 901
10.13140/RG.2.2.32530.73922). 905
prints202301.0105.v1). 908
HG28 [136] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 909
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 910
HG29 [137] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 912
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 913
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 914
10.13140/RG.2.2.23172.19849). 915

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

10.13140/RG.2.2.17385.36968). 925
HG107 [141] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 926
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 927

Beyond”, Preprints 2023, 2023010044 928
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 930
(doi: 10.20944/preprints202301.0043.v1). 931

HG31 [143] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 932
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 933
2023, (doi: 10.13140/RG.2.2.28945.92007). 934

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 939
10.13140/RG.2.2.35774.77123). 940
HG35 [147] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 944
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 945
10.13140/RG.2.2.29430.88642). 946

(doi: 10.20944/preprints202212.0549.v1). 952
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 954
10.13140/RG.2.2.19380.94084). 955
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 963

(doi: 10.20944/preprints202212.0500.v1). 966
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 968
10.13140/RG.2.2.20993.12640). 969

HG952 [155] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 970
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 971
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 974

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

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

Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 981
HG37 [159] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 982
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 983
10.13140/RG.2.2.29173.86244). 984
HG38 [160] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 985
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 986
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 987
HG153b [161] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 988
(doi: 10.5281/zenodo.7792307). 989
HG152b [162] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 990
(doi: 10.5281/zenodo.7790728). 991
HG151b [163] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 992
2023 (doi: 10.5281/zenodo.7787712). 993
HG150b [164] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 994
10.5281/zenodo.7783791). 995
HG149b [165] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 996
10.5281/zenodo.7780123). 997
HG148b [166] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 998
(doi: 10.5281/zenodo.7773119). 999
HG147b [167] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1000
odo.7637762). 1001
HG146b [168] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1002
10.5281/zenodo.7766174). 1003
HG145b [169] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1004
10.5281/zenodo.7762232). 1005

HG144b [170] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1006
(doi: 10.5281/zenodo.7758601). 1007
HG143b [171] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1008
10.5281/zenodo.7754661). 1009
HG142b [172] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1010
10.5281/zenodo.7750995) . 1011
HG141b [173] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1012
(doi: 10.5281/zenodo.7749875). 1013
HG140b [174] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1014
10.5281/zenodo.7747236). 1015
HG139b [175] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1016
10.5281/zenodo.7742587). 1017
HG138b [176] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1018
(doi: 10.5281/zenodo.7738635). 1019
HG137b [177] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1020
10.5281/zenodo.7734719). 1021
HG136b [178] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1022
10.5281/zenodo.7730484). 1023
HG135b [179] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1024
(doi: 10.5281/zenodo.7730469). 1025
HG134b [180] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1026
10.5281/zenodo.7722865). 1027
HG133b [181] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1028
odo.7713563). 1029
odo.7709116). 1031
HG131b [183] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1032
10.5281/zenodo.7706415). 1033
HG130b [184] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1034
(doi: 10.5281/zenodo.7706063). 1035
HG129b [185] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1036
(doi: 10.5281/zenodo.7701906). 1037
HG128b [186] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1038
odo.7700205). 1039
HG127b [187] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1040
10.5281/zenodo.7694876). 1041

HG126b [188] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1042
10.5281/zenodo.7679410). 1043
HG125b [189] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1044
10.5281/zenodo.7675982). 1045
HG124b [190] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1046
10.5281/zenodo.7672388). 1047
HG123b [191] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1048
odo.7668648). 1049
HG122b [192] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1050
10.5281/zenodo.7662810). 1051
HG121b [193] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1052
10.5281/zenodo.7659162). 1053
HG120b [194] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1054
odo.7653233). 1055
HG119b [195] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1056
odo.7653204). 1057
HG118b [196] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1058
odo.7653142). 1059
HG117b [197] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1060
odo.7653117). 1061
HG116b [198] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1062
odo.7653089). 1063
HG115b [199] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1064
odo.7651687). 1065
HG114b [200] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1066
odo.7651619). 1067
HG113b [201] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1068
odo.7651439). 1069
HG112b [202] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1070
odo.7650729). 1071
HG111b [203] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1072
odo.7647868). 1073
HG110b [204] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1074
odo.7647017). 1075
HG109b [205] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1076
odo.7644894). 1077

HG108b [206] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1078
odo.7641880). 1079
HG107b [207] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1080
odo.7632923). 1081
HG106b [208] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1082
odo.7623459). 1083
HG105b [209] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1084
10.5281/zenodo.7606416). 1085
HG104b [210] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1086
10.5281/zenodo.7606416). 1087
HG103b [211] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1088
odo.7606404). 1089
HG102b [212] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1090
10.5281/zenodo.7580018). 1091
HG101b [213] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1092
odo.7580018). 1093
odo.7580018). 1095
odo.7579929). 1097
HG98b [216] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1098
10.5281/zenodo.7563170). 1099
HG97b [217] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1100
odo.7563164). 1101
HG96b [218] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1102
odo.7563160). 1103
odo.7563160). 1105
HG94b [220] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1106
10.5281/zenodo.7563160). 1107
HG93b [221] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1108
10.5281/zenodo.7557063). 1109
HG92b [222] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1110
10.5281/zenodo.7557009). 1111
HG91b [223] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1112
10.5281/zenodo.7539484). 1113

HG90b [224] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1114
10.5281/zenodo.7523390). 1115
HG89b [225] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1116
10.5281/zenodo.7523390). 1117
HG88b [226] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1118
10.5281/zenodo.7523390). 1119
HG87b [227] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1120
odo.7574952). 1121
HG86b [228] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7574992). 1123
odo.7523357). 1125
HG84b [230] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1126
10.5281/zenodo.7523357). 1127
HG83b [231] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1128
10.5281/zenodo.7504782). 1129
HG82b [232] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1130
10.5281/zenodo.7504782). 1131
HG81b [233] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1132
10.5281/zenodo.7504782). 1133
HG80b [234] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1134
10.5281/zenodo.7499395). 1135
HG79b [235] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1136
odo.7499395). 1137
HG78b [236] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1138
10.5281/zenodo.7499395). 1139
HG77b [237] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1140
10.5281/zenodo.7497450). 1141
HG76b [238] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1142
10.5281/zenodo.7497450). 1143
HG75b [239] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1144
10.5281/zenodo.7494862). 1145
HG74b [240] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1146
odo.7494862). 1147
HG73b [241] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1148
10.5281/zenodo.7494862). 1149

HG72b [242] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1150
10.5281/zenodo.7493845). 1151
HG71b [243] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1152
10.5281/zenodo.7493845). 1153
HG70b [244] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.7493845). 1155
HG69b [245] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1156
odo.7539484). 1157
HG68b [246] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1158
odo.7523390). 1159
HG67b [247] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1160
odo.7523357). 1161
HG66b [248] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1162
odo.7504782). 1163
HG65b [249] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1164
odo.7499395). 1165
HG64b [250] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1166
odo.7497450). 1167
HG63b [251] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1168
odo.7494862). 1169
HG62b [252] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1170
odo.7493845). 1171
HG61b [253] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1172
odo.7480110). 1173
HG60b [254] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1174
odo.7378758). 1175
HG32b [255] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1176
odo.6320305). 1177
HG44b [256] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1178
odo.6677173). 1179

CHAPTER 3 1180
Acknowledgements 1181
The author is going to express his gratitude and his appreciation about the brains and their 1182
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1183
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1184 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
1185
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 1186
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1187
ideas to be on the star lines of words and shining like stars, forever. 1188
39
CHAPTER 4 1189
Cancer In Extreme SuperHyperGraph 1190
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1191
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1192
as the consequences of the model, some parameters are used. The cells are under attack of this 1193
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1194
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1195
In the following, some Extreme steps are Extreme devised on this disease. 1196
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1197
function. 1198
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1199
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1200
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1204
what’s done. 1205
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1206
they’ve got the names, and some general Extreme models. The moves and the Extreme 1207
traces of the cancer on the complex tracks and between complicated groups of cells could be 1208
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1209
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1210
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1211
in those Extreme Extreme SuperHyperModels. 1212
Some cells have been faced with some attacks from the situation which is caused by the 1213
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1214
which in that, the cells could be labelled as some groups and some groups or individuals have 1215
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1216
the embedded situations, the individuals of cells and the groups of cells could be considered 1217
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1218
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1219
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1220
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1221
41
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1222
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1223
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1224
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1225
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1226
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1227
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1228

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1229
is going to figure out what’s going on this phenomenon. The special case of this disease is 1230
considered and as the consequences of the model, some parameters are used. The cells are 1231
under attack of this disease but the moves of the cancer in the special region are the matter of 1232
mind. The recognition of the cancer could help to find some treatments for this disease. The 1233
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1234
Recognition” and both bases are the background of this research. Sometimes the cancer has 1235
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1236
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1237
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1238
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1239
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1240
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1241
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1242
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1243
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1244
and neutrality about the moves and the effects of the cancer on that region; this event leads 1245
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1246
perception on what’s happened and what’s done. There are some specific models, which 1247
are well-known and they’ve got the names, and some general models. The moves and the 1248
traces of the cancer on the complex tracks and between complicated groups of cells could 1249
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1250
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1251
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1252

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1253
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1254
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1255
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1256
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1257
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1258
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1259
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1260
based on the fixed groups of cells or the fixed groups of group of cells? 1261
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1262
messy and dense SuperHyperModels where embedded notions are illustrated? 1263
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1264
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1265
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1266

research has taken more motivations to define SuperHyperClasses and to find some connections 1267
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1268
instances and examples to make clarifications about the framework of this research. The general 1269
results and some results about some connections are some avenues to make key point of this 1270
research, “Cancer’s Recognition”, more understandable and more clear. 1271
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1272
on the modeling of the regions where are under the attacks of the cancer to recognize 1273
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1274
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1275
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1276
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1277
instances and literature reviews have taken the whole way through. In this scientific research, 1278
the literature reviews have fulfilled the lines containing the notions and the results. The 1279
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1280
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1281
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1282
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1283
of the moves of the cancer in the longest and strongest styles with the formation of the design 1284
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1285
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1286
out the background for the SuperHyperNotions. 1287

CHAPTER 5 1288
Extreme Hamiltonian-Cycle-Cut 1289
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1290
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1291
2023, (doi: 10.13140/RG.2.2.34953.52320). 1292

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1293
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1294
(doi: 10.13140/RG.2.2.33275.80161). 1295
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1296
10.13140/RG.2.2.11050.90569). 1298
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1299
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1300
10.13140/RG.2.2.17761.79206). 1301
10.13140/RG.2.2.19911.37285). 1304
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1305
10.13140/RG.2.2.23266.81602). 1307
10.13140/RG.2.2.19360.87048). 1310
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1311
10.13140/RG.2.2.32363.21286). 1313
10.13140/RG.2.2.11758.69441). 1316
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1317
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1318
10.13140/RG.2.2.31891.35367). 1319
10.13140/RG.2.2.21510.45125). 1322
45
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1323
10.13140/RG.2.2.13121.84321). 1325

CHAPTER 6 1326
New Ideas On Super Hammy By Hyper 1327
Hamper Of Hamiltonian-Cycle-Cut In 1328
Recognition of Cancer With 1329
(Neutrosophic) SuperHyperGraph 1330
47
CHAPTER 7 1331
ABSTRACT 1332
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1333

Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cycle- 1334
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 1335
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperHamiltonian- 1336
Cycle-Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut 1337
criteria holds 1338
∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut if the following expression is called 1339

Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut criteria holds 1340
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1341

SuperHyperHamiltonian-Cycle-Cut if the following expression is called Neutrosophic v- 1342
SuperHyperHamiltonian-Cycle-Cut criteria holds 1343
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut if the following expression is called 1344

Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut criteria holds 1345
∀Va ∈ C : C is
49
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1346

SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian- 1347
Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut, 1348
Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and 1349
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut. ((Neutrosophic) SuperHyperHamiltonian- 1350
Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1351
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is 1352

called an Extreme SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e- 1353
SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut, Neut- 1354
rosophic v-SuperHyperHamiltonian-Cycle-Cut, and Neutrosophic rv-SuperHyperHamiltonian- 1355
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1356
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1357
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 1358

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1359
Cycle-Cut; a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e- 1360
Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1363
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1364

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1365
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1366
SuperHyperHamiltonian-Cycle-Cut; an Extreme SuperHyperHamiltonian-Cycle-Cut SuperHy- 1367
perPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic 1368
re-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and 1369
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme Super- 1370

HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1371
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1372
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1373
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1374
form the Extreme SuperHyperHamiltonian-Cycle-Cut; and the Extreme power is corresponded 1375
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyper- 1376

Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic 1377
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHy- 1379
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1380
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1381
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 1382
ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1383
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; and the Neutrosophic 1384
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian- 1385
Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic 1386

Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme SuperHyper- 1388
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1389
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1390
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1391

the Extreme SuperHyperHamiltonian-Cycle-Cut; a Neutrosophic V-SuperHyperHamiltonian- 1392

re-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, 1394
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutrosophic 1395
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 1396
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1397
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyper- 1398

Vertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; an Extreme 1399
V-SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic e- 1400
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1403
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1404
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1405
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1406
Cycle-Cut; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 1408
SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic e- 1409

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1413
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 1414
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1415
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1416
the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; and the Neutrosophic power is corres- 1417
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1418
for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cycle-Cut and Neutrosophic 1419
SuperHyperHamiltonian-Cycle-Cut. Two different types of SuperHyperDefinitions are debut 1420
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1421
Recognition” are the under research to figure out the challenges make sense about ongoing and 1428
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1433
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1434
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1435
research. It’s also officially collected in the form of some questions and some problems. Assume 1436
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cycle-Cut 1437

is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 1438
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1441
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Cut is 1442
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1443
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1447
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1448
SuperHyperHamiltonian-Cycle-Cut . Since there’s more ways to get type-results to make 1449
a SuperHyperHamiltonian-Cycle-Cut more understandable. For the sake of having Neut- 1450

rosophic SuperHyperHamiltonian-Cycle-Cut, there’s a need to “redefine” the notion of a 1451
“SuperHyperHamiltonian-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are 1452
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 1453
the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cycle-Cut . 1454
It’s redefined a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if the mentioned Table holds, 1455
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1456
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1457
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1458
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1459
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1460
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1461
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1462
based on a SuperHyperHamiltonian-Cycle-Cut . It’s the main. It’ll be disciplinary to have 1463
have all SuperHyperHamiltonian-Cycle-Cut until the SuperHyperHamiltonian-Cycle-Cut, 1465
then it’s officially called a “SuperHyperHamiltonian-Cycle-Cut” but otherwise, it isn’t a 1466
SuperHyperHamiltonian-Cycle-Cut . There are some instances about the clarifications for the 1467
main definition titled a “SuperHyperHamiltonian-Cycle-Cut ”. These two examples get more 1468
scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHy- 1469
perClass based on a SuperHyperHamiltonian-Cycle-Cut . For the sake of having a Neutrosophic 1470
SuperHyperHamiltonian-Cycle-Cut, there’s a need to “redefine” the notion of a “Neutrosophic 1471
SuperHyperHamiltonian-Cycle-Cut” and a “Neutrosophic SuperHyperHamiltonian-Cycle-Cut ”. 1472
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 1473
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1474
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 1475
the intended Table holds. And a SuperHyperHamiltonian-Cycle-Cut are redefined to a “Neut- 1476
rosophic SuperHyperHamiltonian-Cycle-Cut” if the intended Table holds. It’s useful to define 1477
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 1478
type-results to make a Neutrosophic SuperHyperHamiltonian-Cycle-Cut more understandable. 1479

Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses 1480
if the intended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Cut, 1481
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 1482
are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Cut”, 1483

“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 1484

HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 1485
SuperHyperGraph has a “Neutrosophic SuperHyperHamiltonian-Cycle-Cut” where it’s the 1486
strongest [the maximum Neutrosophic value from all the SuperHyperHamiltonian-Cycle-Cut 1487
amid the maximum value amid all SuperHyperVertices from a SuperHyperHamiltonian- 1488
Cycle-Cut .] SuperHyperHamiltonian-Cycle-Cut . A graph is a SuperHyperUniform if it’s a 1489
SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume 1490
a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Su- 1491
perHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1492
with two exceptions; it’s SuperHyperHamiltonian-Cycle-Cut if it’s only one SuperVertex as 1493
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1494
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1495
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1496
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1497
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1498
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1499
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1500
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1501
the specific designs and the specific architectures. The SuperHyperModel is officially called 1502
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1503
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1504
and the common and intended properties between “specific” cells and “specific group” of 1505
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1506
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1507
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1508
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 1509
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 1510
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 1511
long cycle of the move from the cancer is identified by this research. Sometimes the move of 1512
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 1513
neutrality about the moves and the effects of the cancer on that region; this event leads us 1514
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 1515
perception on what’s happened and what’s done. There are some specific models, which are 1516
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 1517
moves and the traces of the cancer on the complex tracks and between complicated groups of 1518
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 1519

Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1520
The aim is to find either the longest SuperHyperHamiltonian-Cycle-Cut or the strongest 1521
SuperHyperHamiltonian-Cycle-Cut in those Neutrosophic SuperHyperModels. For the 1522
longest SuperHyperHamiltonian-Cycle-Cut, called SuperHyperHamiltonian-Cycle-Cut, and the 1523
strongest SuperHyperHamiltonian-Cycle-Cut, called Neutrosophic SuperHyperHamiltonian- 1524
Cycle-Cut, some general results are introduced. Beyond that in SuperHyperStar, all possible 1525
SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to 1526
have at least three SuperHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Cut. 1527
There isn’t any formation of any SuperHyperHamiltonian-Cycle-Cut but literarily, it’s the 1528
deformation of any SuperHyperHamiltonian-Cycle-Cut. It, literarily, deforms and it doesn’t 1529

form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cycle-Cut theory, 1530

SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1531
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Cut, Cancer’s 1532
Neutrosophic Recognition 1533


CHAPTER 8 1535
Applied Notions Under The Scrutiny Of 1536
The Motivation Of This Scientific 1537
Research 1538
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1539
try to bring the motivations in the narrative ways. Some cells have been faced with some 1540
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1541
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1542
as some groups and some groups or individuals have excessive labels which all are raised from 1543
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1544
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1545
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1546
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1547
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1548
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1549
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1550
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1551
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1552
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1553
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1554
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1555
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1556
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1557
The special case of this disease is considered and as the consequences of the model, some 1558
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1559
the special region are the matter of mind. The recognition of the cancer could help to find some 1560
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1561
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1562
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1563
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1564
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with 1565
the formation of the design and the architecture are formally called “ SuperHyperHamiltonian- 1566
Cycle-Cut” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 1567
55
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 1568
recognition of the cancer in the long-term function. The specific region has been assigned by 1569
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1570
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1571
there are some determinacy, indeterminacy and neutrality about the moves and the effects of 1572
the cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1573
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1574
are some specific models, which are well-known and they’ve got the names, and some general 1575
models. The moves and the traces of the cancer on the complex tracks and between complicated 1576
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperHamiltonian- 1577
Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1578
The aim is to find either the optimal SuperHyperHamiltonian-Cycle-Cut or the Extreme 1579
SuperHyperHamiltonian-Cycle-Cut in those Extreme SuperHyperModels. Some general results 1580

are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s 1581
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1582
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Cut. There isn’t any 1583
formation of any SuperHyperHamiltonian-Cycle-Cut but literarily, it’s the deformation of any 1584
SuperHyperHamiltonian-Cycle-Cut. It, literarily, deforms and it doesn’t form. 1585
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the 1586
“ amount of SuperHyperHamiltonian-Cycle-Cut” of either individual of cells or the groups 1587

of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 1588
SuperHyperHamiltonian-Cycle-Cut” based on the fixed groups of cells or the fixed groups of 1589
group of cells? 1590
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1591
messy and dense SuperHyperModels where embedded notions are illustrated? 1592
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1593
it motivates us to define different types of “ SuperHyperHamiltonian-Cycle-Cut” and “Extreme 1594

SuperHyperHamiltonian-Cycle-Cut” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1595
Then the research has taken more motivations to define SuperHyperClasses and to find some 1596
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1597
some instances and examples to make clarifications about the framework of this research. The 1598
general results and some results about some connections are some avenues to make key point of 1599
this research, “Cancer’s Recognition”, more understandable and more clear. 1600
The framework of this research is as follows. In the beginning, I introduce basic definitions 1601
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1602
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1603
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1604
review literature are applied to make sense about what’s going to figure out about the upcoming 1605
sections. The main definitions and their clarifications alongside some results about new notions, 1606
SuperHyperHamiltonian-Cycle-Cut and Extreme SuperHyperHamiltonian-Cycle-Cut, are figured 1607
out in sections “ SuperHyperHamiltonian-Cycle-Cut” and “Extreme SuperHyperHamiltonian- 1608
Cycle-Cut”. In the sense of tackling on getting results and in Hamiltonian-Cycle-Cut to 1609
make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1610
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1611
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1612

and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1613
there are some smart steps toward the common notions to extend the new notions in new 1614
frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1615
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1616
about the general SuperHyperRelations and as concluding and closing section of theoretical 1617
research are contained in the section “General Results”. Some general SuperHyperRelations 1618
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1619
and discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Cycle-Cut”, 1620
“Extreme SuperHyperHamiltonian-Cycle-Cut”, “Results on SuperHyperClasses” and “Results 1621
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1622
SuperHyperNotions to make sense about excellency of this research and going to figure out 1623
the word “best” as the description and adjective for this research as presented in section, 1624
“ SuperHyperHamiltonian-Cycle-Cut”. The keyword of this research debut in the section 1625

“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1626
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1627
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1628
are some scrutiny and discernment on what’s done and what’s happened in this research in 1629
the terms of “questions” and “problems” to make sense to figure out this research in featured 1630
style. The advantages and the limitations of this research alongside about what’s done in this 1631
research to make sense and to get sense about what’s figured out are included in the section, 1632
“Conclusion and Closing Remarks”. 1633

CHAPTER 9 1634
Extreme Preliminaries Of This Scientific 1635
Research On the Redeemed Ways 1636
In this section, the basic material in this scientific research, is referred to [Single Valued 1637
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1638
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1639

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1640
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1641
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1642
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1643
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1644
their clarifications are addressed to Ref.[HG38]. 1645

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

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1665
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1666
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1667
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1668
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1669
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1670

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

(Ref.[HG38],Definition 2.7,p.3). 1672
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1673
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1674
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1675
(i) If |Vi | = 1, then Vi is called vertex; 1676
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1677
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1678
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1679
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1680
SuperEdge; 1681
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1682
SuperHyperEdge. 1683
If we choose different types of binary operations, then we could get hugely diverse types of 1684
general forms of Neutrosophic SuperHyperGraph (NSHG). 1685
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1686

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1687
x, y, z, w ∈ [0, 1]: 1688
(i) 1 ⊗ x = x; 1689
(ii) x ⊗ y = y ⊗ x; 1690
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1691
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1692

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

where 1695

1, 2, . . . , n0 ); 1700
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1701
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1702
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1703
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1704
0


SuperEdge; 1724
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1727
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1728
makes the patterns and regularities. 1729
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1730
of elements of SuperHyperEdges are the same. 1731

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1732
makes to have SuperHyperUniform more understandable. 1733
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1734
Classes as follows. 1735
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1736
two given SuperHyperEdges with two exceptions; 1737
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1738
SuperHyperEdges; 1739
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1740
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1741
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1742
in common; 1743
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1744
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1745
SuperHyperEdge in common; 1746
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1747
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1748
SuperVertex. 1749
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 1750
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1751
(i) Vi , Vi+1 ∈ Ei0 ; 1752
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1753
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1754
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1755
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1756
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1757
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1758
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1759
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1761
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1762
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1763
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1764
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1765
perPath . 1766
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 1767
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1768
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1769
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1770
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1771
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1772

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1785
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1786
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1787
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1788

Cycle-Cut). 1789
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1791
or E 0 is called 1792
(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut if the following expression is 1793

called Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut criteria holds 1794
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut if the following expression is 1795

called Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut criteria holds 1796
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1797
(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut if the following expression is 1798
called Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut criteria holds 1799
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut if the following expression is 1800
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1802

(v) Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 1803

sophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian- 1804
Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and Neutrosophic rv- 1805
SuperHyperHamiltonian-Cycle-Cut. 1806
Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Cut). 1807

(i) an Extreme SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic 1810

e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Cycle- 1811
Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and Neutrosophic rv- 1812
SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph 1813
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1814

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1815
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1816
that they form the Extreme SuperHyperHamiltonian-Cycle-Cut; 1817
(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 1818

SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 1821
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Super- 1822
HyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 1823

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 1824
that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; 1825
(iii) an Extreme SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if 1826

it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re- 1827
SuperHyperHamiltonian-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, 1828
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme 1829
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1830
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1831
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme car- 1832

dinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1833
such that they form the Extreme SuperHyperHamiltonian-Cycle-Cut; and the Extreme 1834
power is corresponded to its Extreme coefficient; 1835
(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial 1836

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re- 1837
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutro- 1839
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1840

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1841
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1842
SuperHyperHamiltonian-Cycle-Cut; and the Neutrosophic power is corresponded to its 1845
Neutrosophic coefficient; 1846

(v) an Extreme V-SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 1847

of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1852

(vi) a Neutrosophic V-SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 1855


N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1859
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1860
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1861
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; 1862
(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if 1863

of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1869

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1870
(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial 1873

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1879

Neutrosophic coefficient. 1883
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Cut). 1884

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1885
(i) an δ−SuperHyperHamiltonian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 1886
SuperHyperHamiltonian-Cycle-Cut such that either of the following expressions hold for 1887

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1888
|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 1889
(29.1), holds if S is an δ−SuperHyperDefensive; 1890
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Cut is a Neutrosophic kind 1891

of Neutrosophic SuperHyperHamiltonian-Cycle-Cut such that either of the following 1892
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 1893
of s ∈ S : 1894
|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 1895
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1896
For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Cut, there’s a need to 1897

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1898
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1899
there’s the usage of the position of labels to assign to the values. 1900
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1901
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1902
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1903
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1904
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 1905

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1906
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Cut, SuperHyperStar, 1907
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1908
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1909
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1910
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1911
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 1912
Cycle-Cut. Since there’s more ways to get type-results to make a Neutrosophic 1913

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

136TBL4

136TBL1
SuperHyperHamiltonian-Cycle-Cut more Neutrosophicly understandable. 1914

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Cut”. The 1916
1919
136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Cycle-Cut. It’s redefined a Neutro- 1920
sophic SuperHyperHamiltonian-Cycle-Cut if the Table (29.3) holds. 1921

CHAPTER 10 1922
Extreme 1923
SuperHyperHamiltonian-Cycle-Cut But 1924
As The Extensions Excerpt From Dense 1925
And Super Forms 1926
Definition 10.0.1. (Extreme event). 1927

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1928
is a probability Hamiltonian-Cycle-Cut. Any Extreme k-subset of A of V is called Extreme 1929
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1930
expression is called Extreme probability of A. 1931
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1932

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1933
is a probability Hamiltonian-Cycle-Cut. s Extreme k-events Ai , i ∈ I is called Extreme 1934
s-independent if the following expression is called Extreme s-independent criteria 1935
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 1936
following expression is called Extreme independent criteria 1937
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 1938

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1939
a probability Hamiltonian-Cycle-Cut. Any k-function Hamiltonian-Cycle-Cut like E is called 1940
Extreme k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Cut like E is called 1941

Extreme Variable. 1942
The notion of independent on Extreme Variable is likewise. 1943
71
Definition 10.0.4. (Extreme Expectation). 1944

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 1945
probability Hamiltonian-Cycle-Cut. an Extreme k-Variable E has a number is called Extreme 1946
Expectation if the following expression is called Extreme Expectation criteria 1947
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 1948

a probability Hamiltonian-Cycle-Cut. an Extreme number is called Extreme Crossing if the 1950
following expression is called Extreme Crossing criteria 1951
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 1952
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let m and n propose special Hamiltonian- 1953

Cycle-Cut. Then with m ≥ 4n, 1954
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 Hamiltonian-Cycle-Cut p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 1955
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
1956
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1957
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let P be a SuperHyperSet of n 1958
points in the plane, and let l be the Extreme number of√ SuperHyperLines in the plane passing 1959
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1960
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 1961

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 1969
Then k < 5n4/3 . 1970
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 1971
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle 1972
around each SuperHyperPoint of P. Let ni be theP Extreme number of these SuperHyperCircles 1973
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 1974
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 1975

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 1980
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 1981
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 1982
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 1983
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1984
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let X be a nonnegative Extreme 1985
Variable and t a positive real number. Then 1986
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. 1987
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1988
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let Xn be a nonnegative integer- 1989
valued variable in a probability Hamiltonian-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 1990

n → ∞, then P (Xn = 0) → 1 as n → ∞. 1991
Proof. 1992
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. A special SuperHyperGraph in 1994
Gn,p almost surely has stability number at most d2p−1 log ne. 1995

S = (V, E) is a probability Hamiltonian-Cycle-Cut. A special SuperHyperGraph in Gn,p is 1997
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 1998
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 1999
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2000
SuperHyperEdge of the Extreme SuperHyperGraph G. 2001
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2002
Extreme Variable for this Extreme Event. By equation, we have 2003
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 2004
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2005
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: 2006
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2007
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 2008
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2009
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2010
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2011
Definition 10.0.12. (Extreme Variance). 2012

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

S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let X be an Extreme Variable and let t be 2020
a positive real number. Then 2021
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2022
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let Xn be an Extreme Variable in 2024
a probability Hamiltonian-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2025
then 2026
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 2028
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2029
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2030
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2032
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 2033
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2034
S = (V, E) is a probability Hamiltonian-Cycle-Cut. As in the proof of related Theorem, the 2036
result is straightforward. 2037
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ 2039
be as defined in previous Theorem. Then either: 2040
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2041
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2042
S = (V, E) is a probability Hamiltonian-Cycle-Cut. The latter is straightforward. 2044
Definition 10.0.17. (Extreme Threshold). 2045

a probability Hamiltonian-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs 2047
(one which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for 2048
P is a function f (n) such that: 2049
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2050
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2051

Definition 10.0.18. (Extreme Balanced). 2052

probability Hamiltonian-Cycle-Cut. Let F be a fixed Extreme SuperHyperGraph. Then 2054
there is a threshold function for the property of containing a copy of F as an Extreme 2055
SubSuperHyperGraph is called Extreme Balanced. 2056
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let F be a nonempty balanced 2058
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2059

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2060
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2063
the mentioned Extreme Figures in every Extreme items. 2064
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme 2065

SuperHyperHamiltonian-Cycle-Cut, is up. The Extreme Algorithm is Extremely straight- 2066
forward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2067
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2068
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2069
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2070
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2071

V3 , is excluded in every given Extreme SuperHyperHamiltonian-Cycle-Cut. 2072
C(N SHG)Extreme Hamiltonian-Cycle-Cut

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

forward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2076
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2077
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2078
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2079
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2080

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.3) 136NSHG1
= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + 2z 3 .
2082

forward. 2085

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



forward. 2089

= {E4 , E5 }.
= 2z 5 .
= {V1 , V2 , V3 , {N }, {F }}.
= z 4 + z 3 + z 2 + 2z.
2090

forward. 2093

= {}.
= 0z 0 .

= {}.
= 0z 0 .
2094

forward. 2097

= {Eii=110 , Ejj=2232 , E12 }.
= 22z 2 .
= {Vi }22
i=1 .
22
X
= z |Vi | .
i=1
2098


forward. 2101

= {E15 , E13 , E16 , E14 , E17 , E12 }.
= 2z 5 + z 4 + 3z 2 .
= {Vi }11
i=1 .
11
X
= z |Vi | .
i=1
2102

forward. 2105

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

forward. 2109

= {Eii=110 , Ejj=2223 , E12 }.
= 13z 2 .
= {Vi }22
i=1 .

22
X
= z |Vi | .
i=1
2110
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperHamiltonian-2111

Cycle-Cut, is up. The Extreme Algorithm is Extremely straightforward. 2112
begineqnarray* C(NSHG)Extreme Hamiltonian-Cycle-Cut 2113
= {E1 , E6 , E2 , E7 , E3 , E4 }. 2114
C(N SHG)Extreme Hamiltonian-Cycle-Cut SuperHyperPolynomial 2115
= 2z 5 + z 4 + 3z 2 . 2116
C(N SHG)Extreme V-Hamiltonian-Cycle-Cut 2117
= {Vi }11
i=1 . 2118
C(N SHG)Extreme V-Hamiltonian-Cycle-Cut SuperHyperPolynomial 2119
P11 |Vi |
= i=1 z . 2120
On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperHamiltonian-2121


= {E1 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .



= {Vi }6i=1 .
6
X
= z |Vi | .
i=1
2123


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



= {E9 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .
= {Vi }6i=1 .
6
X
= z |Vi | .
i=1
2129


= {}.
= 0z 0 .


= {}.
= 0z 0 .
2132


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



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



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


= {}.
= 0z 0 .

= {}.
= 0z 0 .
2144


= {Eii=112 }.
12
X
= z |Ei | .
i=1
= {Vi }ai=1 .
Xa
= z |Vi | .
i=1
2147



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


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


= {VE2 }.
= z 5 + 2z 3 + 7z.
2153


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

SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.3) 95NHG1
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2157
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cycle-Cut 2158
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2159
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2160
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2161
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2162

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2163
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2164
quasi-R-Hamiltonian-Cycle-Cut minus all Extreme SuperHypeNeighbor to some of them but not 2165
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2166
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle-Cut, 2167
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2168
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

SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.3) 95NHG2
cardinality of the Extreme R-Hamiltonian-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Cut 2169
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2170
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2171
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2172
of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Cycle-Cut in some cases 2173

but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2174
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2175
R-Hamiltonian-Cycle-Cut. 2176
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-Cycle-Cut has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Hamiltonian-Cycle-Cut with the least Extreme cardinality, 2177

the lower sharp Extreme bound for cardinality. 2178
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2179

Then in the worst case, literally, 2180
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

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

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

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

Is a quasi-R-Hamiltonian-Cycle-Cut. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-Cycle-Cut is the cardinality of
Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the
SuperHyperStable is only up in this quasi-R-Hamiltonian-Cycle-Cut. It’s the contradiction to
that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-Hamiltonian-Cycle-Cut decorates the Extreme
SuperHyperVertices 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-Hamiltonian-Cycle-
Cut. Since at least two Extreme SuperHyperVertices involve to make a title in the Extreme
background of the Extreme SuperHyperGraph. The Extreme SuperHyperGraph is obvious
if it has no Extreme SuperHyperEdge but at least two Extreme SuperHyperVertices make
the Extreme version of Extreme SuperHyperEdge. Thus in the Extreme setting of non-
obvious Extreme SuperHyperGraph, there are at least one Extreme SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Extreme adjective for the initial
Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop Extreme
version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said to be
loopless. The Extreme adjective “loop” on the basic Extreme framework engages one Extreme
SuperHyperVertex but it never happens in this Extreme setting. With these Extreme bases,
on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus there’s
at least an Extreme R-Hamiltonian-Cycle-Cut has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Hamiltonian-Cycle-Cut has the Extreme cardinality
at least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This

Extreme SuperHyperSet isn’t an Extreme R-Hamiltonian-Cycle-Cut since either the Extreme

SuperHyperGraph is an obvious Extreme SuperHyperModel thus it never happens since there’s
no Extreme usage of this Extreme framework and even more there’s no Extreme connection
inside or the Extreme SuperHyperGraph isn’t obvious and as its consequences, there’s an
Extreme contradiction with the term “Extreme R-Hamiltonian-Cycle-Cut” since the maximum
Extreme cardinality never happens for this Extreme style of the Extreme SuperHyperSet and
beyond that there’s no Extreme connection inside as mentioned in first Extreme case in the
forms of drawback for this selected Extreme SuperHyperSet. Let
Comes up. This Extreme case implies having the Extreme style of on-quasi-triangle Extreme
style on the every Extreme elements of this Extreme SuperHyperSet. Precisely, the Extreme
R-Hamiltonian-Cycle-Cut is the Extreme SuperHyperSet of the Extreme SuperHyperVertices
such that some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle
Extreme style. The Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet

But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that

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

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


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

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

2185
Extreme R-Hamiltonian-Cycle-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Hamiltonian-Cycle-Cut where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in an Extreme Hamiltonian-Cycle-Cut, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Cut 2186
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2187
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2188
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2189
number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Cycle-Cut in 2190
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2191
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2192
contained in an Extreme R-Hamiltonian-Cycle-Cut. 2193
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2194
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2195
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2196
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2197
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2198
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2199
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2200
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2201
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2202
Thus it forms an Extreme quasi-R-Hamiltonian-Cycle-Cut where the Extreme completion of 2203
the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Hamiltonian- 2204
Cycle-Cut. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2205
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2206
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2207
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2208
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2209
included in the minimum Extreme style of the embedded Extreme R-Hamiltonian-Cycle-Cut. 2210
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2211
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2212
common connections, more precise and more formal, the perfect unique connections inside 2213
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2214
Extreme R-Hamiltonian-Cycle-Cut. Thus Extreme exterior SuperHyperVertices could be used 2215
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2216
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2217
Hamiltonian-Cycle-Cut, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2218

more connections inside more than outside. Thus the title “exterior” is more relevant than the 2219
title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme 2220
SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has been 2221
ignored in the exploring to lead on the optimal case implying the Extreme R-Hamiltonian- 2222
Cycle-Cut. The Extreme R-Hamiltonian-Cycle-Cut with the exclusion of the exclusion of 2223
all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2224
Extreme R-Hamiltonian-Cycle-Cut with the inclusion of all Extreme SuperHyperVertices in 2225

one Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Cycle-Cut. To sum them 2226
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2227
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2228
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian-Cycle- 2229
Cut minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2230
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2231
Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle-Cut, minus all Extreme 2232
SuperHypeNeighbor to some of them but not all of them. 2233
The main definition of the Extreme R-Hamiltonian-Cycle-Cut has two titles. an Extreme quasi-R- 2234
Hamiltonian-Cycle-Cut and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2235
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2236
quasi-R-Hamiltonian-Cycle-Cut with that quasi-maximum Extreme SuperHyperCardinality 2237

in the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2238
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2239
all the Extreme quasi-R-Hamiltonian-Cycle-Cuts for all Extreme numbers less than its Extreme 2240
corresponded maximum number. The essence of the Extreme Hamiltonian-Cycle-Cut ends up 2241
but this essence starts up in the terms of the Extreme quasi-R-Hamiltonian-Cycle-Cut, again 2242
and more in the operations of collecting all the Extreme quasi-R-Hamiltonian-Cycle-Cuts acted 2243
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2244
number. This Extreme number is 2245
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Cuts. Let 2246
zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Cycle-Cut be an Extreme number, 2247
an Extreme SuperHyperSet and an Extreme Hamiltonian-Cycle-Cut. Then 2248
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Hamiltonian-Cycle-Cut is re-formalized 2249
and redefined as follows. 2250
GExtreme Hamiltonian-Cycle-Cut ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2251

definition for the Extreme Hamiltonian-Cycle-Cut. 2252
GExtreme Hamiltonian-Cycle-Cut =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Hamiltonian- 2253
Cycle-Cut poses the upcoming expressions. 2254
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2255
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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

To get more visions in the closer look-up, there’s an overall overlook. 2257



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

2259

2260

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2261
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2262
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2263
It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Cycle-Cut” but, precisely, it’s the 2264
generalization of “Extreme Quasi-Hamiltonian-Cycle-Cut” since “Extreme Quasi-Hamiltonian- 2265
Cycle-Cut” happens “Extreme Hamiltonian-Cycle-Cut” in an Extreme SuperHyperGraph as 2266
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2267
“Extreme Hamiltonian-Cycle-Cut” in an Extreme SuperHyperGraph as initial framework and 2268
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2269
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2270
“Extreme Quasi-Hamiltonian-Cycle-Cut”, and “Extreme Hamiltonian-Cycle-Cut” are up. 2271
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Cycle-Cut be an 2272
Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Cycle-Cut 2273
and the new terms are up. 2274

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality

2275
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2276
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2277
And with go back to initial structure, 2278


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


2280

2281

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

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

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by Extreme Hamiltonian-Cycle-Cut is related to
the Extreme SuperHyperSet of the Extreme SuperHyperVertices,

There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Hamiltonian-Cycle-Cut is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Cut is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Cycle-Cut is up. To sum them
up, the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Cycle-

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the Extreme
Hamiltonian-Cycle-Cut. There isn’t only less than two Extreme SuperHyperVertices inside the
intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Hamiltonian-Cycle-Cut,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-

Cut, not:
Is the Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2282
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2283
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2284
the 2285
“Extreme R-Hamiltonian-Cycle-Cut” 2286
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2287
Extreme R-Hamiltonian-Cycle-Cut, 2288
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-Hamiltonian-Cycle-Cut amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Hamiltonian-Cycle-Cut, are
In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Hamiltonian-Cycle-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Hamiltonian-Cycle-Cut is the cardinality of
2289
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2290
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cycle-Cut if for any 2291
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2292
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2293
all minus all Extreme SuperHypeNeighbors to any amount of them. 2294
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2295
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2296
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2297
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2298
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2299
R-Hamiltonian-Cycle-Cut with the least cardinality, the lower sharp Extreme bound for Extreme 2300
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2301
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2302

S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2303
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Hamiltonian-Cycle-Cut. 2304
Since it doesn’t have 2305
2306
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2307
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2308
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2309
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Super- 2310
HyperVertices but it isn’t an Extreme R-Hamiltonian-Cycle-Cut. Since it doesn’t do the 2311
Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have some 2312
Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2313
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2314
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2315

SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2316
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2317
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus 2318
the obvious Extreme R-Hamiltonian-Cycle-Cut, VESHE is up. The obvious simple Extreme 2319
type-SuperHyperSet of the Extreme R-Hamiltonian-Cycle-Cut, VESHE , is an Extreme SuperHy- 2320
perSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2321
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2322
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2323
is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2324
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2325
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2326
ESHG : (V, E). Any Extreme R-Hamiltonian-Cycle-Cut only contains all interior Extreme 2327
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2328
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2329
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2330
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2331
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2332
The SuperHyperNotion, namely, Hamiltonian-Cycle-Cut, is up. There’s neither empty 2333

SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2334
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2335
the Extreme Hamiltonian-Cycle-Cut. The Extreme SuperHyperSet of Extreme SuperHy- 2336
perEdges[SuperHyperVertices], 2337
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−Cut
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−Cycle−CutSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cycle−CutSuperHyperP olynomial = az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Cut. The Extreme 2338

SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2339
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 2340
ESHG : (V, E) is an Extreme type-SuperHyperSet with 2341

2342
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2343
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2344
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2345
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2346
Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Cycle-Cut is up. The 2347
obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Cut is an 2348
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2349
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2350
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2351
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2352
Cycle-Cut is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2353
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Cut. 2355

Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2356
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cycle-Cut C(ESHG) for an Extreme SuperHyperGraph 2357
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2358
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2359
that Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Cut and it’s an 2360
Extreme Hamiltonian-Cycle-Cut. Since it’s 2361
2362
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2363

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2364
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2365
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2366
intended Extreme SuperHyperSet, 2367
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Thus the non-obvious Extreme Hamiltonian-Cycle-Cut, 2368
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle-Cut, 2369
not: 2370

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Extreme SuperHyperSet, not: 2371
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2372
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2373
SuperHyperSet called the 2374
“Extreme Hamiltonian-Cycle-Cut” 2375
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2376
Extreme Hamiltonian-Cycle-Cut, 2377
is only and only 2378
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2379

CHAPTER 11 2380
The Extreme Departures on The 2381
Theoretical Results Toward Theoretical 2382
Motivations 2383
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2384
SuperHyperClasses. 2385
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2386

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

SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2389
new way to redefine as 2390
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 2391
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Cut. The latter is 2392
straightforward. 2393
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2394
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2395
(31.1), is the SuperHyperHamiltonian-Cycle-Cut. 2396
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2397

= {}.
= 0z 0 .

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2405
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2406
SuperHyperModel (31.2), is the Extreme SuperHyperHamiltonian-Cycle-Cut. 2407
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2408

= {Ei }.
i=1|EN SHG |

|EN SHG |
X
= z |Ei | .
i=1
|V
N SHG |
= {Vi }i=1 .

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

SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.7) 136NSHG19a

|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 2409
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2410
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 2411
way to redefine as 2412


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

SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2416
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in 2417
previous Extreme result, of the Extreme SuperHyperVertices of the connected Extreme 2418
SuperHyperStar ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme 2419
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2421

= {Ei |P min |
}.
i=1 N SHG

min
|PN SHG |
X
= z |Ei | .
i=1
|V
N SHG |
= {Vi }i=1 .


|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 2422
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
2423
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 2424
a new way to redefine as 2425

straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Cut. Thus the 2428
notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2429

Cut could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could 2430
have one SuperHyperVertex as the representative in the 2431
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Extreme SuperHyperBi- 2432
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2433
SuperHyperPart SuperHyperEdges are attained in any solution 2434
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2435

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

Extreme SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.11) 136NSHG21a
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2436
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2437
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2438
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2439
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Cycle-Cut. 2440
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2441
Then 2442

= {Ei |P min |
}.
i=1 N SHG

min
|PN SHG |
X
= z |Ei | .
i=1
|V
N SHG |
= {Vi }i=1 .
|VN SHG |
X
= z |Vi | .
i=1

Proof. Let 2443
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2444
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Extreme SuperHyper- 2445

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


Cut could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could 2451
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2453

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2454
SuperHyperEdges are attained in any solution 2455
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2456

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

136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2458
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2459
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2460
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2461
the Extreme SuperHyperHamiltonian-Cycle-Cut. 2462
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2463

= {Ei , Ei∗ , Ej∗ }.
i=1|EN SHG |

|EN SHG |+2
X
= z |Ei | .
i=1
|V
N SHG |
= {Vi }i=1 .
|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 2464
P :
V1EXT ERN AL , E1∗ ,

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

Extreme SuperHyperHamiltonian-Cycle-Cut in the Extreme Example (42.0.15) 136NSHG23a
CEN T ER, E2∗

2465
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Extreme SuperHyper- 2466

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

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Cut. Thus the 2470
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2471
Cut could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Cut proposes some 2472
longest SuperHyperHamiltonian-Cycle-Cut excerpt from some representatives. The latter is 2473
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2475
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2476
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2477
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2478
Extreme SuperHyperHamiltonian-Cycle-Cut. 2479

CHAPTER 12 2480
The Surveys of Mathematical Sets On 2481
The Results But As The Initial Motivation 2482
For the SuperHyperHamiltonian-Cycle-Cut, Extreme SuperHyperHamiltonian-Cycle-Cut, and 2483

the Extreme SuperHyperHamiltonian-Cycle-Cut, some general results are introduced. 2484
Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Cycle-Cut is “redefined” 2485
on the positions of the alphabets. 2486
Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Cycle-Cut. Then 2487
Extreme SuperHyperHamiltonian − Cycle − Cut =

{theSuperHyperHamiltonian − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cycle − Cut
|ExtremecardinalityamidthoseSuperHyperHamiltonian−Cycle−Cut. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2488
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2489

and the neutrality, for i = 1, 2, 3, respectively. 2490
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the alpha- 2491
bet. Then the notion of Extreme SuperHyperHamiltonian-Cycle-Cut and SuperHyperHamiltonian- 2492
Cycle-Cut coincide. 2493
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2494
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2495
SuperHyperHamiltonian-Cycle-Cut if and only if it’s a SuperHyperHamiltonian-Cycle-Cut. 2496
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2497
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2498
SuperHyperHamiltonian-Cycle-Cut if and only if it’s a longest SuperHyperHamiltonian-Cycle- 2499
Cut. 2500
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2501

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Cut is its 2502
SuperHyperHamiltonian-Cycle-Cut and reversely. 2503
123
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Cut, 2504

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2505
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Cut is its 2506
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2508
Cycle-Cut isn’t well-defined if and only if its SuperHyperHamiltonian-Cycle-Cut isn’t well-defined. 2509
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2510
its Extreme SuperHyperHamiltonian-Cycle-Cut isn’t well-defined if and only if its 2511

SuperHyperHamiltonian-Cycle-Cut isn’t well-defined. 2512
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 2513

Then its Extreme SuperHyperHamiltonian-Cycle-Cut isn’t well-defined if and only if its 2515
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2517
Cycle-Cut is well-defined if and only if its SuperHyperHamiltonian-Cycle-Cut is well-defined. 2518
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2519
its Extreme SuperHyperHamiltonian-Cycle-Cut is well-defined if and only if its 2520
SuperHyperHamiltonian-Cycle-Cut is well-defined. 2521
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 2522

Then its Extreme SuperHyperHamiltonian-Cycle-Cut is well-defined if and only if its 2524
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2526
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2527
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2528
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2529
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2530
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2531
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2532
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2533
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2534
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2535
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2536
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2537
(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2538

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

independent SuperHyperSet is 2541
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2544
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2548

which is a SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath. Then V is a maximal 2549
(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2550
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2551
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2552
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2553
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2554
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2555
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2556
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2557

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2558
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2559
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2560
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2561
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2562
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2563
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2564

which is a SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath. Then the number of 2567
(i) : the SuperHyperHamiltonian-Cycle-Cut; 2568

(ii) : the SuperHyperHamiltonian-Cycle-Cut; 2569
(iii) : the connected SuperHyperHamiltonian-Cycle-Cut; 2570
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 2571
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 2572
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Cut. 2573
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2574
coincide. 2575

which is a SuperHyperWheel. Then the number of 2577
(i) : the dual SuperHyperHamiltonian-Cycle-Cut; 2578
(ii) : the dual SuperHyperHamiltonian-Cycle-Cut; 2579
(iii) : the dual connected SuperHyperHamiltonian-Cycle-Cut; 2580
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 2581
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 2582
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut. 2583
coincide. 2585
which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2587

SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2588
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2589
is a 2590
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2594
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2595
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2596

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2599
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2600
SuperHyperPart is a 2601

(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2605
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2606
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2607

SuperHyperMultipartite. Then Then the number of 2610
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2617
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2618
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2620
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2621
(iv) : SuperHyperHamiltonian-Cycle-Cut; 2625
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2626
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2627
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2628
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2629
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2630
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2631

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

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

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2638
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2639
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2640
dual 2641
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2645
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2648
perComplete. Then there’s no independent SuperHyperSet. 2649
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2650

SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is 2651
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 2652
dual 2653
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2657
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2658
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2659
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2660
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2661
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2662
t>
2
setting of a dual 2663



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2670
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2671
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2672
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2673
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2674
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 2675
(i) v ∈ Ns (x); 2676
(ii) vx ∈ E. 2677
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2678
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut, then 2679
(i) S is SuperHyperHamiltonian-Cycle-Cut set; 2680
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2681
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2682
(i) Γ ≤ O; 2683
(ii) Γs ≤ On . 2684
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2685
connected. Then 2686
(i) Γ ≤ O − 1; 2687
(ii) Γs ≤ On − Σ3i=1 σi (x). 2688
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2689
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2690

SuperHyperHamiltonian-Cycle-Cut; 2691
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2692
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2693

(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2694
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2696
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2697

Cut; 2698
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2699
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2700
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2701
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Cut. Then 2703
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2714
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2715
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2717
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Cut; 2718
(ii) Γ = 1; 2719
(iii) Γs = Σ3i=1 σi (c); 2720
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Cut. 2721
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2722
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2723
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 2724

6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2725
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2726
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2727
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 2728
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2729
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2730
Cycle-Cut; 2731
(ii) Γ = b n2 c + 1; 2732
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2733
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian-
2734
Cycle-Cut. 2735
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2736
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian- 2737
Cycle-Cut; 2738
(ii) Γ = b n2 c; 2739

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

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

2745
Cycle-Cut for N SHF; 2746
(ii) Γ = m for N SHF : (V, E); 2747
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2748
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2749
Cycle-Cut for N SHF : (V, E). 2750
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2751

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2752
b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2753
SuperHyperHamiltonian-Cycle-Cut for N SHF; 2754
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2755


b n c+1 for N SHF : (V, E); 2756
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperHamiltonian- 2757
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2759

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2760
bn
2c
Cycle-Cut for N SHF : (V, E); 2762
(ii) Γ = b n2 c for N SHF : (V, E); 2763

bnc for N SHF : (V, E); 2764
S={vi }i=1
bnc
2
are only dual maximal SuperHyperHamiltonian-Cycle-Cut 2765
for N SHF : (V, E). 2766
following statements hold; 2768
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2769

SuperHyperHamiltonian-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
2770
Cycle-Cut; 2771
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2772

SuperHyperHamiltonian-Cycle-Cut, then S is a dual s-SuperHyperDefensive 2773
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2777

SuperHyperHamiltonian-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
2778
Cycle-Cut; 2779
SuperHyperHamiltonian-Cycle-Cut, then S is a dual s-SuperHyperPowerful 2781

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

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

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

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

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

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


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


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

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

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

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

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

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


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

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

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

CHAPTER 13 2843
Extreme Applications in Cancer’s 2844
Extreme Recognition 2845
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2846
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2847
as the consequences of the model, some parameters are used. The cells are under attack of this 2848
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2849
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2850
In the following, some Extreme steps are Extreme devised on this disease. 2851
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2852
function. 2853
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2854
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2855
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2859
what’s done. 2860
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2861
they’ve got the names, and some general Extreme models. The moves and the Extreme 2862
traces of the cancer on the complex tracks and between complicated groups of cells 2863
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Cut, 2864
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 2865
aim is to find either the Extreme SuperHyperHamiltonian-Cycle-Cut or the Extreme 2866
SuperHyperHamiltonian-Cycle-Cut in those Extreme Extreme SuperHyperModels. 2867
135
CHAPTER 14 2868
Case 1: The Initial Extreme Steps 2869
Toward Extreme SuperHyperBipartite 2870
as Extreme SuperHyperModel 2871
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2872
is Extreme highlighted and Extreme featured. 2873
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2874
partite is obtained. 2875
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2876
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

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

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

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

CHAPTER 15 2880
Case 2: The Increasing Extreme Steps 2881
Toward Extreme 2882
SuperHyperMultipartite as Extreme 2883
SuperHyperModel 2884
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2885
ite is Extreme highlighted and Extreme featured. 2886
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2887
partite is obtained. 2888
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2889
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

139
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 2893
Wondering Open Problems But As The 2894
Directions To Forming The Motivations 2895
In what follows, some “problems” and some “questions” are proposed. 2896
The SuperHyperHamiltonian-Cycle-Cut and the Extreme SuperHyperHamiltonian-Cycle-Cut 2897
are defined on a real-world application, titled “Cancer’s Recognitions”. 2898
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2899
recognitions? 2900
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle- 2901

Cut and the Extreme SuperHyperHamiltonian-Cycle-Cut? 2902
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2903
them? 2904
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian-2905
Cycle-Cut and the Extreme SuperHyperHamiltonian-Cycle-Cut? 2906
Problem 16.0.5. The SuperHyperHamiltonian-Cycle-Cut and the Extreme SuperHyperHamiltonian-2907

Cycle-Cut do a SuperHyperModel for the Cancer’s recognitions and they’re based on 2908
SuperHyperHamiltonian-Cycle-Cut, are there else? 2909
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2910
Numbers types-results? 2911
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2912
the multiple types of SuperHyperNotions? 2913
141
CHAPTER 17 2914
Conclusion and Closing Remarks 2915
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2916
research are illustrated. Some benefits and some advantages of this research are highlighted. 2917
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2918
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cycle-Cut. 2919
For that sake in the second definition, the main definition of the Extreme SuperHyperGraph is 2920
redefined on the position of the alphabets. Based on the new definition for the Extreme 2921
SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian-Cycle- 2922
Cut, finds the convenient background to implement some results based on that. Some 2923
SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research on 2924
the modeling of the regions where are under the attacks of the cancer to recognize this 2925
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 2926
the SuperHyperNotion, SuperHyperHamiltonian-Cycle-Cut, the new SuperHyperClasses and 2927
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 2928
SuperHyperHamiltonian-Cycle-Cut and the Extreme SuperHyperHamiltonian-Cycle-Cut. The 2929

clarifications, instances and literature reviews have taken the whole way through. In this 2930
research, the literature reviews have fulfilled the lines containing the notions and the results. 2931
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 2932
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 2933
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 2934
and the architecture are formally called “ SuperHyperHamiltonian-Cycle-Cut” in the themes of 2937
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 2938
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 2939
for this research are, figured out, pointed out and spoken out. 2940
143
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cycle-Cut
3. Extreme SuperHyperHamiltonian-Cycle-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 2941
Extreme SuperHyperDuality But As The 2942
Extensions Excerpt From Dense And 2943
Super Forms 2944
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2945

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

Va ∈ Ei , Ej ; 2949
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2950
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2951
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2952
Vi , Vj ∈ Ea ; 2953
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2954
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2955
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2956
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2957

SuperHyperDuality. 2958
Definition 18.0.2. ((Extreme) SuperHyperDuality). 2959

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2964
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2965
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 2966
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2967
Extreme SuperHyperDuality; 2968
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 2969

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 2970
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2971
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 2972
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2973
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2974
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2975

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2976
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2977
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 2978
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 2979
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2980
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2981
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2982
coefficient; 2983
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2984

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3007
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3008

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3012

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3020
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3021
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3022
to its Extreme coefficient. 3023
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3024
mentioned Extreme Figures in every Extreme items. 3025
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3026
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3027
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3028
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3029
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3030
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- 3034
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3035
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3036
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3037
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3038
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3039
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3040


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

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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3087
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3088
(31.1), is the SuperHyperDuality. 3091
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 3093
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3108
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3109
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3110
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 3112
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

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3116
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3117
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3118
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3119
representative in the 3120
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 : 3121

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3133

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3137
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3138
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. 3150
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 3152
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 : 3153

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

∃!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 3158
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3159
Extreme SuperHyperDuality. 3165

CHAPTER 19 3166
Extreme SuperHyperJoin But As The 3167
Super Forms 3169
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3170

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3181
|Vj |NEUTROSOPIC CARDINALITY ; 3182
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3183
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3184
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3185

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

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

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3201
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3202
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3203
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3204
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3205
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3206
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3207
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3208

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3220
SuperHyperJoin; 3222
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3223

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3226
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3227
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3228
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3229
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3230

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3233

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

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

SuperHyperJoin. 3254
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 3256
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3257
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3258
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3259
V3 , is excluded in every given Extreme SuperHyperJoin. 3261

is up. The Extreme Algorithm is Extremely straightforward. 3263


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3384
Extreme SuperHyperPerfect But As The 3385
Super Forms 3387
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3388

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3400
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3401

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3405
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3406
Extreme SuperHyperPerfect; 3410
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3411

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3418
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3419
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3424
coefficient; 3425
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3426

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3462
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3463
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3464
to its Extreme coefficient. 3465
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3468
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3469
SuperHyperPerfect. 3475
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 3477
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3478
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3482


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

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

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

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

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



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

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

Then 3573

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



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

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

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


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

CHAPTER 21 3608
Extreme SuperHyperTotal But As The 3609
Super Forms 3611
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3612
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3615
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3616

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3622
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3623

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3627
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3629
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3631
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3632

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3639
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3640
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3641
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3642
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3643
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3644
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3645
cient; 3646
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3647

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3648
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3650
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3651
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3652

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3658
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3659
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3660
SuperHyperTotal; 3662
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3663

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3670
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3671
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3674
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3675
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3676
Extreme coefficient; 3677

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3679
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3681
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3682
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3683
cient. 3686
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3689
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3690
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3691
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3692
SuperHyperTotal. 3696
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 3698
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3699
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3700
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3701

V3 , is excluded in every given Extreme SuperHyperTotal. 3703



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3751
(31.1), is the SuperHyperTotal. 3754
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 3756
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. 3763
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 3765
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3827
Extreme SuperHyperConnected But As 3828
The Extensions Excerpt From Dense And 3829
Super Forms 3830
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3831

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3845
SuperHyperConnected. 3846
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3847
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3850

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3864
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3865
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3866
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3867
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3868
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3869
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3870
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3872


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

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

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

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

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

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

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

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

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


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

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

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 3972
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. 3976
(31.1), is the SuperHyperConnected. 3979
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 3981
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. 3988
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 3990



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4009

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4044
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4045
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4046
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4047
some representatives. The latter is straightforward. 4048
Extreme SuperHyperConnected. 4053

CHAPTER 23 4054
Background 4055
215











in Scribd. 4213



Bibliography 4245
10.33140/JMTCM.01.03.09) 4252
221
10.20944/preprints202301.0282.v1). 4280
10.20944/preprints202301.0267.v1). 4283

(doi: 10.20944/preprints202301.0265.v1). 4288
prints202301.0262.v1). 4292
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4298
prints202301.0105.v1). 4301
Preprints 2023, 2023010044 4307
10.20944/preprints202301.0043.v1). 4310

(doi: 10.20944/preprints202212.0549.v1). 4319
(doi: 10.20944/preprints202212.0500.v1). 4326
10.5281/zenodo.7791952). 4335
(doi: 10.5281/zenodo.7791982). 4338

10.5281/zenodo.7790026). 4341
2023, (doi: 10.5281/zenodo.7790052). 4344
2023, (doi: 10.5281/zenodo.7787066). 4347

10.5281/zenodo.7781476). 4353
10.5281/zenodo.7783082). 4356
10.5281/zenodo.7777857). 4359
10.5281/zenodo.7779286). 4362
(doi: 10.5281/zenodo.7771831). 4365
2023, (doi: 10.5281/zenodo.7772468). 4368
10.13140/RG.2.2.20913.25446). 4371
10.5281/zenodo.7764916). 4374
10.13140/RG.2.2.11770.98247). 4377
10.13140/RG.2.2.12400.12808). 4380
2023, (doi: 10.13140/RG.2.2.22545.10089). 4383
10.13140/RG.2.2.11377.76644). 4389

10.13140/RG.2.2.23750.96329). 4392
10.13140/RG.2.2.31366.24641). 4395
10.13140/RG.2.2.34721.68960). 4398
10.13140/RG.2.2.24288.35842). 4407
10.13140/RG.2.2.32467.25124). 4410
10.13140/RG.2.2.31025.45925). 4413
10.13140/RG.2.2.17184.25602). 4416
10.13140/RG.2.2.23423.28327). 4419
10.13140/RG.2.2.28456.44805). 4422
10.13140/RG.2.2.23525.68320). 4425
10.13140/RG.2.2.20170.24000). 4428

10.13140/RG.2.2.36475.59683). 4431
10.13140/RG.2.2.29764.71046). 4434
2023, (doi: 10.13140/RG.2.2.18780.87683). 4437
10.13140/RG.2.2.26134.01603). 4443
10.13140/RG.2.2.27392.30721). 4446
10.13140/RG.2.2.33028.40321). 4449
10.13140/RG.2.2.21389.20966). 4452
10.13140/RG.2.2.16356.04489). 4455
10.13140/RG.2.2.21756.21129). 4458
10.13140/RG.2.2.30983.68009). 4461
10.13140/RG.2.2.28552.29445). 4464

10.13140/RG.2.2.35105.89447). 4470
(doi: 10.13140/RG.2.2.30072.72960). 4473
10.13140/RG.2.2.31147.52003). 4476
10.13140/RG.2.2.32825.24163). 4479
10.13140/RG.2.2.13059.58401). 4482
10.13140/RG.2.2.11172.14720). 4485
2023, (doi: 10.13140/RG.2.2.22011.80165). 4488
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4491
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4497
2023, (doi: 10.13140/RG.2.2.19944.14086). 4500
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4503
(doi: 10.13140/RG.2.2.33103.76968). 4506

2023, (doi: 10.13140/RG.2.2.23037.44003). 4509
(doi: 10.13140/RG.2.2.35646.56641). 4512
(doi: 10.13140/RG.2.2.18030.48967). 4515
(doi: 10.13140/RG.2.2.13973.81121). 4518
2023, (doi: 10.13140/RG.2.2.34106.47047). 4521
2023, (doi: 10.13140/RG.2.2.31956.88961). 4527
2023, (doi: 10.13140/RG.2.2.15179.67361). 4530
10.13140/RG.2.2.21510.45125). 4533
2023, (doi: 10.13140/RG.2.2.13121.84321). 4536
10.13140/RG.2.2.11758.69441). 4539
2023, (doi: 10.13140/RG.2.2.31891.35367). 4542
10.13140/RG.2.2.19360.87048). 4545

2023, (doi: 10.13140/RG.2.2.32363.21286). 4548
(doi: 10.13140/RG.2.2.23266.81602). 4551
10.13140/RG.2.2.19911.37285). 4554
10.13140/RG.2.2.11050.90569). 4557
(doi: 10.13140/RG.2.2.30182.50241). 4569


2023, (doi: 10.13140/RG.2.2.17252.24968). 4602
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 4611

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4614



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


10.20944/preprints202301.0282.v1). 4635
10.20944/preprints202301.0267.v1).). 4638

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4643
prints202301.0262.v1). 4647

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

10.13140/RG.2.2.35061.65767). 4656
10.13140/RG.2.2.18494.15680). 4660

10.13140/RG.2.2.32530.73922). 4664
10.13140/RG.2.2.15897.70243). 4668
10.13140/RG.2.2.32530.73922). 4672
prints202301.0105.v1). 4675
10.13140/RG.2.2.23172.19849). 4682


10.13140/RG.2.2.17385.36968). 4692

(doi: 10.20944/preprints202301.0043.v1). 4698

2023, (doi: 10.13140/RG.2.2.28945.92007). 4701

10.13140/RG.2.2.35774.77123). 4707
10.13140/RG.2.2.29430.88642). 4713

(doi: 10.20944/preprints202212.0549.v1). 4719
10.13140/RG.2.2.19380.94084). 4722

(doi: 10.20944/preprints202212.0500.v1). 4733
10.13140/RG.2.2.20993.12640). 4736




10.13140/RG.2.2.29173.86244). 4751
(doi: 10.5281/zenodo.7792307). 4756
(doi: 10.5281/zenodo.7790728). 4758
2023 (doi: 10.5281/zenodo.7787712). 4760
10.5281/zenodo.7783791). 4762
10.5281/zenodo.7780123). 4764
(doi: 10.5281/zenodo.7773119). 4766
odo.7637762). 4768
10.5281/zenodo.7766174). 4770
10.5281/zenodo.7762232). 4772

(doi: 10.5281/zenodo.7758601). 4774
10.5281/zenodo.7754661). 4776
10.5281/zenodo.7750995) . 4778
(doi: 10.5281/zenodo.7749875). 4780
10.5281/zenodo.7747236). 4782
10.5281/zenodo.7742587). 4784
(doi: 10.5281/zenodo.7738635). 4786
10.5281/zenodo.7734719). 4788
10.5281/zenodo.7730484). 4790
(doi: 10.5281/zenodo.7730469). 4792
10.5281/zenodo.7722865). 4794
odo.7713563). 4796
odo.7709116). 4798
10.5281/zenodo.7706415). 4800
(doi: 10.5281/zenodo.7706063). 4802
(doi: 10.5281/zenodo.7701906). 4804
odo.7700205). 4806
10.5281/zenodo.7694876). 4808

10.5281/zenodo.7679410). 4810
10.5281/zenodo.7675982). 4812
10.5281/zenodo.7672388). 4814
odo.7668648). 4816
10.5281/zenodo.7662810). 4818
10.5281/zenodo.7659162). 4820
odo.7653233). 4822
odo.7653204). 4824
odo.7653142). 4826
odo.7653117). 4828
odo.7653089). 4830
odo.7651687). 4832
odo.7651619). 4834
odo.7651439). 4836
odo.7650729). 4838
odo.7647868). 4840
odo.7647017). 4842
odo.7644894). 4844

odo.7641880). 4846
odo.7632923). 4848
odo.7623459). 4850
10.5281/zenodo.7606416). 4852
10.5281/zenodo.7606416). 4854
odo.7606404). 4856
10.5281/zenodo.7580018). 4858
odo.7580018). 4860
odo.7580018). 4862
odo.7579929). 4864
10.5281/zenodo.7563170). 4866
odo.7563164). 4868
odo.7563160). 4870
odo.7563160). 4872
10.5281/zenodo.7563160). 4874
10.5281/zenodo.7557063). 4876
10.5281/zenodo.7557009). 4878
10.5281/zenodo.7539484). 4880

10.5281/zenodo.7523390). 4882
10.5281/zenodo.7523390). 4884
10.5281/zenodo.7523390). 4886
odo.7574952). 4888
10.5281/zenodo.7574992). 4890
odo.7523357). 4892
10.5281/zenodo.7523357). 4894
10.5281/zenodo.7504782). 4896
10.5281/zenodo.7504782). 4898
10.5281/zenodo.7504782). 4900
10.5281/zenodo.7499395). 4902
odo.7499395). 4904
10.5281/zenodo.7499395). 4906
10.5281/zenodo.7497450). 4908
10.5281/zenodo.7497450). 4910
10.5281/zenodo.7494862). 4912
odo.7494862). 4914
10.5281/zenodo.7494862). 4916

10.5281/zenodo.7493845). 4918
10.5281/zenodo.7493845). 4920
10.5281/zenodo.7493845). 4922
odo.7539484). 4924
odo.7523390). 4926
odo.7523357). 4928
odo.7504782). 4930
odo.7499395). 4932
odo.7497450). 4934
odo.7494862). 4936
odo.7493845). 4938
odo.7480110). 4940
odo.7378758). 4942
odo.6320305). 4944
odo.6677173). 4946

CHAPTER 24 4947
Cancer In Neutrosophic 4948
SuperHyperGraph 4949
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 4950
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 4951
disease is considered and as the consequences of the model, some parameters are used. The cells 4952
are under attack of this disease but the moves of the cancer in the special region are the matter 4953
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 4954
treatments for this Neutrosophic disease. 4955
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 4956
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 4957
term Neutrosophic function. 4958
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 4959
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 4960
move from the cancer is identified by this research. Sometimes the move of the cancer 4961
about the moves and the effects of the cancer on that region; this event leads us to 4963
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 4964
perception on what’s happened and what’s done. 4965
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 4966
known and they’ve got the names, and some general Neutrosophic models. The moves 4967
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 4968
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 4969
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 4970
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 4971
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 4972
Models. 4973
Some cells have been faced with some attacks from the situation which is caused by the 4974
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 4975
which in that, the cells could be labelled as some groups and some groups or individuals have 4976
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 4977
the embedded situations, the individuals of cells and the groups of cells could be considered 4978
241
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 4979
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 4980
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 4981
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 4982
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 4983
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 4984
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 4985
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 4986
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 4987
imprecise data, and uncertain analysis. The latter model could be considered on the previous 4988
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 4989
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 4990
out what’s going on this phenomenon. The special case of this disease is considered and as the 4991
consequences of the model, some parameters are used. The cells are under attack of this disease 4992
but the moves of the cancer in the special region are the matter of mind. The recognition of 4993
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 4994
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 4995
both bases are the background of this research. Sometimes the cancer has been happened on the 4996
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 4997
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 4998
in the forms of alliances’ styles with the formation of the design and the architecture are 4999
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5000
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5001
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5002
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5003
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5004
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5005
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5006
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5007
and what’s done. There are some specific models, which are well-known and they’ve got the 5008
names, and some general models. The moves and the traces of the cancer on the complex tracks 5009
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5010
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5011
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5012
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5013
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5014
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5015
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5016
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5017
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5018
Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5019
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5020
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5021
based on the fixed groups of cells or the fixed groups of group of cells? 5022
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5023

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5027
Then the research has taken more motivations to define SuperHyperClasses and to find some 5028
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5029
some instances and examples to make clarifications about the framework of this research. The 5030
general results and some results about some connections are some avenues to make key point of 5031
this research, “Cancer’s Recognition”, more understandable and more clear. 5032
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5033
research on the modeling of the regions where are under the attacks of the cancer to 5034
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5035
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5036
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5037
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5038

instances and literature reviews have taken the whole way through. In this scientific research, 5039
the literature reviews have fulfilled the lines containing the notions and the results. The 5040
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5041
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5043
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5044
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5045
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5046
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5047
to figure out the background for the SuperHyperNotions. 5048

CHAPTER 25 5049
Neutrosophic Hamiltonian-Cycle-Cut 5050
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5051
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5052
2023, (doi: 10.13140/RG.2.2.34953.52320). 5053

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5054
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5055
(doi: 10.13140/RG.2.2.33275.80161). 5056
10.13140/RG.2.2.11050.90569). 5059
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5060
10.13140/RG.2.2.17761.79206). 5062
10.13140/RG.2.2.19911.37285). 5065
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5066
10.13140/RG.2.2.23266.81602). 5068
10.13140/RG.2.2.19360.87048). 5071
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5072
10.13140/RG.2.2.32363.21286). 5074
10.13140/RG.2.2.11758.69441). 5077
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5078
10.13140/RG.2.2.31891.35367). 5080
10.13140/RG.2.2.21510.45125). 5083
245
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5084
10.13140/RG.2.2.13121.84321). 5086

CHAPTER 26 5087
New Ideas In Recognition of Cancer And 5088
Neutrosophic SuperHyperGraph By 5089
Hamiltonian-Cycle-Cut As Hyper Hamper 5090
On Super Hammy 5091
247
CHAPTER 27 5092
ABSTRACT 5093
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5094

Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cycle- 5095
Cut pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 5096
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperHamiltonian- 5097
Cycle-Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut 5098
criteria holds 5099
∀Ea ∈ C : C is
Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut if the following expression is called 5100

Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut criteria holds 5101
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5102

SuperHyperHamiltonian-Cycle-Cut if the following expression is called Neutrosophic v- 5103
SuperHyperHamiltonian-Cycle-Cut criteria holds 5104
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut if the following expression is called 5105

Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut criteria holds 5106
∀Va ∈ C : C is
249
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5107

SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian- 5108
Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut, 5109
Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and 5110
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut. ((Neutrosophic) SuperHyperHamiltonian- 5111
Cycle-Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5112
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is 5113

called an Extreme SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e- 5114
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5117
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 5118

Cycle-Cut; a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic e- 5121
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5125

SuperHyperHamiltonian-Cycle-Cut; an Extreme SuperHyperHamiltonian-Cycle-Cut SuperHy- 5128
perPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic 5129
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme Super- 5131

HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5132
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5133
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5134
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5135
form the Extreme SuperHyperHamiltonian-Cycle-Cut; and the Extreme power is corresponded 5136
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyper- 5137

Polynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic 5138
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutrosophic SuperHy- 5140
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5141
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5142
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 5143
ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5144
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; and the Neutrosophic 5145
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian- 5146

Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for an Extreme SuperHyper- 5149
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5150
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 5151
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5152

the Extreme SuperHyperHamiltonian-Cycle-Cut; a Neutrosophic V-SuperHyperHamiltonian- 5153

re-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, 5155
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut and C(N SHG) for a Neutrosophic 5156
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 5157
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5158
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyper- 5159

Vertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; an Extreme 5160
V-SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic e- 5161
Cycle-Cut and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5164
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 5165
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5166
Cycle-Cut; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 5169
SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if it’s either of Neutrosophic e- 5170

Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5174
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 5175
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5176
the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; and the Neutrosophic power is corres- 5178
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 5179
for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cycle-Cut and Neutrosophic 5180
SuperHyperHamiltonian-Cycle-Cut. Two different types of SuperHyperDefinitions are debut 5181
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5182
Recognition” are the under research to figure out the challenges make sense about ongoing and 5189
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5194
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5195
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5196
research. It’s also officially collected in the form of some questions and some problems. Assume 5197
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cycle-Cut 5198

is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5199
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5202
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Cut is 5203
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5204
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5208
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5209
SuperHyperHamiltonian-Cycle-Cut . Since there’s more ways to get type-results to make 5210
a SuperHyperHamiltonian-Cycle-Cut more understandable. For the sake of having Neut- 5211

rosophic SuperHyperHamiltonian-Cycle-Cut, there’s a need to “redefine” the notion of a 5212
“SuperHyperHamiltonian-Cycle-Cut ”. The SuperHyperVertices and the SuperHyperEdges are 5213
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 5214
the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cycle-Cut . 5215
It’s redefined a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if the mentioned Table holds, 5216
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5217
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5218
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5219
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5220
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 5221
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5222
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5223
based on a SuperHyperHamiltonian-Cycle-Cut . It’s the main. It’ll be disciplinary to have 5224
have all SuperHyperHamiltonian-Cycle-Cut until the SuperHyperHamiltonian-Cycle-Cut, 5226
then it’s officially called a “SuperHyperHamiltonian-Cycle-Cut” but otherwise, it isn’t a 5227
SuperHyperHamiltonian-Cycle-Cut . There are some instances about the clarifications for the 5228
main definition titled a “SuperHyperHamiltonian-Cycle-Cut ”. These two examples get more 5229
scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHy- 5230
perClass based on a SuperHyperHamiltonian-Cycle-Cut . For the sake of having a Neutrosophic 5231
SuperHyperHamiltonian-Cycle-Cut, there’s a need to “redefine” the notion of a “Neutrosophic 5232
SuperHyperHamiltonian-Cycle-Cut” and a “Neutrosophic SuperHyperHamiltonian-Cycle-Cut ”. 5233
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 5234
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5235
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 5236
the intended Table holds. And a SuperHyperHamiltonian-Cycle-Cut are redefined to a “Neut- 5237
rosophic SuperHyperHamiltonian-Cycle-Cut” if the intended Table holds. It’s useful to define 5238
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 5239
type-results to make a Neutrosophic SuperHyperHamiltonian-Cycle-Cut more understandable. 5240

Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses 5241
if the intended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Cut, 5242
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 5243
are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Cut”, 5244

“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Super- 5245

HyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 5246
SuperHyperGraph has a “Neutrosophic SuperHyperHamiltonian-Cycle-Cut” where it’s the 5247
strongest [the maximum Neutrosophic value from all the SuperHyperHamiltonian-Cycle-Cut 5248
amid the maximum value amid all SuperHyperVertices from a SuperHyperHamiltonian- 5249
Cycle-Cut .] SuperHyperHamiltonian-Cycle-Cut . A graph is a SuperHyperUniform if it’s a 5250
SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume 5251
a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Su- 5252
perHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5253
with two exceptions; it’s SuperHyperHamiltonian-Cycle-Cut if it’s only one SuperVertex as 5254
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5255
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5256
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5257
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5258
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5259
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5260
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5261
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5262
the specific designs and the specific architectures. The SuperHyperModel is officially called 5263
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5264
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 5265
and the common and intended properties between “specific” cells and “specific group” of 5266
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 5267
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 5268
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 5269
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 5270
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 5271
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 5272
long cycle of the move from the cancer is identified by this research. Sometimes the move of 5273
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 5274
neutrality about the moves and the effects of the cancer on that region; this event leads us 5275
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 5278
moves and the traces of the cancer on the complex tracks and between complicated groups of 5279
cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 5280

The aim is to find either the longest SuperHyperHamiltonian-Cycle-Cut or the strongest 5282
SuperHyperHamiltonian-Cycle-Cut in those Neutrosophic SuperHyperModels. For the 5283
longest SuperHyperHamiltonian-Cycle-Cut, called SuperHyperHamiltonian-Cycle-Cut, and the 5284
strongest SuperHyperHamiltonian-Cycle-Cut, called Neutrosophic SuperHyperHamiltonian- 5285
Cycle-Cut, some general results are introduced. Beyond that in SuperHyperStar, all possible 5286
SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to 5287
have at least three SuperHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Cut. 5288
There isn’t any formation of any SuperHyperHamiltonian-Cycle-Cut but literarily, it’s the 5289
deformation of any SuperHyperHamiltonian-Cycle-Cut. It, literarily, deforms and it doesn’t 5290

form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cycle-Cut theory, 5291

SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5292
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Cut, Cancer’s 5293


CHAPTER 28 5296
Applied Notions Under The Scrutiny Of 5297
The Motivation Of This Scientific 5298
Research 5299
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5300
try to bring the motivations in the narrative ways. Some cells have been faced with some 5301
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5302
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5303
as some groups and some groups or individuals have excessive labels which all are raised from 5304
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5305
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5306
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5307
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5308
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5309
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5310
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5311
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5312
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5313
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5314
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5315
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5316
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5317
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5318
case of this disease is considered and as the consequences of the model, some parameters are used. 5319
The cells are under attack of this disease but the moves of the cancer in the special region are the 5320
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5321
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5322
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5323
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5325
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5326
architecture are formally called “ SuperHyperHamiltonian-Cycle-Cut” in the themes of jargons 5327
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5328
255
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5329
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5330
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5331
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5332
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5333
well-known and they’ve got the names, and some general models. The moves and the traces of 5336
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5337
by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian-Cycle-Cut, SuperHyperStar, 5338
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5339
optimal SuperHyperHamiltonian-Cycle-Cut or the Neutrosophic SuperHyperHamiltonian-Cycle- 5340
Cut in those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that 5341
in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5342
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 5343
a SuperHyperHamiltonian-Cycle-Cut. There isn’t any formation of any SuperHyperHamiltonian- 5344
Cycle-Cut but literarily, it’s the deformation of any SuperHyperHamiltonian-Cycle-Cut. It, 5345
literarily, deforms and it doesn’t form. 5346
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to 5347
find the “ amount of SuperHyperHamiltonian-Cycle-Cut” of either individual of cells or the 5348

groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 5349
SuperHyperHamiltonian-Cycle-Cut” based on the fixed groups of cells or the fixed groups of 5350
group of cells? 5351
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5352
these messy and dense SuperHyperModels where embedded notions are illustrated? 5353
Thus it motivates us to define different types of “ SuperHyperHamiltonian-Cycle-Cut” and 5355

“Neutrosophic SuperHyperHamiltonian-Cycle-Cut” on “SuperHyperGraph” and “Neutrosophic 5356
SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5357
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5358
motivates us to get some instances and examples to make clarifications about the framework of 5359
this research. The general results and some results about some connections are some avenues to 5360
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5361
The framework of this research is as follows. In the beginning, I introduce basic definitions 5362
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5363
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in- 5364
depth-discussed. The elementary concepts are clarified and illustrated completely and 5365
sometimes review literature are applied to make sense about what’s going to figure out 5366
about the upcoming sections. The main definitions and their clarifications alongside 5367
some results about new notions, SuperHyperHamiltonian-Cycle-Cut and Neutrosophic 5368
SuperHyperHamiltonian-Cycle-Cut, are figured out in sections “ SuperHyperHamiltonian- 5369
Cycle-Cut” and “Neutrosophic SuperHyperHamiltonian-Cycle-Cut”. In the sense of tackling 5370
on getting results and in Hamiltonian-Cycle-Cut to make sense about continuing the research, 5371
the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5372
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5373

done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5374
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5375
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5376
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5377
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5378
and as concluding and closing section of theoretical research are contained in the section 5379
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 5380
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 5381
Results”, “ SuperHyperHamiltonian-Cycle-Cut”, “Neutrosophic SuperHyperHamiltonian-Cycle- 5382
Cut”, “Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. 5383
There are curious questions about what’s done about the SuperHyperNotions to make sense 5384
about excellency of this research and going to figure out the word “best” as the description 5385
and adjective for this research as presented in section, “ SuperHyperHamiltonian-Cycle-Cut”. 5386

The keyword of this research debut in the section “Applications in Cancer’s Recognition” 5387
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 5388
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 5389
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 5390
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 5391
to make sense to figure out this research in featured style. The advantages and the limitations 5392
of this research alongside about what’s done in this research to make sense and to get sense 5393
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 5394

CHAPTER 29 5395
Neutrosophic Preliminaries Of This 5396
Scientific Research On the Redeemed 5397
Ways 5398
In this section, the basic material in this scientific research, is referred to [Single Valued 5399
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5400

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5401
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5402
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5403
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5404
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5405
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5406
their clarifications are addressed to Ref.[HG38]. 5407
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5408
the new ideas and their clarifications are elicited. 5409
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

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

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). 5411
where 5413
1, 2, . . . , n0 ); 5418
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5419
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5420

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5449
x, y, z, w ∈ [0, 1]: 5450
(i) 1 ⊗ x = x; 5451
(ii) x ⊗ y = y ⊗ x; 5452
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5453
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5454

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

where 5457

1, 2, . . . , n0 ); 5462
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5463
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5464
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5465
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5466
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5478
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5479
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5480
SuperEdge; 5486
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5489
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5490
makes the patterns and regularities. 5491
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5492
of elements of SuperHyperEdges are the same. 5493

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5494
makes to have SuperHyperUniform more understandable. 5495
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5496
Classes as follows. 5497
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5498
two given SuperHyperEdges with two exceptions; 5499
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5500
SuperHyperEdges; 5501
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5502
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5503
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5504
in common; 5505
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5506
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5507
SuperHyperEdge in common; 5508
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5509
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5510
SuperVertex. 5511
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 5512
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5513
(i) Vi , Vi+1 ∈ Ei0 ; 5514
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5515
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5516
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5517
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5518
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5519
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5520
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5521
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5523
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5524
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5525
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5526
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5527
perPath . 5528
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 5529
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5530
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5531
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5532
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5533
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5534

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5547
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5548
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5549
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5550

Cycle-Cut). 5551
(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut if the following expression is 5555

called Neutrosophic e-SuperHyperHamiltonian-Cycle-Cut criteria holds 5556
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut if the following expression is 5557

called Neutrosophic re-SuperHyperHamiltonian-Cycle-Cut criteria holds 5558
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5559
(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut if the following expression is 5560
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Cut if the following expression is 5562
∀Va ∈ C : C is

(v) Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 5565

Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Cut). 5569

(i) an Extreme SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutrosophic 5572

e-SuperHyperHamiltonian-Cycle-Cut, Neutrosophic re-SuperHyperHamiltonian-Cycle- 5573
Cut, Neutrosophic v-SuperHyperHamiltonian-Cycle-Cut, and Neutrosophic rv- 5574

(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 5580

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Super- 5584
HyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality con- 5585

seNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 5586
that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; 5587
(iii) an Extreme SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if 5588

of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme car- 5594

dinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 5595
(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial 5598


Neutrosophic coefficient; 5608

(v) an Extreme V-SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 5609

of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5614

(vi) a Neutrosophic V-SuperHyperHamiltonian-Cycle-Cut if it’s either of Neutro- 5617


N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5621
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5622
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Cut; 5624
(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial if 5625


(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Cut SuperHyperPolynomial 5635


Neutrosophic coefficient. 5645
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Cut). 5646

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5647
(i) an δ−SuperHyperHamiltonian-Cycle-Cut is a Neutrosophic kind of Neutrosophic 5648
SuperHyperHamiltonian-Cycle-Cut such that either of the following expressions hold for 5649


136TBL3
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5650
|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 5651
(29.1), holds if S is an δ−SuperHyperDefensive; 5652
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Cut is a Neutrosophic kind 5653

of Neutrosophic SuperHyperHamiltonian-Cycle-Cut such that either of the following 5654
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5655
of s ∈ S : 5656
|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 5657
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5658

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5660
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 5661
there’s the usage of the position of labels to assign to the values. 5662
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5663
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5664
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5665
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5666
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5667

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5668
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Cut, SuperHyperStar, 5669
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5670
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5671
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5672
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5673
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 5674
Cycle-Cut. Since there’s more ways to get type-results to make a Neutrosophic 5675

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

136TBL4

136TBL1
SuperHyperHamiltonian-Cycle-Cut more Neutrosophicly understandable. 5676

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Cut”. The 5678
5681
136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Cycle-Cut. It’s redefined a Neutro- 5682
sophic SuperHyperHamiltonian-Cycle-Cut if the Table (29.3) holds. 5683

CHAPTER 30 5684
Neutrosophic 5685
SuperHyperHamiltonian-Cycle-Cut But 5686
Definition 30.0.1. (Neutrosophic event). 5689

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5690
is a probability Hamiltonian-Cycle-Cut. Any Neutrosophic k-subset of A of V is called 5691
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5692
Neutrosophic event. The following expression is called Neutrosophic probability of 5693
A. 5694
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5695
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5696
a probability Hamiltonian-Cycle-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5697
s-independent if the following expression is called Neutrosophic s-independent criteria 5698
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. 5699
The following expression is called Neutrosophic independent criteria 5700
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5701

is a probability Hamiltonian-Cycle-Cut. Any k-function Hamiltonian-Cycle-Cut like E is called 5703
Neutrosophic k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Cut like E is 5704
called Neutrosophic Variable. 5705
271
The notion of independent on Neutrosophic Variable is likewise. 5706
Definition 30.0.4. (Neutrosophic Expectation). 5707

is a probability Hamiltonian-Cycle-Cut. A Neutrosophic k-Variable E has a number is called 5709
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5710

criteria 5711
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5712

is a probability Hamiltonian-Cycle-Cut. A Neutrosophic number is called Neutrosophic 5714
Crossing if the following expression is called Neutrosophic Crossing criteria 5715
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). 5716
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let m and n propose special 5717

Hamiltonian-Cycle-Cut. Then with m ≥ 4n, 5718
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 Hamiltonian-Cycle-Cut p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 5719
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5720
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5721
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let P be a SuperHyperSet of 5722
n points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 5723
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5724

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5725

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 5733
Then k < 5n4/3 . 5734
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5735
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Draw a SuperHyperUnit SuperHyperCircle 5736
around each SuperHyperPoint of P. Let ni be the P Neutrosophic number of theseP SuperHyper- 5737
Circles passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . 5738
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 5739
whose SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints 5740
on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5741
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 5742

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5743
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5744
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5745
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5746
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5747
4/3 4/3
k < 4n + n < 5n . 5748
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5749
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let X be a nonnegative 5750
Neutrosophic Variable and t a positive real number. Then 5751
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. 5752

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5753
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let Xn be a nonnegative integer- 5754
valued variable in a probability Hamiltonian-Cycle-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 5755
n → ∞, then P (Xn = 0) → 1 as n → ∞. 5756
Proof. 5757
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. A special SuperHyperGraph in 5759
Gn,p almost surely has stability number at most d2p−1 log ne. 5760
S = (V, E) is a probability Hamiltonian-Cycle-Cut. A special SuperHyperGraph in Gn,p is 5762
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5763
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5764
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5765
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5766
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5767
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5768
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 5769
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5770

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: 5771
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5772
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 5773
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5774
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5775
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5776
Definition 30.0.12. (Neutrosophic Variance). 5777
is a probability Hamiltonian-Cycle-Cut. A Neutrosophic k-Variable E has a number is 5779
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 5780
criteria 5781
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let X be a Neutrosophic Variable 5783
and let t be a positive real number. Then 5784
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let X be a Neutrosophic Variable and let t 5786
be a positive real number. Then 5787
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5788
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let Xn be a Neutrosophic Variable 5790

in a probability Hamiltonian-Cycle-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5791
then 5792
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cycle-Cut. Set X := Xn and t := |Ex(Xn )| in 5794
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5795
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5796
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5798
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 5799
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5800
S = (V, E) is a probability Hamiltonian-Cycle-Cut. As in the proof of related Theorem, the 5802
result is straightforward. 5803
Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let G ∈ Gn,1/2 and let f and k ∗ 5805
be as defined in previous Theorem. Then either: 5806
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5807
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5808

Definition 30.0.17. (Neutrosophic Threshold). 5811

is a probability Hamiltonian-Cycle-Cut. Let P be a monotone property of SuperHyperGraphs 5813
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5814
for P is a function f (n) such that: 5815
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5816
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5817
Definition 30.0.18. (Neutrosophic Balanced). 5818
is a probability Hamiltonian-Cycle-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. 5820
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 5821
SubSuperHyperGraph is called Neutrosophic Balanced. 5822
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5823

(V, E). Consider S = (V, E) is a probability Hamiltonian-Cycle-Cut. Let F be a nonempty 5824
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5825
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5826
SubSuperHyperGraph. 5827
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5830
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5831
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5832
SuperHyperHamiltonian-Cycle-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5833

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5834
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5835
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5836
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5837
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5838
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5839

Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 5840
C(N SHG)Neutrosophic Hamiltonian-Cycle-Cut

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

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

Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example (42.0.3) 136NSHG1

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5844
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5845
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5846
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5847
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5848
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian- 5849

Cycle-Cut. 5850

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



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


= {E4 , E5 }.
= 2z 5 .




= {V1 , V2 , V3 , {N }, {F }}.
= z 4 + z 3 + z 2 + 2z.
5859




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


= {Eii=110 , Ejj=2232 , E12 }.



= 22z 2 .
= {Vi }22
i=1 .
22
X
= z |Vi | .
i=1
5867


= {E15 , E13 , E16 , E14 , E17 , E12 }.
= 2z 5 + z 4 + 3z 2 .
= {Vi }11
i=1 .



11
X
= z |Vi | .
i=1
5871


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



= {Eii=110 , Ejj=2223 , E12 }.
= 13z 2 .
= {Vi }22
i=1 .
22
X
= z |Vi | .
i=1
5879

begineqnarray* C(NSHG)Neutrosophic Hamiltonian-Cycle-Cut 5883
= {E1 , E6 , E2 , E7 , E3 , E4 }. 5884
C(N SHG)Neutrosophic Hamiltonian-Cycle-Cut SuperHyperPolynomial 5885
= 2z 5 + z 4 + 3z 2 . 5886
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Cut 5887


= {Vi }11
i=1 . 5888
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Cut SuperHyperPolynomial 5889
P11
= i=1 z |Vi | . 5890
On the Figure (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5891


= {E1 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .
= {Vi }6i=1 .
6
X
= z |Vi | .
i=1
5894






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


= {E9 , E6 , E3 , E8 }.
= 2z 3 + 2z 2 .


= {Vi }6i=1 .
6
X
= z |Vi | .
i=1
5902


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




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




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


= {}.
= 0z 0 .



= {}.
= 0z 0 .
5918


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






= {Eii=112 }.
12
X
= z |Ei | .
i=1
= {Vi }ai=1 .
Xa
= z |Vi | .
i=1
5926


= {}.
= 0z 0 .


= {}.
= 0z 0 .
5930


= {E1 , E2 }.
= z 10 + z 2 .
= {VE2 }.
= z 5 + 2z 3 + 7z.
5934


Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG1


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


Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example (42.0.3) 95NHG2
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 5939
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian- 5940
Cycle-Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 5941
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 5942
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 5943
of them. 5944
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5945

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5946
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5947
Neutrosophic quasi-R-Hamiltonian-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to 5948
some of them but not all of them. In other words, there’s only an unique Neutrosophic 5949
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 5950

Neutrosophic quasi-R-Hamiltonian-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to 5951
some of them but not all of them. 5952
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-Hamiltonian-Cycle-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle- 5953
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 5954
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 5955

In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 5956
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 5957
Neutrosophic Hamiltonian-Cycle-Cut in some cases but the maximum number of the Neutrosophic 5958
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5959
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cycle- 5960
Cut. 5961
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-Cycle-Cut has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Hamiltonian-Cycle-Cut with the least Neutrosophic 5962

cardinality, the lower sharp Neutrosophic bound for cardinality. 5963
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 5964

(V, E). Then in the worst case, literally, 5965
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−CutSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Hamiltonian-Cycle-Cut. In other words, the least cardinality, the 5966

lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Cycle-Cut is 5967
the cardinality of 5968
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

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

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic

SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Hamiltonian-Cycle-Cut. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-Cycle-Cut is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-
types but the SuperHyperStable is only up in this quasi-R-Hamiltonian-Cycle-Cut. It’s the
contradiction to that fact on the generality. There are some counterexamples to deny this
statement. One of them comes from the setting of the graph titled path and cycle as the
counterexamples-classes or reversely direction star as the examples-classes, are well-known classes
in that setting and they could be considered as the examples-classes and counterexamples-classes
for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Hamiltonian-Cycle-Cut decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with
the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices
are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside

each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t

matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Hamiltonian-Cycle-Cut. Since at least two Neutrosophic SuperHyperVertices involve
to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
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 Neutrosophic
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
setting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at
least one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Hamiltonian-
Cycle-Cut has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a
Neutrosophic R-Hamiltonian-Cycle-Cut has the Neutrosophic cardinality at least a Neutrosophic
SuperHyperEdge. Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic
SuperHyperSet isn’t a Neutrosophic R-Hamiltonian-Cycle-Cut since either the Neutrosophic
SuperHyperGraph is an obvious Neutrosophic SuperHyperModel thus it never happens since
there’s no Neutrosophic usage of this Neutrosophic framework and even more there’s no
Neutrosophic connection inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its
consequences, there’s a Neutrosophic contradiction with the term “Neutrosophic R-Hamiltonian-
Cycle-Cut” since the maximum Neutrosophic cardinality never happens for this Neutrosophic
style of the Neutrosophic SuperHyperSet and beyond that there’s no Neutrosophic connection
inside as mentioned in first Neutrosophic case in the forms of drawback for this selected
Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Hamiltonian-Cycle-Cut is the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet

But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic

term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

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

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

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

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

z
and
is formalized with mathematical literatures on the Neutrosophic R-Hamiltonian-Cycle-Cut.

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

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

the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 5973
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 5974
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 5975
rosophic Hamiltonian-Cycle-Cut in some cases but the maximum number of the Neutrosophic 5976
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5977
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cycle- 5978
Cut. 5979
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 5980
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 5981
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 5982
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 5983
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 5984
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 5985
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 5986
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 5987
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 5988
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a Neut- 5989
rosophic quasi-R-Hamiltonian-Cycle-Cut where the Neutrosophic completion of the Neutrosophic 5990
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Hamiltonian-Cycle-Cut. 5991

The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 5992
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHyper- 5993
Cardinality. Thus the embedded setting is elected such that those SuperHyperSets have the 5994
maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOptimal. 5995
The less than two distinct types of Neutrosophic SuperHyperVertices are included in the min- 5996
imum Neutrosophic style of the embedded Neutrosophic R-Hamiltonian-Cycle-Cut. The interior 5997
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 5998
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 5999
common connections, more precise and more formal, the perfect unique connections inside the 6000
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the 6001
Neutrosophic R-Hamiltonian-Cycle-Cut. Thus Neutrosophic exterior SuperHyperVertices could 6002
be used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation 6003

with the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. 6004
In the embedded Neutrosophic Hamiltonian-Cycle-Cut, there’s the usage of exterior Neutro- 6005
sophic SuperHyperVertices since they’ve more connections inside more than outside. Thus the 6006
title “exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVer- 6007
tex has no connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic 6008
SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead 6009
on the optimal case implying the Neutrosophic R-Hamiltonian-Cycle-Cut. The Neutrosophic 6010
R-Hamiltonian-Cycle-Cut with the exclusion of the exclusion of all Neutrosophic SuperHy- 6011
perVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic 6012
R-Hamiltonian-Cycle-Cut with the inclusion of all Neutrosophic SuperHyperVertices in one 6013
Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Cycle-Cut. To sum 6014

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6015
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6016
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6017
quasi-R-Hamiltonian-Cycle-Cut minus all Neutrosophic SuperHypeNeighbor to some of them 6018

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6019
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6020
quasi-R-Hamiltonian-Cycle-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them 6021
but not all of them. 6022
The main definition of the Neutrosophic R-Hamiltonian-Cycle-Cut has two titles. a Neut- 6023
rosophic quasi-R-Hamiltonian-Cycle-Cut and its corresponded quasi-maximum Neutrosophic 6024
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6025
number, there’s a Neutrosophic quasi-R-Hamiltonian-Cycle-Cut with that quasi-maximum 6026
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6027
Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6028
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian- 6029
Cycle-Cuts for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6030
number. The essence of the Neutrosophic Hamiltonian-Cycle-Cut ends up but this essence 6031
starts up in the terms of the Neutrosophic quasi-R-Hamiltonian-Cycle-Cut, again and more in 6032
the operations of collecting all the Neutrosophic quasi-R-Hamiltonian-Cycle-Cuts acted on the 6033
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6034
number. This Neutrosophic number is 6035
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Cuts. Let 6036
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Cycle-Cut be a Neutro- 6037

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

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Hamiltonian-Cycle-Cut is re- 6040
formalized and redefined as follows. 6041
GNeutrosophic Hamiltonian-Cycle-Cut ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6042
definition for the Neutrosophic Hamiltonian-Cycle-Cut. 6043
GNeutrosophic Hamiltonian-Cycle-Cut =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
= zNeutrosophic Number |


= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic 6044
Hamiltonian-Cycle-Cut poses the upcoming expressions. 6045
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6046
= max zNeutrosophic Number

And then, 6047

To get more visions in the closer look-up, there’s an overall overlook. 6048


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


6050

6051

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic Supe- 6052
rHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHyperVer- 6053
tices such that any amount of its Neutrosophic SuperHyperVertices are incident to a Neutrosophic 6054
SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Hamiltonian-Cycle-Cut” 6055
but, precisely, it’s the generalization of “Neutrosophic Quasi-Hamiltonian-Cycle-Cut” since 6056
“Neutrosophic Quasi-Hamiltonian-Cycle-Cut” happens “Neutrosophic Hamiltonian-Cycle-Cut” 6057
in a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 6058
SuperHyperNeighborhood” may not happens “Neutrosophic Hamiltonian-Cycle-Cut” in a 6059
Neutrosophic SuperHyperGraph as initial framework and preliminarily background since 6060
there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To 6061
get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6062
Quasi-Hamiltonian-Cycle-Cut”, and “Neutrosophic Hamiltonian-Cycle-Cut” are up. 6063
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Cycle-Cut
6064
be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 6065

Hamiltonian-Cycle-Cut and the new terms are up. 6066

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


6068
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6069
And with go back to initial structure, 6070


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

6072


6073

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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Hamiltonian-Cycle-Cut C(ESHG) for an Neutrosophic SuperHy-

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

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

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Cut. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Hamiltonian-Cycle-Cut,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic

Hamiltonian-Cycle-Cut, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6074
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6075
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6076
type-SuperHyperSet called the 6077
“Neutrosophic R-Hamiltonian-Cycle-Cut” 6078

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6079
Neutrosophic R-Hamiltonian-Cycle-Cut, 6080
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Hamiltonian-Cycle-Cut. In other words, the least cardinality, the lower

sharp bound for the cardinality, of a Neutrosophic R-Hamiltonian-Cycle-Cut is the cardinality
of
6081
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior 6082
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cycle-Cut if 6083
for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 6084
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 6085
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6086
them. 6087
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6088
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6089
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6090
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6091
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6092
Consider there’s a Neutrosophic R-Hamiltonian-Cycle-Cut with the least cardinality, the lower 6093
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6094
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6095
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6096
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6097
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Cycle-Cut. Since it 6098
doesn’t have 6099
6100

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

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6102
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6103
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6104
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Hamiltonian- 6105
Cycle-Cut. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6106
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6107

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6108
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6109
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6110
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6111
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6112
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6113
Neutrosophic R-Hamiltonian-Cycle-Cut, VESHE is up. The obvious simple Neutrosophic type- 6114
SuperHyperSet of the Neutrosophic R-Hamiltonian-Cycle-Cut, VESHE , is a Neutrosophic Supe- 6115
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6116
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6117
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6118
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6119

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6120
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6121
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6122
R-Hamiltonian-Cycle-Cut only contains all interior Neutrosophic SuperHyperVertices and all 6123
exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6124
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6125
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6126
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6127
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6128
The SuperHyperNotion, namely, Hamiltonian-Cycle-Cut, is up. There’s neither empty SuperHy- 6129
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6130
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6131

the Neutrosophic Hamiltonian-Cycle-Cut. The Neutrosophic SuperHyperSet of Neutrosophic 6132
SuperHyperEdges[SuperHyperVertices], 6133
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−Cut

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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6135

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyper- 6136
Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6137
6138
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6140
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6141
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6142
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6143
non-obvious Neutrosophic Hamiltonian-Cycle-Cut is up. The obvious simple Neutrosophic 6144

type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Cut is a Neutrosophic Su- 6145
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6146
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6147

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6148
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6149
Hamiltonian-Cycle-Cut is up. To sum them up, the Neutrosophic SuperHyperSet of the 6150
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6151

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6152
Cycle-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6153

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Cycle-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6155

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6156
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6157
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Cut 6158
and it’s an Neutrosophic Hamiltonian-Cycle-Cut. Since it’s 6159

6160
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6162
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6163
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6164
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6165

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Thus the non-obvious Neutrosophic Hamiltonian-Cycle-Cut, 6166

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6167
Cycle-Cut, not: 6168

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

= 2z b 2 c
.
Is the Neutrosophic SuperHyperSet, not: 6169

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6170
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6171
Neutrosophic type-SuperHyperSet called the 6172
“Neutrosophic Hamiltonian-Cycle-Cut” 6173
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6174
Neutrosophic Hamiltonian-Cycle-Cut, 6175
is only and only 6176

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6177

CHAPTER 31 6178
The Neutrosophic Departures on The 6179
Theoretical Results Toward Theoretical 6180
Motivations 6181
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6182
Neutrosophic SuperHyperClasses. 6183
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6184

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6192
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6193
SuperHyperModel (31.1), is the SuperHyperHamiltonian-Cycle-Cut. 6194
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6195

= {}.
= 0z 0 .

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6203
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6204
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6205
6206
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6207

= {Ei }.
i=1|EN SHG |

|EN SHG |
X
= z |Ei | .
i=1

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

Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example (42.0.7) 136NSHG19a
|V
N SHG |
= {Vi }i=1 .
|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 6208
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6209
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6210


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

Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6215
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6216
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6217
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6218
the Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6219
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6220
Then 6221

= {Ei |P min |
}.
i=1 N SHG

min
|PN SHG |
X
= z |Ei | .
i=1


|V
N SHG |
= {Vi }i=1 .
|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 6222
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6223
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). 6224


Cut could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could 6230
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Neutrosophic Supe- 6232

rHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6233
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6234
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Cut in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6236
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6237
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6238

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6239
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6240
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6242
Then 6243

= {Ei |P min |
}.
i=1 N SHG

min
|PN SHG |
X
= z |Ei | .
i=1

|V
N SHG |
= {Vi }i=1 .
|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 6244
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6245
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Neutrosophic SuperHy- 6246

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


Cut could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could 6252
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6254
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6255
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6259
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6260
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6261
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6262
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Cycle- 6263

Cut. 6264
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6265
Then, 6266

= {Ei , Ei∗ , Ej∗ }.
i=1|EN SHG |

|EN SHG |+2
X
= z |Ei | .
i=1
|V
N SHG |
= {Vi }i=1 .


|VN SHG |
X
= z |Vi | .
i=1
Proof. Let 6267
P :
CEN T ER, E2∗
6268
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cycle-Cut taken from a connected Neutrosophic SuperHy- 6269

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

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Cut. Thus the 6273

notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 6274
Cut could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Cut proposes some 6275
longest SuperHyperHamiltonian-Cycle-Cut excerpt from some representatives. The latter is 6276
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6278
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6279
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6280
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6281
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6282

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6283
The Surveys of Mathematical Sets On 6284
The Results But As The Initial Motivation 6285
For the SuperHyperHamiltonian-Cycle-Cut, Neutrosophic SuperHyperHamiltonian-Cycle-Cut, 6286

and the Neutrosophic SuperHyperHamiltonian-Cycle-Cut, some general results are introduced. 6287
6288
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Cycle-Cut is 6289

“redefined” on the positions of the alphabets. 6290
Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Cycle-Cut. Then 6291
N eutrosophic SuperHyperHamiltonian − Cycle − Cut =

{theSuperHyperHamiltonian − Cycle − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cycle − Cut
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−Cycle−Cut. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6292
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6293
the neutrality, for i = 1, 2, 3, respectively. 6294
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6295
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Cycle-Cut and 6296
SuperHyperHamiltonian-Cycle-Cut coincide. 6297
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6298
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6299
SuperHyperHamiltonian-Cycle-Cut if and only if it’s a SuperHyperHamiltonian-Cycle-Cut. 6300
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6301
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6302
SuperHyperHamiltonian-Cycle-Cut if and only if it’s a longest SuperHyperHamiltonian-Cycle- 6303
Cut. 6304
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6305

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle-Cut is its 6306
325
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 6308

Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the 6309
same identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle-Cut 6310
is its SuperHyperHamiltonian-Cycle-Cut and reversely. 6311
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6312

SuperHyperHamiltonian-Cycle-Cut isn’t well-defined if and only if its SuperHyperHamiltonian- 6313
Cycle-Cut isn’t well-defined. 6314
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6315

its Neutrosophic SuperHyperHamiltonian-Cycle-Cut isn’t well-defined if and only if its 6316

Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then 6319
its Neutrosophic SuperHyperHamiltonian-Cycle-Cut isn’t well-defined if and only if its 6320
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6322

SuperHyperHamiltonian-Cycle-Cut is well-defined if and only if its SuperHyperHamiltonian- 6323
Cycle-Cut is well-defined. 6324
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6325
its Neutrosophic SuperHyperHamiltonian-Cycle-Cut is well-defined if and only if its 6326


Then its Neutrosophic SuperHyperHamiltonian-Cycle-Cut is well-defined if and only if its 6330
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6332
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6333
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6334
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6335
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6336
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6337
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 6338
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6339
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6342

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

independent SuperHyperSet is 6347
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6350
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6354

Graph which is a SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath. Then V is a maximal 6355
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6359
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6360
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6361
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6363

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6364
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6368
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6369
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6370
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6372

perGraph which is a SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath. Then the number 6373
of 6374

(i) : the SuperHyperHamiltonian-Cycle-Cut; 6375
(ii) : the SuperHyperHamiltonian-Cycle-Cut; 6376
(iii) : the connected SuperHyperHamiltonian-Cycle-Cut; 6377
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 6378
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 6379
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Cut. 6380
coincide. 6382

Graph which is a SuperHyperWheel. Then the number of 6384
(i) : the dual SuperHyperHamiltonian-Cycle-Cut; 6385
(ii) : the dual SuperHyperHamiltonian-Cycle-Cut; 6386
(iii) : the dual connected SuperHyperHamiltonian-Cycle-Cut; 6387
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 6388
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut; 6389
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Cut. 6390
coincide. 6392
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6393

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6405
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6406
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6407
SuperHyperPart is a 6408
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6412
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6413
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 6414
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6416

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6435
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6436
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6437
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6438

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6446
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6447
of dual 6448
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6452

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6456
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6457

is SuperHyperHamiltonian-Cycle-Cut/SuperHyperPath/SuperHyperWheel. The number is 6458
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of 6459
a dual 6460
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6464
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut; 6465

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut. 6466

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


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

a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut, then ∀v ∈ V \ S, ∃x ∈ S such 6482
that 6483
(i) v ∈ Ns (x); 6484
(ii) vx ∈ E. 6485
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6486

a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Cut, then 6487
(i) S is SuperHyperHamiltonian-Cycle-Cut set; 6488
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6489
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6490
(i) Γ ≤ O; 6491
(ii) Γs ≤ On . 6492
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6493
connected. Then 6494
(i) Γ ≤ O − 1; 6495
(ii) Γs ≤ On − Σ3i=1 σi (x). 6496
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6497


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6501
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6502
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6504
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6505
Cut; 6506
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6507
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6508
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6509
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Cut. Then 6511
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6522
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6523
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6525
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Cut; 6526
(ii) Γ = 1; 6527
(iii) Γs = Σ3i=1 σi (c); 6528

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Cut. 6529
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6530
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6531
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6533
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6534
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6535
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6537
b n c+1
2
Cycle-Cut; 6539
(ii) Γ = b n2 c + 1; 6540

b n c+1 ; 6541
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian-
6542
Cycle-Cut. 6543
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6544
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian- 6545
Cycle-Cut; 6546
(ii) Γ = b n2 c; 6547

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

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

6553
Cycle-Cut for N SHF; 6554
(ii) Γ = m for N SHF : (V, E); 6555
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6556
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6557

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6559

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6560
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6561
SuperHyperHamiltonian-Cycle-Cut for N SHF; 6562
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6563

b n c+1 for N SHF : (V, E); 6564
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperHamiltonian- 6565
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6567
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6568
bnc
2
Cycle-Cut for N SHF : (V, E); 6570
(ii) Γ = b n2 c for N SHF : (V, E); 6571

bnc for N SHF : (V, E); 6572
S={vi }i=1
bnc
2
are only dual maximal SuperHyperHamiltonian-Cycle-Cut 6573
for N SHF : (V, E). 6574
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6577

SuperHyperHamiltonian-Cycle-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
6578
Cycle-Cut; 6579

SuperHyperHamiltonian-Cycle-Cut, then S is a dual s-SuperHyperDefensive 6581
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6585

SuperHyperHamiltonian-Cycle-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
6586
Cycle-Cut; 6587

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

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6601
(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6605

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


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

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

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


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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 6633
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6635

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

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


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

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

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


CHAPTER 33 6651
Neutrosophic Applications in Cancer’s 6652
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6654
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6655
disease is considered and as the consequences of the model, some parameters are used. The cells 6656
are under attack of this disease but the moves of the cancer in the special region are the matter 6657
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6658
treatments for this Neutrosophic disease. 6659
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6660
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6661
term Neutrosophic function. 6662
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6663
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6664
move from the cancer is identified by this research. Sometimes the move of the cancer 6665
about the moves and the effects of the cancer on that region; this event leads us to 6667
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6668
perception on what’s happened and what’s done. 6669
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6670
known and they’ve got the names, and some general Neutrosophic models. The 6671
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6672
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6673
/SuperHyperHamiltonian-Cycle-Cut, SuperHyperStar, SuperHyperBipartite, SuperHy- 6674
perMultipartite, SuperHyperWheel). The aim is to find either the Neutrosophic 6675

SuperHyperHamiltonian-Cycle-Cut or the Neutrosophic SuperHyperHamiltonian-Cycle- 6676
Cut in those Neutrosophic Neutrosophic SuperHyperModels. 6677
337
CHAPTER 34 6678
Case 1: The Initial Neutrosophic Steps 6679
Toward Neutrosophic 6680
SuperHyperBipartite as Neutrosophic 6681
SuperHyperModel 6682
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6683
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6684
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

339
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6685
perBipartite is obtained. 6686
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6687
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6688
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6689
(34.1), is the Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6690

CHAPTER 35 6691
Case 2: The Increasing Neutrosophic 6692
Steps Toward Neutrosophic 6693
SuperHyperMultipartite as 6694
Neutrosophic SuperHyperModel 6695
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6696
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6697
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6698
perMultipartite is obtained. 6699
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6700
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

341
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6702
Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6703

CHAPTER 36 6704
Wondering Open Problems But As The 6705
Directions To Forming The Motivations 6706
In what follows, some “problems” and some “questions” are proposed. 6707
The SuperHyperHamiltonian-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Cycle- 6708
Cut are defined on a real-world application, titled “Cancer’s Recognitions”. 6709
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6710
recognitions? 6711
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle- 6712

Cut and the Neutrosophic SuperHyperHamiltonian-Cycle-Cut? 6713
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6714
them? 6715
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian-6716
Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Cycle-Cut? 6717
Problem 36.0.5. The SuperHyperHamiltonian-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-

6718
Cycle-Cut do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6719
SuperHyperHamiltonian-Cycle-Cut, are there else? 6720
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6721
Numbers types-results? 6722
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6723
the multiple types of SuperHyperNotions? 6724
343
CHAPTER 37 6725
Conclusion and Closing Remarks 6726
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6727
research are illustrated. Some benefits and some advantages of this research are highlighted. 6728
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6729
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cycle- 6730
Cut. For that sake in the second definition, the main definition of the Neutrosophic SuperHyper- 6731
Graph is redefined on the position of the alphabets. Based on the new definition for the Neutro- 6732
sophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperHamiltonian- 6733
Cycle-Cut, finds the convenient background to implement some results based on that. Some 6734
SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this research 6735
on the modeling of the regions where are under the attacks of the cancer to recognize this 6736
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 6737
the SuperHyperNotion, SuperHyperHamiltonian-Cycle-Cut, the new SuperHyperClasses and 6738
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 6739
SuperHyperHamiltonian-Cycle-Cut and the Neutrosophic SuperHyperHamiltonian-Cycle-Cut. 6740

The clarifications, instances and literature reviews have taken the whole way through. In this 6741
research, the literature reviews have fulfilled the lines containing the notions and the results. 6742
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6743
and the architecture are formally called “ SuperHyperHamiltonian-Cycle-Cut” in the themes of 6748
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 6749
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 6750
for this research are, figured out, pointed out and spoken out. 6751
345
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cycle-Cut
3. Neutrosophic SuperHyperHamiltonian-Cycle-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6752
Neutrosophic SuperHyperDuality But As 6753
Super Forms 6755
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6756

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6760

Va ∈ Ei , Ej ; 6761
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6762

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6763
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6764

Vi , Vj ∈ Ea ; 6765
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6766

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6767
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6768

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6769
sophic rv-SuperHyperDuality. 6770
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6771

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6774

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6776
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6777
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6778
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6779
form the Extreme SuperHyperDuality; 6780
347
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6781

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6783
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6784
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6785
such that they form the Neutrosophic SuperHyperDuality; 6787
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6788
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6789

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6790
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6791
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6792
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6793
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6795
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6797

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6799
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6800
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6805
coefficient; 6806
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6807

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6809
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6810
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6811
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6812
form the Extreme SuperHyperDuality; 6813
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6814

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6815
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6816
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6817
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6818
such that they form the Neutrosophic SuperHyperDuality; 6820
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6821

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6822
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6823

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6825
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6828
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6830

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6832

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6838
coefficient. 6839
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6840
the mentioned Neutrosophic Figures in every Neutrosophic items. 6841

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6843
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6844
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6845
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6846
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6847
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6848
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6849
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 6853
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6854
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6855
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6856
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6857

every given Neutrosophic SuperHyperDuality. 6858




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6918
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 6920


the Neutrosophic SuperHyperDuality. 6929
Then 6931
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 6932
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6938
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 6941

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6942
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6951

(V, E). Then 6952

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 6953
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 6954


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 6958
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 6959
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), 6970
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 6971
Then, 6973
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 6974
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 6975


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 6980
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 6981
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 6987

CHAPTER 39 6988
Neutrosophic SuperHyperJoin But As 6989
Super Forms 6991
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 6992

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6996
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6998

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 6999
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7001

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7003

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7006

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7007
rv-SuperHyperJoin. 7008
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7009

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

361

Extreme SuperHyperJoin; 7018
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7019

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7021
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7022
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7023
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7024

form the Neutrosophic SuperHyperJoin; 7025
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7026

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7027
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7028
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7033
coefficient; 7034
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7035

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7036
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7037
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7038
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7039
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7040
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7041

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7042
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7043
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7044

Extreme SuperHyperJoin; 7050
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7051

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7053
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7054
form the Neutrosophic SuperHyperJoin; 7057

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7058

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7060

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7065
to its Extreme coefficient; 7066
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7067

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7069
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7070

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7071
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7072
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7075
coefficient. 7076
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7080

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7081

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7146

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7155
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 7157


the Neutrosophic SuperHyperJoin. 7166
Then 7168
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 7169
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 7175
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7177

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7188

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7190


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

Then, 7208

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

.
Proof. Let 7209
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7210


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7214
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7215
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7216
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7221

CHAPTER 40 7222
Neutrosophic SuperHyperPerfect But As 7223
Super Forms 7225
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7226

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

Va ∈ Ei , Ej ; 7231
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7232

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7238

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7239
rv-SuperHyperPerfect. 7240
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7241

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7246
375
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7251

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7253
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7254
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7255
form the Neutrosophic SuperHyperPerfect; 7257
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7258

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7259
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7260
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7263
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7267

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7269
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7275
coefficient; 7276
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7277

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7285
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7286
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7287
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7288
such that they form the Neutrosophic SuperHyperPerfect; 7290
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7291

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7293

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7296
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7300

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7302

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7308
coefficient. 7309

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7313

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7379
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 7381
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7399
Then 7401
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 7402
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 7406
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7407
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7408
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7411

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7422

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7445


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7448
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7449
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7450
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7451
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7457

CHAPTER 41 7458
Neutrosophic SuperHyperTotal But As 7459
Super Forms 7461
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7462

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7466

Va ∈ Ei , Ej ; 7467
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7468

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7469
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7470

Vi , Vj ∈ Ea ; 7471
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7472

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7474

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7475
rv-SuperHyperTotal. 7476
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7477

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7482
Extreme SuperHyperTotal; 7486
389
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7487

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7489
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7490
form the Neutrosophic SuperHyperTotal; 7493
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7494
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7495

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7496
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7501
coefficient; 7502
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7503
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7504

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7505
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7511
cient; 7512
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7513

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7515
Extreme SuperHyperTotal; 7519
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7520

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7522
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7523
form the Neutrosophic SuperHyperTotal; 7526
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7527

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7528
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7529


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7534
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7536

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7537
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7538

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7544
cient. 7545

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7549
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. 7564




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7615
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 7617
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. 7624
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 7626



the Neutrosophic SuperHyperTotal. 7635
Then 7637
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 7638
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7644
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7646
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7657

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7664
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. 7675
Then, 7677
∗
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 7678
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7679


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7683
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7684

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7685
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7691

CHAPTER 42 7692
Neutrosophic SuperHyperConnected But 7693
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7696

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7700
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7701
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7702

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7703
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7704
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7705

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7706
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7707

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7708
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7709
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7710
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7711
rosophic rv-SuperHyperConnected. 7712
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7713

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7716
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7717
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7718
403

that they form the Extreme SuperHyperConnected; 7722
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7723

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7724
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7725
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7726
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7727
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7728

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7729
nected; 7730
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7731

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7732
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7733
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7734
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7735
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7736

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7738
Extreme power is corresponded to its Extreme coefficient; 7739
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7740

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7741
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7742
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7743
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7744
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7745

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7748
its Neutrosophic coefficient; 7749
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7750

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7753
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7754

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7755
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7756
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7757

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7760
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7761
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7762

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7763
nected; 7764
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7765

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7768
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7769
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7770
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7771

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7772
and the Extreme power is corresponded to its Extreme coefficient; 7773
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7774

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7777
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7778

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7779
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7782
its Neutrosophic coefficient. 7783
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7786
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7787
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7789
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7790
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7791
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7792
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7793
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. 7801


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 7845
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. 7852
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 7854
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. 7861
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 7863



the Neutrosophic SuperHyperConnected. 7872
Then 7874
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 7875
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 7880
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7881
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7884

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7895
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 7896
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7897


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7901
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7902
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7903
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. 7914
Then, 7916
∗
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 7917
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 7918


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7921
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7922
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7923
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7924
some representatives. The latter is straightforward. 7925
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7930

CHAPTER 43 7931
Background 7932
417











in Scribd. 8090



Bibliography 8122
10.33140/JMTCM.01.03.09) 8129
423
10.20944/preprints202301.0282.v1). 8157
10.20944/preprints202301.0267.v1). 8160

(doi: 10.20944/preprints202301.0265.v1). 8165
prints202301.0262.v1). 8169
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8175
prints202301.0105.v1). 8178
Preprints 2023, 2023010044 8184
10.20944/preprints202301.0043.v1). 8187

(doi: 10.20944/preprints202212.0549.v1). 8196
(doi: 10.20944/preprints202212.0500.v1). 8203
10.5281/zenodo.7791952). 8212
(doi: 10.5281/zenodo.7791982). 8215

10.5281/zenodo.7790026). 8218
2023, (doi: 10.5281/zenodo.7790052). 8221
2023, (doi: 10.5281/zenodo.7787066). 8224

10.5281/zenodo.7781476). 8230
10.5281/zenodo.7783082). 8233
10.5281/zenodo.7777857). 8236
10.5281/zenodo.7779286). 8239
(doi: 10.5281/zenodo.7771831). 8242
2023, (doi: 10.5281/zenodo.7772468). 8245
10.13140/RG.2.2.20913.25446). 8248
10.5281/zenodo.7764916). 8251
10.13140/RG.2.2.11770.98247). 8254
10.13140/RG.2.2.12400.12808). 8257
2023, (doi: 10.13140/RG.2.2.22545.10089). 8260
10.13140/RG.2.2.11377.76644). 8266

10.13140/RG.2.2.23750.96329). 8269
10.13140/RG.2.2.31366.24641). 8272
10.13140/RG.2.2.34721.68960). 8275
10.13140/RG.2.2.24288.35842). 8284
10.13140/RG.2.2.32467.25124). 8287
10.13140/RG.2.2.31025.45925). 8290
10.13140/RG.2.2.17184.25602). 8293
10.13140/RG.2.2.23423.28327). 8296
10.13140/RG.2.2.28456.44805). 8299
10.13140/RG.2.2.23525.68320). 8302
10.13140/RG.2.2.20170.24000). 8305

10.13140/RG.2.2.36475.59683). 8308
10.13140/RG.2.2.29764.71046). 8311
2023, (doi: 10.13140/RG.2.2.18780.87683). 8314
10.13140/RG.2.2.26134.01603). 8320
10.13140/RG.2.2.27392.30721). 8323
10.13140/RG.2.2.33028.40321). 8326
10.13140/RG.2.2.21389.20966). 8329
10.13140/RG.2.2.16356.04489). 8332
10.13140/RG.2.2.21756.21129). 8335
10.13140/RG.2.2.30983.68009). 8338
10.13140/RG.2.2.28552.29445). 8341

10.13140/RG.2.2.35105.89447). 8347
(doi: 10.13140/RG.2.2.30072.72960). 8350
10.13140/RG.2.2.31147.52003). 8353
10.13140/RG.2.2.32825.24163). 8356
10.13140/RG.2.2.13059.58401). 8359
10.13140/RG.2.2.11172.14720). 8362
2023, (doi: 10.13140/RG.2.2.22011.80165). 8365
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8368
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8374
2023, (doi: 10.13140/RG.2.2.19944.14086). 8377
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8380
(doi: 10.13140/RG.2.2.33103.76968). 8383

2023, (doi: 10.13140/RG.2.2.23037.44003). 8386
(doi: 10.13140/RG.2.2.35646.56641). 8389
(doi: 10.13140/RG.2.2.18030.48967). 8392
(doi: 10.13140/RG.2.2.13973.81121). 8395
2023, (doi: 10.13140/RG.2.2.34106.47047). 8398
2023, (doi: 10.13140/RG.2.2.31956.88961). 8404
2023, (doi: 10.13140/RG.2.2.15179.67361). 8407
10.13140/RG.2.2.21510.45125). 8410
2023, (doi: 10.13140/RG.2.2.13121.84321). 8413
10.13140/RG.2.2.11758.69441). 8416
2023, (doi: 10.13140/RG.2.2.31891.35367). 8419
10.13140/RG.2.2.19360.87048). 8422

2023, (doi: 10.13140/RG.2.2.32363.21286). 8425
(doi: 10.13140/RG.2.2.23266.81602). 8428
10.13140/RG.2.2.19911.37285). 8431
10.13140/RG.2.2.11050.90569). 8434
(doi: 10.13140/RG.2.2.30182.50241). 8446


2023, (doi: 10.13140/RG.2.2.17252.24968). 8479
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 8488

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8491



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


10.20944/preprints202301.0282.v1). 8512
10.20944/preprints202301.0267.v1).). 8515

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8520
prints202301.0262.v1). 8524

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

10.13140/RG.2.2.35061.65767). 8533
10.13140/RG.2.2.18494.15680). 8537

10.13140/RG.2.2.32530.73922). 8541
10.13140/RG.2.2.15897.70243). 8545
10.13140/RG.2.2.32530.73922). 8549
prints202301.0105.v1). 8552
10.13140/RG.2.2.23172.19849). 8559


10.13140/RG.2.2.17385.36968). 8569

(doi: 10.20944/preprints202301.0043.v1). 8575

2023, (doi: 10.13140/RG.2.2.28945.92007). 8578

10.13140/RG.2.2.35774.77123). 8584
10.13140/RG.2.2.29430.88642). 8590

(doi: 10.20944/preprints202212.0549.v1). 8596
10.13140/RG.2.2.19380.94084). 8599

(doi: 10.20944/preprints202212.0500.v1). 8610
10.13140/RG.2.2.20993.12640). 8613




10.13140/RG.2.2.29173.86244). 8628
(doi: 10.5281/zenodo.7792307). 8633
(doi: 10.5281/zenodo.7790728). 8635
2023 (doi: 10.5281/zenodo.7787712). 8637
10.5281/zenodo.7783791). 8639
10.5281/zenodo.7780123). 8641
(doi: 10.5281/zenodo.7773119). 8643
odo.7637762). 8645
10.5281/zenodo.7766174). 8647
10.5281/zenodo.7762232). 8649

(doi: 10.5281/zenodo.7758601). 8651
10.5281/zenodo.7754661). 8653
10.5281/zenodo.7750995) . 8655
(doi: 10.5281/zenodo.7749875). 8657
10.5281/zenodo.7747236). 8659
10.5281/zenodo.7742587). 8661
(doi: 10.5281/zenodo.7738635). 8663
10.5281/zenodo.7734719). 8665
10.5281/zenodo.7730484). 8667
(doi: 10.5281/zenodo.7730469). 8669
10.5281/zenodo.7722865). 8671
odo.7713563). 8673
odo.7709116). 8675
10.5281/zenodo.7706415). 8677
(doi: 10.5281/zenodo.7706063). 8679
(doi: 10.5281/zenodo.7701906). 8681
odo.7700205). 8683
10.5281/zenodo.7694876). 8685

10.5281/zenodo.7679410). 8687
10.5281/zenodo.7675982). 8689
10.5281/zenodo.7672388). 8691
odo.7668648). 8693
10.5281/zenodo.7662810). 8695
10.5281/zenodo.7659162). 8697
odo.7653233). 8699
odo.7653204). 8701
odo.7653142). 8703
odo.7653117). 8705
odo.7653089). 8707
odo.7651687). 8709
odo.7651619). 8711
odo.7651439). 8713
odo.7650729). 8715
odo.7647868). 8717
odo.7647017). 8719
odo.7644894). 8721

odo.7641880). 8723
odo.7632923). 8725
odo.7623459). 8727
10.5281/zenodo.7606416). 8729
10.5281/zenodo.7606416). 8731
odo.7606404). 8733
10.5281/zenodo.7580018). 8735
odo.7580018). 8737
odo.7580018). 8739
odo.7579929). 8741
10.5281/zenodo.7563170). 8743
odo.7563164). 8745
odo.7563160). 8747
odo.7563160). 8749
10.5281/zenodo.7563160). 8751
10.5281/zenodo.7557063). 8753
10.5281/zenodo.7557009). 8755
10.5281/zenodo.7539484). 8757

10.5281/zenodo.7523390). 8759
10.5281/zenodo.7523390). 8761
10.5281/zenodo.7523390). 8763
odo.7574952). 8765
10.5281/zenodo.7574992). 8767
odo.7523357). 8769
10.5281/zenodo.7523357). 8771
10.5281/zenodo.7504782). 8773
10.5281/zenodo.7504782). 8775
10.5281/zenodo.7504782). 8777
10.5281/zenodo.7499395). 8779
odo.7499395). 8781
10.5281/zenodo.7499395). 8783
10.5281/zenodo.7497450). 8785
10.5281/zenodo.7497450). 8787
10.5281/zenodo.7494862). 8789
odo.7494862). 8791
10.5281/zenodo.7494862). 8793

10.5281/zenodo.7493845). 8795
10.5281/zenodo.7493845). 8797
10.5281/zenodo.7493845). 8799
odo.7539484). 8801
odo.7523390). 8803
odo.7523357). 8805
odo.7504782). 8807
odo.7499395). 8809
odo.7497450). 8811
odo.7494862). 8813
odo.7493845). 8815
odo.7480110). 8817
odo.7378758). 8819
odo.6320305). 8821
odo.6677173). 8823

CHAPTER 44 8824
Books’ Contributions 8825
“Books’ Contributions”: | Featured Threads 8826

The following references are cited by chapters. 8827
8828
[Ref225] 8829
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 8830
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8831
10.5281/zenodo.7791982). 8832
8833
[Ref226] 8834
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8835
Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 10.5281/zen- 8836
odo.7791952). 8837
8838
The links to the contributions of this scientific research book are listed below. 8839
[HG225 8840
10.5281/zenodo.7791982). 8843
8844
[TITLE] “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-Cut 8845
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 8846

8847
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8848
https://www.researchgate.net/publication/369708364 8849
8850
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8851
https://www.scribd.com/document/635437195 8852
8853
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8854
https://zenodo.org/record/7791982 8855
8856
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8857
https://www.academia.edu/99473852 8858
443
Figure 44.1: 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).
8859
[ADDRESSED CITATION] 8860
10.5281/zenodo.7791982). 8863
[ASSIGNED NUMBER] #225 Article 8864
[DATE] March 2023 8865

[DOI] 10.5281/zenodo.7791982 8866
[LICENSE] CC BY-NC-ND 4.0 8867
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8868
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8869
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8870
8871
[HG226] 8872
odo.7791952). 8875
8876
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8877

Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy” 8878
8879
https://www.researchgate.net/publication/369707997 8881
8882
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8883

(doi: 10.5281/zenodo.7791982).
(doi: 10.5281/zenodo.7791982).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo
2023, (doi: 10.5281/zenodo.7791952).
https://www.scribd.com/document/635433286 8884
8885
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8886
https://zenodo.org/record/7791952 8887
8888
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8889
https://www.academia.edu/99472453 8890
8891
odo.7791952). 8895
[ASSIGNED NUMBER] #226 Article 8896
[DATE] March 2023 8897
[DOI] 10.5281/zenodo.7791952 8898
[LICENSE] CC BY-NC-ND 4.0 8899

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8900
[AVAILABLE AT TWITTER’S IDS] 8901
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8902
googlebooks GooglePlay 8903
8904
[ASSIGNED NUMBER] | Book #153 8905

HG153b
Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8907
10.5281/zenodo.7792307). 8908

2023, (doi: 10.5281/zenodo.7791952).
2023, (doi: 10.5281/zenodo.7791952).

[TITLE] Hamiltonian-Cycle-Cut In SuperHyperGraphs 8909

#Latest_Updates 8910
#The_Links 8911
8915
8917
#The_Links 8918
8919
[ASSIGNED NUMBER] | Book #153 8920

8921
[TITLE] Hamiltonian-Cycle-Cut In SuperHyperGraphs 8922
8923
8927
– 8928
8929
[PUBLISHER] 8930
(Paperback): https://www.amazon.com/dp/- 8931
(Hardcover): https://www.amazon.com/dp/- 8932

(Kindle Edition): https://www.amazon.com/dp/- 8933
8934
– 8935
8936
[ISBN] 8937
(Paperback): - 8938
(Hardcover): - 8939
(Kindle Edition): CC BY-NC-ND 4.0 8940
(EBook): CC BY-NC-ND 4.0 8941
8942
– 8943
8944
[PRINT LENGTH] 8945
(Paperback): - pages 8946
(Hardcover): - pages 8947
(Kindle Edition): - pages 8948
(E-Book): - pages 8949
8950
– 8951
8952
8954

#The_Links 8955
8956
https://www.researchgate.net/publication/- 8958
8959
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8960
https://drhenrygarrett.wordpress.com/2023/04/22/ 8961
Hamiltonian-Cycle-Cut-In-SuperHyperGraphs/ 8962
8963
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 8964
https://www.scribd.com/document/- 8965
8966
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 8967
https://www.academia.edu/- 8968
8969
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 8970
https://zenodo.org/record/- 8971
8972
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 8973
https://books.google.com/books/about?id=- 8974
8975
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 8976
https://play.google.com/store/books/details?id=- 8977

[TITLE] Hamiltonian-Cycle-Cut In SuperHyperGraphs (Published Version) 8978

8979
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8980
8981
https://drhenrygarrett.wordpress.com/2023/04/22/ 8982
Hamiltonian-Cycle-Cut-In-SuperHyperGraphs/ 8983
8984
– 8985
8986
[POSTED BY] Dr. Henry Garrett 8987
8988
[DATE] April 002, 2023 8989

8990
[POSTED IN] 153 | Hamiltonian-Cycle-Cut In SuperHyperGraphs 8991
8992
[TAGS] 8993
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 8994
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 8995
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 8996
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 8997
neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs, 8998
Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real- 8999
World Applications, Recent Research, Recognitions, Research, scientific research Article, 9000
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9001
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Su- 9002

perHyperGraph Theory, SuperHyperGraphs, Hamiltonian-Cycle-Cut In SuperHyperGraphs, 9003
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9004
In this scientific research book, there are some scientific research chapters on “Extreme 9005
Hamiltonian-Cycle-Cut In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Cycle-Cut In 9006
SuperHyperGraphs” about some scientific research on Hamiltonian-Cycle-Cut In SuperHyper- 9007
Graphs by two (Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian-Cycle-Cut In 9008

SuperHyperGraphs and Neutrosophic Hamiltonian-Cycle-Cut In SuperHyperGraphs. With 9009
scientific research on the basic scientific research properties, the scientific research book 9010
starts to make Extreme Hamiltonian-Cycle-Cut In SuperHyperGraphs theory and Neutro- 9011
sophic Hamiltonian-Cycle-Cut In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9012
understandable. 9013

CHAPTER 45 9014
“SuperHyperGraph-Based Books”: | 9015
Featured Tweets 9016
“SuperHyperGraph-Based Books”: | Featured Tweets 9017
451
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 9018
CV 9019
479
9020
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG: https://www.sciencepublishinggroup.com/journal/index?journalid=303; PDF:
https://drhenrygarrett.files.wordpress.com/2023/02/certificate_for_reviewer-2.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM

9021
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)
9022
Publications: Articles
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
@ResearchGate: https://www.researchgate.net/publication/369456588
@Scribd: https://www.scribd.com/document/633165164
@ZENODO_ORG: https://zenodo.org/record/7763661
@academia: https://www.academia.edu/98987491
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
@Scribd: https://www.scribd.com/document/-
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript

9023
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript

9024
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor
10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

9025
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript

9026
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In
10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

9027
By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

9028
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript

9029
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity
10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

9030
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript

9031
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-
2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

9032
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
9033
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

9034

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript

9035
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of
Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s

Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript

9036
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript

9037
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
9038
2023 129 Manuscript
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
9039
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
9040
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
9041
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9042
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
9043
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript
Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

9044
2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

9045
2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

9046
2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
9047
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
9048
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9049
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).
9050

(doi: 10.13140/RG.2.2.34040.16648).

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
9051
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9052
Publications: Books
2023 147 | SuperHyperDuality Amazon
[ADDRESSED CITATION]
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
@academia:https://www.academia.edu/96858234
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
(Kindle Edition): CC BY-NC-ND 4.0
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9053
[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

9054
[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

9055
[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

9056
[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

9057
[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

9058
[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

9059
[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

9060
[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

9061
[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

9062
[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

9063
[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

9064
[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

9065
[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

9066
[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

9067
[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

9068
[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

9069
[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

9070
[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

9071
[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
9072
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

9073
[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

9074
[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

9075
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
@ZENODOO RG : https : //zenodo.org/record/7563160
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9076
[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

9077
[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
9078
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

9079
“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

9080
[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
9081
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

9082
[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

9083
[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

9084
[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

9085
[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

9086
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

9087
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
9088
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
9089
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

9090
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

9091
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
-
9092
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

9093
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9094
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
9095
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
9096
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

9097
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
9098
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
...
9099
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/
9100
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
9101

Hamiltonian-Cycle-Cut in SuperHyperGraphs

Uploaded by

Document Information

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

Hamiltonian-Cycle-Cut in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Hamiltonian-Cycle-Cut In

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 41

6 New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59

10 Extreme SuperHyperHamiltonian-Cycle-Cut But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 135

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 143

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 241

25 Neutrosophic Hamiltonian-Cycle-Cut 245

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Neutrosophic SuperHyperHamiltonian-Cycle-Cut But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 337

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 345

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 443

45 “SuperHyperGraph-Based Books”: | Featured Tweets 451

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.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 452

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

34.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

35.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges