Hamiltonian-Cut in SuperHyperGraphs

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

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

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

Scientific Research 53
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 57
10 Extreme SuperHyperHamiltonian-Cut But As The Extensions Excerpt

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

Motivations 111
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-Cut 245
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Hamiltonian-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-Cut But As The Extensions

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-Cut in the Extreme Example (42.0.3) . . . . . . . . . . . 75
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

SuperHyperHamiltonian-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-Cut in the Neutrosophic Example (42.0.3) 277


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

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

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) 268

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-Cut In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Cut In SuperHy- 2
perGraphs” about some scientific research on Hamiltonian-Cut In SuperHyperGraphs by two 3

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

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

SuperHyperGraphs . Since there’s more ways to get type-results to make a Hamiltonian-Cut In 41
SuperHyperGraphs more understandable. For the sake of having Neutrosophic Hamiltonian-Cut 42
In SuperHyperGraphs, there’s a need to “redefine” the notion of a “Hamiltonian-Cut In 43
SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 44
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 45
of labels to assign to the values. Assume a Hamiltonian-Cut In SuperHyperGraphs . It’s 46

redefined a Neutrosophic Hamiltonian-Cut In SuperHyperGraphs if the mentioned Table holds, 47
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 48
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 49
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 50
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 51
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 52
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 53
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 54
on a Hamiltonian-Cut In SuperHyperGraphs . It’s the main. It’ll be disciplinary to have the 55
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 56
all Hamiltonian-Cut In SuperHyperGraphs until the Hamiltonian-Cut In SuperHyperGraphs, 57
then it’s officially called a “Hamiltonian-Cut In SuperHyperGraphs” but otherwise, it isn’t a 58

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

Hamiltonian-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the SuperHyperEdges 65
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 66
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 67
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 68
Hamiltonian-Cut In SuperHyperGraphs are redefined to a “Neutrosophic Hamiltonian-Cut In 69

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

SuperHyperPath”, “Neutrosophic Hamiltonian-Cut In SuperHyperGraphs”, “Neutrosophic 76
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPart- 77
ite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 78
has a “Neutrosophic Hamiltonian-Cut In SuperHyperGraphs” where it’s the strongest [the 79

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

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

Graphs, called Hamiltonian-Cut In SuperHyperGraphs, and the strongest Hamiltonian-Cut 116
In SuperHyperGraphs, called Neutrosophic Hamiltonian-Cut In SuperHyperGraphs, some 117
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 118
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 119
SuperHyperEdges to form any style of a Hamiltonian-Cut In SuperHyperGraphs. There isn’t 120
any formation of any Hamiltonian-Cut In SuperHyperGraphs but literarily, it’s the deformation 121
of any Hamiltonian-Cut In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A 122
basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are 123
proposed. 124
Keywords: SuperHyperGraph, (Neutrosophic) Hamiltonian-Cut In SuperHyperGraphs, 125

Cancer’s Recognition 126

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

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

|S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 157
The first Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second 158
Expression, holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define 159
“Neutrosophic” version of Hamiltonian-Cut In SuperHyperGraphs . Since there’s more ways to 160
get type-results to make Hamiltonian-Cut In SuperHyperGraphs more understandable. For the 161
sake of having Neutrosophic Hamiltonian-Cut In SuperHyperGraphs, there’s a need to “redefine” 162
the notion of “Hamiltonian-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the 163
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 164
there’s the usage of the position of labels to assign to the values. Assume a Hamiltonian-Cut 165
In SuperHyperGraphs . It’s redefined Neutrosophic Hamiltonian-Cut In SuperHyperGraphs 166
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 167
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the 168
key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 169
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 170
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 171

Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 172
To get structural examples and instances, I’m going to introduce the next SuperHyperClass of 173
SuperHyperGraph based on Hamiltonian-Cut In SuperHyperGraphs . It’s the main. It’ll be 174
disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 175
there’s a need to have all Hamiltonian-Cut In SuperHyperGraphs until the Hamiltonian-Cut 176
In SuperHyperGraphs, then it’s officially called “Hamiltonian-Cut In SuperHyperGraphs” but 177
otherwise, it isn’t Hamiltonian-Cut In SuperHyperGraphs . There are some instances about 178
the clarifications for the main definition titled “Hamiltonian-Cut In SuperHyperGraphs ”. 179
These two examples get more scrutiny and discernment since there are characterized in the 180
disciplinary ways of the SuperHyperClass based on Hamiltonian-Cut In SuperHyperGraphs 181
. For the sake of having Neutrosophic Hamiltonian-Cut In SuperHyperGraphs, there’s a 182
need to “redefine” the notion of “Neutrosophic Hamiltonian-Cut In SuperHyperGraphs” and 183
“Neutrosophic Hamiltonian-Cut In SuperHyperGraphs ”. The SuperHyperVertices and the 184

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

and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 197
“Neutrosophic Hamiltonian-Cut In SuperHyperGraphs” where it’s the strongest [the maximum 198
Neutrosophic value from all Hamiltonian-Cut In SuperHyperGraphs amid the maximum value 199
amid all SuperHyperVertices from a Hamiltonian-Cut In SuperHyperGraphs .] Hamiltonian-Cut 200
In SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the 201
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 202
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 203
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 204
Hamiltonian-Cut In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 205
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 206
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 207
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 208
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 209
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 210
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 211
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 212
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 213
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 214
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 215
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 216
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 217

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

In SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, 237
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 238
essential to have at least three SuperHyperEdges to form any style of a Hamiltonian-Cut In 239
SuperHyperGraphs. There isn’t any formation of any Hamiltonian-Cut In SuperHyperGraphs 240
but literarily, it’s the deformation of any Hamiltonian-Cut In SuperHyperGraphs. It, literarily, 241
deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutro- 242
sophic SuperHyperGraph theory are proposed. 243
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Hamiltonian-Cut In SuperHyper- 244
Graphs, Cancer’s Neutrosophic Recognition 245

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

Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 263
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 264
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 265
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 266
33131 United States. This research book presents different types of notions SuperHyperResolving 267
and Hamiltonian-Cut In SuperHyperGraphs in the setting of duality in neutrosophic graph 268

theory and neutrosophic SuperHyperGraph theory. This research book has scrutiny on the 269
complement of the intended set and the intended set, simultaneously. It’s smart to consider a 270
set but acting on its complement that what’s done in this research book which is popular in the 271
terms of high readers in Scribd. 272
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 273
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 274
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 275
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 276
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 277
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 278



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

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

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

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

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

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

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

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

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

HG214; HG215; HG216; HG217; HG218; HG219; HG220], there are some endeavors to 409
formalize the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyper- 410
Graph alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 411
HG65b; HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; 412
HG95b; HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; 415
HG104b; HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; 416

HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; HG150b]. Two popular 421
scientific research books in Scribd in the terms of high readers, 4087 and 5084 respectively, on 422
neutrosophic science is on [HG32b; HG44b]. 423
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 424
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 425
more than 4093 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 426
by Dr. Henry Garrett. This research book covers different types of notions and settings in 427
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 428
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 429
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 430
has more than 5090 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 431
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 432
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 433
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended 434
set and the intended set, simultaneously. It’s smart to consider a set but acting on its 435
complement that what’s done in this research book which is popular in the terms of high readers 436
in Scribd. 437
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 438
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 439
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 440

HG219; HG220] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; 455

HG143b; HG144b; HG145b; HG146b; HG147b; HG148b; HG149b; HG150b]. Two 465
popular scientific research books in Scribd in the terms of high readers, 4093 and 5090 466
respectively, on neutrosophic science is on [HG32b; HG44b]. 467

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 540
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 541
(doi: 10.20944/preprints202212.0549.v1). 542
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 543
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 544
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 545
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 546
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 547
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 548
(doi: 10.20944/preprints202212.0500.v1). 549
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 550
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 551
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 553
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 554
HG220 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 556
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 557
10.5281/zenodo.7781476). 558
HG219 [26] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 559
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 560
10.5281/zenodo.7783082). 561
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 563

10.5281/zenodo.7777857). 564
HG217 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 565
10.5281/zenodo.7779286). 567
HG215 [29] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 568
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 569
(doi: 10.5281/zenodo.7771831). 570
HG214 [30] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 571
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 572
2023, (doi: 10.5281/zenodo.7772468). 573

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 575
10.13140/RG.2.2.20913.25446). 576
HG212 [32] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 577
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 578
10.5281/zenodo.7764916). 579
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 581
10.13140/RG.2.2.11770.98247). 582
HG210 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 583
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 584
10.13140/RG.2.2.12400.12808). 585
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 587
2023, (doi: 10.13140/RG.2.2.22545.10089). 588
HG208 [36] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 589
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 590
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 591
HG207 [37] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 592
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 593
10.13140/RG.2.2.11377.76644). 594
HG206 [38] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 595
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 596
10.13140/RG.2.2.23750.96329). 597
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 599
10.13140/RG.2.2.31366.24641). 600
HG204 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 601
10.13140/RG.2.2.34721.68960). 603
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 605
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 608
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 611
10.13140/RG.2.2.24288.35842). 612

HG200 [44] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 613
10.13140/RG.2.2.32467.25124). 615
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 617
10.13140/RG.2.2.31025.45925). 618
HG198 [46] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 619
10.13140/RG.2.2.17184.25602). 621
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 623
10.13140/RG.2.2.23423.28327). 624
HG196 [48] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 625
10.13140/RG.2.2.28456.44805). 627
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 629
10.13140/RG.2.2.23525.68320). 630
HG194 [50] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 631
10.13140/RG.2.2.20170.24000). 633
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 635
10.13140/RG.2.2.36475.59683). 636
HG192 [52] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 637
10.13140/RG.2.2.29764.71046). 639
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 641
2023, (doi: 10.13140/RG.2.2.18780.87683). 642
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 644
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 647
10.13140/RG.2.2.26134.01603). 648
HG188 [56] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 649
10.13140/RG.2.2.27392.30721). 651

HG187 [57] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 652
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 653
10.13140/RG.2.2.33028.40321). 654
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 656
10.13140/RG.2.2.21389.20966). 657
HG185 [59] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 658
10.13140/RG.2.2.16356.04489). 660
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 662
10.13140/RG.2.2.21756.21129). 663
HG183 [61] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 664
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 665
10.13140/RG.2.2.30983.68009). 666
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 668
10.13140/RG.2.2.28552.29445). 669
HG181 [63] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 670
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 671
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 672
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 674
10.13140/RG.2.2.35105.89447). 675
HG179 [65] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 676
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 677
(doi: 10.13140/RG.2.2.30072.72960). 678
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 680
10.13140/RG.2.2.31147.52003). 681
HG177 [67] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 682
10.13140/RG.2.2.32825.24163). 684
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 686
10.13140/RG.2.2.13059.58401). 687
HG175 [69] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 688
10.13140/RG.2.2.11172.14720). 690

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 692
2023, (doi: 10.13140/RG.2.2.22011.80165). 693
HG173 [71] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 694
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 695
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 696
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 698
HG171 [73] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 700
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 702
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 704
2023, (doi: 10.13140/RG.2.2.19944.14086). 705
HG169 [75] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 706
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 708
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 710
(doi: 10.13140/RG.2.2.33103.76968). 711
HG167 [77] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 712
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 713
2023, (doi: 10.13140/RG.2.2.23037.44003). 714
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 716
(doi: 10.13140/RG.2.2.35646.56641). 717
HG165 [79] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 718
(doi: 10.13140/RG.2.2.18030.48967). 720
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 722
(doi: 10.13140/RG.2.2.13973.81121). 723
HG163 [81] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 724
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 725
2023, (doi: 10.13140/RG.2.2.34106.47047). 726
HG162 [82] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 727
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 728

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 731
2023, (doi: 10.13140/RG.2.2.31956.88961). 732
HG160 [84] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 733
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 734
2023, (doi: 10.13140/RG.2.2.15179.67361). 735
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 737
10.13140/RG.2.2.21510.45125). 738
HG158 [86] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 739
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 740
2023, (doi: 10.13140/RG.2.2.13121.84321). 741
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 743
10.13140/RG.2.2.11758.69441). 744
HG156 [88] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 745
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 746
2023, (doi: 10.13140/RG.2.2.31891.35367). 747
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 749
10.13140/RG.2.2.19360.87048). 750
HG154 [90] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 751
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 752
2023, (doi: 10.13140/RG.2.2.32363.21286). 753
HG153 [91] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 754
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 755
(doi: 10.13140/RG.2.2.23266.81602). 756
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 758
10.13140/RG.2.2.19911.37285). 759
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 761
10.13140/RG.2.2.11050.90569). 762
HG150 [94] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 763
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 764
HG149 [95] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 766
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 767

HG148 [96] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 769
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 770
HG147 [97] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 772
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 773
(doi: 10.13140/RG.2.2.30182.50241). 774
HG146 [98] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 775
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 776
HG145 [99] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 778
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 779
HG144 [100] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 781
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 782
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 783
HG143 [101] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 784
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 785
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 786
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 789
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 792
HG140 [104] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 793
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 794
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 795
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 798
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 801
HG137 [107] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 802
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 803
HG136 [108] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 805
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 806
2023, (doi: 10.13140/RG.2.2.17252.24968). 807

HG135 [109] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 808
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 809
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 810
HG134 [110] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 811
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 812
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 813
HG132 [111] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 814
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 815

2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 816
HG131 [112] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 817
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 818

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 819
HG130 [113] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 820
Recognition in The Confrontation With Super Attacks In Hyper Situations By 821
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 822

Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 823
HG129 [114] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 824
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 825
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 826
HG128 [115] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 828
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 829

SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 830
HG127 [116] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 831
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 832

2023,(doi: 10.13140/RG.2.2.36745.93289). 833
HG126 [117] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 834
HG125 [118] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 837

10.20944/preprints202301.0282.v1). 840
HG124 [119] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 841
10.20944/preprints202301.0267.v1).). 843
HG123 [120] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 844
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 845
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 846

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 847

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 848
HG122 [121] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 849
prints202301.0262.v1). 852
HG121 [122] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 853
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 854

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 860
10.13140/RG.2.2.35061.65767). 861
HG25 [125] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 862
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 863
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 864
10.13140/RG.2.2.18494.15680). 865
HG26 [126] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 866
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 867
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 868
10.13140/RG.2.2.32530.73922). 869
HG27 [127] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 870
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 871
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 872
10.13140/RG.2.2.15897.70243). 873

10.13140/RG.2.2.32530.73922). 877
prints202301.0105.v1). 880
HG28 [130] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 881
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 882

HG29 [131] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 884
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 885
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 886
10.13140/RG.2.2.23172.19849). 887
HG30 [134] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 894
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 895
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 896
10.13140/RG.2.2.17385.36968). 897
HG107 [135] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 898
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 899
Beyond”, Preprints 2023, 2023010044 900
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 902
(doi: 10.20944/preprints202301.0043.v1). 903
HG31 [137] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 904
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 905

2023, (doi: 10.13140/RG.2.2.28945.92007). 906
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 911
10.13140/RG.2.2.35774.77123). 912
HG35 [141] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 916
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 917

10.13140/RG.2.2.29430.88642). 918

(doi: 10.20944/preprints202212.0549.v1). 924
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 926

10.13140/RG.2.2.19380.94084). 927
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 935
(doi: 10.20944/preprints202212.0500.v1). 938
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 940
10.13140/RG.2.2.20993.12640). 941
HG952 [149] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 942
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 943

SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 946
ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 947
HG942 [151] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 948

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

Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 953
HG37 [153] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 954
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 955

10.13140/RG.2.2.29173.86244). 956
HG38 [154] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 957
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 958
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 959

HG150b [155] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 960
10.5281/zenodo.7783791). 961
HG149b [156] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 962
10.5281/zenodo.7780123). 963
HG148b [157] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 964
(doi: 10.5281/zenodo.7773119). 965
HG147b [158] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 966
odo.7637762). 967
HG146b [159] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 968
10.5281/zenodo.7766174). 969
HG145b [160] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 970
10.5281/zenodo.7762232). 971
HG144b [161] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 972
(doi: 10.5281/zenodo.7758601). 973
HG143b [162] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 974
10.5281/zenodo.7754661). 975
HG142b [163] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 976
10.5281/zenodo.7750995) . 977
HG141b [164] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 978
(doi: 10.5281/zenodo.7749875). 979
HG140b [165] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 980
10.5281/zenodo.7747236). 981
HG139b [166] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 982
10.5281/zenodo.7742587). 983
HG138b [167] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 984
(doi: 10.5281/zenodo.7738635). 985
HG137b [168] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 986
10.5281/zenodo.7734719). 987
HG136b [169] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 988
10.5281/zenodo.7730484). 989
HG135b [170] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 990
(doi: 10.5281/zenodo.7730469). 991
HG134b [171] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 992
10.5281/zenodo.7722865). 993
HG133b [172] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 994
odo.7713563). 995

odo.7709116). 997
HG131b [174] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 998
10.5281/zenodo.7706415). 999
HG130b [175] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1000
(doi: 10.5281/zenodo.7706063). 1001
HG129b [176] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1002
(doi: 10.5281/zenodo.7701906). 1003
HG128b [177] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1004
odo.7700205). 1005
HG127b [178] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1006
10.5281/zenodo.7694876). 1007
HG126b [179] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1008
10.5281/zenodo.7679410). 1009
HG125b [180] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1010
10.5281/zenodo.7675982). 1011
HG124b [181] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1012
10.5281/zenodo.7672388). 1013
HG123b [182] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1014
odo.7668648). 1015
HG122b [183] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1016
10.5281/zenodo.7662810). 1017
HG121b [184] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1018
10.5281/zenodo.7659162). 1019
HG120b [185] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1020
odo.7653233). 1021
HG119b [186] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1022
odo.7653204). 1023
HG118b [187] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1024
odo.7653142). 1025
HG117b [188] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1026
odo.7653117). 1027
HG116b [189] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1028
odo.7653089). 1029
HG115b [190] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1030
odo.7651687). 1031

HG114b [191] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1032
odo.7651619). 1033
HG113b [192] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1034
odo.7651439). 1035
HG112b [193] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1036
odo.7650729). 1037
HG111b [194] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1038
odo.7647868). 1039
HG110b [195] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1040
odo.7647017). 1041
HG109b [196] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1042
odo.7644894). 1043
HG108b [197] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1044
odo.7641880). 1045
HG107b [198] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1046
odo.7632923). 1047
HG106b [199] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1048
odo.7623459). 1049
HG105b [200] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1050
10.5281/zenodo.7606416). 1051
HG104b [201] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1052
10.5281/zenodo.7606416). 1053
HG103b [202] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1054
odo.7606404). 1055
HG102b [203] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1056
10.5281/zenodo.7580018). 1057
HG101b [204] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1058
odo.7580018). 1059
odo.7580018). 1061
odo.7579929). 1063
HG98b [207] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1064
10.5281/zenodo.7563170). 1065
HG97b [208] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1066
odo.7563164). 1067

HG96b [209] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1068
odo.7563160). 1069
odo.7563160). 1071
HG94b [211] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1072
10.5281/zenodo.7563160). 1073
HG93b [212] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1074
10.5281/zenodo.7557063). 1075
HG92b [213] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1076
10.5281/zenodo.7557009). 1077
HG91b [214] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1078
10.5281/zenodo.7539484). 1079
HG90b [215] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1080
10.5281/zenodo.7523390). 1081
HG89b [216] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1082
10.5281/zenodo.7523390). 1083
HG88b [217] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1084
10.5281/zenodo.7523390). 1085
HG87b [218] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1086
odo.7574952). 1087
HG86b [219] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1088
10.5281/zenodo.7574992). 1089
odo.7523357). 1091
HG84b [221] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1092
10.5281/zenodo.7523357). 1093
HG83b [222] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1094
10.5281/zenodo.7504782). 1095
HG82b [223] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1096
10.5281/zenodo.7504782). 1097
HG81b [224] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1098
10.5281/zenodo.7504782). 1099
HG80b [225] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1100
10.5281/zenodo.7499395). 1101
HG79b [226] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1102
odo.7499395). 1103

HG78b [227] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1104
10.5281/zenodo.7499395). 1105
HG77b [228] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1106
10.5281/zenodo.7497450). 1107
HG76b [229] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1108
10.5281/zenodo.7497450). 1109
HG75b [230] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1110
10.5281/zenodo.7494862). 1111
HG74b [231] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1112
odo.7494862). 1113
HG73b [232] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1114
10.5281/zenodo.7494862). 1115
HG72b [233] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1116
10.5281/zenodo.7493845). 1117
HG71b [234] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1118
10.5281/zenodo.7493845). 1119
HG70b [235] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1120
10.5281/zenodo.7493845). 1121
HG69b [236] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1122
odo.7539484). 1123
HG68b [237] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1124
odo.7523390). 1125
HG67b [238] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1126
odo.7523357). 1127
HG66b [239] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1128
odo.7504782). 1129
HG65b [240] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1130
odo.7499395). 1131
HG64b [241] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1132
odo.7497450). 1133
HG63b [242] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1134
odo.7494862). 1135
HG62b [243] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1136
odo.7493845). 1137
HG61b [244] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1138
odo.7480110). 1139

HG60b [245] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1140
odo.7378758). 1141
HG32b [246] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1142
odo.6320305). 1143
HG44b [247] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1144
odo.6677173). 1145

CHAPTER 3 1146
Acknowledgements 1147
The author is going to express his gratitude and his appreciation about the brains and their 1148
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1149
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1150 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
1151
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 1152
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1153
ideas to be on the star lines of words and shining like stars, forever. 1154
37
CHAPTER 4 1155
Cancer In Extreme SuperHyperGraph 1156
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1157
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1158
as the consequences of the model, some parameters are used. The cells are under attack of this 1159
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1160
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1161
In the following, some Extreme steps are Extreme devised on this disease. 1162
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1163
function. 1164
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1165
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1166
effects of the cancer on that region; this event leads us to choose another model [it’s said 1169
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1170
what’s done. 1171
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1172
they’ve got the names, and some general Extreme models. The moves and the Extreme 1173
traces of the cancer on the complex tracks and between complicated groups of cells could be 1174
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1175
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1176
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1177
in those Extreme Extreme SuperHyperModels. 1178
Some cells have been faced with some attacks from the situation which is caused by the 1179
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1180
which in that, the cells could be labelled as some groups and some groups or individuals have 1181
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1182
the embedded situations, the individuals of cells and the groups of cells could be considered 1183
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1184
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1185
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1186
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1187
39
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1188
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1189
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1190
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1191
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1192
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1193
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1194

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1195
is going to figure out what’s going on this phenomenon. The special case of this disease is 1196
considered and as the consequences of the model, some parameters are used. The cells are 1197
under attack of this disease but the moves of the cancer in the special region are the matter of 1198
mind. The recognition of the cancer could help to find some treatments for this disease. The 1199
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1200
Recognition” and both bases are the background of this research. Sometimes the cancer has 1201
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1202
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1203
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1204
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1205
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1206
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1207
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1208
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1209
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1210
and neutrality about the moves and the effects of the cancer on that region; this event leads 1211
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1212
perception on what’s happened and what’s done. There are some specific models, which 1213
are well-known and they’ve got the names, and some general models. The moves and the 1214
traces of the cancer on the complex tracks and between complicated groups of cells could 1215
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1216
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1217
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1218

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1219
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1220
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1221
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1222
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1223
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1224
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1225
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1226
based on the fixed groups of cells or the fixed groups of group of cells? 1227
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1228
messy and dense SuperHyperModels where embedded notions are illustrated? 1229
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1230
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1231
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1232

research has taken more motivations to define SuperHyperClasses and to find some connections 1233
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1234
instances and examples to make clarifications about the framework of this research. The general 1235
results and some results about some connections are some avenues to make key point of this 1236
research, “Cancer’s Recognition”, more understandable and more clear. 1237
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1238
on the modeling of the regions where are under the attacks of the cancer to recognize 1239
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1240
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1241
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1242
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1243
instances and literature reviews have taken the whole way through. In this scientific research, 1244
the literature reviews have fulfilled the lines containing the notions and the results. The 1245
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1246
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1247
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1248
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1249
of the moves of the cancer in the longest and strongest styles with the formation of the design 1250
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1251
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1252
out the background for the SuperHyperNotions. 1253

CHAPTER 5 1254
Extreme Hamiltonian-Cut 1255
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1256
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1257
2023, (doi: 10.13140/RG.2.2.34953.52320). 1258

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1259
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1260
(doi: 10.13140/RG.2.2.33275.80161). 1261
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1262
10.13140/RG.2.2.11050.90569). 1264
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1265
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1266
10.13140/RG.2.2.17761.79206). 1267
10.13140/RG.2.2.19911.37285). 1270
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1271
10.13140/RG.2.2.23266.81602). 1273
10.13140/RG.2.2.19360.87048). 1276
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1277
10.13140/RG.2.2.32363.21286). 1279
10.13140/RG.2.2.11758.69441). 1282
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1283
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1284
10.13140/RG.2.2.31891.35367). 1285
10.13140/RG.2.2.21510.45125). 1288
43
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1289
10.13140/RG.2.2.13121.84321). 1291

CHAPTER 6 1292
New Ideas On Super Hammy By Hyper 1293
Hamper Of Hamiltonian-Cut In 1294
Recognition of Cancer With 1295
(Neutrosophic) SuperHyperGraph 1296
45
CHAPTER 7 1297
ABSTRACT 1298
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1299

Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cut 1300
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 1301
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperHamiltonian- 1302
Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cut criteria 1303
holds 1304
∀Ea ∈ P : P is a SuperHyperPath and it has the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic 1305

e-SuperHyperHamiltonian-Cut criteria holds 1306
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 1307

v-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic v- 1308
SuperHyperHamiltonian-Cut criteria holds 1309
∀Va ∈ P : P is a SuperHyperPath and it has the maximum number of SuperHyperVertices;
Neutrosophic rv-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic 1310

v-SuperHyperHamiltonian-Cut criteria holds 1311
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1312

SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, 1313
Neutrosophic re-SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, 1314
and Neutrosophic rv-SuperHyperHamiltonian-Cut. ((Neutrosophic) SuperHyperHamiltonian- 1315

Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 1316
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 1317
SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neut- 1318
rosophic re-SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and 1319
Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for an Extreme SuperHyperGraph 1320
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1321
47
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme se- 1322
quence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1323
Extreme SuperHyperHamiltonian-Cut; a Neutrosophic SuperHyperHamiltonian-Cut if it’s either 1324
of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, 1325
Neutrosophic v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut 1326
and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 1327
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1328

high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutro- 1329
sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cut; 1330
an Extreme SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either of Neutrosophic 1331
e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, Neutrosophic v- 1332
SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) 1333
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1334

contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1335
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1336
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1337
such that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power 1338
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cut 1339
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neut- 1340

Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for a Neutrosophic SuperHyper- 1342
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1343
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality 1344
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neut- 1345
rosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1346

SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cut; 1347
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme V- 1348
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 1352
treme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 1353
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1354
SuperHyperHamiltonian-Cut; a Neutrosophic V-SuperHyperHamiltonian-Cut if it’s either of 1355
Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, 1356

sophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 1359
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutro- 1360
an Extreme V-SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either of Neutrosophic 1362

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


such that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is 1369
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cut Super- 1370
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic 1371
re-SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and Neutro- 1372
sophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 1373
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 1374
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1375
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1376
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 1377
tices such that they form the Neutrosophic SuperHyperHamiltonian-Cut; and the Neutrosophic 1378
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 1379
introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cut and Neutro- 1380

sophic SuperHyperHamiltonian-Cut. Two different types of SuperHyperDefinitions are debut 1381
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1382
Recognition” are the under research to figure out the challenges make sense about ongoing and 1389
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 1390
different types of them. Some of them are individuals and some of them are well-modeled by 1391
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 1392
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 1393
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1394
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1395
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1396
research. It’s also officially collected in the form of some questions and some problems. Assume 1397
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cut 1398

S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cut is a maximal 1403

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 1404
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 1405
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1406
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 1407
holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 1408
if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 1409

version of a SuperHyperHamiltonian-Cut . Since there’s more ways to get type-results 1410
to make a SuperHyperHamiltonian-Cut more understandable. For the sake of having 1411
Neutrosophic SuperHyperHamiltonian-Cut, there’s a need to “redefine” the notion of a 1412
“SuperHyperHamiltonian-Cut ”. The SuperHyperVertices and the SuperHyperEdges are as- 1413

signed by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1414
position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cut . It’s redefined 1415
a Neutrosophic SuperHyperHamiltonian-Cut if the mentioned Table holds, concerning, “The 1416
Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The 1417
Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Num- 1418
ber of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 1419
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 1420
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 1421
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 1422
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperHamiltonian- 1423
Cut . It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 1424
kind of SuperHyperClass. If there’s a need to have all SuperHyperHamiltonian-Cut until 1425
the SuperHyperHamiltonian-Cut, then it’s officially called a “SuperHyperHamiltonian-Cut” 1426

but otherwise, it isn’t a SuperHyperHamiltonian-Cut . There are some instances about the 1427
clarifications for the main definition titled a “SuperHyperHamiltonian-Cut ”. These two 1428
examples get more scrutiny and discernment since there are characterized in the disciplinary 1429
ways of the SuperHyperClass based on a SuperHyperHamiltonian-Cut . For the sake of having 1430
a Neutrosophic SuperHyperHamiltonian-Cut, there’s a need to “redefine” the notion of a 1431
“Neutrosophic SuperHyperHamiltonian-Cut” and a “Neutrosophic SuperHyperHamiltonian-Cut 1432

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1433
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 1434
values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 1435
Graph” if the intended Table holds. And a SuperHyperHamiltonian-Cut are redefined to a 1436
“Neutrosophic SuperHyperHamiltonian-Cut” if the intended Table holds. It’s useful to define 1437
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 1438
results to make a Neutrosophic SuperHyperHamiltonian-Cut more understandable. Assume 1439
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 1440
intended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cut, SuperHyperStar, 1441
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cut”, “Neutrosophic SuperHyper- 1443
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 1444

“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 1445
“Neutrosophic SuperHyperHamiltonian-Cut” where it’s the strongest [the maximum Neutro- 1446
sophic value from all the SuperHyperHamiltonian-Cut amid the maximum value amid all 1447
SuperHyperVertices from a SuperHyperHamiltonian-Cut .] SuperHyperHamiltonian-Cut . A 1448
graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 1449

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 1450
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 1451
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Cut if it’s 1452
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1453
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1454
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1455
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 1456
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1458
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1459

has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1460
the specific designs and the specific architectures. The SuperHyperModel is officially called 1461
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1462
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1463
and the common and intended properties between “specific” cells and “specific group” of 1464
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1465
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1466
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1467
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 1468
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 1469
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 1470
of the move from the cancer is identified by this research. Sometimes the move of the cancer 1471
the traces of the cancer on the complex tracks and between complicated groups of cells could be 1477
fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cut, SuperHyperStar, 1478

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1479
the longest SuperHyperHamiltonian-Cut or the strongest SuperHyperHamiltonian-Cut in 1480
those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cut, called 1481
SuperHyperHamiltonian-Cut, and the strongest SuperHyperHamiltonian-Cut, called Neut- 1482
rosophic SuperHyperHamiltonian-Cut, some general results are introduced. Beyond that in 1483
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 1484
enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1485
SuperHyperHamiltonian-Cut. There isn’t any formation of any SuperHyperHamiltonian-Cut 1486
but literarily, it’s the deformation of any SuperHyperHamiltonian-Cut. It, literarily, deforms 1487
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cut 1488
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1489
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cut, Cancer’s Neutro- 1490
sophic Recognition 1491

CHAPTER 8 1493
Applied Notions Under The Scrutiny Of 1494
The Motivation Of This Scientific 1495
Research 1496
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1497
try to bring the motivations in the narrative ways. Some cells have been faced with some 1498
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1499
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1500
as some groups and some groups or individuals have excessive labels which all are raised from 1501
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1502
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1503
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1504
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1505
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1506
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1507
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1508
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1509
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1510
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1511
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1512
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1513
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1514
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1515
The special case of this disease is considered and as the consequences of the model, some 1516
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1517
the special region are the matter of mind. The recognition of the cancer could help to find some 1518
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1519
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1520
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1521
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1522
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1523
formation of the design and the architecture are formally called “ SuperHyperHamiltonian-Cut” 1524
in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the 1525
53
embedded styles to figure out the background for the SuperHyperNotions. The recognition of 1526
the cancer in the long-term function. The specific region has been assigned by the model [it’s 1527
called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 1528
research. Sometimes the move of the cancer hasn’t be easily identified since there are some 1529
determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that 1530
region; this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] 1531
to have convenient perception on what’s happened and what’s done. There are some specific 1532
models, which are well-known and they’ve got the names, and some general models. The 1533
moves and the traces of the cancer on the complex tracks and between complicated groups 1534
of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperHamiltonian-Cut, 1535
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is 1536
to find either the optimal SuperHyperHamiltonian-Cut or the Extreme SuperHyperHamiltonian- 1537
Cut in those Extreme SuperHyperModels. Some general results are introduced. Beyond that in 1538
SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges but 1539
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 1540
a SuperHyperHamiltonian-Cut. There isn’t any formation of any SuperHyperHamiltonian-Cut 1541
and it doesn’t form. 1543
amount of SuperHyperHamiltonian-Cut” of either individual of cells or the groups of cells based 1545
on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 1546
Cut” based on the fixed groups of cells or the fixed groups of group of cells? 1547
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1548
messy and dense SuperHyperModels where embedded notions are illustrated? 1549
Thus it motivates us to define different types of “ SuperHyperHamiltonian-Cut” and “Extreme 1551
SuperHyperHamiltonian-Cut” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then 1552

the research has taken more motivations to define SuperHyperClasses and to find some 1553
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us 1554
to get some instances and examples to make clarifications about the framework of this research. 1555
The general results and some results about some connections are some avenues to make key 1556
point of this research, “Cancer’s Recognition”, more understandable and more clear. 1557
The framework of this research is as follows. In the beginning, I introduce basic definitions 1558
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1559
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1560
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1561
review literature are applied to make sense about what’s going to figure out about the upcoming 1562
sections. The main definitions and their clarifications alongside some results about new 1563
notions, SuperHyperHamiltonian-Cut and Extreme SuperHyperHamiltonian-Cut, are figured 1564

out in sections “ SuperHyperHamiltonian-Cut” and “Extreme SuperHyperHamiltonian-Cut”. 1565
In the sense of tackling on getting results and in Hamiltonian-Cut to make sense about 1566
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1567
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1568
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1569
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1570

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1571
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1572
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations 1573
and as concluding and closing section of theoretical research are contained in the section 1574
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 1575
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1576
Results”, “ SuperHyperHamiltonian-Cut”, “Extreme SuperHyperHamiltonian-Cut”, “Results on 1577

SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious questions 1578
about what’s done about the SuperHyperNotions to make sense about excellency of this research 1579
and going to figure out the word “best” as the description and adjective for this research as 1580
presented in section, “ SuperHyperHamiltonian-Cut”. The keyword of this research debut in the 1581
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 1582
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 1583
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 1584
there are some scrutiny and discernment on what’s done and what’s happened in this research 1585
in the terms of “questions” and “problems” to make sense to figure out this research in featured 1586
style. The advantages and the limitations of this research alongside about what’s done in this 1587
research to make sense and to get sense about what’s figured out are included in the section, 1588
“Conclusion and Closing Remarks”. 1589

CHAPTER 9 1590
Extreme Preliminaries Of This Scientific 1591
Research On the Redeemed Ways 1592
In this section, the basic material in this scientific research, is referred to [Single Valued 1593
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1594
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1595

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1596
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1597
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1598
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1599
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1600
their clarifications are addressed to Ref.[HG38]. 1601

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

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

Let X be a Hamiltonian-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}.
57
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). 1605
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1606
where 1607
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1608
(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); 1609
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1610
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1611
1, 2, . . . , n0 ); 1612
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1613
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1614

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1621
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1622
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1623
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1624
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1625
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1626

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

(Ref.[HG38],Definition 2.7,p.3). 1628
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1629
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1630
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1631
(i) If |Vi | = 1, then Vi is called vertex; 1632
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1633
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1634
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1635
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1636
SuperEdge; 1637
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1638
SuperHyperEdge. 1639
If we choose different types of binary operations, then we could get hugely diverse types of 1640
general forms of Neutrosophic SuperHyperGraph (NSHG). 1641
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1642

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1643
x, y, z, w ∈ [0, 1]: 1644
(i) 1 ⊗ x = x; 1645
(ii) x ⊗ y = y ⊗ x; 1646
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1647
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1648

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

where 1651

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


SuperEdge; 1680
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1683
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1684
makes the patterns and regularities. 1685
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1686
of elements of SuperHyperEdges are the same. 1687

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1688
makes to have SuperHyperUniform more understandable. 1689
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1690
Classes as follows. 1691
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1692
two given SuperHyperEdges with two exceptions; 1693
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1694
SuperHyperEdges; 1695
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1696
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1697
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1698
in common; 1699
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1700
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1701
SuperHyperEdge in common; 1702
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1703
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1704
SuperVertex. 1705
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 1706
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1707
(i) Vi , Vi+1 ∈ Ei0 ; 1708
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1709
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1710
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1711
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1712
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1713
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1714
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1715
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1717
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1718
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1719
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1720
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1721
perPath . 1722
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 1723
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1724
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1725
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1726
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1727
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1728

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

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


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

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

Cut). 1745
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1747
or E 0 is called 1748
(i) Neutrosophic e-SuperHyperHamiltonian-Cut if the following expression is called 1749

Neutrosophic e-SuperHyperHamiltonian-Cut criteria holds 1750
(ii) Neutrosophic re-SuperHyperHamiltonian-Cut if the following expression is called 1751

Neutrosophic re-SuperHyperHamiltonian-Cut criteria holds 1752
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1753
(iii) Neutrosophic v-SuperHyperHamiltonian-Cut if the following expression is called 1754

Neutrosophic v-SuperHyperHamiltonian-Cut criteria holds 1755
(iv) Neutrosophic rv-SuperHyperHamiltonian-Cut if the following expression is called 1756

and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1758
(v) Neutrosophic SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 1759

SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, Neutrosophic 1760
v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut. 1761
Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cut). 1762

(i) an Extreme SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 1765

SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, Neutro- 1766
sophic v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut 1767

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1768
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1769
the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 1770
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1771
SuperHyperHamiltonian-Cut; 1772
(ii) a Neutrosophic SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 1773

v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut and 1775
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1776
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1777

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1778
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1779
Neutrosophic SuperHyperHamiltonian-Cut; 1780
(iii) an Extreme SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either 1781

of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian- 1782
Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and 1783
Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for an Extreme SuperHy- 1784
perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1785
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1786
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 1787
ity conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1788
that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is 1789
corresponded to its Extreme coefficient; 1790
(iv) a Neutrosophic SuperHyperHamiltonian-Cut SuperHyperPolynomial if 1791

it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re- 1792
SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and Neut- 1793
rosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for a Neutrosophic Super- 1794

HyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1795
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1796
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 1799
sophic SuperHyperHamiltonian-Cut; and the Neutrosophic power is corresponded to its 1800

Neutrosophic coefficient; 1801
(v) an Extreme V-SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 1802

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1805
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1806
Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 1807
(vi) a Neutrosophic V-SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 1810


Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1814
(vii) an Extreme V-SuperHyperHamiltonian-Cut SuperHyperPolynomial if 1818

SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and Neutro- 1820
sophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for an Extreme SuperHyperGraph 1821
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1822
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1823
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 1824

seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1825
form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is corresponded 1826
to its Extreme coefficient; 1827
(viii) a Neutrosophic SuperHyperHamiltonian-Cut SuperHyperPolynomial if 1828



Neutrosophic coefficient. 1838
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cut). 1839

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1840
(i) an δ−SuperHyperHamiltonian-Cut is a Neutrosophic kind of Neutrosophic 1841

SuperHyperHamiltonian-Cut such that either of the following expressions hold for 1842
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1843
|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 1844

(29.1), holds if S is an δ−SuperHyperDefensive; 1845
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cut is a Neutrosophic kind of Neut- 1846

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

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

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

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

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1850
For the sake of having a Neutrosophic SuperHyperHamiltonian-Cut, there’s a need to 1851

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 1852
there’s the usage of the position of labels to assign to the values. 1854
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1855
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1856
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1857
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1858
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 1860
sophic SuperHyperPath , SuperHyperHamiltonian-Cut, SuperHyperStar, SuperHyperBipart- 1861
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 1862
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 1863
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 1864
perHyperWheel if the Table (29.2) holds. 1865
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Cut. 1866

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian-Cut 1867
more Neutrosophicly understandable. 1868
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cut”. The 1870
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1871


136TBL1
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 1872
1873
136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Cut. It’s redefined a Neutrosophic 1874

SuperHyperHamiltonian-Cut if the Table (29.3) holds. 1875

CHAPTER 10 1876
Extreme SuperHyperHamiltonian-Cut But 1877
As The Extensions Excerpt From Dense 1878
And Super Forms 1879
Definition 10.0.1. (Extreme event). 1880

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 1881
probability Hamiltonian-Cut. Any Extreme k-subset of A of V is called Extreme k-event and 1882
if k = 2, then Extreme subset of A of V is called Extreme event. The following expression is 1883
called Extreme probability of A. 1884
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1885

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 1886
probability Hamiltonian-Cut. s Extreme k-events Ai , i ∈ I is called Extreme s-independent 1887
if the following expression is called Extreme s-independent criteria 1888
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 1889
following expression is called Extreme independent criteria 1890
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 1891

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1892
is a probability Hamiltonian-Cut. Any k-function Hamiltonian-Cut like E is called Extreme 1893
k-Variable. If k = 2, then any 2-function Hamiltonian-Cut like E is called Extreme Variable. 1894
The notion of independent on Extreme Variable is likewise. 1895
Definition 10.0.4. (Extreme Expectation). 1896
69
is a probability Hamiltonian-Cut. an Extreme k-Variable E has a number is called Extreme 1898

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

is a probability Hamiltonian-Cut. an Extreme number is called Extreme Crossing if the 1902

following expression is called Extreme Crossing criteria 1903
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 1904
S = (V, E) is a probability Hamiltonian-Cut. Let m and n propose special Hamiltonian-Cut. 1905
Then with m ≥ 4n, 1906
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-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: 1907
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
1908
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1909
Consider S = (V, E) is a probability Hamiltonian-Cut. Let P be a SuperHyperSet of n points in 1910
the plane, and let l be the Extreme number √of SuperHyperLines in the plane passing through at 1911
least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1912
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 1913

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 1932
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 1933
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 1934
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 1935
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1936
Consider S = (V, E) is a probability Hamiltonian-Cut. Let X be a nonnegative Extreme Variable 1937
and t a positive real number. Then 1938
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. 1939
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1940
Consider S = (V, E) is a probability Hamiltonian-Cut. Let Xn be a nonnegative integer-valued 1941
variable in a probability Hamiltonian-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 1942

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

S = (V, E) is a probability Hamiltonian-Cut. A special SuperHyperGraph in Gn,p is up. Let 1949
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 1950
The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 1951
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 1952
of the Extreme SuperHyperGraph G. 1953
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 1954
Extreme Variable for this Extreme Event. By equation, we have 1955
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 1956
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 1957
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: 1958
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 1959
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 1960
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 1961
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 1962
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 1963
Definition 10.0.12. (Extreme Variance). 1964

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

S = (V, E) is a probability Hamiltonian-Cut. Let X be an Extreme Variable and let t be a 1972
positive real number. Then 1973
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
1974
Consider S = (V, E) is a probability Hamiltonian-Cut. Let Xn be an Extreme Variable in a 1976

probability Hamiltonian-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 1977
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cut. Set X := Xn and t := |Ex(Xn )| in 1979
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 1980
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 1981
Consider S = (V, E) is a probability Hamiltonian-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 1983
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 1984
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 1985
S = (V, E) is a probability Hamiltonian-Cut. As in the proof of related Theorem, the result is 1987
straightforward. 1988
Consider S = (V, E) is a probability Hamiltonian-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 1990
defined in previous Theorem. Then either: 1991
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 1992
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 1993
S = (V, E) is a probability Hamiltonian-Cut. The latter is straightforward. 1995
Definition 10.0.17. (Extreme Threshold). 1996
is a probability Hamiltonian-Cut. Let P be a monotone property of SuperHyperGraphs (one 1998
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 1999
a function f (n) such that: 2000
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2001
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2002

Definition 10.0.18. (Extreme Balanced). 2003

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

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

SuperHyperHamiltonian-Cut, is up. The Extreme Algorithm is Extremely straight- 2017
forward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2018
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2019
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2020
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2021
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2022

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

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

forward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2027
SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2028
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2029
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2030
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2031
SuperHyperHamiltonian-Cut. 2032

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

forward. 2036

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



forward. 2040

= {E4 (E5 ), E1 , E2 }.
= z 5 + 2z 3 .
= {VE4 (E5 ) , VE1 , {O}}.
= z 4 + z 3 + 2z 2 + 4z.
2041

forward. 2044

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

= {Vi , Vi+8 , V5 }4i=1 .

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

forward. 2048

= {Ei , Ei+22 , E22 }10
i=1 .
= 21z 2 .
= {Vi }22
i=1 .
= 2z 6 + 6z 5 + 7z 4 + 3z 3 .
2049


forward. 2052

= {E15 , E13 , E16 , E14 , E17 }.
= 2z 5 + z 4 + 2z 2 .
= {Vi }14
i=1 .
= 3z 6 + 6z 5 + 3z 4 + 2z 3 .
2053

forward. 2056

= {E2 , E4 , E3 }.


= 2z 5 + z 3 .
= {Vi }14
i=4,i6=12 .
= 3z 6 + 5z 5 + 2z 4 .
2057

forward. 2060

= {Ei , E22 }10
i=1 .
= 11z 2 .
= {Vi }22
i=1 .
= 2z 6 + 6z 5 + 7z 4 + 3z 3 .

2061

forward. 2064

= {E1 , E6 , E2 , E7 , E3 }.
= 2z 5 + z 4 + 2z 2 .
= {Vi }14
i=1 .
= 3z 6 + 6z 5 + 3z 4 + 2z 3 .
2065


forward. 2068

= {E1 , E6 , E3 }.
= 2z 3 + z 2 .
= {V1 , V2 , V3 , V4 , V5 , V6 }.
= 3z 5 + z 4 + 2z 3 .
2069

forward. 2072

= {E1 , E6 }.
= z5 + z2.


= {V1 , V2 , V3 , V7 , V8 , V9 }.
= 2z 7 + z 6 + 3z 5 .
2073

forward. 2076

= {E9 , E6 , E3 }.
= 2z 3 + z 2 .
= {V1 , V2 , V3 , V4 , V5 , V6 }.
= 3z 5 + z 4 + 2z 3 .
2077


forward. 2080

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

forward. 2084

= {Ei }5i=1 .

= 5z 2 .
= {Vi }6i=1 .
= 3z 5 + z 4 + 2z 3 .
2085

forward. 2088

= {Ei }5i=1 .

= 5z 2 .
= {Vi }22
i=1 .
X
= z |Vi | .
Vi ∈C(N SHG)Extreme V-Hamiltonian-Cut
2089

forward. 2092

= {Ei }6i=1 .
= 6z 2 .
= {Vi }27
i=1 .
X
= z |Vi | .
2093



forward. 2096

= {Ei }6i=1 .
= 6z 2 .
= {Vi }27
i=1 .
X
= z |Vi | .
2097

forward. 2100

= {Ei }12
i=1 .


X
= z |Ei | .
Ei ∈C(N SHG)Extreme Hamiltonian-Cut

= {VEi }12
i=1 .
X
= z |VEi | .
VEi ∈C(N SHG)Extreme V-Hamiltonian-Cut
2101

forward. 2104

= {E6 , E8 }.
= z |E6 | + z |E8 | .
= {VEi , V1 }i=6,8 .


= z |VE6 | + z |VE8 | + z |V1 | .
2105

forward. 2108

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

SuperHyperHamiltonian-Cut in the Extreme Example (42.0.3) 95NHG1

forward. 2112

= {Ei }5i=2 .
= z 12 + 2z 10 + z 6 .
= {VEi }5i=2 .
X
= z |VEi | .
2113

SuperHyperHamiltonian-Cut in the Extreme Example (42.0.3) 95NHG2
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2114
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cut if for 2115
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2116
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2117
all minus all Extreme SuperHypeNeighbors to any amount of them. 2118
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2119

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2120
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2121
quasi-R-Hamiltonian-Cut minus all Extreme SuperHypeNeighbor to some of them but not all of 2122
them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2123
only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cut, minus 2124
all Extreme SuperHypeNeighbor to some of them but not all of them. 2125
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Hamiltonian-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cut is at least 2126
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2127
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2128
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2129
SuperHyperVertices are renamed to Extreme Hamiltonian-Cut in some cases but the maximum 2130

number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2131
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2132
Hamiltonian-Cut. 2133
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-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-Cut with the least Extreme cardinality, the 2134
lower sharp Extreme bound for cardinality. 2135
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2136
Then in the worst case, literally, 2137
C(N SHG)ExtremeQuasi−Hamiltonian−Cut = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

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

C(N SHG)ExtremeQuasi−Hamiltonian−CutSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−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-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-Cut. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Hamiltonian-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-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-Cut decorates the Extreme SuperHyper-
Vertices don’t have received any Extreme connections so as this Extreme style implies different
versions of Extreme SuperHyperEdges with the maximum Extreme cardinality in the terms of
Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to have the maximum
Extreme groups of Extreme SuperHyperVertices have perfect Extreme connections inside each of
SuperHyperEdges and the outside of this Extreme SuperHyperSet doesn’t matter but regarding
the connectedness of the used Extreme SuperHyperGraph arising from its Extreme properties
taken from the fact that it’s simple. If there’s no more than one Extreme SuperHyperVertex
in the targeted Extreme SuperHyperSet, then there’s no Extreme connection. Furthermore,
the Extreme existence of one Extreme SuperHyperVertex has no Extreme effect to talk about
the Extreme R-Hamiltonian-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-Cut has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Hamiltonian-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-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-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-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-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-Cut. Those Extreme SuperHyperVertices
are potentially included in an Extreme style-R-Hamiltonian-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-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Hamiltonian-Cut but with slightly
differences in the maximum Extreme cardinality amid those Extreme type-SuperHyperSets
of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z
and

E
is formalized with mathematical literatures on the Extreme R-Hamiltonian-Cut. Let Zi ∼ Zj ,
be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2140
Extreme R-Hamiltonian-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2141
Extreme R-Hamiltonian-Cut =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Hamiltonian-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-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-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cut is at least 2142
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2143
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2144
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2145
SuperHyperVertices are renamed to Extreme Hamiltonian-Cut in some cases but the maximum 2146
number of the Extreme SuperHyperEdge with the maximum Extreme number of Extreme 2147
SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme R- 2148
Hamiltonian-Cut. 2149
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2150
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2151
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2152
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2153
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2154
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2155
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2156
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2157
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2158
Thus it forms an Extreme quasi-R-Hamiltonian-Cut where the Extreme completion of the 2159
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Hamiltonian- 2160
Cut. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. 2161

In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2162
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2163
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2164
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2165
Extreme style of the embedded Extreme R-Hamiltonian-Cut. The interior types of the Extreme 2166
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2167
affected by the interior Extreme SuperHyperVertices. The common connections, more precise 2168
and more formal, the perfect unique connections inside the Extreme SuperHyperSet for any 2169
distinct types of Extreme SuperHyperVertices pose the Extreme R-Hamiltonian-Cut. Thus 2170
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge and 2171
in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that Extreme 2172
SuperHyperEdge. In the embedded Extreme Hamiltonian-Cut, there’s the usage of exterior 2173
Extreme SuperHyperVertices since they’ve more connections inside more than outside. Thus the 2174
title “exterior” is more relevant than the title “interior”. One Extreme SuperHyperVertex has no 2175
connection, inside. Thus, the Extreme SuperHyperSet of the Extreme SuperHyperVertices with 2176
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 2177
the Extreme R-Hamiltonian-Cut. The Extreme R-Hamiltonian-Cut with the exclusion of the 2178
exclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other 2179
terms, the Extreme R-Hamiltonian-Cut with the inclusion of all Extreme SuperHyperVertices 2180
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Cut. To sum them 2181
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2182
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2183
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian-Cut 2184
minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other words, 2185
there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2186
Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cut, minus all Extreme 2187
SuperHypeNeighbor to some of them but not all of them. 2188
The main definition of the Extreme R-Hamiltonian-Cut has two titles. an Extreme quasi-R- 2189
Hamiltonian-Cut and its corresponded quasi-maximum Extreme R-SuperHyperCardinality are 2190
two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme quasi-R- 2191
Hamiltonian-Cut with that quasi-maximum Extreme SuperHyperCardinality in the terms of the 2192
embedded Extreme SuperHyperGraph. If there’s an embedded Extreme SuperHyperGraph, then 2193
the Extreme quasi-SuperHyperNotions lead us to take the collection of all the Extreme quasi- 2194
R-Hamiltonian-Cuts for all Extreme numbers less than its Extreme corresponded maximum 2195
number. The essence of the Extreme Hamiltonian-Cut ends up but this essence starts up in the 2196
terms of the Extreme quasi-R-Hamiltonian-Cut, again and more in the operations of collecting 2197
all the Extreme quasi-R-Hamiltonian-Cuts acted on the all possible used formations of the 2198
Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2199
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cuts. Let 2200
zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Cut be an Extreme number, an 2201
Extreme SuperHyperSet and an Extreme Hamiltonian-Cut. Then 2202
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Cut ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.

As its consequences, the formal definition of the Extreme Hamiltonian-Cut is re-formalized and 2203
redefined as follows. 2204
GExtreme Hamiltonian-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 2205
definition for the Extreme Hamiltonian-Cut. 2206
GExtreme Hamiltonian-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- 2207
Cut poses the upcoming expressions. 2208
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2209
= maxzExtreme Number

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


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


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

2213
= max zExtreme Number

2214

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2215
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2216
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2217
It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Cut” but, precisely, it’s the gener- 2218
alization of “Extreme Quasi-Hamiltonian-Cut” since “Extreme Quasi-Hamiltonian-Cut” happens 2219
“Extreme Hamiltonian-Cut” in an Extreme SuperHyperGraph as initial framework and back- 2220
ground but “Extreme SuperHyperNeighborhood” may not happens “Extreme Hamiltonian-Cut” 2221
in an Extreme SuperHyperGraph as initial framework and preliminarily background since there 2222
are some ambiguities about the Extreme SuperHyperCardinality arise from it. To get orderly 2223
keywords, the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Hamiltonian-Cut”, 2224

and “Extreme Hamiltonian-Cut” are up. 2225

Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Cut be an Ex- 2226
treme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Cut and 2227
the new terms are up. 2228

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2229
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2230
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2231
And with go back to initial structure, 2232


2233

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

2234
= max zExtreme Number

2235

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

SuperHyperSet of the Extreme SuperHyperVertices,

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


is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cut,

not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2236
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2237
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2238
the 2239
“Extreme R-Hamiltonian-Cut” 2240
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2241
Extreme R-Hamiltonian-Cut, 2242
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-Cut amid those obvious simple Extreme type-SuperHyperSets of the
Extreme Hamiltonian-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-Cut. In other words, the least cardinality, the lower sharp bound
for the cardinality, of an Extreme R-Hamiltonian-Cut is the cardinality of
2243
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2244
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cut if for any of 2245
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2246
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2247
all minus all Extreme SuperHypeNeighbors to any amount of them. 2248

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2249
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2250
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2251
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2252
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2253
R-Hamiltonian-Cut with the least cardinality, the lower sharp Extreme bound for Extreme 2254
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2255
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2256
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2257
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Hamiltonian-Cut. Since 2258
it doesn’t have 2259
2260
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2261

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2262
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2263
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2264
but it isn’t an Extreme R-Hamiltonian-Cut. Since it doesn’t do the Extreme procedure such 2265
that such that there’s an Extreme SuperHyperEdge to have some Extreme SuperHyperVertices 2266
uniquely [there are at least one Extreme SuperHyperVertex outside implying there’s, sometimes 2267
in the connected Extreme SuperHyperGraph ESHG : (V, E), an Extreme SuperHyperVertex, 2268
titled its Extreme SuperHyperNeighbor, to that Extreme SuperHyperVertex in the Extreme 2269
SuperHyperSet S so as S doesn’t do “the Extreme procedure”.]. There’s only one Extreme 2270
SuperHyperVertex outside the intended Extreme SuperHyperSet, VESHE ∪ {z}, in the terms 2271
of Extreme SuperHyperNeighborhood. Thus the obvious Extreme R-Hamiltonian-Cut, VESHE 2272
is up. The obvious simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Cut, 2273
VESHE , is an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices 2274
does forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2275
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2276
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2277
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2278
SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2279

Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Hamiltonian-Cut only contains all 2280
interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices from the 2281
unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme SuperHy- 2282
perNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no exception minus 2283
all Extreme SuperHypeNeighbors to some of them not all of them but everything is possible 2284
about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2285
The SuperHyperNotion, namely, Hamiltonian-Cut, is up. There’s neither empty Supe- 2286
rHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2287
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2288
of the Extreme Hamiltonian-Cut. The Extreme SuperHyperSet of Extreme SuperHy- 2289
perEdges[SuperHyperVertices], 2290
C(N SHG)ExtremeQuasi−Hamiltonian−Cut
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Hamiltonian−CutSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−Cut = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−CutSuperHyperP olynomial = az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cut. The Extreme 2291
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2292
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : 2293

(V, E) is an Extreme type-SuperHyperSet with 2294
2295
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2296
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2297
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2298
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2299
Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Cut is up. The obvious 2300
simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cut is an Extreme Super- 2301
HyperSet includes only two Extreme SuperHyperVertices. But the Extreme SuperHyperSet 2302
of the Extreme SuperHyperEdges[SuperHyperVertices], 2303
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2304
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2305
Cut is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2306
b c
= {E2i−1 }i=1 2
.

= 2z b 2 c
.
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cut. Since 2308
the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2309
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cut C(ESHG) for an Extreme SuperHyperGraph ESHG : (V, E) 2310

is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s no an 2311
Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Extreme type- 2312
SuperHyperSet called the Extreme Hamiltonian-Cut and it’s an Extreme Hamiltonian-Cut. 2313
Since it’s 2314
2315
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2316
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2317
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2318
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2319
intended Extreme SuperHyperSet, 2320
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Thus the non-obvious Extreme Hamiltonian-Cut, 2321
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cut, not: 2322
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Extreme SuperHyperSet, not: 2323
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2324
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2325
SuperHyperSet called the 2326
“Extreme Hamiltonian-Cut” 2327
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2328
Extreme Hamiltonian-Cut, 2329
is only and only 2330
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2331

CHAPTER 11 2332
The Extreme Departures on The 2333
Theoretical Results Toward Theoretical 2334
Motivations 2335
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2336
SuperHyperClasses. 2337
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2338

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

|E |
= {VEi }i=1N SHG .
X
= z |VEi | .
Proof. Let 2339
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2340
P :
E1 , V1EXT ERN AL ,
111
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperHamiltonian-Cut in the Example (42.0.5) 136NSHG18a
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2341
new way to redefine as 2342
ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 2343
ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cut. The latter is straightforward. 2344

2345
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2346
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2347
(31.1), is the SuperHyperHamiltonian-Cut. 2348
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2349

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

|E |
= {VEi }i=1N SHG .
X
= z |VEi | .
Proof. Let 2350
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2351
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 2352

2356
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2357
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2358
SuperHyperModel (31.2), is the Extreme SuperHyperHamiltonian-Cut. 2359

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

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

= {Ei , Ej }i=1,...,|EN SHG | .
= z |Ei | + z |Ej | .
= {VEi , CEN T ER, VEj }.
= z |VEi | + z |VEj | + z |CEN T ER| .
Proof. Let 2361
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2362
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperHamiltonian-Cut in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2363
way to redefine as 2364

2367
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2368
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in 2369
previous Extreme result, of the Extreme SuperHyperVertices of the connected Extreme 2370
SuperHyperStar ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme 2371

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

= {Ei }i=1,...,|PNmin
SHG
|.

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

= {VEi }i=1,...,|PNmin
SHG
|.

X
= z |VEi | .
min
i=1,...,|PN |
SHG
Proof. Let 2374
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
2375
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 2376
a new way to redefine as 2377

Then there’s no at least one SuperHyperHamiltonian-Cut. Thus the notion of quasi may be up 2380
but the SuperHyperNotions based on SuperHyperHamiltonian-Cut could be applied. There are 2381
only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2382
the representative in the 2383
P :

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

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

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2385
SuperHyperPart SuperHyperEdges are attained in any solution 2386
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2387
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2388
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2389
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2390
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2391
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Cut. 2392
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2393

Then 2394

= {Ei }i=1,...,|PNmin
SHG
|.

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

SHG
|.

X
= z |VEi | .
min
i=1,...,|PN |
SHG
Proof. Let 2395
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2396
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperHamiltonian-Cut taken from a connected Extreme SuperHyperMulti- 2397

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


only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 2403
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2405
(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2406
SuperHyperEdges are attained in any solution 2407
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2408
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2410
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2411
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2412
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2413
the Extreme SuperHyperHamiltonian-Cut. 2414
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2415

|E |−1
= {Ei , Ej∗ , Ek∗ }i=1N SHG .

X ∗ ∗
= z |Ei | + z |Ej | + z |Ek | .

|E |
= {VEi , VEj∗ , VEk∗ }i=1N SHG .
X |VE ∗ | |V ∗ |
= z |VEi | + z j + z Ek .
Proof. Let 2416
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2417
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cut taken from a connected Extreme SuperHyperWheel 2418

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

Then there’s at least one SuperHyperHamiltonian-Cut. Thus the notion of quasi isn’t up and 2422
the SuperHyperNotions based on SuperHyperHamiltonian-Cut could be applied. The unique 2423
embedded SuperHyperHamiltonian-Cut proposes some longest SuperHyperHamiltonian-Cut 2424

excerpt from some representatives. The latter is straightforward. 2425
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2426
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2427
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2428
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2429
Extreme SuperHyperHamiltonian-Cut. 2430

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

Extreme SuperHyperHamiltonian-Cut in the Extreme Example (42.0.15) 136NSHG23a

CHAPTER 12 2431
The Surveys of Mathematical Sets On 2432
The Results But As The Initial Motivation 2433
For the SuperHyperHamiltonian-Cut, Extreme SuperHyperHamiltonian-Cut, and the Extreme 2434

SuperHyperHamiltonian-Cut, some general results are introduced. 2435
Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Cut is “redefined” on 2436
the positions of the alphabets. 2437
Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Cut. Then 2438
Extreme SuperHyperHamiltonian − Cut =

{theSuperHyperHamiltonian − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cut
|ExtremecardinalityamidthoseSuperHyperHamiltonian−Cut. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2439
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2440
and the neutrality, for i = 1, 2, 3, respectively. 2441
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2442
alphabet. Then the notion of Extreme SuperHyperHamiltonian-Cut and SuperHyperHamiltonian- 2443
Cut coincide. 2444
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2445
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2446
SuperHyperHamiltonian-Cut if and only if it’s a SuperHyperHamiltonian-Cut. 2447
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2448
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2449
SuperHyperHamiltonian-Cut if and only if it’s a longest SuperHyperHamiltonian-Cut. 2450
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2451
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cut is its 2452
SuperHyperHamiltonian-Cut and reversely. 2453
123
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cut, Supe- 2454

rHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2455
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cut is its 2456
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme 2458

SuperHyperHamiltonian-Cut isn’t well-defined if and only if its SuperHyperHamiltonian-Cut 2459
isn’t well-defined. 2460
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2461

Extreme SuperHyperHamiltonian-Cut isn’t well-defined if and only if its SuperHyperHamiltonian- 2462
Cut isn’t well-defined. 2463
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cut, Super- 2464

HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2465
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme 2468

SuperHyperHamiltonian-Cut is well-defined if and only if its SuperHyperHamiltonian-Cut is 2469
well-defined. 2470
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2471
Extreme SuperHyperHamiltonian-Cut is well-defined if and only if its SuperHyperHamiltonian- 2472

Cut is well-defined. 2473
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cut, Super- 2474
HyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme 2475

well-defined. 2477
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2478
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2479
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2480
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2481
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2482
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2483
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut. 2484
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2485
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cut; 2486
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cut; 2487
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cut; 2488
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2489

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2490
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cut. 2491
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2492

independent SuperHyperSet is 2493
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cut; 2496
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2500

which is a SuperHyperHamiltonian-Cut/SuperHyperPath. Then V is a maximal 2501
(i) : SuperHyperDefensive SuperHyperHamiltonian-Cut; 2502
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cut; 2503
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cut; 2504
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2505
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2506
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2507
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2508
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2509
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2510
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2511
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2512
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2513
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2514
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2515
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2516
which is a SuperHyperHamiltonian-Cut/SuperHyperPath. Then the number of 2519

(i) : the SuperHyperHamiltonian-Cut; 2520
(ii) : the SuperHyperHamiltonian-Cut; 2521
(iii) : the connected SuperHyperHamiltonian-Cut; 2522
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cut; 2523
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cut; 2524
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cut. 2525
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2526
coincide. 2527

which is a SuperHyperWheel. Then the number of 2529
(i) : the dual SuperHyperHamiltonian-Cut; 2530
(ii) : the dual SuperHyperHamiltonian-Cut; 2531
(iii) : the dual connected SuperHyperHamiltonian-Cut; 2532
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cut; 2533
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cut; 2534
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cut. 2535
coincide. 2537

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2539
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2540
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2541
is a 2542
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2546
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2547
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cut. 2548


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2551
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2552
SuperHyperPart is a 2553
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2557
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2558
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cut. 2559

SuperHyperMultipartite. Then Then the number of 2562
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2569
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2570
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2572
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2573
(iv) : SuperHyperHamiltonian-Cut; 2577
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2578
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Cut. 2579

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2580
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2581
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2582
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2583

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2584
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2588
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cut. 2590
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2591
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2592
dual 2593
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2597
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2600
perComplete. Then there’s no independent SuperHyperSet. 2601
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2602

SuperHyperHamiltonian-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2603
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2604
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2608
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut; 2609
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut. 2610

Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2611
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2612
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2613
t>
2
setting of a dual 2614


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2621
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2622
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2623
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2624
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2625
SuperHyperDefensive SuperHyperHamiltonian-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 2626
(i) v ∈ Ns (x); 2627
(ii) vx ∈ E. 2628
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2629
SuperHyperDefensive SuperHyperHamiltonian-Cut, then 2630
(i) S is SuperHyperHamiltonian-Cut set; 2631
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2632
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2633
(i) Γ ≤ O; 2634
(ii) Γs ≤ On . 2635
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2636
connected. Then 2637
(i) Γ ≤ O − 1; 2638
(ii) Γs ≤ On − Σ3i=1 σi (x). 2639
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2640
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2641

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2643
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2644
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2645
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2647
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 2648
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2649
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2650
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2651
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cut. Then 2653
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2664
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2665
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2667
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cut; 2668
(ii) Γ = 1; 2669
(iii) Γs = Σ3i=1 σi (c); 2670
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cut. 2671
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2672

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2673
SuperHyperDefensive SuperHyperHamiltonian-Cut; 2674
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2675
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2676
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2677
SuperHyperDefensive SuperHyperHamiltonian-Cut. 2678
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2679
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2680
Cut; 2681
(ii) Γ = b n2 c + 1; 2682
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2683
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian-
2684
Cut. 2685
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2686
bnc
2
Cut; 2688
(ii) Γ = b n2 c; 2689

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

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

2695
Cut for N SHF; 2696
(ii) Γ = m for N SHF : (V, E); 2697
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2698
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2699
Cut for N SHF : (V, E). 2700
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2701
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2702

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 2703
SuperHyperHamiltonian-Cut for N SHF; 2704
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2705

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2710
bnc
2
Cut for N SHF : (V, E); 2712
(ii) Γ = b n2 c for N SHF : (V, E); 2713

bnc for N SHF : (V, E); 2714
S={vi }i=1
bnc
2
are only dual maximal SuperHyperHamiltonian-Cut for 2715
N SHF : (V, E). 2716
following statements hold; 2718
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2719

SuperHyperHamiltonian-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 2720
Cut; 2721
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2722

SuperHyperHamiltonian-Cut, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
2723
Cut. 2724
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2727
SuperHyperHamiltonian-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 2728

Cut; 2729

SuperHyperHamiltonian-Cut, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-2731
Cut. 2732
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2733

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

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

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

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

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

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

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

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

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


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

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


SuperHyperGraph which is SuperHyperHamiltonian-Cut. Then following statements hold; 2774
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 2775
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2777

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

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


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

(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, 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 2-SuperHyperDefensive 2789

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


CHAPTER 13 2793
Extreme Applications in Cancer’s 2794
Extreme Recognition 2795
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2796
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2797
as the consequences of the model, some parameters are used. The cells are under attack of this 2798
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2799
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2800
In the following, some Extreme steps are Extreme devised on this disease. 2801
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2802
function. 2803
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2804
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2805
effects of the cancer on that region; this event leads us to choose another model [it’s said 2808
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2809
what’s done. 2810
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known 2811
and they’ve got the names, and some general Extreme models. The moves and the 2812
Extreme traces of the cancer on the complex tracks and between complicated groups 2813
of cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian- 2814
Cut, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 2815
The aim is to find either the Extreme SuperHyperHamiltonian-Cut or the Extreme 2816
SuperHyperHamiltonian-Cut in those Extreme Extreme SuperHyperModels. 2817
135
CHAPTER 14 2818
Case 1: The Initial Extreme Steps 2819
Toward Extreme SuperHyperBipartite 2820
as Extreme SuperHyperModel 2821
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2822
is Extreme highlighted and Extreme featured. 2823
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2824
partite is obtained. 2825
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2826
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Cut 136NSHGaa21aa
137
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 2830
Case 2: The Increasing Extreme Steps 2831
Toward Extreme 2832
SuperHyperMultipartite as Extreme 2833
SuperHyperModel 2834
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2835
ite is Extreme highlighted and Extreme featured. 2836
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2837
partite is obtained. 2838
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2839
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- 2840

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

CHAPTER 16 2843
Wondering Open Problems But As The 2844
Directions To Forming The Motivations 2845
In what follows, some “problems” and some “questions” are proposed. 2846
The SuperHyperHamiltonian-Cut and the Extreme SuperHyperHamiltonian-Cut are defined on 2847
a real-world application, titled “Cancer’s Recognitions”. 2848
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2849
recognitions? 2850
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cut 2851

and the Extreme SuperHyperHamiltonian-Cut? 2852
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2853
them? 2854
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian-2855
Cut and the Extreme SuperHyperHamiltonian-Cut? 2856
Problem 16.0.5. The SuperHyperHamiltonian-Cut and the Extreme SuperHyperHamiltonian- 2857

Cut do a SuperHyperModel for the Cancer’s recognitions and they’re based on 2858
SuperHyperHamiltonian-Cut, are there else? 2859
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2860
Numbers types-results? 2861
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2862
the multiple types of SuperHyperNotions? 2863
141
CHAPTER 17 2864
Conclusion and Closing Remarks 2865
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2866
research are illustrated. Some benefits and some advantages of this research are highlighted. 2867
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2868
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cut. For 2869
that sake in the second definition, the main definition of the Extreme SuperHyperGraph 2870
is redefined on the position of the alphabets. Based on the new definition for the 2871
Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian- 2872
Cut, finds the convenient background to implement some results based on that. Some 2873
SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research on 2874
the modeling of the regions where are under the attacks of the cancer to recognize this 2875
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 2876
on the SuperHyperNotion, SuperHyperHamiltonian-Cut, the new SuperHyperClasses and 2877
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 2878
SuperHyperHamiltonian-Cut and the Extreme SuperHyperHamiltonian-Cut. The clarifications, 2879

instances and literature reviews have taken the whole way through. In this research, the literature 2880
reviews have fulfilled the lines containing the notions and the results. The SuperHyperGraph 2881
and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 2882
both bases are the background of this research. Sometimes the cancer has been happened on the 2883
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 2884
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 2885
longest and strongest styles with the formation of the design and the architecture are formally 2886
called “ SuperHyperHamiltonian-Cut” in the themes of jargons and buzzwords. The prefix 2887
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 2888
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 2889
pointed out and spoken out. 2890
143
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cut
3. Extreme SuperHyperHamiltonian-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 2891
Extreme SuperHyperDuality But As The 2892
Extensions Excerpt From Dense And 2893
Super Forms 2894
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2895

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

Va ∈ Ei , Ej ; 2899
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2900
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2901
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2902
Vi , Vj ∈ Ea ; 2903
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2904
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2905
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2906
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2907

SuperHyperDuality. 2908
Definition 18.0.2. ((Extreme) SuperHyperDuality). 2909

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2914
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2915
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 2916
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2917
Extreme SuperHyperDuality; 2918
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 2919

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 2920
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2921
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 2922
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2923
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2924
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2925

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 2926
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 2927
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 2930
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 2931
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 2932
coefficient; 2933
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2934

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 2957
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 2958
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2959
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2960
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2961

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 2962

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 2970
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2971
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 2972
to its Extreme coefficient. 2973
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 2974
mentioned Extreme Figures in every Extreme items. 2975
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 2976
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 2977
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 2978
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2979
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2980
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- 2984
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 2985
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2986
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2987
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 2988
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 2989
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 2990


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

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 3034
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3

ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3038
(31.1), is the SuperHyperDuality. 3041
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 3043
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 3058
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 3059
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3060
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 3062
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded 3065
to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3066
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3067
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3068
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3069
representative in the 3070
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 : 3071

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3083

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3087
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3088
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. 3100
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 3102
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 : 3103

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

∃!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 3108
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3109
Extreme SuperHyperDuality. 3115

CHAPTER 19 3116
Extreme SuperHyperJoin But As The 3117
Super Forms 3119
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3120

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3131
|Vj |NEUTROSOPIC CARDINALITY ; 3132
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3133
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3134
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3135

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3139
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3141
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3142
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3143
159
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3144

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3151
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3152
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3153
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3154
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3155
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3157
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3158

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


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

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3176
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3177
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3178
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3179
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3180

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3183

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

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

SuperHyperJoin. 3204
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 3206
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3207
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3208
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3209
V3 , is excluded in every given Extreme SuperHyperJoin. 3211

is up. The Extreme Algorithm is Extremely straightforward. 3213


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3334
Extreme SuperHyperPerfect But As The 3335
Super Forms 3337
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3338

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3350
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3351

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3355
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3356
Extreme SuperHyperPerfect; 3360
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3361

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3368
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3369
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3374
coefficient; 3375
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3376

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3412
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3413
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3414
to its Extreme coefficient. 3415
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3418
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3419
SuperHyperPerfect. 3425
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 3427
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3428
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3432


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

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

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

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

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



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

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

Then 3523

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3528
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3529
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3530
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. 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

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


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

CHAPTER 21 3558
Extreme SuperHyperTotal But As The 3559
Super Forms 3561
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3562
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3565
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3566

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3572
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3573

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3577
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3579
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3580
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3581
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3582

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3589
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3590
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3591
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3592
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3593
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3594
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3595
cient; 3596
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3597

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3598
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3600
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3601
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3602

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

the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3610
SuperHyperTotal; 3612
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3613

Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 3616
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3618
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3619

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3620
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3621
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3625
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3626
Extreme coefficient; 3627

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3629
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3631
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3632
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3633
cient. 3636
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3639
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3640
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3641
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3642
SuperHyperTotal. 3646
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 3648
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3649
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3650
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3651

V3 , is excluded in every given Extreme SuperHyperTotal. 3653



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3701
(31.1), is the SuperHyperTotal. 3704
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 3706
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. 3713
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 3715
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3777
Extreme SuperHyperConnected But As 3778
The Extensions Excerpt From Dense And 3779
Super Forms 3780
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3781

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3795
SuperHyperConnected. 3796
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3797
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3800

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

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3809
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3810
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3811
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3812
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3813

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3814
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3815
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3816
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3817
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3818
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3819
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3820
power is corresponded to its Extreme coefficient; 3821
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3822


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

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

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

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

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

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

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

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

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


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

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

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 3922
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. 3926
(31.1), is the SuperHyperConnected. 3929
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 3931
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. 3938
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 3940



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 3959

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


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

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



to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 3994
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 3995
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 3996
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 3997
some representatives. The latter is straightforward. 3998
Extreme SuperHyperConnected. 4003

CHAPTER 23 4004
Background 4005
215










in Scribd. 4162



Bibliography 4193
10.33140/JMTCM.01.03.09) 4200
221
10.20944/preprints202301.0282.v1). 4228
10.20944/preprints202301.0267.v1). 4231

(doi: 10.20944/preprints202301.0265.v1). 4236
prints202301.0262.v1). 4240
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4246
prints202301.0105.v1). 4249
Preprints 2023, 2023010044 4255
10.20944/preprints202301.0043.v1). 4258

(doi: 10.20944/preprints202212.0549.v1). 4267
(doi: 10.20944/preprints202212.0500.v1). 4274
10.5281/zenodo.7781476). 4283
10.5281/zenodo.7783082). 4286

10.5281/zenodo.7777857). 4289
10.5281/zenodo.7779286). 4292
(doi: 10.5281/zenodo.7771831). 4295
2023, (doi: 10.5281/zenodo.7772468). 4298

10.13140/RG.2.2.20913.25446). 4301
10.5281/zenodo.7764916). 4304
10.13140/RG.2.2.11770.98247). 4307
10.13140/RG.2.2.12400.12808). 4310
2023, (doi: 10.13140/RG.2.2.22545.10089). 4313
10.13140/RG.2.2.11377.76644). 4319
10.13140/RG.2.2.23750.96329). 4322
10.13140/RG.2.2.31366.24641). 4325
10.13140/RG.2.2.34721.68960). 4328
10.13140/RG.2.2.24288.35842). 4337

10.13140/RG.2.2.32467.25124). 4340
10.13140/RG.2.2.31025.45925). 4343
10.13140/RG.2.2.17184.25602). 4346
10.13140/RG.2.2.23423.28327). 4349
10.13140/RG.2.2.28456.44805). 4352
10.13140/RG.2.2.23525.68320). 4355
10.13140/RG.2.2.20170.24000). 4358
10.13140/RG.2.2.36475.59683). 4361
10.13140/RG.2.2.29764.71046). 4364
2023, (doi: 10.13140/RG.2.2.18780.87683). 4367
10.13140/RG.2.2.26134.01603). 4373
10.13140/RG.2.2.27392.30721). 4376

10.13140/RG.2.2.33028.40321). 4379
10.13140/RG.2.2.21389.20966). 4382
10.13140/RG.2.2.16356.04489). 4385
10.13140/RG.2.2.21756.21129). 4388
10.13140/RG.2.2.30983.68009). 4391
10.13140/RG.2.2.28552.29445). 4394
10.13140/RG.2.2.35105.89447). 4400
(doi: 10.13140/RG.2.2.30072.72960). 4403
10.13140/RG.2.2.31147.52003). 4406
10.13140/RG.2.2.32825.24163). 4409
10.13140/RG.2.2.13059.58401). 4412
10.13140/RG.2.2.11172.14720). 4415

2023, (doi: 10.13140/RG.2.2.22011.80165). 4418
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4421
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4427
2023, (doi: 10.13140/RG.2.2.19944.14086). 4430
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4433
(doi: 10.13140/RG.2.2.33103.76968). 4436
2023, (doi: 10.13140/RG.2.2.23037.44003). 4439
(doi: 10.13140/RG.2.2.35646.56641). 4442
(doi: 10.13140/RG.2.2.18030.48967). 4445
(doi: 10.13140/RG.2.2.13973.81121). 4448
2023, (doi: 10.13140/RG.2.2.34106.47047). 4451

2023, (doi: 10.13140/RG.2.2.31956.88961). 4457
2023, (doi: 10.13140/RG.2.2.15179.67361). 4460
10.13140/RG.2.2.21510.45125). 4463
2023, (doi: 10.13140/RG.2.2.13121.84321). 4466
10.13140/RG.2.2.11758.69441). 4469
2023, (doi: 10.13140/RG.2.2.31891.35367). 4472
10.13140/RG.2.2.19360.87048). 4475
2023, (doi: 10.13140/RG.2.2.32363.21286). 4478
(doi: 10.13140/RG.2.2.23266.81602). 4481
10.13140/RG.2.2.19911.37285). 4484
10.13140/RG.2.2.11050.90569). 4487

(doi: 10.13140/RG.2.2.30182.50241). 4499
2023, (doi: 10.13140/RG.2.2.17252.24968). 4532


2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 4541

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



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

10.20944/preprints202301.0282.v1). 4565
10.20944/preprints202301.0267.v1).). 4568


2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4573
prints202301.0262.v1). 4577

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

10.13140/RG.2.2.35061.65767). 4586
10.13140/RG.2.2.18494.15680). 4590
10.13140/RG.2.2.32530.73922). 4594
10.13140/RG.2.2.15897.70243). 4598

10.13140/RG.2.2.32530.73922). 4602
prints202301.0105.v1). 4605

10.13140/RG.2.2.23172.19849). 4612
10.13140/RG.2.2.17385.36968). 4622
(doi: 10.20944/preprints202301.0043.v1). 4628

2023, (doi: 10.13140/RG.2.2.28945.92007). 4631
10.13140/RG.2.2.35774.77123). 4637

10.13140/RG.2.2.29430.88642). 4643

(doi: 10.20944/preprints202212.0549.v1). 4649

10.13140/RG.2.2.19380.94084). 4652
(doi: 10.20944/preprints202212.0500.v1). 4663
10.13140/RG.2.2.20993.12640). 4666




10.13140/RG.2.2.29173.86244). 4681

10.5281/zenodo.7783791). 4686
10.5281/zenodo.7780123). 4688
(doi: 10.5281/zenodo.7773119). 4690
odo.7637762). 4692
10.5281/zenodo.7766174). 4694
10.5281/zenodo.7762232). 4696
(doi: 10.5281/zenodo.7758601). 4698
10.5281/zenodo.7754661). 4700
10.5281/zenodo.7750995) . 4702
(doi: 10.5281/zenodo.7749875). 4704
10.5281/zenodo.7747236). 4706
10.5281/zenodo.7742587). 4708
(doi: 10.5281/zenodo.7738635). 4710
10.5281/zenodo.7734719). 4712
10.5281/zenodo.7730484). 4714
(doi: 10.5281/zenodo.7730469). 4716
10.5281/zenodo.7722865). 4718
odo.7713563). 4720

odo.7709116). 4722
10.5281/zenodo.7706415). 4724
(doi: 10.5281/zenodo.7706063). 4726
(doi: 10.5281/zenodo.7701906). 4728
odo.7700205). 4730
10.5281/zenodo.7694876). 4732
10.5281/zenodo.7679410). 4734
10.5281/zenodo.7675982). 4736
10.5281/zenodo.7672388). 4738
odo.7668648). 4740
10.5281/zenodo.7662810). 4742
10.5281/zenodo.7659162). 4744
odo.7653233). 4746
odo.7653204). 4748
odo.7653142). 4750
odo.7653117). 4752
odo.7653089). 4754
odo.7651687). 4756

odo.7651619). 4758
odo.7651439). 4760
odo.7650729). 4762
odo.7647868). 4764
odo.7647017). 4766
odo.7644894). 4768
odo.7641880). 4770
odo.7632923). 4772
odo.7623459). 4774
10.5281/zenodo.7606416). 4776
10.5281/zenodo.7606416). 4778
odo.7606404). 4780
10.5281/zenodo.7580018). 4782
odo.7580018). 4784
odo.7580018). 4786
odo.7579929). 4788
10.5281/zenodo.7563170). 4790
odo.7563164). 4792

odo.7563160). 4794
odo.7563160). 4796
10.5281/zenodo.7563160). 4798
10.5281/zenodo.7557063). 4800
10.5281/zenodo.7557009). 4802
10.5281/zenodo.7539484). 4804
10.5281/zenodo.7523390). 4806
10.5281/zenodo.7523390). 4808
10.5281/zenodo.7523390). 4810
odo.7574952). 4812
10.5281/zenodo.7574992). 4814
odo.7523357). 4816
10.5281/zenodo.7523357). 4818
10.5281/zenodo.7504782). 4820
10.5281/zenodo.7504782). 4822
10.5281/zenodo.7504782). 4824
10.5281/zenodo.7499395). 4826
odo.7499395). 4828

10.5281/zenodo.7499395). 4830
10.5281/zenodo.7497450). 4832
10.5281/zenodo.7497450). 4834
10.5281/zenodo.7494862). 4836
odo.7494862). 4838
10.5281/zenodo.7494862). 4840
10.5281/zenodo.7493845). 4842
10.5281/zenodo.7493845). 4844
10.5281/zenodo.7493845). 4846
odo.7539484). 4848
odo.7523390). 4850
odo.7523357). 4852
odo.7504782). 4854
odo.7499395). 4856
odo.7497450). 4858
odo.7494862). 4860
odo.7493845). 4862
odo.7480110). 4864

odo.7378758). 4866
odo.6320305). 4868
odo.6677173). 4870

CHAPTER 24 4871
Cancer In Neutrosophic 4872
SuperHyperGraph 4873
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 4874
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 4875
disease is considered and as the consequences of the model, some parameters are used. The cells 4876
are under attack of this disease but the moves of the cancer in the special region are the matter 4877
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 4878
treatments for this Neutrosophic disease. 4879
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 4880
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 4881
term Neutrosophic function. 4882
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 4883
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 4884
move from the cancer is identified by this research. Sometimes the move of the cancer 4885
about the moves and the effects of the cancer on that region; this event leads us to 4887
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 4888
perception on what’s happened and what’s done. 4889
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 4890
known and they’ve got the names, and some general Neutrosophic models. The moves 4891
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 4892
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 4893
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 4894
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 4895
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 4896
Models. 4897
Some cells have been faced with some attacks from the situation which is caused by the 4898
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 4899
which in that, the cells could be labelled as some groups and some groups or individuals have 4900
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 4901
the embedded situations, the individuals of cells and the groups of cells could be considered 4902
241
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 4903
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 4904
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 4905
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 4906
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 4907
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 4908
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 4909
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 4910
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 4911
imprecise data, and uncertain analysis. The latter model could be considered on the previous 4912
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 4913
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 4914
out what’s going on this phenomenon. The special case of this disease is considered and as the 4915
consequences of the model, some parameters are used. The cells are under attack of this disease 4916
but the moves of the cancer in the special region are the matter of mind. The recognition of 4917
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 4918
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 4919
both bases are the background of this research. Sometimes the cancer has been happened on the 4920
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 4921
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 4922
in the forms of alliances’ styles with the formation of the design and the architecture are 4923
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 4924
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 4925
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 4926
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 4927
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 4928
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 4929
and the effects of the cancer on that region; this event leads us to choose another model [it’s 4930
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 4931
and what’s done. There are some specific models, which are well-known and they’ve got the 4932
names, and some general models. The moves and the traces of the cancer on the complex tracks 4933
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 4934
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 4935
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 4936
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 4937
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 4938
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 4939
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 4940
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 4941
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 4942
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 4944
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 4945
based on the fixed groups of cells or the fixed groups of group of cells? 4946
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 4947

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 4951
Then the research has taken more motivations to define SuperHyperClasses and to find some 4952
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 4953
some instances and examples to make clarifications about the framework of this research. The 4954
general results and some results about some connections are some avenues to make key point of 4955
this research, “Cancer’s Recognition”, more understandable and more clear. 4956
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 4957
research on the modeling of the regions where are under the attacks of the cancer to 4958
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 4959
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 4960
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 4961
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 4962

instances and literature reviews have taken the whole way through. In this scientific research, 4963
the literature reviews have fulfilled the lines containing the notions and the results. The 4964
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 4965
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 4966
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 4967
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 4968
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 4969
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 4970
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 4971
to figure out the background for the SuperHyperNotions. 4972

CHAPTER 25 4973
Neutrosophic Hamiltonian-Cut 4974
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 4975
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 4976
2023, (doi: 10.13140/RG.2.2.34953.52320). 4977

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 4978
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 4979
(doi: 10.13140/RG.2.2.33275.80161). 4980
10.13140/RG.2.2.11050.90569). 4983
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 4984
10.13140/RG.2.2.17761.79206). 4986
10.13140/RG.2.2.19911.37285). 4989
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 4990
10.13140/RG.2.2.23266.81602). 4992
10.13140/RG.2.2.19360.87048). 4995
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4996
10.13140/RG.2.2.32363.21286). 4998
10.13140/RG.2.2.11758.69441). 5001
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5002
10.13140/RG.2.2.31891.35367). 5004
10.13140/RG.2.2.21510.45125). 5007
245
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5008
10.13140/RG.2.2.13121.84321). 5010

CHAPTER 26 5011
New Ideas In Recognition of Cancer And 5012
Neutrosophic SuperHyperGraph By 5013
Hamiltonian-Cut As Hyper Hamper On 5014
Super Hammy 5015
247
CHAPTER 27 5016
ABSTRACT 5017
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5018

Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cut 5019
pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 5020
E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-SuperHyperHamiltonian- 5021
Cut if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cut criteria 5022
holds 5023
Neutrosophic re-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic 5024

e-SuperHyperHamiltonian-Cut criteria holds 5025
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic 5026

v-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic v- 5027
SuperHyperHamiltonian-Cut criteria holds 5028
Neutrosophic rv-SuperHyperHamiltonian-Cut if the following expression is called Neutrosophic 5029

v-SuperHyperHamiltonian-Cut criteria holds 5030
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5031

SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, 5032
Neutrosophic re-SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, 5033
and Neutrosophic rv-SuperHyperHamiltonian-Cut. ((Neutrosophic) SuperHyperHamiltonian- 5034

Cut). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 5035
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 5036
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 5040
249
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme se- 5041
quence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 5042
Extreme SuperHyperHamiltonian-Cut; a Neutrosophic SuperHyperHamiltonian-Cut if it’s either 5043
of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, 5044
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 5047

high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutro- 5048
an Extreme SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either of Neutrosophic 5050

cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5055
such that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power 5057
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cut 5058
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neut- 5059

Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for a Neutrosophic SuperHyper- 5061
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5062
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality 5063
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neut- 5064
rosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5065

SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cut; 5066
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme V- 5067
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 5071
treme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 5072
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 5073
SuperHyperHamiltonian-Cut; a Neutrosophic V-SuperHyperHamiltonian-Cut if it’s either of 5074
Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, 5075

sophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 5078
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutro- 5079
an Extreme V-SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either of Neutrosophic 5081

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


such that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is 5088
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cut Super- 5089
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic 5090
re-SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and Neutro- 5091
sophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for a Neutrosophic SuperHyperGraph 5092
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 5093
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5094
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5095
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 5096
tices such that they form the Neutrosophic SuperHyperHamiltonian-Cut; and the Neutrosophic 5097
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 5098
introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Cut and Neutro- 5099

sophic SuperHyperHamiltonian-Cut. Two different types of SuperHyperDefinitions are debut 5100
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5101
Recognition” are the under research to figure out the challenges make sense about ongoing and 5108
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 5109
different types of them. Some of them are individuals and some of them are well-modeled by 5110
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5111
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 5112
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5113
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5114
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5115
research. It’s also officially collected in the form of some questions and some problems. Assume 5116
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cut 5117

S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cut is a maximal 5122

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 5123
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 5124
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5125
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 5126
holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 5127
if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 5128

version of a SuperHyperHamiltonian-Cut . Since there’s more ways to get type-results 5129
to make a SuperHyperHamiltonian-Cut more understandable. For the sake of having 5130
Neutrosophic SuperHyperHamiltonian-Cut, there’s a need to “redefine” the notion of a 5131
“SuperHyperHamiltonian-Cut ”. The SuperHyperVertices and the SuperHyperEdges are as- 5132

signed by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5133
position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cut . It’s redefined 5134
a Neutrosophic SuperHyperHamiltonian-Cut if the mentioned Table holds, concerning, “The 5135
Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The 5136
Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Num- 5137
ber of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 5138
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 5139
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 5140
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to 5141
introduce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperHamiltonian- 5142
Cut . It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 5143
kind of SuperHyperClass. If there’s a need to have all SuperHyperHamiltonian-Cut until 5144
the SuperHyperHamiltonian-Cut, then it’s officially called a “SuperHyperHamiltonian-Cut” 5145

but otherwise, it isn’t a SuperHyperHamiltonian-Cut . There are some instances about the 5146
clarifications for the main definition titled a “SuperHyperHamiltonian-Cut ”. These two 5147
examples get more scrutiny and discernment since there are characterized in the disciplinary 5148
ways of the SuperHyperClass based on a SuperHyperHamiltonian-Cut . For the sake of having 5149
a Neutrosophic SuperHyperHamiltonian-Cut, there’s a need to “redefine” the notion of a 5150
“Neutrosophic SuperHyperHamiltonian-Cut” and a “Neutrosophic SuperHyperHamiltonian-Cut 5151

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5152
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 5153
values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 5154
Graph” if the intended Table holds. And a SuperHyperHamiltonian-Cut are redefined to a 5155
“Neutrosophic SuperHyperHamiltonian-Cut” if the intended Table holds. It’s useful to define 5156
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic type- 5157
results to make a Neutrosophic SuperHyperHamiltonian-Cut more understandable. Assume 5158
a Neutrosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the 5159
intended Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cut, SuperHyperStar, 5160
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cut”, “Neutrosophic SuperHyper- 5162
Star”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 5163

“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 5164
“Neutrosophic SuperHyperHamiltonian-Cut” where it’s the strongest [the maximum Neutro- 5165
sophic value from all the SuperHyperHamiltonian-Cut amid the maximum value amid all 5166
SuperHyperVertices from a SuperHyperHamiltonian-Cut .] SuperHyperHamiltonian-Cut . A 5167
graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of 5168

SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There are some 5169
SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection 5170
amid two given SuperHyperEdges with two exceptions; it’s SuperHyperHamiltonian-Cut if it’s 5171
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5172
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5173
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 5175
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5177
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5178

has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5179
the specific designs and the specific architectures. The SuperHyperModel is officially called 5180
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5181
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 5182
and the common and intended properties between “specific” cells and “specific group” of 5183
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 5184
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 5185
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 5186
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 5187
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 5188
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 5189
of the move from the cancer is identified by this research. Sometimes the move of the cancer 5190
the traces of the cancer on the complex tracks and between complicated groups of cells could be 5196
fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cut, SuperHyperStar, 5197

the longest SuperHyperHamiltonian-Cut or the strongest SuperHyperHamiltonian-Cut in 5199
those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cut, called 5200
SuperHyperHamiltonian-Cut, and the strongest SuperHyperHamiltonian-Cut, called Neut- 5201
rosophic SuperHyperHamiltonian-Cut, some general results are introduced. Beyond that in 5202
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 5203
enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5204
SuperHyperHamiltonian-Cut. There isn’t any formation of any SuperHyperHamiltonian-Cut 5205
and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Cut 5207
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5208
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cut, Cancer’s Neutro- 5209
sophic Recognition 5210

CHAPTER 28 5212
Applied Notions Under The Scrutiny Of 5213
The Motivation Of This Scientific 5214
Research 5215
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5216
try to bring the motivations in the narrative ways. Some cells have been faced with some 5217
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5218
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5219
as some groups and some groups or individuals have excessive labels which all are raised from 5220
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5221
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5222
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5223
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5224
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5225
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5226
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5227
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5228
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5229
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5230
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5231
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5232
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5233
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5234
case of this disease is considered and as the consequences of the model, some parameters are used. 5235
The cells are under attack of this disease but the moves of the cancer in the special region are the 5236
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5237
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5238
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5239
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5240
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 5241
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5242
the architecture are formally called “ SuperHyperHamiltonian-Cut” in the themes of jargons 5243
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5244
255
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5245
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5246
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5247
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5248
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5249
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5250
perception on what’s happened and what’s done. There are some specific models, which 5251
are well-known and they’ve got the names, and some general models. The moves and the 5252
traces of the cancer on the complex tracks and between complicated groups of cells could be 5253
fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian-Cut, SuperHyperStar, 5254
the optimal SuperHyperHamiltonian-Cut or the Neutrosophic SuperHyperHamiltonian-Cut in 5256
those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 5257
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 5258
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 5259
a SuperHyperHamiltonian-Cut. There isn’t any formation of any SuperHyperHamiltonian-Cut 5260
and it doesn’t form. 5262
amount of SuperHyperHamiltonian-Cut” of either individual of cells or the groups of cells based 5264
on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 5265
Cut” based on the fixed groups of cells or the fixed groups of group of cells? 5266
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5267
these messy and dense SuperHyperModels where embedded notions are illustrated? 5268
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5269
it motivates us to define different types of “ SuperHyperHamiltonian-Cut” and “Neutrosophic 5270
SuperHyperHamiltonian-Cut” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5271

Then the research has taken more motivations to define SuperHyperClasses and to find some 5272
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5273
some instances and examples to make clarifications about the framework of this research. The 5274
general results and some results about some connections are some avenues to make key point of 5275
this research, “Cancer’s Recognition”, more understandable and more clear. 5276
The framework of this research is as follows. In the beginning, I introduce basic definitions 5277
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5278
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5279
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5280
review literature are applied to make sense about what’s going to figure out about the upcoming 5281
sections. The main definitions and their clarifications alongside some results about new notions, 5282
SuperHyperHamiltonian-Cut and Neutrosophic SuperHyperHamiltonian-Cut, are figured out in 5283

sections “ SuperHyperHamiltonian-Cut” and “Neutrosophic SuperHyperHamiltonian-Cut”. In 5284
the sense of tackling on getting results and in Hamiltonian-Cut to make sense about continuing 5285
the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5286
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5287
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5288
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5289

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5290
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5291
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5292
and as concluding and closing section of theoretical research are contained in the section “General 5293
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5294
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5295
“ SuperHyperHamiltonian-Cut”, “Neutrosophic SuperHyperHamiltonian-Cut”, “Results on 5296

SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are curious 5297
questions about what’s done about the SuperHyperNotions to make sense about excellency of 5298
this research and going to figure out the word “best” as the description and adjective for this 5299
research as presented in section, “ SuperHyperHamiltonian-Cut”. The keyword of this research 5300
debut in the section “Applications in Cancer’s Recognition” with two cases and subsections 5301
“Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The 5302
Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open 5303
Problems”, there are some scrutiny and discernment on what’s done and what’s happened in this 5304
research in the terms of “questions” and “problems” to make sense to figure out this research in 5305
featured style. The advantages and the limitations of this research alongside about what’s done 5306
in this research to make sense and to get sense about what’s figured out are included in the 5307
section, “Conclusion and Closing Remarks”. 5308

CHAPTER 29 5309
Neutrosophic Preliminaries Of This 5310
Scientific Research On the Redeemed 5311
Ways 5312
In this section, the basic material in this scientific research, is referred to [Single Valued 5313
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5314

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5315
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5316
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5317
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5318
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5319
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5320
their clarifications are addressed to Ref.[HG38]. 5321
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5322
the new ideas and their clarifications are elicited. 5323
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a Hamiltonian-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). 5325
where 5327
1, 2, . . . , n0 ); 5332
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5333
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5334

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5363
x, y, z, w ∈ [0, 1]: 5364
(i) 1 ⊗ x = x; 5365
(ii) x ⊗ y = y ⊗ x; 5366
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5367
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5368

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

where 5371

1, 2, . . . , n0 ); 5376
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5377
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5378
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5379
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5380
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5392
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5393
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5394
SuperEdge; 5400
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5403
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5404
makes the patterns and regularities. 5405
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5406
of elements of SuperHyperEdges are the same. 5407

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5408
makes to have SuperHyperUniform more understandable. 5409
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5410
Classes as follows. 5411
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5412
two given SuperHyperEdges with two exceptions; 5413
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5414
SuperHyperEdges; 5415
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5416
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5417
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5418
in common; 5419
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5420
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5421
SuperHyperEdge in common; 5422
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5423
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5424
SuperVertex. 5425
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 5426
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5427
(i) Vi , Vi+1 ∈ Ei0 ; 5428
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5429
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5430
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5431
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5432
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5433
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5434
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5435
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5437
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5438
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5439
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5440
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5441
perPath . 5442
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 5443
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5444
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5445
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5446
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5447
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5448

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

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


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

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

Cut). 5465
(i) Neutrosophic e-SuperHyperHamiltonian-Cut if the following expression is called 5469

Neutrosophic e-SuperHyperHamiltonian-Cut criteria holds 5470
(ii) Neutrosophic re-SuperHyperHamiltonian-Cut if the following expression is called 5471

Neutrosophic re-SuperHyperHamiltonian-Cut criteria holds 5472
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5473
(iii) Neutrosophic v-SuperHyperHamiltonian-Cut if the following expression is called 5474

(iv) Neutrosophic rv-SuperHyperHamiltonian-Cut if the following expression is called 5476

(v) Neutrosophic SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 5479

v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut. 5481
Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cut). 5482

(i) an Extreme SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 5485

SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian-Cut, Neutro- 5486
sophic v-SuperHyperHamiltonian-Cut, and Neutrosophic rv-SuperHyperHamiltonian-Cut 5487

the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 5490
(ii) a Neutrosophic SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 5493


(iii) an Extreme SuperHyperHamiltonian-Cut SuperHyperPolynomial if it’s either 5501

of Neutrosophic e-SuperHyperHamiltonian-Cut, Neutrosophic re-SuperHyperHamiltonian- 5502
Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and 5503
Neutrosophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for an Extreme SuperHy- 5504
perGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5505
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 5506
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 5507
ity conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5508
that they form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is 5509
(iv) a Neutrosophic SuperHyperHamiltonian-Cut SuperHyperPolynomial if 5511



Neutrosophic coefficient; 5521
(v) an Extreme V-SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 5522

(vi) a Neutrosophic V-SuperHyperHamiltonian-Cut if it’s either of Neutrosophic e- 5530


(vii) an Extreme V-SuperHyperHamiltonian-Cut SuperHyperPolynomial if 5538

SuperHyperHamiltonian-Cut, Neutrosophic v-SuperHyperHamiltonian-Cut, and Neutro- 5540
sophic rv-SuperHyperHamiltonian-Cut and C(N SHG) for an Extreme SuperHyperGraph 5541

seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5545
form the Extreme SuperHyperHamiltonian-Cut; and the Extreme power is corresponded 5546
(viii) a Neutrosophic SuperHyperHamiltonian-Cut SuperHyperPolynomial if 5548



Neutrosophic coefficient. 5558
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cut). 5559

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5560
(i) an δ−SuperHyperHamiltonian-Cut is a Neutrosophic kind of Neutrosophic 5561

SuperHyperHamiltonian-Cut such that either of the following expressions hold for 5562
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5563
|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 5564

(29.1), holds if S is an δ−SuperHyperDefensive; 5565
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cut is a Neutrosophic kind of Neut- 5566

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


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

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

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5570

“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 5572
there’s the usage of the position of labels to assign to the values. 5574
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5576
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5577
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5578
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus Neutro- 5580
sophic SuperHyperPath , SuperHyperHamiltonian-Cut, SuperHyperStar, SuperHyperBipart- 5581
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath, 5582
Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, Neutrosophic Su- 5583
perHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Su- 5584
perHyperWheel if the Table (29.2) holds. 5585
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian-Cut. 5586

Since there’s more ways to get type-results to make a Neutrosophic SuperHyperHamiltonian-Cut 5587
more Neutrosophicly understandable. 5588
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cut”. The 5590
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5591


136TBL1
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5592
5593
136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Cut. It’s redefined a Neutrosophic 5594

SuperHyperHamiltonian-Cut if the Table (29.3) holds. 5595

CHAPTER 30 5596
Neutrosophic 5597
SuperHyperHamiltonian-Cut But As The 5598
Super Forms 5600
Definition 30.0.1. (Neutrosophic event). 5601

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5602
is a probability Hamiltonian-Cut. Any Neutrosophic k-subset of A of V is called Neutrosophic 5603
k-event and if k = 2, then Neutrosophic subset of A of V is called Neutrosophic event. The 5604
following expression is called Neutrosophic probability of A. 5605
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5606
is a probability Hamiltonian-Cut. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5608
s-independent if the following expression is called Neutrosophic s-independent criteria 5609
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. 5610

The following expression is called Neutrosophic independent criteria 5611
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5612

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5613
a probability Hamiltonian-Cut. Any k-function Hamiltonian-Cut like E is called Neutrosophic 5614
k-Variable. If k = 2, then any 2-function Hamiltonian-Cut like E is called Neutrosophic 5615

Variable. 5616
The notion of independent on Neutrosophic Variable is likewise. 5617
271
Definition 30.0.4. (Neutrosophic Expectation). 5618

is a probability Hamiltonian-Cut. A Neutrosophic k-Variable E has a number is called 5620
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5621
criteria 5622
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5623

is a probability Hamiltonian-Cut. A Neutrosophic number is called Neutrosophic Crossing 5625

if the following expression is called Neutrosophic Crossing criteria 5626
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). 5627
Consider S = (V, E) is a probability Hamiltonian-Cut. Let m and n propose special Hamiltonian- 5628
Cut. Then with m ≥ 4n, 5629
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-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: 5630
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5631
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5632
the plane, and let l be the Neutrosophic number√of SuperHyperLines in the plane passing through 5634
at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5635
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5636

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5637
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5638

SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5639

choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5640
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 . 5641
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5644
k < 5n4/3 . 5645
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5646
S = (V, E) is a probability Hamiltonian-Cut. Draw a SuperHyperUnit SuperHyperCircle around 5647
each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5648
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5649
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5650

SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5651
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5652
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 5653

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5654
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5655
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5656
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5657
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5658
4/3 4/3
k < 4n + n < 5n . 5659
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5660
Consider S = (V, E) is a probability Hamiltonian-Cut. Let X be a nonnegative Neutrosophic 5661

Variable and t a positive real number. Then 5662
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. 5663
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5664
Consider S = (V, E) is a probability Hamiltonian-Cut. Let Xn be a nonnegative integer-valued 5665
variable in a probability Hamiltonian-Cut (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, then 5666
P (Xn = 0) → 1 as n → ∞. 5667

Proof. 5668
Consider S = (V, E) is a probability Hamiltonian-Cut. A special SuperHyperGraph in Gn,p 5670
almost surely has stability number at most d2p−1 log ne. 5671
S = (V, E) is a probability Hamiltonian-Cut. A special SuperHyperGraph in Gn,p is up. Let 5673
G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, where k ∈ N. 5674

The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this being the 5675
probability that none of the (k+1)choose2 pairs of SuperHyperVertices of S is a SuperHyperEdge 5676
of the Neutrosophic SuperHyperGraph G. 5677
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5678
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5679
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 5680
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5681
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: 5682
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5683
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 5684
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5685
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5686
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5687
Definition 30.0.12. (Neutrosophic Variance). 5688

is a probability Hamiltonian-Cut. A Neutrosophic k-Variable E has a number is called 5690
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5691
criteria 5692
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Hamiltonian-Cut. Let X be a Neutrosophic Variable and 5694
let t be a positive real number. Then 5695
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Hamiltonian-Cut. Let X be a Neutrosophic Variable and let t be a 5697
positive real number. Then 5698
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ = .
t2 t2
5699
Consider S = (V, E) is a probability Hamiltonian-Cut. Let Xn be a Neutrosophic Variable in a 5701
probability Hamiltonian-Cut (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 5702
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cut. Set X := Xn and t := |Ex(Xn )| in 5704
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5705
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5706
Consider S = (V, E) is a probability Hamiltonian-Cut. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5708
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 5709
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5710
S = (V, E) is a probability Hamiltonian-Cut. As in the proof of related Theorem, the result is 5712
Consider S = (V, E) is a probability Hamiltonian-Cut. Let G ∈ Gn,1/2 and let f and k ∗ be as 5715
defined in previous Theorem. Then either: 5716
∗ ∗ ∗
(i). f (k ) << 1, in which case almost surely α(G) is equal to either k − 2 or k − 1, or 5717
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5718
Definition 30.0.17. (Neutrosophic Threshold). 5721

is a probability Hamiltonian-Cut. Let P be a monotone property of SuperHyperGraphs (one 5723
which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold for 5724
P is a function f (n) such that: 5725

(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5726
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5727
Definition 30.0.18. (Neutrosophic Balanced). 5728

is a probability Hamiltonian-Cut. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5730
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5731
SubSuperHyperGraph is called Neutrosophic Balanced. 5732
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5733

(V, E). Consider S = (V, E) is a probability Hamiltonian-Cut. Let F be a nonempty 5734
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5735
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5736
SubSuperHyperGraph. 5737
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5740
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5741
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5742
SuperHyperHamiltonian-Cut, is up. The Neutrosophic Algorithm is Neutrosophicly 5743

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5744
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5745
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5746
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5747
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5748
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5749

Neutrosophic SuperHyperHamiltonian-Cut. 5750
C(N SHG)Neutrosophic Hamiltonian-Cut

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5754
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5755

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

Neutrosophic SuperHyperHamiltonian-Cut in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5756
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5757

Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5758
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian- 5759
Cut. 5760

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


= {E4 }.


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


= {E4 (E5 ), E1 , E2 }.
= z 5 + 2z 3 .
= {VE4 (E5 ) , VE1 , {O}}.
= z 4 + z 3 + 2z 2 + 4z.
5769







= {E1 , E4 }.
= 2z 5 .
= {Vi , Vi+8 , V5 }4i=1 .
= z 7 + 2z 4 + 5z 3 + z 2 .
5773


= {Ei , Ei+22 , E22 }10
i=1 .



= 21z 2 .
= {Vi }22
i=1 .
= 2z 6 + 6z 5 + 7z 4 + 3z 3 .
5777


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


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


= {E2 , E4 , E3 }.
= 2z 5 + z 3 .
= {Vi }14
i=4,i6=12 .
= 3z 6 + 5z 5 + 2z 4 .
5785



= {Ei , E22 }10

i=1 .
= 11z 2 .
= {Vi }22
i=1 .
= 2z 6 + 6z 5 + 7z 4 + 3z 3 .
5789


= {E1 , E6 , E2 , E7 , E3 }.
= 2z 5 + z 4 + 2z 2 .
= {Vi }14
i=1 .


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


= {E1 , E6 , E3 }.
= 2z 3 + z 2 .
= {V1 , V2 , V3 , V4 , V5 , V6 }.
= 3z 5 + z 4 + 2z 3 .
5797






= {E1 , E6 }.
= z5 + z2.
= {V1 , V2 , V3 , V7 , V8 , V9 }.
= 2z 7 + z 6 + 3z 5 .
5801


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



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


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




= {Ei }5i=1 .
= 5z 2 .
= {Vi }6i=1 .
= 3z 5 + z 4 + 2z 3 .
5813




= {Ei }5i=1 .
= 5z 2 .
= {Vi }22
i=1 .
X
= z |Vi | .
Vi ∈C(N SHG)Neutrosophic V-Hamiltonian-Cut
5817


= {Ei }6i=1 .
= 6z 2 .



= {Vi }27
i=1 .
X
= z |Vi | .
5821


= {Ei }6i=1 .
= 6z 2 .
= {Vi }27
i=1 .
X
= z |Vi | .
5825






= {Ei }12
i=1 .
X
= z |Ei | .
Ei ∈C(N SHG)Neutrosophic Hamiltonian-Cut

= {VEi }12
i=1 .
X
= z |VEi | .
VEi ∈C(N SHG)Neutrosophic V-Hamiltonian-Cut
5829


= {E6 , E8 }.



= z |E6 | + z |E8 | .
= {VEi , V1 }i=6,8 .
= z |VE6 | + z |VE8 | + z |V1 | .
5833


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


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

= z 5 + 2z 3 + 7z.
5837


= {Ei }5i=2 .
= z 12 + 2z 10 + z 6 .
= {VEi }5i=2 .


Neutrosophic SuperHyperHamiltonian-Cut in the Neutrosophic Example (42.0.3) 95NHG2

X
= z |VEi | .
5841
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 5842
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian- 5843
Cut if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 5844
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 5845
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 5846
them. 5847
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5848

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5849
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5850
Neutrosophic quasi-R-Hamiltonian-Cut minus all Neutrosophic SuperHypeNeighbor to some of 5851
them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 5852
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 5853
quasi-R-Hamiltonian-Cut, minus all Neutrosophic SuperHypeNeighbor to some of them but not 5854
all of them. 5855
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-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cut 5856
is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 5857
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 5858
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 5859
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 5860

Neutrosophic Hamiltonian-Cut in some cases but the maximum number of the Neutrosophic 5861
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5862
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cut. 5863
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-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-Cut with the least Neutrosophic cardinality, 5864

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

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

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

C(N SHG)N eutrosophicQuasi−Hamiltonian−CutSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cut = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−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-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-Cut. In other words, the least cardinality, the lower sharp bound for
the cardinality, of a quasi-R-Hamiltonian-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-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-Cut decorates the Neutrosophic
SuperHyperVertices don’t have received any Neutrosophic connections so as this Neutrosophic
style implies different versions of Neutrosophic SuperHyperEdges with the maximum Neutro-
sophic cardinality in the terms of Neutrosophic SuperHyperVertices are spotlight. The lower

Neutrosophic bound is to have the maximum Neutrosophic groups of Neutrosophic SuperHy-

perVertices have perfect Neutrosophic connections inside each of SuperHyperEdges and the
outside of this Neutrosophic SuperHyperSet doesn’t matter but regarding the connectedness of
the used Neutrosophic SuperHyperGraph arising from its Neutrosophic properties taken from
the fact that it’s simple. If there’s no more than one Neutrosophic SuperHyperVertex in the
targeted Neutrosophic SuperHyperSet, then there’s no Neutrosophic connection. Furthermore,
the Neutrosophic existence of one Neutrosophic SuperHyperVertex has no Neutrosophic effect
to talk about the Neutrosophic R-Hamiltonian-Cut. Since at least two Neutrosophic Supe-
rHyperVertices involve to make a title in the Neutrosophic background of the Neutrosophic
SuperHyperGraph. The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic
SuperHyperEdge but at least two Neutrosophic SuperHyperVertices make the Neutrosophic
version of Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious
Neutrosophic SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Neutrosophic adjective for the initial
Neutrosophic SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neut-
rosophic version of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph
is said to be loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework
engages one Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic set-
ting. With these Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least
one Neutrosophic SuperHyperEdge thus there’s at least a Neutrosophic R-Hamiltonian-Cut
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic
R-Hamiltonian-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-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-Cut” since the maximum Neutro-
sophic cardinality never happens for this Neutrosophic style of the Neutrosophic SuperHyperSet
and beyond that there’s no Neutrosophic connection inside as mentioned in first Neutrosophic
case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Hamiltonian-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-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-Cut.
Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic style-R-
Hamiltonian-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-Cut is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Hamiltonian-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-Cut. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 5871
Neutrosophic R-Hamiltonian-Cut =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
5872
Neutrosophic R-Hamiltonian-Cut =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Hamiltonian-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-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-Cut is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian- 5873
Cut is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 5874
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 5875
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 5876

contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 5877
to Neutrosophic Hamiltonian-Cut in some cases but the maximum number of the Neutrosophic 5878
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 5879
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Hamiltonian-Cut. 5880
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 5881
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 5882
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 5883
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 5884
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 5885
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 5886
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 5887
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 5888
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 5889

SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 5890
Neutrosophic quasi-R-Hamiltonian-Cut where the Neutrosophic completion of the Neutrosophic 5891
incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Hamiltonian-Cut. The 5892
SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the 5893
original setting, these types of SuperHyperSets only don’t satisfy on the maximum SuperHy- 5894
perCardinality. Thus the embedded setting is elected such that those SuperHyperSets have 5895
the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic SuperHyperOp- 5896
timal. The less than two distinct types of Neutrosophic SuperHyperVertices are included in the 5897
minimum Neutrosophic style of the embedded Neutrosophic R-Hamiltonian-Cut. The interior 5898
types of the Neutrosophic SuperHyperVertices are deciders. Since the Neutrosophic number of 5899
SuperHyperNeighbors are only affected by the interior Neutrosophic SuperHyperVertices. The 5900
common connections, more precise and more formal, the perfect unique connections inside the 5901
Neutrosophic SuperHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose 5902
the Neutrosophic R-Hamiltonian-Cut. Thus Neutrosophic exterior SuperHyperVertices could 5903
be used only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation 5904
with the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. 5905
In the embedded Neutrosophic Hamiltonian-Cut, there’s the usage of exterior Neutrosophic 5906
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 5907
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no 5908
connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 5909
tices with one SuperHyperElement has been ignored in the exploring to lead on the optimal 5910
case implying the Neutrosophic R-Hamiltonian-Cut. The Neutrosophic R-Hamiltonian-Cut 5911
with the exclusion of the exclusion of all Neutrosophic SuperHyperVertices in one Neutro- 5912
sophic SuperHyperEdge and with other terms, the Neutrosophic R-Hamiltonian-Cut with the 5913
inclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a 5914
Neutrosophic quasi-R-Hamiltonian-Cut. To sum them up, in a connected non-obvious Neut- 5915
rosophic SuperHyperGraph ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge 5916
E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct interior Neutrosophic 5917
SuperHyperVertices inside of any given Neutrosophic quasi-R-Hamiltonian-Cut minus all Neut- 5918
rosophic SuperHypeNeighbor to some of them but not all of them. In other words, there’s only 5919
an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic 5920
SuperHyperVertices in an Neutrosophic quasi-R-Hamiltonian-Cut, minus all Neutrosophic Su- 5921
perHypeNeighbor to some of them but not all of them. 5922

The main definition of the Neutrosophic R-Hamiltonian-Cut has two titles. a Neut- 5923
rosophic quasi-R-Hamiltonian-Cut and its corresponded quasi-maximum Neutrosophic R- 5924
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic num- 5925
ber, there’s a Neutrosophic quasi-R-Hamiltonian-Cut with that quasi-maximum Neutrosophic 5926
SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyperGraph. If there’s 5927
an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi-SuperHyperNotions 5928
lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian-Cuts for all Neut- 5929
rosophic numbers less than its Neutrosophic corresponded maximum number. The essence 5930
of the Neutrosophic Hamiltonian-Cut ends up but this essence starts up in the terms of the 5931
Neutrosophic quasi-R-Hamiltonian-Cut, again and more in the operations of collecting all the 5932
Neutrosophic quasi-R-Hamiltonian-Cuts acted on the all possible used formations of the Neut- 5933
rosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic number is 5934
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cuts. Let 5935
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Cut be a Neutrosophic 5936
number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Cut. Then 5937
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cut ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Hamiltonian-Cut is re-formalized 5938
and redefined as follows. 5939
GNeutrosophic Hamiltonian-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 5940
definition for the Neutrosophic Hamiltonian-Cut. 5941
GNeutrosophic Hamiltonian-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 5942
Hamiltonian-Cut poses the upcoming expressions. 5943

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

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

And then, 5945

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


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

5948


5949

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 5950
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 5951
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 5952
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 5953
Hamiltonian-Cut” but, precisely, it’s the generalization of “Neutrosophic Quasi-Hamiltonian-Cut” 5954
since “Neutrosophic Quasi-Hamiltonian-Cut” happens “Neutrosophic Hamiltonian-Cut” in a 5955
Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic Supe- 5956
rHyperNeighborhood” may not happens “Neutrosophic Hamiltonian-Cut” in a Neutrosophic 5957
SuperHyperGraph as initial framework and preliminarily background since there are some am- 5958
biguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, 5959
the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian-Cut”, 5960
and “Neutrosophic Hamiltonian-Cut” are up. 5961
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Cut 5962
be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 5963
Hamiltonian-Cut and the new terms are up. 5964

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


5967
And with go back to initial structure, 5968


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

5970

5971

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

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

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

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

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

Hamiltonian-Cut, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 5972
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 5973
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 5974
type-SuperHyperSet called the 5975
“Neutrosophic R-Hamiltonian-Cut” 5976
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 5977
Neutrosophic R-Hamiltonian-Cut, 5978
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHy-

perModeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel
and a Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic

stable embedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic R-Hamiltonian-Cut amid those obvious simple Neutrosophic
type-SuperHyperSets of the Neutrosophic Hamiltonian-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-Cut. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Neutrosophic R-Hamiltonian-Cut is the cardinality of
5979
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 5980
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cut 5981
if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior 5982
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no 5983
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 5984
them. 5985
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 5986
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 5987
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 5988
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 5989
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 5990

Consider there’s a Neutrosophic R-Hamiltonian-Cut with the least cardinality, the lower 5991
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 5992
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 5993
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 5994
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 5995
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Cut. Since it doesn’t 5996

have 5997
5998
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 5999
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6000
some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic 6001
SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutro- 6002

sophic SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic 6003
R-Hamiltonian-Cut. Since it doesn’t do the Neutrosophic procedure such that such that 6004
there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely 6005
[there are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in 6006
the connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyper- 6007
Vertex, titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex 6008

in the Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. 6009

There’s only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic Super- 6010
HyperSet, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the 6011
obvious Neutrosophic R-Hamiltonian-Cut, VESHE is up. The obvious simple Neutrosophic 6012
type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Cut, VESHE , is a Neutrosophic Super- 6013
HyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6014
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6015

SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6016
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6017
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6018
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6019
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6020
R-Hamiltonian-Cut only contains all interior Neutrosophic SuperHyperVertices and all exterior 6021
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6022
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6023
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6024
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6025
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6026
The SuperHyperNotion, namely, Hamiltonian-Cut, is up. There’s neither empty SuperHy- 6027
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6028
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of the 6029
Neutrosophic Hamiltonian-Cut. The Neutrosophic SuperHyperSet of Neutrosophic SuperHy- 6030
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cut

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

Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6033

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6034
ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6035

6036
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Supe- 6038
rHyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6039
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neutrosophic 6040
SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the non-obvious 6041
Neutrosophic Hamiltonian-Cut is up. The obvious simple Neutrosophic type-SuperHyperSet 6042

called the Neutrosophic Hamiltonian-Cut is a Neutrosophic SuperHyperSet includes only two 6043
Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of the Neutrosophic 6044
SuperHyperEdges[SuperHyperVertices], 6045

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6050

Hamiltonian-Cut. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6051

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

Is an Neutrosophic Hamiltonian-Cut C(ESHG) for an Neutrosophic SuperHyperGraph 6053

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6054
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6055
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cut and 6056
it’s an Neutrosophic Hamiltonian-Cut. Since it’s 6057
6058

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

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

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

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

Is the Neutrosophic SuperHyperSet, not: 6067

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6068
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6069
Neutrosophic type-SuperHyperSet called the 6070
“Neutrosophic Hamiltonian-Cut” 6071
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6072
Neutrosophic Hamiltonian-Cut, 6073
is only and only 6074

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

CHAPTER 31 6076
The Neutrosophic Departures on The 6077
Theoretical Results Toward Theoretical 6078
Motivations 6079
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6080
Neutrosophic SuperHyperClasses. 6081
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6082

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

|E |
= {VEi }i=1N SHG .
X
= z |VEi | .
Proof. Let 6083
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6084
P :
E1 , V1EXT ERN AL ,
313
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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


6089
136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6090
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6091
SuperHyperModel (31.1), is the SuperHyperHamiltonian-Cut. 6092
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6093

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

|E |
= {VEi }i=1N SHG .
X
= z |VEi | .
Proof. Let 6094
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6095
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). 6096

6100
136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6101
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6102
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Cut. 6103

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

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

= {Ei , Ej }i=1,...,|EN SHG | .
= z |Ei | + z |Ej | .
= {VEi , CEN T ER, VEj }.
= z |VEi | + z |VEj | + z |CEN T ER| .
Proof. Let 6105
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6106
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

Neutrosophic SuperHyperHamiltonian-Cut in the Neutrosophic Example (42.0.9) 136NSHG20a
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6107

6111
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6112
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6113
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6114
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6115
the Neutrosophic SuperHyperHamiltonian-Cut. 6116
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6117

Then 6118

= {Ei }i=1,...,|PNmin
SHG
|.

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

SHG
|.

X
= z |VEi | .
min
i=1,...,|PN |
SHG
Proof. Let 6119
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6120
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). 6121

only two SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6127
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

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

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

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

Then 6140

= {Ei }i=1,...,|PNmin
SHG
|.

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

SHG
|.

X
= z |VEi | .
min
i=1,...,|PN |
SHG
Proof. Let 6141
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6142
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperHamiltonian-Cut taken from a connected Neutrosophic SuperHyperMul- 6143

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


only z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as 6149
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6151
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6152
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6156
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6157
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6158
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6159
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Cut. 6160
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6161

Then, 6162

|E |−1
= {Ei , Ej∗ , Ek∗ }i=1N SHG .
X ∗ ∗
= z |Ei | + z |Ej | + z |Ek | .

|E |
= {VEi , VEj∗ , VEk∗ }i=1N SHG .
X |VE ∗ | |V ∗ |
= z |VEi | + z j + z Ek .
Proof. Let 6163
P :
CEN T ER, E2∗
6164
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperHamiltonian-Cut taken from a connected Neutrosophic SuperHyperWheel 6165


Then there’s at least one SuperHyperHamiltonian-Cut. Thus the notion of quasi isn’t up and 6169
the SuperHyperNotions based on SuperHyperHamiltonian-Cut could be applied. The unique 6170
embedded SuperHyperHamiltonian-Cut proposes some longest SuperHyperHamiltonian-Cut 6171

excerpt from some representatives. The latter is straightforward. 6172
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6173
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6174
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6175
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6176
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Cut. 6177

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Cut in the Neutrosophic Example (42.0.15) 136NSHG23a

CHAPTER 32 6178
The Surveys of Mathematical Sets On 6179
The Results But As The Initial Motivation 6180
For the SuperHyperHamiltonian-Cut, Neutrosophic SuperHyperHamiltonian-Cut, and the 6181

Neutrosophic SuperHyperHamiltonian-Cut, some general results are introduced. 6182
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Cut is “redefined” 6183
on the positions of the alphabets. 6184
Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Cut. Then 6185
N eutrosophic SuperHyperHamiltonian − Cut =

{theSuperHyperHamiltonian − Cutof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cut
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−Cut. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6186
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6187
the neutrality, for i = 1, 2, 3, respectively. 6188
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical let- 6189
ter of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Cut and 6190
SuperHyperHamiltonian-Cut coincide. 6191
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6192
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6193
SuperHyperHamiltonian-Cut if and only if it’s a SuperHyperHamiltonian-Cut. 6194
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6195
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6196
SuperHyperHamiltonian-Cut if and only if it’s a longest SuperHyperHamiltonian-Cut. 6197
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6198
identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cut is its 6199
325
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cut, 6201

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6202
identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cut is its 6203
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6205

Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 6208

Then its Neutrosophic SuperHyperHamiltonian-Cut isn’t well-defined if and only if its 6209
SuperHyperHamiltonian-Cut isn’t well-defined. 6210
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cut, Su- 6211

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6212
rosophic SuperHyperHamiltonian-Cut isn’t well-defined if and only if its SuperHyperHamiltonian- 6213
Cut isn’t well-defined. 6214
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6215

well-defined. 6217
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. 6218
Then its Neutrosophic SuperHyperHamiltonian-Cut is well-defined if and only if its 6219

SuperHyperHamiltonian-Cut is well-defined. 6220
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cut, Su- 6221
perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neut- 6222

rosophic SuperHyperHamiltonian-Cut is well-defined if and only if its SuperHyperHamiltonian- 6223
Cut is well-defined. 6224
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6225
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6226
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6227
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6228
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6229
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6230
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cut. 6231
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6232
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cut; 6235

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

independent SuperHyperSet is 6240
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cut; 6243
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6247

Graph which is a SuperHyperHamiltonian-Cut/SuperHyperPath. Then V is a maximal 6248
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6252
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6253
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6254
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6256
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6257
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6261
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6262
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6263
Graph which is a SuperHyperHamiltonian-Cut/SuperHyperPath. Then the number of 6266

(i) : the SuperHyperHamiltonian-Cut; 6267
(ii) : the SuperHyperHamiltonian-Cut; 6268
(iii) : the connected SuperHyperHamiltonian-Cut; 6269
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cut; 6270
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cut; 6271
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cut. 6272
coincide. 6274

Graph which is a SuperHyperWheel. Then the number of 6276
(i) : the dual SuperHyperHamiltonian-Cut; 6277
(ii) : the dual SuperHyperHamiltonian-Cut; 6278
(iii) : the dual connected SuperHyperHamiltonian-Cut; 6279
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cut; 6280
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cut; 6281
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cut. 6282
coincide. 6284
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6285

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6297
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6298
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6299
SuperHyperPart is a 6300
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6304
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6305
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cut. 6306
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6308

plete SuperHyperMultipartite. Then Then the number of 6309
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6316
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6317
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6319
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6320
(iv) : SuperHyperHamiltonian-Cut; 6324

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6327
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6328
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6329
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6330

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6338
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6339
of dual 6340
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6344

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6348

SuperHyperHamiltonian-Cut/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6350
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6351
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6355
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut; 6356
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cut. 6357


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


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

a dual SuperHyperDefensive SuperHyperHamiltonian-Cut, then ∀v ∈ V \ S, ∃x ∈ S such that 6373
(i) v ∈ Ns (x); 6374
(ii) vx ∈ E. 6375
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6376

a dual SuperHyperDefensive SuperHyperHamiltonian-Cut, then 6377
(i) S is SuperHyperHamiltonian-Cut set; 6378
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6379
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6380
(i) Γ ≤ O; 6381
(ii) Γs ≤ On . 6382
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6383
connected. Then 6384
(i) Γ ≤ O − 1; 6385
(ii) Γs ≤ On − Σ3i=1 σi (x). 6386
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6387

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6391
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6392
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6394
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cut; 6395
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6396
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6397
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6398
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cut. Then 6400
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-

6401
Cut; 6402
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6403
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6404
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6405
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Cut. Then 6407

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6411
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6412
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6414
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cut; 6415
(ii) Γ = 1; 6416
(iii) Γs = Σ3i=1 σi (c); 6417
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cut. 6418
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6419

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6420
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6422
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6423
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6424
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6426
b n c+1
2
Cut; 6428
(ii) Γ = b n2 c + 1; 6429

b n c+1 ; 6430
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian-
6431
Cut. 6432
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6433
bnc
2
Cut; 6435
(ii) Γ = b n2 c; 6436

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

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

6442
Cut for N SHF; 6443
(ii) Γ = m for N SHF : (V, E); 6444
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6445
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6446
Cut for N SHF : (V, E). 6447
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6448
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6449

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive 6450
SuperHyperHamiltonian-Cut for N SHF; 6451
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6452

b n c+1 for N SHF : (V, E); 6453
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperHamiltonian-Cut 6454
for N SHF : (V, E). 6455
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6456

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

bnc for N SHF : (V, E); 6461
S={vi }i=1
bnc
2
are only dual maximal SuperHyperHamiltonian-Cut for 6462
N SHF : (V, E). 6463
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6466

SuperHyperHamiltonian-Cut, then S is an s-SuperHyperDefensive SuperHyperHamiltonian- 6467
Cut; 6468

SuperHyperHamiltonian-Cut, then S is a dual s-SuperHyperDefensive SuperHyperHamiltonian-
6470
Cut. 6471
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6474
SuperHyperHamiltonian-Cut, then S is an s-SuperHyperPowerful SuperHyperHamiltonian- 6475

Cut; 6476

SuperHyperHamiltonian-Cut, then S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-6478
Cut. 6479
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6480

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

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

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

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

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

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

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

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

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


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

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


(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 6522
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6524

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

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


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

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

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


CHAPTER 33 6540
Neutrosophic Applications in Cancer’s 6541
Neutrosophic Recognition 6542
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6543
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6544
disease is considered and as the consequences of the model, some parameters are used. The cells 6545
are under attack of this disease but the moves of the cancer in the special region are the matter 6546
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6547
treatments for this Neutrosophic disease. 6548
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6549
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6550
term Neutrosophic function. 6551
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6552
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6553
move from the cancer is identified by this research. Sometimes the move of the cancer 6554
about the moves and the effects of the cancer on that region; this event leads us to 6556
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6557
perception on what’s happened and what’s done. 6558
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6559
known and they’ve got the names, and some general Neutrosophic models. The 6560
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6561
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6562
/SuperHyperHamiltonian-Cut, SuperHyperStar, SuperHyperBipartite, SuperHyper- 6563
Multipartite, SuperHyperWheel). The aim is to find either the Neutrosophic 6564

SuperHyperHamiltonian-Cut or the Neutrosophic SuperHyperHamiltonian-Cut in those 6565
Neutrosophic Neutrosophic SuperHyperModels. 6566
337
CHAPTER 34 6567
Case 1: The Initial Neutrosophic Steps 6568
Toward Neutrosophic 6569
SuperHyperBipartite as Neutrosophic 6570
SuperHyperModel 6571
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6572
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6573
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- 6574
perBipartite is obtained. 6575
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6576
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6577
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6578
(34.1), is the Neutrosophic SuperHyperHamiltonian-Cut. 6579

CHAPTER 35 6580
Case 2: The Increasing Neutrosophic 6581
Steps Toward Neutrosophic 6582
SuperHyperMultipartite as 6583
Neutrosophic SuperHyperModel 6584
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6585
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6586
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6587
perMultipartite is obtained. 6588
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6589
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- 6590

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6591
Neutrosophic SuperHyperHamiltonian-Cut. 6592

CHAPTER 36 6593
Wondering Open Problems But As The 6594
Directions To Forming The Motivations 6595
In what follows, some “problems” and some “questions” are proposed. 6596
The SuperHyperHamiltonian-Cut and the Neutrosophic SuperHyperHamiltonian-Cut are defined 6597
on a real-world application, titled “Cancer’s Recognitions”. 6598
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6599
recognitions? 6600
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cut 6601

and the Neutrosophic SuperHyperHamiltonian-Cut? 6602
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6603
them? 6604
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian-6605
Cut and the Neutrosophic SuperHyperHamiltonian-Cut? 6606
Problem 36.0.5. The SuperHyperHamiltonian-Cut and the Neutrosophic SuperHyperHamiltonian- 6607

Cut do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6608
SuperHyperHamiltonian-Cut, are there else? 6609
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6610
Numbers types-results? 6611
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6612
the multiple types of SuperHyperNotions? 6613
343
CHAPTER 37 6614
Conclusion and Closing Remarks 6615
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6616
research are illustrated. Some benefits and some advantages of this research are highlighted. 6617
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6618
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cut. 6619
For that sake in the second definition, the main definition of the Neutrosophic SuperHyperGraph 6620
is redefined on the position of the alphabets. Based on the new definition for the Neutrosophic 6621
SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperHamiltonian-Cut, 6622
finds the convenient background to implement some results based on that. Some SuperHy- 6623
perClasses and some Neutrosophic SuperHyperClasses are the cases of this research on the 6624
modeling of the regions where are under the attacks of the cancer to recognize this disease as it’s 6625
mentioned on the title “Cancer’s Recognitions”. To formalize the instances on the SuperHyper- 6626
Notion, SuperHyperHamiltonian-Cut, the new SuperHyperClasses and SuperHyperClasses, are 6627
introduced. Some general results are gathered in the section on the SuperHyperHamiltonian-Cut 6628
and the Neutrosophic SuperHyperHamiltonian-Cut. The clarifications, instances and literature 6629
reviews have taken the whole way through. In this research, the literature reviews have fulfilled 6630
the lines containing the notions and the results. The SuperHyperGraph and Neutrosophic 6631
SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases 6632
are the background of this research. Sometimes the cancer has been happened on the region, 6633
full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 6634
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 6635
longest and strongest styles with the formation of the design and the architecture are formally 6636
called “ SuperHyperHamiltonian-Cut” in the themes of jargons and buzzwords. The prefix 6637
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6638
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6639
pointed out and spoken out. 6640
345
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cut
3. Neutrosophic SuperHyperHamiltonian-Cut 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6641
Neutrosophic SuperHyperDuality But As 6642
Super Forms 6644
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6645

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6649

Va ∈ Ei , Ej ; 6650
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6651

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6652
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6653

Vi , Vj ∈ Ea ; 6654
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6655

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6656
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6657

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6658
sophic rv-SuperHyperDuality. 6659
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6660

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6663

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6665
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6666
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6667
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6668
form the Extreme SuperHyperDuality; 6669
347
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6670

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6672
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6673
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6674
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 6675
such that they form the Neutrosophic SuperHyperDuality; 6676
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6677
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6678

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6679
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6680
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6681
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6682
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6684
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6686

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6688
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6689
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6690
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6691
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 6692
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 6693
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6694
coefficient; 6695
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6696

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6698
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6699
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6700
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6701
form the Extreme SuperHyperDuality; 6702
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6703

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6704
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6705
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6706
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6707
such that they form the Neutrosophic SuperHyperDuality; 6709
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6710

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6711
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6712

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6714
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6717
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6719

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6721

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6724
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6727
coefficient. 6728
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6729
the mentioned Neutrosophic Figures in every Neutrosophic items. 6730

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6732
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6733
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6734
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6735
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6736
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6737
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6738
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 6742
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6743
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6744
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6745
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6746

every given Neutrosophic SuperHyperDuality. 6747




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6807
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 6809


the Neutrosophic SuperHyperDuality. 6818
Then 6820
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 6821
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6827
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 6830

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6831
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6840

(V, E). Then 6841

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 6842
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 6843


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 6847
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 6848
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), 6859
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 6860
Then, 6862
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 6863
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 6864


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 6869
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 6870
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 6876

CHAPTER 39 6877
Neutrosophic SuperHyperJoin But As 6878
Super Forms 6880
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 6881

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6885
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 6887

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 6888
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 6890

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 6892

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6895

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 6896
rv-SuperHyperJoin. 6897
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 6898

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

361

Extreme SuperHyperJoin; 6907
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6908

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 6910
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 6911
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 6912
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 6913

form the Neutrosophic SuperHyperJoin; 6914
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 6915

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 6916
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 6917
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 6922
coefficient; 6923
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 6924

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 6925
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 6926
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 6927
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 6928
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 6929
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 6930

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 6931
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 6932
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6933

Extreme SuperHyperJoin; 6939
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 6940

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 6942
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 6943
form the Neutrosophic SuperHyperJoin; 6946

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 6947

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 6949

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 6954
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 6956

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 6958
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 6959

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 6964
coefficient. 6965
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6969

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 6970

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7035

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7044
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 7046


the Neutrosophic SuperHyperJoin. 7055
Then 7057
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 7058
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 7064
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7066

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7077

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7079


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

Then, 7097

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

.
Proof. Let 7098
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7099


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7103
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7104
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7105
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7110

CHAPTER 40 7111
Neutrosophic SuperHyperPerfect But As 7112
Super Forms 7114
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7115

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

Va ∈ Ei , Ej ; 7120
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7121

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7127

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7128
rv-SuperHyperPerfect. 7129
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7130

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7135
375
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7140

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7142
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7143
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7144
form the Neutrosophic SuperHyperPerfect; 7146
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7147

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7148
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7149
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7152
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7156

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7158
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7164
coefficient; 7165
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7166

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7174
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7175
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7176
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7177
such that they form the Neutrosophic SuperHyperPerfect; 7179
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7180

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7182

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7185
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7189

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7191

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7197
coefficient. 7198

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7202

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7268
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 7270
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7288
Then 7290
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 7291
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 7295
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7296
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7297
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7300

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7311

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7334


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7337
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7338
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7339
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7340
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7346

CHAPTER 41 7347
Neutrosophic SuperHyperTotal But As 7348
Super Forms 7350
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7351

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7355

Va ∈ Ei , Ej ; 7356
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7357

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7358
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7359

Vi , Vj ∈ Ea ; 7360
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7361

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7363

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7364
rv-SuperHyperTotal. 7365
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7366

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7371
Extreme SuperHyperTotal; 7375
389
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7376

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7378
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7379
form the Neutrosophic SuperHyperTotal; 7382
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7383
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7384

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7385
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7390
coefficient; 7391
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7392
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7393

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7394
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7395
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7400
cient; 7401
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7402

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7404
Extreme SuperHyperTotal; 7408
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7409

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7411
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7412
form the Neutrosophic SuperHyperTotal; 7415
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7416

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7417
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7418


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7423
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7425

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7426
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7427
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7428

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7433
cient. 7434

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7438
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. 7453




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7504
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 7506
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. 7513
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 7515



the Neutrosophic SuperHyperTotal. 7524
Then 7526
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 7527
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7533
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7535
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7546

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7553
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. 7564
Then, 7566
∗
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 7567
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7568


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7572
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7573

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7574
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7580

CHAPTER 42 7581
Neutrosophic SuperHyperConnected But 7582
As The Extensions Excerpt From Dense 7583
And Super Forms 7584
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7585

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7589
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7590
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7591

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7592
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7593
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7594

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7595
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7596

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7597
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7598
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7599
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7600
rosophic rv-SuperHyperConnected. 7601
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7602

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7605
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7606
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7607
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7608
403
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7609

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7610
that they form the Extreme SuperHyperConnected; 7611
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7612

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7613
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7614
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7615
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7616
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7617

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7618
nected; 7619
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7620

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7621
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7622
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7623
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7624
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7625

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7627
Extreme power is corresponded to its Extreme coefficient; 7628
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7629

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7630
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7631
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7632
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7633
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7634

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7636
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7637
its Neutrosophic coefficient; 7638
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7639

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7642
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7643

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7644
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7645
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7646

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7649
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7650
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7651

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7652
nected; 7653
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7654

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7657
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7658
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7659
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7660

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7661
and the Extreme power is corresponded to its Extreme coefficient; 7662
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7663

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7666
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7667

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7668
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7670
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7671
its Neutrosophic coefficient. 7672
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7675
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7676
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7678
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7679
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7680
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7681
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7682
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. 7690


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 7734
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. 7741
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 7743
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. 7750
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 7752



the Neutrosophic SuperHyperConnected. 7761
Then 7763
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 7764
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 7769
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7770
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7773

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7784
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 7785
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7786


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7790
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7791
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7792
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. 7803
Then, 7805
∗
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 7806
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 7807


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7810
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7811
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7812
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7813
some representatives. The latter is straightforward. 7814
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7819

CHAPTER 43 7820
Background 7821
417










in Scribd. 7978



Bibliography 8009
10.33140/JMTCM.01.03.09) 8016
423
10.20944/preprints202301.0282.v1). 8044
10.20944/preprints202301.0267.v1). 8047

(doi: 10.20944/preprints202301.0265.v1). 8052
prints202301.0262.v1). 8056
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8062
prints202301.0105.v1). 8065
Preprints 2023, 2023010044 8071
10.20944/preprints202301.0043.v1). 8074

(doi: 10.20944/preprints202212.0549.v1). 8083
(doi: 10.20944/preprints202212.0500.v1). 8090
10.5281/zenodo.7781476). 8099
10.5281/zenodo.7783082). 8102

10.5281/zenodo.7777857). 8105
10.5281/zenodo.7779286). 8108
(doi: 10.5281/zenodo.7771831). 8111
2023, (doi: 10.5281/zenodo.7772468). 8114

10.13140/RG.2.2.20913.25446). 8117
10.5281/zenodo.7764916). 8120
10.13140/RG.2.2.11770.98247). 8123
10.13140/RG.2.2.12400.12808). 8126
2023, (doi: 10.13140/RG.2.2.22545.10089). 8129
10.13140/RG.2.2.11377.76644). 8135
10.13140/RG.2.2.23750.96329). 8138
10.13140/RG.2.2.31366.24641). 8141
10.13140/RG.2.2.34721.68960). 8144
10.13140/RG.2.2.24288.35842). 8153

10.13140/RG.2.2.32467.25124). 8156
10.13140/RG.2.2.31025.45925). 8159
10.13140/RG.2.2.17184.25602). 8162
10.13140/RG.2.2.23423.28327). 8165
10.13140/RG.2.2.28456.44805). 8168
10.13140/RG.2.2.23525.68320). 8171
10.13140/RG.2.2.20170.24000). 8174
10.13140/RG.2.2.36475.59683). 8177
10.13140/RG.2.2.29764.71046). 8180
2023, (doi: 10.13140/RG.2.2.18780.87683). 8183
10.13140/RG.2.2.26134.01603). 8189
10.13140/RG.2.2.27392.30721). 8192

10.13140/RG.2.2.33028.40321). 8195
10.13140/RG.2.2.21389.20966). 8198
10.13140/RG.2.2.16356.04489). 8201
10.13140/RG.2.2.21756.21129). 8204
10.13140/RG.2.2.30983.68009). 8207
10.13140/RG.2.2.28552.29445). 8210
10.13140/RG.2.2.35105.89447). 8216
(doi: 10.13140/RG.2.2.30072.72960). 8219
10.13140/RG.2.2.31147.52003). 8222
10.13140/RG.2.2.32825.24163). 8225
10.13140/RG.2.2.13059.58401). 8228
10.13140/RG.2.2.11172.14720). 8231

2023, (doi: 10.13140/RG.2.2.22011.80165). 8234
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8237
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8243
2023, (doi: 10.13140/RG.2.2.19944.14086). 8246
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8249
(doi: 10.13140/RG.2.2.33103.76968). 8252
2023, (doi: 10.13140/RG.2.2.23037.44003). 8255
(doi: 10.13140/RG.2.2.35646.56641). 8258
(doi: 10.13140/RG.2.2.18030.48967). 8261
(doi: 10.13140/RG.2.2.13973.81121). 8264
2023, (doi: 10.13140/RG.2.2.34106.47047). 8267

2023, (doi: 10.13140/RG.2.2.31956.88961). 8273
2023, (doi: 10.13140/RG.2.2.15179.67361). 8276
10.13140/RG.2.2.21510.45125). 8279
2023, (doi: 10.13140/RG.2.2.13121.84321). 8282
10.13140/RG.2.2.11758.69441). 8285
2023, (doi: 10.13140/RG.2.2.31891.35367). 8288
10.13140/RG.2.2.19360.87048). 8291
2023, (doi: 10.13140/RG.2.2.32363.21286). 8294
(doi: 10.13140/RG.2.2.23266.81602). 8297
10.13140/RG.2.2.19911.37285). 8300
10.13140/RG.2.2.11050.90569). 8303

(doi: 10.13140/RG.2.2.30182.50241). 8315
2023, (doi: 10.13140/RG.2.2.17252.24968). 8348


2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 8357

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



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

10.20944/preprints202301.0282.v1). 8381
10.20944/preprints202301.0267.v1).). 8384


2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8389
prints202301.0262.v1). 8393

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

10.13140/RG.2.2.35061.65767). 8402
10.13140/RG.2.2.18494.15680). 8406
10.13140/RG.2.2.32530.73922). 8410
10.13140/RG.2.2.15897.70243). 8414

10.13140/RG.2.2.32530.73922). 8418
prints202301.0105.v1). 8421

10.13140/RG.2.2.23172.19849). 8428
10.13140/RG.2.2.17385.36968). 8438
(doi: 10.20944/preprints202301.0043.v1). 8444

2023, (doi: 10.13140/RG.2.2.28945.92007). 8447
10.13140/RG.2.2.35774.77123). 8453

10.13140/RG.2.2.29430.88642). 8459

(doi: 10.20944/preprints202212.0549.v1). 8465

10.13140/RG.2.2.19380.94084). 8468
(doi: 10.20944/preprints202212.0500.v1). 8479
10.13140/RG.2.2.20993.12640). 8482




10.13140/RG.2.2.29173.86244). 8497

10.5281/zenodo.7783791). 8502
10.5281/zenodo.7780123). 8504
(doi: 10.5281/zenodo.7773119). 8506
odo.7637762). 8508
10.5281/zenodo.7766174). 8510
10.5281/zenodo.7762232). 8512
(doi: 10.5281/zenodo.7758601). 8514
10.5281/zenodo.7754661). 8516
10.5281/zenodo.7750995) . 8518
(doi: 10.5281/zenodo.7749875). 8520
10.5281/zenodo.7747236). 8522
10.5281/zenodo.7742587). 8524
(doi: 10.5281/zenodo.7738635). 8526
10.5281/zenodo.7734719). 8528
10.5281/zenodo.7730484). 8530
(doi: 10.5281/zenodo.7730469). 8532
10.5281/zenodo.7722865). 8534
odo.7713563). 8536

odo.7709116). 8538
10.5281/zenodo.7706415). 8540
(doi: 10.5281/zenodo.7706063). 8542
(doi: 10.5281/zenodo.7701906). 8544
odo.7700205). 8546
10.5281/zenodo.7694876). 8548
10.5281/zenodo.7679410). 8550
10.5281/zenodo.7675982). 8552
10.5281/zenodo.7672388). 8554
odo.7668648). 8556
10.5281/zenodo.7662810). 8558
10.5281/zenodo.7659162). 8560
odo.7653233). 8562
odo.7653204). 8564
odo.7653142). 8566
odo.7653117). 8568
odo.7653089). 8570
odo.7651687). 8572

odo.7651619). 8574
odo.7651439). 8576
odo.7650729). 8578
odo.7647868). 8580
odo.7647017). 8582
odo.7644894). 8584
odo.7641880). 8586
odo.7632923). 8588
odo.7623459). 8590
10.5281/zenodo.7606416). 8592
10.5281/zenodo.7606416). 8594
odo.7606404). 8596
10.5281/zenodo.7580018). 8598
odo.7580018). 8600
odo.7580018). 8602
odo.7579929). 8604
10.5281/zenodo.7563170). 8606
odo.7563164). 8608

odo.7563160). 8610
odo.7563160). 8612
10.5281/zenodo.7563160). 8614
10.5281/zenodo.7557063). 8616
10.5281/zenodo.7557009). 8618
10.5281/zenodo.7539484). 8620
10.5281/zenodo.7523390). 8622
10.5281/zenodo.7523390). 8624
10.5281/zenodo.7523390). 8626
odo.7574952). 8628
10.5281/zenodo.7574992). 8630
odo.7523357). 8632
10.5281/zenodo.7523357). 8634
10.5281/zenodo.7504782). 8636
10.5281/zenodo.7504782). 8638
10.5281/zenodo.7504782). 8640
10.5281/zenodo.7499395). 8642
odo.7499395). 8644

10.5281/zenodo.7499395). 8646
10.5281/zenodo.7497450). 8648
10.5281/zenodo.7497450). 8650
10.5281/zenodo.7494862). 8652
odo.7494862). 8654
10.5281/zenodo.7494862). 8656
10.5281/zenodo.7493845). 8658
10.5281/zenodo.7493845). 8660
10.5281/zenodo.7493845). 8662
odo.7539484). 8664
odo.7523390). 8666
odo.7523357). 8668
odo.7504782). 8670
odo.7499395). 8672
odo.7497450). 8674
odo.7494862). 8676
odo.7493845). 8678
odo.7480110). 8680

odo.7378758). 8682
odo.6320305). 8684
odo.6677173). 8686

CHAPTER 44 8687
Books’ Contributions 8688
“Books’ Contributions”: | Featured Threads 8689

The following references are cited by chapters. 8690
8691
[Ref219] 8692
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut In 8693
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8694
odo.7783082). 8695
8696
[Ref220] 8697
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 8698
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 10.5281/zen- 8699
odo.7781476). 8700
8701
The links to the contributions of this scientific research book are listed below. 8702
[HG219 8703
odo.7783082). 8706
8707
[TITLE] “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut In Re- 8708
cognition of Cancer With (Neutrosophic) SuperHyperGraph” 8709

8710
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8711
https://www.researchgate.net/publication/369619224 8712
8713
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8714
https://www.scribd.com/document/634699251 8715
8716
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8717
https://zenodo.org/record/7783082 8718
8719
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8720
https://www.academia.edu/99283965 8721
443
Figure 44.1: Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
8722
[ADDRESSED CITATION] 8723
odo.7783082). 8726
[ASSIGNED NUMBER] #219 Article 8727
[DATE] March 2023 8728

[DOI] 10.5281/zenodo.7783082 8729
[LICENSE] CC BY-NC-ND 4.0 8730
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8731
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8732
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8733
8734
[HG220] 8735
odo.7781476). 8738
8739
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8740

Hamiltonian-Cut As Hyper Hamper On Super Hammy” 8741
8742
https://www.researchgate.net/publication/369596826 8744
8745
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8746

10.5281/zenodo.7783082).
10.5281/zenodo.7783082).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023,
(doi: 10.5281/zenodo.7781476).
https://www.scribd.com/document/634609670 8747
8748
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8749
8751
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8752
https://www.academia.edu/99267882 8753
8754
odo.7781476). 8758
[ASSIGNED NUMBER] #220 Article 8759

[DATE] March 2023 8760
[DOI] 10.5281/zenodo.7781476 8761
[LICENSE] CC BY-NC-ND 4.0 8762
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8763
[AVAILABLE AT TWITTER’S IDS] 8764
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8765
googlebooks GooglePlay 8766
8767
[ASSIGNED NUMBER] | Book #150 8768
Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8770
10.5281/zenodo.7783791). 8771

(doi: 10.5281/zenodo.7781476).
(doi: 10.5281/zenodo.7781476).

[TITLE] Hamiltonian-Cut In SuperHyperGraphs 8772

#Latest_Updates 8773
#The_Links 8774
8778
8780
#The_Links 8781
8782
[ASSIGNED NUMBER] | Book #150 8783

8784
[TITLE] Hamiltonian-Cut In SuperHyperGraphs 8785
8786
8790
– 8791
8792
[PUBLISHER] 8793
(Paperback): https://www.amazon.com/dp/- 8794
(Hardcover): https://www.amazon.com/dp/- 8795

(Kindle Edition): https://www.amazon.com/dp/- 8796
8797
– 8798
8799
[ISBN] 8800
(Paperback): - 8801
(Hardcover): - 8802
(Kindle Edition): CC BY-NC-ND 4.0 8803
(EBook): CC BY-NC-ND 4.0 8804
8805
– 8806
8807
[PRINT LENGTH] 8808
(Paperback): - pages 8809
(Hardcover): - pages 8810
(Kindle Edition): - pages 8811
(E-Book): - pages 8812
8813
– 8814
8815
8817

#The_Links 8818
8819
https://www.researchgate.net/publication/- 8821
8822
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8823
https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-SuperHyperGraphs/ 8824
8825
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 8826
https://www.scribd.com/document/- 8827
8828
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 8829

https://www.academia.edu/- 8830
8831
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 8832
8834
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 8835

https://books.google.com/books/about?id=- 8836
8837
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 8838
https://play.google.com/store/books/details?id=- 8839
8840
8841

[TITLE] Hamiltonian-Cut In SuperHyperGraphs (Published Version) 8842

8843
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 8844
8845
https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-SuperHyperGraphs/ 8846
8847
– 8848
8849
[POSTED BY] Dr. Henry Garrett 8850
8851
[DATE] March 030, 2023 8852
8853
[POSTED IN] 0150 | Hamiltonian-Cut In SuperHyperGraphs 8854
8855
[TAGS] 8856
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 8857
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 8858
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 8859
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 8860

neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Cut In SuperHyperGraphs, Open 8861
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 8862
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 8863
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 8864
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 8865
SuperHyperGraphs, Hamiltonian-Cut In SuperHyperGraphs, SuperHyperModeling, SuperHy- 8866

perVertices, Theoretical Research, Vertex, Vertices. 8867
In this scientific research book, there are some scientific research chapters on “Extreme 8868
Hamiltonian-Cut In SuperHyperGraphs” and “Neutrosophic Hamiltonian-Cut In SuperHy- 8869
perGraphs” about some scientific research on Hamiltonian-Cut In SuperHyperGraphs by two 8870
(Extreme/Neutrosophic) notions, namely, Extreme Hamiltonian-Cut In SuperHyperGraphs and 8871
Neutrosophic Hamiltonian-Cut In SuperHyperGraphs. With scientific research on the basic sci- 8872
entific research properties, the scientific research book starts to make Extreme Hamiltonian-Cut 8873
In SuperHyperGraphs theory and Neutrosophic Hamiltonian-Cut In SuperHyperGraphs theory 8874
more (Extremely/Neutrosophicly) understandable. 8875

CHAPTER 45 8876
“SuperHyperGraph-Based Books”: | 8877
Featured Tweets 8878
“SuperHyperGraph-Based Books”: | Featured Tweets 8879
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 8880
CV 8881
479
8882
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

8883
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)
8884
Publications: Articles
2023 184 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
@ResearchGate: https://www.researchgate.net/publication/369086888
@Scribd: https://www.scribd.com/document/-
@ZENODOO RG : https : //zenodo.org/record/7708851
@academia: https://www.academia.edu/98165095
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
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

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

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
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

8885
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).
@Scribd: https://www.scribd.com/document/629520682
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

8886
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

8887
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

8888
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”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.34106.47047).
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).
@ZENODO_ORG: https://zenodo.org/record/7650464
8889
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

8890

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

8891
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

8892
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

8893
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: -
8894
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
8895
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
8896
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
8897
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
8898
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).
8899
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”,

8900
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”,

8901
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

8902
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).
8903
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).
8904
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
8905
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).
8906

(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).
8907
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).
8908
Publications: Books
2023 0127 | Space In SuperHyperGraphs Amazon
@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/
@academia:https://www.academia.edu/98169374
(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
(Kindle Edition): CC BY-NC-ND 4.0
2023 0126 | Edge-Connectivity In SuperHyperGraphs Amazon
@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/-
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): -
2023 0125 | Vertex-Connectivity In SuperHyperGraphs Amazon
@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
8909
2023 0124 | Tree-Decomposition In SuperHyperGraphs Amazon
@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 0123 | Chord In SuperHyperGraphs Amazon
@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 0122 | (i,j)-Domination In SuperHyperGraphs Amazon
@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 0121 | Edge-Domination In SuperHyperGraphs Amazon

8910
@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 0120 | K-Domination In SuperHyperGraphs Amazon
@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 0119 | K-Number In SuperHyperGraphs Amazon
@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/- @ZENODOO RG : 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 0118 | Order In SuperHyperGraphs Amazon

8911
@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 0117 | Coloring In SuperHyperGraphs Amazon
@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 116 | Dimension In SuperHyperGraphs Amazon
@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/368663443 @WordPress:
https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODOO RG : https :
//zenodo.org/record/7659162@academia : https : //www.academia.edu/97246270
(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 - Amazon
8912
“ 115th Book
|| 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 115- Amazon
Cancer in SuperHyperGraphs
@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/-
2023 - Amazon
“ 114th Book
|| 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 - Amazon
“ 114th
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/
2023 - Amazon
“ 113rd Book
|| 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 - Amazon
“ 113rd”
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/
8913
2023 - Amazon
“ 112nd Book”
|| 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 - Amazon
“ 112nd”
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/
2023 - Amazon
“ 111st Book”
|| 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 - Amazon
“ 111st”
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/
2023 - Amazon
“ 110th Book”
|| 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 - Amazon
“ 110th”
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/
8914
2023 - Amazon
“ 109th Book”
|| 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 - Amazon
“ 109th”
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/
2023 - Amazon
“ 108th Book”
|| 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 - Amazon
“ 108th”
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/
2023 - Amazon
“ 107th Book”
|| 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 - Amazon
“ 107th”
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/
8915
2023 - Amazon
“ 106th Book”
|| 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 - Amazon
“ 106th”
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/
2023 - Amazon
“ 105th Book”
|| 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 - Amazon
“ 105th”
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/
2023 - Amazon
“ 104th Book”
|| 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 - Amazon
8916
“ 104th”
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/
2023 - Amazon
“ 103rd Book”
|| 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 - Amazon
“ 103rd”
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/
2023 - Amazon
“ 102nd Book”
|| SuperHyperDuality
Link (Paperback): https://www.amazon.com/dp/B0BVPMX6C4 (Hardcover):
https://www.amazon.com/dp/B0BVNTYX6M (Kindle Edition):
ND 4.0
2023 - Amazon
“ 102nd”
SuperHyperDuality
@googlebooks: https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/14/superhyperduality
2023 - Amazon
“ 101st Book”
|| Path SuperHyperColoring
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ND 4.0
8917
2023 - Amazon
“ 101st Book”
|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
2023 - Amazon
“ 100th Book”
|| SuperHyperDensity
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
2023 - Amazon
“ 100th Book”
|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ND 4.0
2023 - Amazon
Book 99 || “Neutrosophic SuperHyperConnectivities”

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 - Amazon
Book 99 || “Neutrosophic SuperHyperConnectivities”
Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ND 4.0
2023 - Amazon
Book 98 || “Extreme SuperHyperConnectivities”
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
8918
2023 - Amazon
Book 98 || “Extreme SuperHyperConnectivities”
Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ND 4.0
2023 - Amazon
Book 97 || “SuperHyperConnectivities”
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 - Amazon
Book 96 || “Neutrosophic SuperHyperCycle”
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 - Amazon
Book 96 || “Neutrosophic SuperHyperCycle”
Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ND 4.0
2023 - Amazon
Book 95 || “Extreme SuperHyperCycle”
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 - Amazon
Book 95 || “Extreme SuperHyperCycle”
Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ND 4.0
2023 - Amazon
8919
Book 94 || “SuperHyperCycle”
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 - Amazon
0092 | Neutrosophic SuperHyperGirth
https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@WordPress: -
@Scribd: -
2023 - Amazon
0091 | Extreme SuperHyperGirth

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 - Amazon
0070 | SuperHyperGirth
https://www.amazon.com/dp/B0BSLKY69Q https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361 9798374736854 CC BY-NC-ND 4.0
@WordPress: -
2023 - Amazon
“Neutrosophic SuperHyperGirth”
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperGirth”
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
8920
2023 - Amazon
“Overlook On SuperHyperGirth”
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 - Amazon
“Book 90”
Neutrosophic SuperHyperMatching
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 - Amazon
Book 80 Extreme SuperHyperMatching
https://www.amazon.com/dp/B0BSJDJSN7 https://www.amazon.com/dp/B0BSLKWW3F
9798374564266 9798374564785 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 - Amazon
Book 69 SuperHyperMatching
@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/
2023 - Amazon
Book 69 SuperHyperMatching
Link (Paperback): https://www.amazon.com/dp/B0BSDPXX1P (Hardcover):

https://www.amazon.com/dp/B0BSDC1L66 (Kindle Edition):
ND 4.0
2023 - Amazon
“Neutrosophic SuperHyperMatching”
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperMatching”
@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
8921
2023 - Amazon
“Overlook On SuperHyperMatching”
@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
2023 - Amazon
68 Failed SuperHyperClique
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
2023 - Amazon
“Neutrosophic Failed SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ
2023 - Amazon
“Extreme Failed SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ
2023 - Amazon
“Overlook On Failed SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
2023 - Amazon
“Book 88: Neutrosophic SuperHyperClique”
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 - Amazon
“Book 88: Neutrosophic SuperHyperClique”
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):

https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ND 4.0
2023 - Amazon
8922
“Book 78: Extreme SuperHyperClique”
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 - Amazon
“Book 78: Extreme SuperHyperClique”
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
2023 - Amazon
Book 67 SuperHyperClique
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/
2023 - Amazon
“Neutrosophic SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
2023 - Amazon
“Overlook On SuperHyperClique”
@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
2023 - Amazon
66 Failed SuperHyperStable
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/
8923
2023 - Amazon
“Neutrosophic Failed SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ
2023 - Amazon
“Extreme Failed SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ
2023 - Amazon
“Overlook On Failed SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ
2023 - Amazon
Book 65 SuperHyperStable
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/
2023 - Amazon
“Neutrosophic SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ
2023 - Amazon
“Overlook On SuperHyperStable”
@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ
2023 - Amazon
8924
64 Failed SuperHyperForcing
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/
2023 - Amazon
“Neutrosophic Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ
2023 - Amazon
“Extreme Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ
2023 - Amazon
“Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
2023 - Amazon
63 | “SuperHyperForcing”
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/
2023 - Amazon
“Neutrosophic SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
2023 - Amazon
“Overlook On SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
8925
2023 - Amazon
“Neutrosophic SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ
2023 - Amazon
“Extreme SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ
2023 - Amazon
“Overlook On SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ
2023 - Amazon
62 |“SuperHyperAlliances”
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/
2023 - Amazon
Book 61 | “SuperHyperGraphs”
@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/24/superhypergraphs-published-
version/
2023 - Amazon
Book 61 | “SuperHyperGraphs”
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):

https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ND 4.0
2023 - Amazon
8926
60 | “Neut. SuperHyperEdges”
@googlebooks: http://books.google.com/books/about?id=rr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
2023 - Amazon
Book 60 | “Neut. SuperHyperEdges”
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):

https://www.amazon.com/dp/B0BNGZGPP6
ND 4.0
2023 0069 | SuperHyperMatching Amazon
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
2023 0068 | Failed SuperHyperClique Amazon
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language

ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
2023 0067 | SuperHyperClique Amazon
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
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
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
8927
2023 0064 | Failed SuperHyperForcing Amazon
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
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language
2022 0062 | SuperHyperAlliances Amazon
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
2022 0061 | SuperHyperGraphs Amazon
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
2022 0060 | Neut. SuperHyperEdges Amazon
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
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

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

8929
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
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
8930
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
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
8931
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
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
8932
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
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

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

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

8935
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
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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
8936
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
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

8937
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
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
8938
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
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |

Walmart | eBay
8939
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

8940
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
8941
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
...
8942
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/
8943
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
8944

Hamiltonian-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-Cut in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Hamiltonian-Cut In

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 39

6 New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut In

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 57

10 Extreme SuperHyperHamiltonian-Cut But As The Extensions Excerpt

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 135

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 143

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 241

25 Neutrosophic Hamiltonian-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-Cut But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 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.8 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.23“SuperHyperGraph-Based Books”: | Featured Tweets #65 . . . . . . . . . . . . . . 471

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