Hamiltonian-Cycle-Decomposition in SuperHyperGraphs

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

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

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

Graph By Hamiltonian-Cycle-Decomposition As Hyper Decompress On
Super Decompensation 247
27 ABSTRACT 249
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 255

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 259
30 Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition But As The Exten-

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

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

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

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

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

Motivations 341
37 Conclusion and Closing Remarks 343
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 401
43 Background 415
Bibliography 421
44 Books’ Contributions 441
45 “SuperHyperGraph-Based Books”: | Featured Tweets 449
46 CV 477

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

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

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

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

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


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


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

SuperHyperHamiltonian-Cycle-Decomposition in the Example (42.0.5) . . . . . . . . . . . . 314
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 316
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Example
(42.0.11) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 319
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperHamiltonian-Cycle-Decomposition in the Example (42.0.13) . . . . . . . . . . . 321
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
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 Decompensation By Hyper Decompress Of

Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7793410). . . . . . . . . . 442
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). . . . . . . . . . . 444

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

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 451
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 452
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 458

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

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

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 338

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

Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Ex- 4
treme Hamiltonian-Cycle-Decomposition In SuperHyperGraphs and Neutrosophic Hamiltonian- 5
Cycle-Decomposition In SuperHyperGraphs. With scientific research on the basic scientific 6
research properties, the scientific research book starts to make Extreme Hamiltonian- 7
Cycle-Decomposition In SuperHyperGraphs theory and Neutrosophic Hamiltonian-Cycle- 8
Decomposition In SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9

10
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 11
Notions, namely, a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs and Neutrosophic 12
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . Two different types of SuperHyper- 13
Definitions are debut for them but the scientific research goes further and the SuperHyperNotion, 14
SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 15

The literature review is implemented in the whole of this research. For shining the elegancy 16
and the significancy of this research, the comparison between this SuperHyperNotion with 17
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 18
are followed by the examples and the instances thus the clarifications are driven with different 19
tools. The applications are figured out to make sense about the theoretical aspect of this 20
ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 21
out the challenges make sense about ongoing and upcoming research. The special case is 22
up. The cells are viewed in the deemed ways. There are different types of them. Some of 23
them are individuals and some of them are well-modeled by the group of cells. These types 24
are all officially called “SuperHyperVertex” but the relations amid them all officially called 25
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyper- 26
Graph” are chosen and elected to scientific research about “Cancer’s Recognition”. Thus 27
these complex and dense SuperHyperModels open up some avenues to scientific research on 28
theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 29
research. It’s also officially collected in the form of some questions and some problems. Assume 30
a SuperHyperGraph. Then δ−Hamiltonian-Cycle-Decomposition In SuperHyperGraphs is a 31
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 32
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 33
1
are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 34
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S is 35
an δ−SuperHyperDefensive; a Neutrosophic δ−Hamiltonian-Cycle-Decomposition In Super- 36
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 37
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 38
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 39
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 40
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 41
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Hamiltonian-Cycle- 42
Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make a 43
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs more understandable. For the sake 44
of having Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, there’s a 45
need to “redefine” the notion of a “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 46

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 47
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 48
assign to the values. Assume a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . 49
It’s redefined a Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs if the 50
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 51
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 52
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 53
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 54
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 55
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 56
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 57
of SuperHyperGraph based on a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 58

. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 59
kind of SuperHyperClass. If there’s a need to have all Hamiltonian-Cycle-Decomposition 60
In SuperHyperGraphs until the Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, 61
then it’s officially called a “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” but 62
otherwise, it isn’t a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . There are 63
some instances about the clarifications for the main definition titled a “Hamiltonian-Cycle- 64
Decomposition In SuperHyperGraphs ”. These two examples get more scrutiny and discernment 65
since there are characterized in the disciplinary ways of the SuperHyperClass based on a 66
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . For the sake of having a Neutro- 67
sophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, there’s a need to “redefine” 68
the notion of a “Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” and a 69

“Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs ”. The SuperHyperVer- 70
tices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 71
In this procedure, there’s the usage of the position of labels to assign to the values. Assume 72
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 73
intended Table holds. And a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs are 74
redefined to a “Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” if 75

the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 76
Since there’s more ways to get Neutrosophic type-results to make a Neutrosophic Hamiltonian- 77
Cycle-Decomposition In SuperHyperGraphs more understandable. Assume a Neutrosophic 78
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 79

holds. Thus SuperHyperPath, Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, Su- 80

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

SuperHyperGraphs or the strongest Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 122
in those Neutrosophic SuperHyperModels. For the longest Hamiltonian-Cycle-Decomposition 123
In SuperHyperGraphs, called Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, and 124
the strongest Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, called Neutrosophic 125

Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, some general results are introduced. 126

Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 127
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 128
of a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs. There isn’t any formation of any 129
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs but literarily, it’s the deformation 130
of any Hamiltonian-Cycle-Decomposition In SuperHyperGraphs. It, literarily, deforms and it 131
doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyper- 132
Graph theory are proposed. 133
Keywords: SuperHyperGraph, (Neutrosophic) Hamiltonian-Cycle-Decomposition In Super- 134
HyperGraphs, Cancer’s Recognition 135

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

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

perGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 165
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 166
of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 167
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 168
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 169
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Hamiltonian-Cycle- 170

Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make 171
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs more understandable. For the sake 172
of having Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, there’s a 173
need to “redefine” the notion of “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 174
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 175
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 176
assign to the values. Assume a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . 177

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

“Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” but otherwise, it isn’t Hamiltonian- 190
Cycle-Decomposition In SuperHyperGraphs . There are some instances about the clarifications 191
for the main definition titled “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs ”. These 192
two examples get more scrutiny and discernment since there are characterized in the disciplinary 193
ways of the SuperHyperClass based on Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 194
. For the sake of having Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, 195

there’s a need to “redefine” the notion of “Neutrosophic Hamiltonian-Cycle-Decomposition In Su- 196
perHyperGraphs” and “Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs ”. 197
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 198
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 199
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 200
if the intended Table holds. And Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 201

are redefined “Neutrosophic Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” if the 202
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 203
Since there’s more ways to get Neutrosophic type-results to make Neutrosophic Hamiltonian- 204
Cycle-Decomposition In SuperHyperGraphs more understandable. Assume a Neutrosophic 205
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 206
holds. Thus SuperHyperPath, Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, Su- 207
perHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 208
“Neutrosophic SuperHyperPath”, “Neutrosophic Hamiltonian-Cycle-Decomposition In Su- 209
perHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 210
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 211
Table holds. A SuperHyperGraph has “Neutrosophic Hamiltonian-Cycle-Decomposition In 212

SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 213
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs amid the maximum value amid 214
all SuperHyperVertices from a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs .] 215
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs . A graph is SuperHyperUniform 216

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

perHyperWheel). The aim is to find either the longest Hamiltonian-Cycle-Decomposition In 248
SuperHyperGraphs or the strongest Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 249
in those Neutrosophic SuperHyperModels. For the longest Hamiltonian-Cycle-Decomposition 250
In SuperHyperGraphs, called Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, and 251
the strongest Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, called Neutrosophic 252

Hamiltonian-Cycle-Decomposition In SuperHyperGraphs, some general results are introduced. 253
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 254
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 255
of a Hamiltonian-Cycle-Decomposition In SuperHyperGraphs. There isn’t any formation of any 256
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs but literarily, it’s the deformation 257
of any Hamiltonian-Cycle-Decomposition In SuperHyperGraphs. It, literarily, deforms and it 258

doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyper- 259
Graph theory are proposed. 260
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Hamiltonian-Cycle-Decomposition 261

In SuperHyperGraphs, Cancer’s Neutrosophic Recognition 262

264
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 265
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 266
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 267
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 268
United State. This research book covers different types of notions and settings in neutrosophic 269
graph theory and neutrosophic SuperHyperGraph theory. 270
271
272
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 273
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 274
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 275
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 276
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 277
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 278
279
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 280
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 281
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 282
Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 283
33131 United States. This research book presents different types of notions SuperHyperResolv- 284
ing and Hamiltonian-Cycle-Decomposition In SuperHyperGraphs in the setting of duality in 285

neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research book has 286
scrutiny on the complement of the intended set and the intended set, simultaneously. It’s smart 287
to consider a set but acting on its complement that what’s done in this research book which is 288
popular in the terms of high readers in Scribd. 289
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 290
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 291
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 292
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 293
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 294
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 295




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

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

Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 350
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 351
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 352
Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 354
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 355
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 356
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 357
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 358
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry 359
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic Su- 360
perHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in 361

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

SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 367
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) Super- 368
HyperAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet 369
On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 370
Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry 371
Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 372

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

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

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

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

HG224; HG225; HG226; HG228], there are some endeavors to formalize the basic Super- 427
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 428
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 429
HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; HG77b; 430
HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; HG106b; 433
HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; HG114b; 434

HG147b; HG148b; HG149b; HG150b; HG151b; HG152b; HG153b; HG154b]. Two 439
popular scientific research books in Scribd in the terms of high readers, 4190 and 5189 respect- 440
ively, on neutrosophic science is on [HG32b; HG44b]. 441

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

HG219; HG220; HG221; HG222; HG223; HG224; HG225; HG226; HG228] alongside 473
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 474

HG154b]. Two popular scientific research books in Scribd in the terms of high readers, 485
4190 and 5189 respectively, on neutrosophic science is on [HG32b; HG44b]. 486

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 559
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 560
(doi: 10.20944/preprints202212.0549.v1). 561
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 562
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 563
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 564
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 565
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 566
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 567
(doi: 10.20944/preprints202212.0500.v1). 568
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 569
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 570
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 572
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 573
HG228 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 575
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 576
Zenodo 2023, (doi: 10.5281/zenodo.7793372). 577
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 579
10.5281/zenodo.7791952). 580
HG225 [27] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 581
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 582

(doi: 10.5281/zenodo.7791982). 583
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 585
10.5281/zenodo.7790026). 586
HG223 [29] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 587
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 588
2023, (doi: 10.5281/zenodo.7790052). 589
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 591
2023, (doi: 10.5281/zenodo.7787066). 592

HG221 [31] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 593
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 594
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 595
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 597
10.5281/zenodo.7781476). 598
HG219 [33] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 599
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 600
10.5281/zenodo.7783082). 601
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 603
10.5281/zenodo.7777857). 604
HG217 [35] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 605
10.5281/zenodo.7779286). 607
HG215 [36] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 608
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 609
(doi: 10.5281/zenodo.7771831). 610
HG214 [37] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 611
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 612
2023, (doi: 10.5281/zenodo.7772468). 613
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 615
10.13140/RG.2.2.20913.25446). 616
HG212 [39] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 617
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 618
10.5281/zenodo.7764916). 619
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 621
10.13140/RG.2.2.11770.98247). 622
HG210 [41] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 623
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 624
10.13140/RG.2.2.12400.12808). 625
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 627
2023, (doi: 10.13140/RG.2.2.22545.10089). 628
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 630
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 631

HG207 [44] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 632
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 633
10.13140/RG.2.2.11377.76644). 634
HG206 [45] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 635
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 636
10.13140/RG.2.2.23750.96329). 637
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 639
10.13140/RG.2.2.31366.24641). 640
HG204 [47] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 641
10.13140/RG.2.2.34721.68960). 643
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 645
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 648
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 651
10.13140/RG.2.2.24288.35842). 652
HG200 [51] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 653
10.13140/RG.2.2.32467.25124). 655
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 657
10.13140/RG.2.2.31025.45925). 658
HG198 [53] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 659
10.13140/RG.2.2.17184.25602). 661
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 663
10.13140/RG.2.2.23423.28327). 664
HG196 [55] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 665
10.13140/RG.2.2.28456.44805). 667
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 669
10.13140/RG.2.2.23525.68320). 670

HG194 [57] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 671
10.13140/RG.2.2.20170.24000). 673
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 675
10.13140/RG.2.2.36475.59683). 676
HG192 [59] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 677
10.13140/RG.2.2.29764.71046). 679
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 681
2023, (doi: 10.13140/RG.2.2.18780.87683). 682
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 684
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 687
10.13140/RG.2.2.26134.01603). 688
HG188 [63] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 689
10.13140/RG.2.2.27392.30721). 691
HG187 [64] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 692
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 693
10.13140/RG.2.2.33028.40321). 694
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 696
10.13140/RG.2.2.21389.20966). 697
HG185 [66] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 698
10.13140/RG.2.2.16356.04489). 700
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.21756.21129). 703
HG183 [68] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 704
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 705
10.13140/RG.2.2.30983.68009). 706
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 708
10.13140/RG.2.2.28552.29445). 709

HG181 [70] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 710
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 711
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 712
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.35105.89447). 715
HG179 [72] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 716
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 717
(doi: 10.13140/RG.2.2.30072.72960). 718
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.31147.52003). 721
HG177 [74] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 722
10.13140/RG.2.2.32825.24163). 724
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.13059.58401). 727
HG175 [76] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 728
10.13140/RG.2.2.11172.14720). 730
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 732
2023, (doi: 10.13140/RG.2.2.22011.80165). 733
HG173 [78] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 734
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 735
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 736
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 738
HG171 [80] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 740
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 742
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 744
2023, (doi: 10.13140/RG.2.2.19944.14086). 745
HG169 [82] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 746
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 748

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 750
(doi: 10.13140/RG.2.2.33103.76968). 751
HG167 [84] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 752
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 753
2023, (doi: 10.13140/RG.2.2.23037.44003). 754
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 756
(doi: 10.13140/RG.2.2.35646.56641). 757
HG165 [86] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 758
(doi: 10.13140/RG.2.2.18030.48967). 760
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 762
(doi: 10.13140/RG.2.2.13973.81121). 763
HG163 [88] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 764
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 765
2023, (doi: 10.13140/RG.2.2.34106.47047). 766
HG162 [89] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 767
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 768
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 771
2023, (doi: 10.13140/RG.2.2.31956.88961). 772
HG160 [91] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 773
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 774
2023, (doi: 10.13140/RG.2.2.15179.67361). 775
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 777
10.13140/RG.2.2.21510.45125). 778
HG158 [93] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 779
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 780
2023, (doi: 10.13140/RG.2.2.13121.84321). 781
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 783
10.13140/RG.2.2.11758.69441). 784
HG156 [95] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 785
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 786
2023, (doi: 10.13140/RG.2.2.31891.35367). 787

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 789
10.13140/RG.2.2.19360.87048). 790
HG154 [97] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 791
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 792
2023, (doi: 10.13140/RG.2.2.32363.21286). 793
HG153 [98] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 794
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 795
(doi: 10.13140/RG.2.2.23266.81602). 796
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 798
10.13140/RG.2.2.19911.37285). 799
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 801
10.13140/RG.2.2.11050.90569). 802
HG150 [101] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 803
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 804
HG149 [102] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 806
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 807
HG148 [103] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 809
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 810
HG147 [104] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 812
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 813
(doi: 10.13140/RG.2.2.30182.50241). 814
HG146 [105] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 815
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 816
HG145 [106] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 818
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 819
HG144 [107] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 821
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 822
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 823
HG143 [108] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 824
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 825
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 826

Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 829
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 832
HG140 [111] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 833
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 834
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 835
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 838
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 841
HG137 [114] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 842
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 843
HG136 [115] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 845
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 846
2023, (doi: 10.13140/RG.2.2.17252.24968). 847
HG135 [116] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 848
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 849
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 850
HG134 [117] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 851
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 852
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 853
HG132 [118] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 854
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 855
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 856
HG131 [119] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 857
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 858

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 859
HG130 [120] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 860
Recognition in The Confrontation With Super Attacks In Hyper Situations By 861
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 862
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 863

HG129 [121] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 864

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 865
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 866
HG128 [122] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 868
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 869
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 870
HG127 [123] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 871
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 872
2023,(doi: 10.13140/RG.2.2.36745.93289). 873
HG126 [124] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 874

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

10.20944/preprints202301.0282.v1). 880
HG124 [126] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 881

10.20944/preprints202301.0267.v1).). 883
HG123 [127] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 884
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 885
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 886

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 887
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 888
HG122 [128] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 889
prints202301.0262.v1). 892
HG121 [129] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 893
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 894

SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 895

2023010224, (doi: 10.20944/preprints202301.0224.v1). 898
HG24 [131] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 899

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 900
10.13140/RG.2.2.35061.65767). 901

HG25 [132] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 902
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 903
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 904
10.13140/RG.2.2.18494.15680). 905
HG26 [133] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 906
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 907
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 908
10.13140/RG.2.2.32530.73922). 909
HG27 [134] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 910
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 911
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 912
10.13140/RG.2.2.15897.70243). 913

10.13140/RG.2.2.32530.73922). 917
prints202301.0105.v1). 920
HG28 [137] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 921
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 922
HG29 [138] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 924
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 925
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 926
10.13140/RG.2.2.23172.19849). 927

HG30 [141] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 934
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 935
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 936
10.13140/RG.2.2.17385.36968). 937
HG107 [142] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 938
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 939
Beyond”, Preprints 2023, 2023010044 940

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 942
(doi: 10.20944/preprints202301.0043.v1). 943
HG31 [144] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 944
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 945

2023, (doi: 10.13140/RG.2.2.28945.92007). 946
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 951
10.13140/RG.2.2.35774.77123). 952
HG35 [148] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 956
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 957

10.13140/RG.2.2.29430.88642). 958
(doi: 10.20944/preprints202212.0549.v1). 964
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 966
10.13140/RG.2.2.19380.94084). 967


SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 975
(doi: 10.20944/preprints202212.0500.v1). 978

Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 980
10.13140/RG.2.2.20993.12640). 981
HG952 [156] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 982
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 983

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

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

Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 993
HG37 [160] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 994
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 995
10.13140/RG.2.2.29173.86244). 996
HG38 [161] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 997
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 998
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 999
HG154b [162] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1000

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 1001
HG153b [163] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1002
(doi: 10.5281/zenodo.7792307). 1003
HG152b [164] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1004
(doi: 10.5281/zenodo.7790728). 1005
HG151b [165] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1006
2023 (doi: 10.5281/zenodo.7787712). 1007
HG150b [166] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1008
10.5281/zenodo.7783791). 1009
HG149b [167] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1010
10.5281/zenodo.7780123). 1011
HG148b [168] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1012
(doi: 10.5281/zenodo.7773119). 1013
HG147b [169] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1014
odo.7637762). 1015

HG146b [170] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1016
10.5281/zenodo.7766174). 1017
HG145b [171] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1018
10.5281/zenodo.7762232). 1019
HG144b [172] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1020
(doi: 10.5281/zenodo.7758601). 1021
HG143b [173] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1022
10.5281/zenodo.7754661). 1023
HG142b [174] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1024
10.5281/zenodo.7750995) . 1025
HG141b [175] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1026
(doi: 10.5281/zenodo.7749875). 1027
HG140b [176] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1028
10.5281/zenodo.7747236). 1029
HG139b [177] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1030
10.5281/zenodo.7742587). 1031
HG138b [178] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1032
(doi: 10.5281/zenodo.7738635). 1033
HG137b [179] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1034
10.5281/zenodo.7734719). 1035
HG136b [180] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1036
10.5281/zenodo.7730484). 1037
HG135b [181] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1038
(doi: 10.5281/zenodo.7730469). 1039
HG134b [182] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1040
10.5281/zenodo.7722865). 1041
HG133b [183] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1042
odo.7713563). 1043
odo.7709116). 1045
HG131b [185] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1046
10.5281/zenodo.7706415). 1047
HG130b [186] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1048
(doi: 10.5281/zenodo.7706063). 1049
HG129b [187] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1050
(doi: 10.5281/zenodo.7701906). 1051

HG128b [188] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1052
odo.7700205). 1053
HG127b [189] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1054
10.5281/zenodo.7694876). 1055
HG126b [190] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1056
10.5281/zenodo.7679410). 1057
HG125b [191] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1058
10.5281/zenodo.7675982). 1059
HG124b [192] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1060
10.5281/zenodo.7672388). 1061
HG123b [193] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1062
odo.7668648). 1063
HG122b [194] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1064
10.5281/zenodo.7662810). 1065
HG121b [195] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1066
10.5281/zenodo.7659162). 1067
HG120b [196] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1068
odo.7653233). 1069
HG119b [197] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1070
odo.7653204). 1071
HG118b [198] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1072
odo.7653142). 1073
HG117b [199] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1074
odo.7653117). 1075
HG116b [200] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1076
odo.7653089). 1077
HG115b [201] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1078
odo.7651687). 1079
HG114b [202] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1080
odo.7651619). 1081
HG113b [203] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1082
odo.7651439). 1083
HG112b [204] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1084
odo.7650729). 1085
HG111b [205] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1086
odo.7647868). 1087

HG110b [206] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1088
odo.7647017). 1089
HG109b [207] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1090
odo.7644894). 1091
HG108b [208] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1092
odo.7641880). 1093
HG107b [209] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1094
odo.7632923). 1095
HG106b [210] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1096
odo.7623459). 1097
HG105b [211] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1098
10.5281/zenodo.7606416). 1099
HG104b [212] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1100
10.5281/zenodo.7606416). 1101
HG103b [213] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1102
odo.7606404). 1103
HG102b [214] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1104
10.5281/zenodo.7580018). 1105
HG101b [215] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1106
odo.7580018). 1107
odo.7580018). 1109
odo.7579929). 1111
HG98b [218] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1112
10.5281/zenodo.7563170). 1113
HG97b [219] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1114
odo.7563164). 1115
HG96b [220] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1116
odo.7563160). 1117
odo.7563160). 1119
HG94b [222] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1120
10.5281/zenodo.7563160). 1121
HG93b [223] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7557063). 1123

HG92b [224] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1124
10.5281/zenodo.7557009). 1125
HG91b [225] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1126
10.5281/zenodo.7539484). 1127
HG90b [226] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1128
10.5281/zenodo.7523390). 1129
HG89b [227] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1130
10.5281/zenodo.7523390). 1131
HG88b [228] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1132
10.5281/zenodo.7523390). 1133
HG87b [229] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1134
odo.7574952). 1135
HG86b [230] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1136
10.5281/zenodo.7574992). 1137
odo.7523357). 1139
HG84b [232] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1140
10.5281/zenodo.7523357). 1141
HG83b [233] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1142
10.5281/zenodo.7504782). 1143
HG82b [234] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1144
10.5281/zenodo.7504782). 1145
HG81b [235] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1146
10.5281/zenodo.7504782). 1147
HG80b [236] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1148
10.5281/zenodo.7499395). 1149
HG79b [237] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1150
odo.7499395). 1151
HG78b [238] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1152
10.5281/zenodo.7499395). 1153
HG77b [239] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.7497450). 1155
HG76b [240] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1156
10.5281/zenodo.7497450). 1157
HG75b [241] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1158
10.5281/zenodo.7494862). 1159

HG74b [242] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1160
odo.7494862). 1161
HG73b [243] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1162
10.5281/zenodo.7494862). 1163
HG72b [244] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1164
10.5281/zenodo.7493845). 1165
HG71b [245] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1166
10.5281/zenodo.7493845). 1167
HG70b [246] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1168
10.5281/zenodo.7493845). 1169
HG69b [247] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1170
odo.7539484). 1171
HG68b [248] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1172
odo.7523390). 1173
HG67b [249] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1174
odo.7523357). 1175
HG66b [250] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1176
odo.7504782). 1177
HG65b [251] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1178
odo.7499395). 1179
HG64b [252] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1180
odo.7497450). 1181
HG63b [253] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1182
odo.7494862). 1183
HG62b [254] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1184
odo.7493845). 1185
HG61b [255] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1186
odo.7480110). 1187
HG60b [256] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1188
odo.7378758). 1189
HG32b [257] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1190
odo.6320305). 1191
HG44b [258] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1192
odo.6677173). 1193

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

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

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1267
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1268
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1269
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1270
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1271
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1272
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1273
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1274
based on the fixed groups of cells or the fixed groups of group of cells? 1275
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1276
messy and dense SuperHyperModels where embedded notions are illustrated? 1277
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1278
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1279
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1280

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

CHAPTER 5 1302
Extreme 1303
Hamiltonian-Cycle-Decomposition 1304
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1305
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1306
2023, (doi: 10.13140/RG.2.2.34953.52320). 1307
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1308
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1309
(doi: 10.13140/RG.2.2.33275.80161). 1310
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1311
10.13140/RG.2.2.11050.90569). 1313
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1314
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1315
10.13140/RG.2.2.17761.79206). 1316
10.13140/RG.2.2.19911.37285). 1319
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1320
10.13140/RG.2.2.23266.81602). 1322
10.13140/RG.2.2.19360.87048). 1325
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1326
10.13140/RG.2.2.32363.21286). 1328
10.13140/RG.2.2.11758.69441). 1331
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1332
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1333
10.13140/RG.2.2.31891.35367). 1334
45

10.13140/RG.2.2.21510.45125). 1337
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1338
10.13140/RG.2.2.13121.84321). 1340

CHAPTER 6 1341
New Ideas On Super Decompensation By 1342
Hyper Decompress Of 1343
Hamiltonian-Cycle-Decomposition In 1344
Recognition of Cancer With 1345
(Neutrosophic) SuperHyperGraph 1346
47
CHAPTER 7 1347
ABSTRACT 1348
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1349

Cycle-Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cycle- 1350
0
Decomposition pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1351
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperHamiltonian- 1352
Cycle-Decomposition if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle- 1353

Decomposition criteria holds 1354
∀E 0 ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperVertices;
Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called 1355

Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1356
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1357

SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called Neutrosophic v- 1358
SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1359
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called 1360

Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1361
∀V 0 ∈ C : C is
49
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1362

SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian- 1363
Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic v- 1364
SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle- 1365
Decomposition. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Decomposition). Assume a Neutrosophic 1366
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 1367
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperHamiltonian-Cycle- 1368

Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic 1369
re-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition, 1370
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme Super- 1371
HyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1372
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Ex- 1373
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1374
form the Extreme SuperHyperHamiltonian-Cycle-Decomposition; a Neutrosophic SuperHyperHamiltonian- 1375
Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neut- 1376
rosophic re-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle- 1377
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for a 1378
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 1379
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutro- 1380

sophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic Supe- 1381
rHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition; 1382
an Extreme SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial if it’s either of 1383
Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian- 1384
Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic 1385
rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1386

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1387
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 1388
perHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 1389
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1390
the Extreme SuperHyperHamiltonian-Cycle-Decomposition; and the Extreme power is corresponded 1391
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHy- 1392

perPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neut- 1393
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for 1395
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 1396
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 1397
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1398
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1399
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1400
SuperHyperHamiltonian-Cycle-Decomposition; and the Neutrosophic power is corresponded to its 1401
Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition if it’s either of 1402

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1406
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1407

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1408
the Extreme SuperHyperHamiltonian-Cycle-Decomposition; a Neutrosophic V-SuperHyperHamiltonian- 1409
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinal- 1413
ity of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1414

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1415
SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition; 1416
an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial if it’s either of 1417

defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1422
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1423
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 1424
treme SuperHyperHamiltonian-Cycle-Decomposition; and the Extreme power is corresponded to its 1425
Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPoly- 1426

nomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic 1427
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for a Neutrosophic 1429
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1430
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1431
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1432

and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific 1435
research, new setting is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian- 1436
Cycle-Decomposition and Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. Two different types 1437
of SuperHyperDefinitions are debut for them but the research goes further and the SuperHy- 1438
perNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 1439
well-reviewed. The literature review is implemented in the whole of this research. For shining the 1440
elegancy and the significancy of this research, the comparison between this SuperHyperNotion 1441
with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 1442
definitions are followed by the examples and the instances thus the clarifications are driven 1443
with different tools. The applications are figured out to make sense about the theoretical 1444
aspect of this ongoing research. The “Cancer’s Recognition” are the under research to figure 1445
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 1450
are chosen and elected to research about “Cancer’s Recognition”. Thus these complex and 1451
dense SuperHyperModels open up some avenues to research on theoretical segments and 1452
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 1453

collected in the form of some questions and some problems. Assume a SuperHyperGraph. 1454
Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cycle-Decomposition is a maximal of 1455
SuperHyperVertices with a maximum cardinality such that either of the following expres- 1456
sions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 1457
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 1459
S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Decomposition is 1460

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

SuperHyperHamiltonian-Cycle-Decomposition . Since there’s more ways to get type-results to make 1467
a SuperHyperHamiltonian-Cycle-Decomposition more understandable. For the sake of having Neut- 1468
rosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to “redefine” the notion of a 1469
“SuperHyperHamiltonian-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are 1470
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1471
position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cycle-Decomposition . It’s 1472

redefined a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if the mentioned Table holds, 1473
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1474
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1475
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1476
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1477
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1478
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1479
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1480
based on a SuperHyperHamiltonian-Cycle-Decomposition . It’s the main. It’ll be disciplinary to have 1481
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 1482
have all SuperHyperHamiltonian-Cycle-Decomposition until the SuperHyperHamiltonian-Cycle-Decomposition, 1483
then it’s officially called a “SuperHyperHamiltonian-Cycle-Decomposition” but otherwise, it isn’t a 1484

SuperHyperHamiltonian-Cycle-Decomposition . There are some instances about the clarifications for 1485
the main definition titled a “SuperHyperHamiltonian-Cycle-Decomposition ”. These two examples 1486
get more scrutiny and discernment since there are characterized in the disciplinary ways 1487
of the SuperHyperClass based on a SuperHyperHamiltonian-Cycle-Decomposition . For the sake 1488
of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to “redefine” 1489

the notion of a “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition” and a “Neutrosophic 1490
SuperHyperHamiltonian-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 1491
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 1492
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 1493
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 1494
SuperHyperHamiltonian-Cycle-Decomposition are redefined to a “Neutrosophic SuperHyperHamiltonian- 1495

Cycle-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 1496
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1497
Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition more understandable. Assume a Neutro- 1498
sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 1499

Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 1500

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1501
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”, “Neutrosophic Super- 1502
HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 1503
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 1504
has a “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition” where it’s the strongest [the 1505
maximum Neutrosophic value from all the SuperHyperHamiltonian-Cycle-Decomposition amid the 1506
maximum value amid all SuperHyperVertices from a SuperHyperHamiltonian-Cycle-Decomposition .] 1507
SuperHyperHamiltonian-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a SuperHyper- 1508
Graph and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 1509
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 1510
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 1511
it’s SuperHyperHamiltonian-Cycle-Decomposition if it’s only one SuperVertex as intersection amid 1512

two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1513
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1514
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 1515
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 1516
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 1517
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1518
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1519
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 1520
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 1521
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 1522
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 1523
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 1524
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 1525
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 1526
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 1527
Recognition” and the results and the definitions will be introduced in redeemed ways. The 1528
recognition of the cancer in the long-term function. The specific region has been assigned 1529
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 1530
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 1533
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 1534
done. There are some specific models, which are well-known and they’ve got the names, and 1535
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 1536
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 1537
SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, SuperHyperBipart- 1538
ite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 1539
SuperHyperHamiltonian-Cycle-Decomposition or the strongest SuperHyperHamiltonian-Cycle-Decomposition in 1540
those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cycle-Decomposition, 1541

called SuperHyperHamiltonian-Cycle-Decomposition, and the strongest SuperHyperHamiltonian-Cycle- 1542
Decomposition, called Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, some general results 1543
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only 1544
two SuperHyperEdges but it’s not enough since it’s essential to have at least three Supe- 1545

rHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Decomposition. There isn’t any 1546

formation of any SuperHyperHamiltonian-Cycle-Decomposition but literarily, it’s the deformation of 1547
any SuperHyperHamiltonian-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. A basic 1548
familiarity with Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition theory, SuperHyperGraphs, 1549
and Neutrosophic SuperHyperGraphs theory are proposed. 1550
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Decomposition, Cancer’s 1551
Neutrosophic Recognition 1552


CHAPTER 8 1554
Applied Notions Under The Scrutiny Of 1555
The Motivation Of This Scientific 1556
Research 1557
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1558
try to bring the motivations in the narrative ways. Some cells have been faced with some 1559
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1560
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1561
as some groups and some groups or individuals have excessive labels which all are raised from 1562
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1563
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1564
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1565
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1566
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1567
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1568
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1569
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1570
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1571
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1572
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1573
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1574
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1575
disease but the model is going to figure out what’s going on this phenomenon. The special case 1576
of this disease is considered and as the consequences of the model, some parameters are used. 1577
The cells are under attack of this disease but the moves of the cancer in the special region are 1578
the matter of mind. The recognition of the cancer could help to find some treatments for this 1579
disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1580
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1581
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1582
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 1584
the architecture are formally called “ SuperHyperHamiltonian-Cycle-Decomposition” in the themes of 1585
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 1586
55
figure out the background for the SuperHyperNotions. The recognition of the cancer in the long- 1587
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1588
and neutrality about the moves and the effects of the cancer on that region; this event leads 1591
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1592
well-known and they’ve got the names, and some general models. The moves and the traces of 1594
the cancer on the complex tracks and between complicated groups of cells could be fantasized 1595
by an Extreme SuperHyperPath (-/SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 1596
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 1597
the optimal SuperHyperHamiltonian-Cycle-Decomposition or the Extreme SuperHyperHamiltonian-Cycle- 1598
Decomposition in those Extreme SuperHyperModels. Some general results are introduced. Beyond 1599
that in SuperHyperStar, all possible Extreme SuperHyperPath s have only two SuperHyperEdges 1600
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of 1601
a SuperHyperHamiltonian-Cycle-Decomposition. There isn’t any formation of any SuperHyperHamiltonian- 1602
Cycle-Decomposition but literarily, it’s the deformation of any SuperHyperHamiltonian-Cycle-Decomposition. 1603
It, literarily, deforms and it doesn’t form. 1604
amount of SuperHyperHamiltonian-Cycle-Decomposition” of either individual of cells or the groups of cells 1606

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 1607
Cycle-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 1608
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1609
messy and dense SuperHyperModels where embedded notions are illustrated? 1610
Thus it motivates us to define different types of “ SuperHyperHamiltonian-Cycle-Decomposition” 1612
and “Extreme SuperHyperHamiltonian-Cycle-Decomposition” on “SuperHyperGraph” and “Extreme 1613

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 1614
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 1615
motivates us to get some instances and examples to make clarifications about the framework of 1616
this research. The general results and some results about some connections are some avenues to 1617
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 1618
The framework of this research is as follows. In the beginning, I introduce basic definitions 1619
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1620
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1621
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1622
review literature are applied to make sense about what’s going to figure out about the 1623
upcoming sections. The main definitions and their clarifications alongside some results 1624
about new notions, SuperHyperHamiltonian-Cycle-Decomposition and Extreme SuperHyperHamiltonian- 1625

Cycle-Decomposition, are figured out in sections “ SuperHyperHamiltonian-Cycle-Decomposition” and 1626
“Extreme SuperHyperHamiltonian-Cycle-Decomposition”. In the sense of tackling on getting results 1627
and in Hamiltonian-Cycle-Decomposition to make sense about continuing the research, the ideas of 1628
SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their consequences, 1629
corresponded SuperHyperClasses are figured out to debut what’s done in this section, 1630
titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As 1631

going back to origin of the notions, there are some smart steps toward the common 1632
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1633
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Extreme 1634
SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1635
as concluding and closing section of theoretical research are contained in the section 1636
“General Results”. Some general SuperHyperRelations are fundamental and they are 1637
well-known as fundamental SuperHyperNotions as elicited and discussed in the sections, 1638

“General Results”, “ SuperHyperHamiltonian-Cycle-Decomposition”, “Extreme SuperHyperHamiltonian- 1639
Cycle-Decomposition”, “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1640
There are curious questions about what’s done about the SuperHyperNotions to make sense 1641
about excellency of this research and going to figure out the word “best” as the description 1642
and adjective for this research as presented in section, “ SuperHyperHamiltonian-Cycle-Decomposition”. 1643
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1644
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1645
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1646
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1647
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1648
to make sense to figure out this research in featured style. The advantages and the limitations 1649
of this research alongside about what’s done in this research to make sense and to get sense 1650
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1651

CHAPTER 9 1652
Extreme Preliminaries Of This Scientific 1653
Research On the Redeemed Ways 1654
In this section, the basic material in this scientific research, is referred to [Single Valued 1655
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1656
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1657

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1658
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1659
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1660
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1661
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1662
their clarifications are addressed to Ref.[HG38]. 1663

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

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

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

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1683
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1684
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1685
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1686
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1687
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1688

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

(Ref.[HG38],Definition 2.7,p.3). 1690
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1691
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1692
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1693
(i) If |Vi | = 1, then Vi is called vertex; 1694
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1695
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1696
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1697
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1698
SuperEdge; 1699
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1700
SuperHyperEdge. 1701
If we choose different types of binary operations, then we could get hugely diverse types of 1702
general forms of Neutrosophic SuperHyperGraph (NSHG). 1703
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1704

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1705
x, y, z, w ∈ [0, 1]: 1706
(i) 1 ⊗ x = x; 1707
(ii) x ⊗ y = y ⊗ x; 1708
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1709
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1710

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

where 1713

1, 2, . . . , n0 ); 1718
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1719
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1720
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1721
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1722
0


SuperEdge; 1742
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1745
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1746
makes the patterns and regularities. 1747
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1748
of elements of SuperHyperEdges are the same. 1749

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1750
makes to have SuperHyperUniform more understandable. 1751
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1752
Classes as follows. 1753
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1754
two given SuperHyperEdges with two exceptions; 1755
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1756
SuperHyperEdges; 1757
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1758
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1759
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1760
in common; 1761
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1762
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1763
SuperHyperEdge in common; 1764
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1765
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1766
SuperVertex. 1767
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 1768
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1769
(i) Vi , Vi+1 ∈ Ei0 ; 1770
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1771
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1772
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1773
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1774
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1775
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1776
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1777
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1779
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1780
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1781
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1782
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1783
perPath . 1784
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 1785
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1786
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1787
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1788
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1789
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1790

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

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


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

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

Decomposition). 1807
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1809
or E 0 is called 1810
(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 1811

is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1812
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 1813

is called Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1814
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1815
(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 1816
is called Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 1817
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 1818
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1820

(v) Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutro- 1821

sophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Cycle- 1822
Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic rv- 1823
SuperHyperHamiltonian-Cycle-Decomposition. 1824
Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Decomposition). 1825

(i) an Extreme SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutrosophic 1828

e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Cycle- 1829
Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic 1830
rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyper- 1831
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1832
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1833
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1834
that they form the Extreme SuperHyperHamiltonian-Cycle-Decomposition; 1835
(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutro- 1836

SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for a Neutrosophic SuperHyper- 1839
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1840
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1841

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1842
such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition; 1843
(iii) an Extreme SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 1844

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic 1845
re-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle- 1846
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) 1847
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1848
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1849
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 1850

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 1851
perVertices such that they form the Extreme SuperHyperHamiltonian-Cycle-Decomposition; and 1852
the Extreme power is corresponded to its Extreme coefficient; 1853
(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 1854

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyper- 1858

Polynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 1859
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 1860
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1861
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1862
form the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition; and the Neutrosophic power 1863
is corresponded to its Neutrosophic coefficient; 1864

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

SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1868
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1869
of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1870

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


SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1878
(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 1881

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

(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 1891

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 1897

is corresponded to its Neutrosophic coefficient. 1901
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Decomposition). 1902

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1903
(i) an δ−SuperHyperHamiltonian-Cycle-Decomposition is a Neutrosophic kind of Neutrosophic 1904
SuperHyperHamiltonian-Cycle-Decomposition such that either of the following expressions hold 1905

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
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1906
|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 1907
(29.1), holds if S is an δ−SuperHyperDefensive; 1908
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Decomposition is a Neutrosophic kind 1909

of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition such that either of the following 1910
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 1911
of s ∈ S : 1912
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1913
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1914
For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need 1915

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1924
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 1925
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1926
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1927
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1928
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1929
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 1930
. Since there’s more ways to get type-results to make a Neutrosophic

Cycle-Decomposition 1931

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

136TBL4

136TBL1
SuperHyperHamiltonian-Cycle-Decomposition more Neutrosophicly understandable. 1932

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to 1933
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”. 1934
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1935
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 1936
values. 1937
136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Cycle-Decomposition. It’s redefined a Neutro- 1938
sophic SuperHyperHamiltonian-Cycle-Decomposition if the Table (29.3) holds. 1939

CHAPTER 10 1940
Extreme SuperHyper But As Hamiltonian-Cycle-Decomposition 1941
The Extensions Excerpt From Dense And 1942
Super Forms 1943
Definition 10.0.1. (Extreme event). 1944
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 1945
a probability Hamiltonian-Cycle-Decomposition. Any Extreme k-subset of A of V is called Extreme 1946
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1947
expression is called Extreme probability of A. 1948
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1949

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1950
is a probability Hamiltonian-Cycle-Decomposition. s Extreme k-events Ai , i ∈ I is called Extreme 1951

s-independent if the following expression is called Extreme s-independent criteria 1952
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 1953
following expression is called Extreme independent criteria 1954
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 1955

is a probability Hamiltonian-Cycle-Decomposition. Any k-function Hamiltonian-Cycle-Decomposition like E is 1957

called Extreme k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Decomposition like E is 1958
called Extreme Variable. 1959
The notion of independent on Extreme Variable is likewise. 1960
Definition 10.0.4. (Extreme Expectation). 1961
71
is a probability Hamiltonian-Cycle-Decomposition. an Extreme k-Variable E has a number is called 1963

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

a probability Hamiltonian-Cycle-Decomposition. an Extreme number is called Extreme Crossing if 1967

the following expression is called Extreme Crossing criteria 1968
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 1969
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let m and n propose special Hamiltonian-Cycle- 1970
Decomposition. Then with m ≥ 4n, 1971
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Hamiltonian-Cycle-Decomposition 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: 1972
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
1973
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 1974
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let P be a SuperHyperSet of n 1975
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 1976
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 1977
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 1978

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 1997
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 1998
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 1999
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2000
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2001
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let X be a nonnegative Extreme 2002
Variable and t a positive real number. Then 2003
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. 2004
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2005
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let Xn be a nonnegative integer- 2006
valued variable in a probability Hamiltonian-Cycle-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2007

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

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2013
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. A special SuperHyperGraph in Gn,p is 2014
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2015
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2016
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2017
SuperHyperEdge of the Extreme SuperHyperGraph G. 2018
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2019
Extreme Variable for this Extreme Event. By equation, we have 2020
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 2021
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2022
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: 2023
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2024
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 2025
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2026
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2027
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2028
Definition 10.0.12. (Extreme Variance). 2029

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

S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let X be an Extreme Variable and let t 2037
be a positive real number. Then 2038
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2039
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let Xn be an Extreme Variable in 2041
a probability Hamiltonian-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2042
then 2043
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 2045
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2046
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2047
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 2049
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 2050
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2051
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. As in the proof of related Theorem, the 2053
result is straightforward. 2054
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 2056
be as defined in previous Theorem. Then either: 2057
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2058
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2059
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. The latter is straightforward. 2061
Definition 10.0.17. (Extreme Threshold). 2062

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

Definition 10.0.18. (Extreme Balanced). 2069

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2070
probability Hamiltonian-Cycle-Decomposition. Let F be a fixed Extreme SuperHyperGraph. Then 2071
there is a threshold function for the property of containing a copy of F as an Extreme 2072
SubSuperHyperGraph is called Extreme Balanced. 2073
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let F be a nonempty balanced 2075
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2076

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

SuperHyperHamiltonian-Cycle-Decomposition, is up. The Extreme Algorithm is Extremely 2083
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop 2084
Extreme SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of 2085
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 2086
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2087
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2088

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

= {{E4 }}.
C(N SHG)Extreme Hamiltonian-Cycle-Decomposition SuperHyperPolynomial
= z.
C(N SHG)Extreme V-Hamiltonian-Cycle-Decomposition
= {{V1 , V2 , V4 }}.
C(N SHG)Extreme V-Hamiltonian-Cycle-Decomposition SuperHyperPolynomial
= z3.
2090

straightforward. E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an 2093

Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2094
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2095
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2096
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2097

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

straightforward. 2102

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




= {{E4 }, {E5 }}.
= 2z.
= {{V1 , V2 , V3 , {N }, {F }}}.
= z5.
2107


= {{}}.
= z0.

= {{}}.
= z0.
2111


= {{Eii=110 , Ejj=2232 , E12 }, . . .}.
= az 22 .
= {{Vi }22
i=1 }.
= z 22 .
2115



= {{E15 , E13 , E16 , E14 , E17 , E12 }, . . .}.
= z6.
= {{Vi }14
i=1 }.
= z 14 .
2119


= {{}}.


= z0.
= {{}}.
= z0.
2123


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

2127
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHyperHamiltonian- 2128
Cycle-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2129
begineqnarray* C(NSHG)Extreme Hamiltonian-Cycle-Decomposition 2130
= {E1 , E6 , E2 , E7 , E3 , E4 }. 2131
C(N SHG)Extreme Hamiltonian-Cycle-Decomposition SuperHyperPolynomial 2132

= z6. 2133
C(N SHG)Extreme V-Hamiltonian-Cycle-Decomposition 2134
= {Vi }14i=1 . 2135
C(N SHG)Extreme V-Hamiltonian-Cycle-Decomposition SuperHyperPolynomial 2136
= z 14 . 2137
On the Figure (30.11), the Extreme SuperHyperNotion, namely, Extreme SuperHyperHamiltonian- 2138
Cycle-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2139

= {{E1 , E6 , E3 , E8 }, {E1 , E6 , E3 , E7 }, {E1 , E7 , E3 , E8 }}.
= 3z 4 .
= {{Vi }6i=1 }.


= z6.
2140
, is up. The Extreme Algorithm is Extremely straightforward.

= {{}}.
= z0.
= {{}}.
= z0.
2143

Cycle-Decomposition , is up. The Extreme Algorithm is Extremely straightforward. 2145

= {{E9 , E6 , E3 , E7 }, {E9 , E6 , E3 , E8 }, {E9 , E7 , E3 , E8 }}.
= 3z 4 .
= {{Vi }6i=1 }.
= z6.
2146

= {{}}.
= z0.

= {{}}.
= z0.
2149

= {{}}.
= z0.
= {{}}.
= z0.
2152


= {{}}.
= z0.
= {{}}.
= z0.
2155



= {{}}.
= z0.
= {{}}.
= z0.
2158

= {{}}.
= z0.

= {{}}.
= z0.
2161

= {{Eii=112 }}.
= z 12 .
= {{Vi }ai=1 }.
= za.
2164


= {{}}.
= z0.
= {{}}.
= z0.
2167

= {{E1 , E2 }}.
= z2.

= {VE2 }.
= z 10 .
2170

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2180
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2181
quasi-R-Hamiltonian-Cycle-Decomposition minus all Extreme SuperHypeNeighbor to some of them but not 2182
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2183
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle- 2184
Decomposition, minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2185
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

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

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but
in an Extreme Hamiltonian-Cycle-Decomposition, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Cycle-Decomposition 2203
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2204
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2205
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2206
number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Cycle-Decomposition in 2207
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2208
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2209
contained in an Extreme R-Hamiltonian-Cycle-Decomposition. 2210
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Ex- 2211
treme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2212
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme Super- 2213
HyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2214
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2215
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2216
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2217
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2218
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyper- 2219
Vertices. Thus it forms an Extreme quasi-R-Hamiltonian-Cycle-Decomposition where the Extreme 2220
completion of the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embed- 2221
ded R-Hamiltonian-Cycle-Decomposition. The SuperHyperNotions of embedded SuperHyperSet and 2222
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2223
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 2224
those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2225
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2226
included in the minimum Extreme style of the embedded Extreme R-Hamiltonian-Cycle-Decomposition. 2227
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2228
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2229
common connections, more precise and more formal, the perfect unique connections inside 2230
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2231
Extreme R-Hamiltonian-Cycle-Decomposition. Thus Extreme exterior SuperHyperVertices could be 2232
used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the 2233
interior Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Ex- 2234
treme Hamiltonian-Cycle-Decomposition, there’s the usage of exterior Extreme SuperHyperVertices since 2235

they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 2236
than the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2237
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has 2238
been ignored in the exploring to lead on the optimal case implying the Extreme R-Hamiltonian- 2239
Cycle-Decomposition. The Extreme R-Hamiltonian-Cycle-Decomposition with the exclusion of the exclusion 2240
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2241
the Extreme R-Hamiltonian-Cycle-Decomposition with the inclusion of all Extreme SuperHyperVertices 2242
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Cycle-Decomposition. To sum 2243
them up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2244
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2245
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian- 2246
Cycle-Decomposition minus all Extreme SuperHypeNeighbor to some of them but not all of them. In 2247
other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 2248
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Cycle-Decomposition, minus 2249
all Extreme SuperHypeNeighbor to some of them but not all of them. 2250
The main definition of the Extreme R-Hamiltonian-Cycle-Decomposition has two titles. an Ex- 2251
treme quasi-R-Hamiltonian-Cycle-Decomposition and its corresponded quasi-maximum Extreme R- 2252
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2253
there’s an Extreme quasi-R-Hamiltonian-Cycle-Decomposition with that quasi-maximum Extreme Su- 2254

perHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2255
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us 2256
to take the collection of all the Extreme quasi-R-Hamiltonian-Cycle-Decompositions for all Extreme 2257
numbers less than its Extreme corresponded maximum number. The essence of the Extreme 2258
Hamiltonian-Cycle-Decomposition ends up but this essence starts up in the terms of the Extreme quasi- 2259
R-Hamiltonian-Cycle-Decomposition, again and more in the operations of collecting all the Extreme 2260
quasi-R-Hamiltonian-Cycle-Decompositions acted on the all possible used formations of the Extreme 2261
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2262
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Decompositions. Let 2263
zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Cycle-Decomposition be an Extreme 2264
number, an Extreme SuperHyperSet and an Extreme Hamiltonian-Cycle-Decomposition. Then 2265
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Cycle-Decomposition ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Hamiltonian-Cycle-Decomposition is re- 2266
formalized and redefined as follows. 2267
GExtreme Hamiltonian-Cycle-Decomposition ∈ ∪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 2268

definition for the Extreme Hamiltonian-Cycle-Decomposition . 2269
GExtreme Hamiltonian-Cycle-Decomposition =
{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- 2270
poses the upcoming expressions.
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2272
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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

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



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

2276

2277

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2278
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2279
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2280
HyperEdge. It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Cycle-Decomposition” but, 2281
precisely, it’s the generalization of “Extreme Quasi-Hamiltonian-Cycle-Decomposition” since “Extreme 2282

Quasi-Hamiltonian-Cycle-Decomposition” happens “Extreme Hamiltonian-Cycle-Decomposition” in an Extreme 2283
SuperHyperGraph as initial framework and background but “Extreme SuperHyperNeighbor- 2284
hood” may not happens “Extreme Hamiltonian-Cycle-Decomposition” in an Extreme SuperHyperGraph 2285
as initial framework and preliminarily background since there are some ambiguities about 2286
the Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Ex- 2287
treme SuperHyperNeighborhood”, “Extreme Quasi-Hamiltonian-Cycle-Decomposition”, and “Extreme 2288

Hamiltonian-Cycle-Decomposition” are up. 2289
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Cycle-Decomposition 2290
be an Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Cycle- 2291
Decomposition and the new terms are up. 2292

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

2293
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2294
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2295
And with go back to initial structure, 2296


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


2298

2299

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

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

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

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

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

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

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

, not:
Decomposition
Is the Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2300
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2301
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2302
the 2303
“Extreme R-Hamiltonian-Cycle-Decomposition” 2304
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2305
Extreme R-Hamiltonian-Cycle-Decomposition, 2306
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Hamiltonian-Cycle-Decomposition. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Hamiltonian-Cycle-Decomposition is the cardinality of
2307
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2308
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Cycle-Decomposition if for 2309
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2310
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2311
all minus all Extreme SuperHypeNeighbors to any amount of them. 2312
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2313
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2314
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2315
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2316
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme R- 2317
Hamiltonian-Cycle-Decomposition with the least cardinality, the lower sharp Extreme bound for Extreme 2318
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2319
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2320

S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2321
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Hamiltonian-Cycle-Decomposition. 2322
Since it doesn’t have 2323
2324
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2325
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2326
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2327
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Supe- 2328
rHyperVertices but it isn’t an Extreme R-Hamiltonian-Cycle-Decomposition. Since it doesn’t do 2329
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2330
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2331
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2332
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2333
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2334
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2335
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2336
Thus the obvious Extreme R-Hamiltonian-Cycle-Decomposition, VESHE is up. The obvious simple Ex- 2337
treme type-SuperHyperSet of the Extreme R-Hamiltonian-Cycle-Decomposition, VESHE , is an Extreme 2338
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2339
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2340
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2341
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2342
S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2343
some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2344
ESHG : (V, E). Any Extreme R-Hamiltonian-Cycle-Decomposition only contains all interior Extreme 2345
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2346
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2347
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2348
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2349
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2350
The SuperHyperNotion, namely, Hamiltonian-Cycle-Decomposition, is up. There’s neither empty 2351

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

Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2357
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cycle-Decomposition C(ESHG) for an Extreme SuperHyperGraph 2358
ESHG : (V, E) is an Extreme type-SuperHyperSet with 2359
2360
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2361

perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2362
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2363
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2364
Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Cycle-Decomposition is up. The 2365
obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Decomposition is 2366
an Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2367
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2368
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2369
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle- 2370
Decomposition is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2371
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2373
Cycle-Decomposition. Since the Extreme SuperHyperSet of the Extreme SuperHy- 2374

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Extreme Hamiltonian-Cycle-Decomposition C(ESHG) for an Extreme SuperHyperGraph 2376

ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2377
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2378
that Extreme type-SuperHyperSet called the Extreme Hamiltonian-Cycle-Decomposition and it’s an 2379
Extreme Hamiltonian-Cycle-Decomposition. Since it’s 2380
2381
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2382
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2383
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2384
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2385
intended Extreme SuperHyperSet, 2386
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Thus the non-obvious Extreme Hamiltonian-Cycle-Decomposition , 2387
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Cycle- 2388
, not:
Decomposition 2389

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Extreme SuperHyperSet, not: 2390
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2391
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2392
SuperHyperSet called the 2393
“Extreme Hamiltonian-Cycle-Decomposition ” 2394
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2395
Extreme Hamiltonian-Cycle-Decomposition , 2396
is only and only 2397
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2398

CHAPTER 11 2399
The Extreme Departures on The 2400
Theoretical Results Toward Theoretical 2401
Motivations 2402
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2403
SuperHyperClasses. 2404
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2405

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

SuperHyperHamiltonian-Cycle-Decomposition in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2408
new way to redefine as 2409
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 2410
to ViEXT ERN AL in the literatures of SuperHyperHamiltonian-Cycle-Decomposition. The latter is 2411

136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2413
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2414
(31.1), is the SuperHyperHamiltonian-Cycle-Decomposition. 2415
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2416

= {{E ∈ EN SHG }}.
= z |EN SHG | .

= {{V ∈ VN SHG }}.

= z |VN SHG | .
Proof. Let 2417
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2418
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 2419

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2424
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2425
SuperHyperModel (31.2), is the Extreme SuperHyperHamiltonian-Cycle-Decomposition. 2426
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2427

= {{}}.
= z0.
= {{}}.
= z0.

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

SuperHyperHamiltonian-Cycle-Decomposition in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2428
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2429
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2430
way to redefine as 2431


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

SuperHyperHamiltonian-Cycle-Decomposition in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2435
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2436
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2437
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperHamiltonian- 2438
Cycle-Decomposition. 2439
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2440

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

min
= az |PN SHG | .
|V
N SHG |
= {{Vi }i=1 }.
= z |VN SHG | .
Proof. Let 2441
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
2442
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 2443
a new way to redefine as 2444

straightforward. Then there’s no at least one SuperHyperHamiltonian-Cycle-Decomposition. Thus 2447
the notion of quasi may be up but the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2448
Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2449
could have one SuperHyperVertex as the representative in the 2450
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Cycle-Decomposition taken from a connected Extreme SuperHyper- 2451

Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2452
SuperHyperPart SuperHyperEdges are attained in any solution 2453
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2454
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2455
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2456
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2457
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2458
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Cycle-Decomposition. 2459

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

Extreme SuperHyperHamiltonian-Cycle-Decomposition in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2460
Then 2461

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

min
= az |PN SHG | .
|V
N SHG |
= {{Vi }i=1 }.
= z |VN SHG | .
Proof. Let 2462
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2463
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2473
SuperHyperEdges are attained in any solution 2474
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2475
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2477
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2478
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2479
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2480
the Extreme SuperHyperHamiltonian-Cycle-Decomposition. 2481
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2482

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

= {{Ei , Ei∗ , Ej∗ }, . . .}.

i=1|EN SHG |−1

= z |EN SHG |+1 .
|V
N SHG |
= {{Vi }i=1 }.
= z |VN SHG | .
Proof. Let 2483
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2484
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

Extreme SuperHyperHamiltonian-Cycle-Decomposition in the Extreme Example (42.0.15) 136NSHG23a
Wheel ESHW : (V, E). There’s a new way to redefine as 2486

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Decomposition. Thus the 2489
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 2490
Decomposition could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Decomposition 2491
proposes some longest SuperHyperHamiltonian-Cycle-Decomposition excerpt from some representatives. 2492

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2494
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2495
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2496
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2497
Extreme SuperHyperHamiltonian-Cycle-Decomposition. 2498

CHAPTER 12 2499
The Surveys of Mathematical Sets On 2500
The Results But As The Initial Motivation 2501
For the SuperHyperHamiltonian-Cycle-Decomposition, Extreme SuperHyperHamiltonian-Cycle-Decomposition, 2502

and the Extreme SuperHyperHamiltonian-Cycle-Decomposition, some general results are introduced. 2503
Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Cycle-Decomposition is “redefined” 2504
on the positions of the alphabets. 2505
Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Cycle-Decomposition. Then 2506
Extreme SuperHyperHamiltonian − Cycle − Decomposition =

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

and the neutrality, for i = 1, 2, 3, respectively. 2509
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the alpha- 2510
bet. Then the notion of Extreme SuperHyperHamiltonian-Cycle-Decomposition and SuperHyperHamiltonian- 2511
Cycle-Decomposition coincide. 2512
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2513
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2514
SuperHyperHamiltonian-Cycle-Decomposition if and only if it’s a SuperHyperHamiltonian-Cycle-Decomposition. 2515
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2516
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2517
SuperHyperHamiltonian-Cycle-Decomposition if and only if it’s a longest SuperHyperHamiltonian-Cycle- 2518
Decomposition. 2519
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2520

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Decomposition is its 2521
SuperHyperHamiltonian-Cycle-Decomposition and reversely. 2522
123
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Decomposition, 2523

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2524
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Cycle-Decomposition is its 2525
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2527
isn’t well-defined if and only if its SuperHyperHamiltonian-Cycle-Decomposition isn’t
well-defined. 2529
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2530

its Extreme SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined if and only if its 2531
SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined. 2532

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then 2534
its Extreme SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined if and only if its 2535
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian-2537

is well-defined if and only if its SuperHyperHamiltonian-Cycle-Decomposition is well- 2538
Cycle-Decomposition
defined. 2539
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its Ex- 2540
treme SuperHyperHamiltonian-Cycle-Decomposition is well-defined if and only if its SuperHyperHamiltonian- 2541

Cycle-Decomposition is well-defined. 2542
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Ex- 2544

treme SuperHyperHamiltonian-Cycle-Decomposition is well-defined if and only if its SuperHyperHamiltonian- 2545
Cycle-Decomposition is well-defined. 2546
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2547
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2548
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2549
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2550
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2551
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2552
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2553
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2554
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2555
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2556
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2557
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2558

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2559
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2560
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2561

independent SuperHyperSet is 2562
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2565
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2569

which is a SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath. Then V is a maximal 2570
(i) : SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2571
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2572
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2573
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2574
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2575
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2576
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2577
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2578
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2579
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2580
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2581
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2582
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2583
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2584
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2585
which is a SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath. Then the number of 2588

(i) : the SuperHyperHamiltonian-Cycle-Decomposition; 2589
(ii) : the SuperHyperHamiltonian-Cycle-Decomposition; 2590
(iii) : the connected SuperHyperHamiltonian-Cycle-Decomposition; 2591
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 2592
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 2593
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition. 2594
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2595
coincide. 2596

which is a SuperHyperWheel. Then the number of 2598
(i) : the dual SuperHyperHamiltonian-Cycle-Decomposition; 2599
(ii) : the dual SuperHyperHamiltonian-Cycle-Decomposition; 2600
(iii) : the dual connected SuperHyperHamiltonian-Cycle-Decomposition; 2601
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 2602
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 2603
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition. 2604
coincide. 2606

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2608
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2609
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2610
is a 2611
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2615
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2616
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2617


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2620
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2621
SuperHyperPart is a 2622
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2626
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2627
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2628

SuperHyperMultipartite. Then Then the number of 2631
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2638
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2639
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2641
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2642
(iv) : SuperHyperHamiltonian-Cycle-Decomposition; 2646
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2647
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2648

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2649
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2650
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2651
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2652

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

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2659
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2660
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2661
dual 2662
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2666
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2669
perComplete. Then there’s no independent SuperHyperSet. 2670
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2671

SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 2672
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 2673
dual 2674
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2678
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2679

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2680
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2681
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2682

O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2683
t>
2
setting of a dual 2684


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2691
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2692
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2693
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2694
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2695
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such that 2696
(i) v ∈ Ns (x); 2697
(ii) vx ∈ E. 2698
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2699
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition, then 2700
(i) S is SuperHyperHamiltonian-Cycle-Decomposition set; 2701
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2702
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2703
(i) Γ ≤ O; 2704
(ii) Γs ≤ On . 2705
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2706
connected. Then 2707
(i) Γ ≤ O − 1; 2708
(ii) Γs ≤ On − Σ3i=1 σi (x). 2709
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2710

(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2711

SuperHyperHamiltonian-Cycle-Decomposition; 2712
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2713
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2714
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2715
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2717
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2718

Decomposition; 2719
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2720
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2721
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2722
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Decomposition. 2724

Then 2725
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 2726

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2736
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2737
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2739
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Decomposition; 2740
(ii) Γ = 1; 2741
(iii) Γs = Σ3i=1 σi (c); 2742

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Decomposition. 2743
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2744
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2745
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 2746
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2747
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2748
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2749
SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 2750
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2751
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2752
(ii) Γ = b n2 c + 1; 2754
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2755
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 2756
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2758
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2759
Decomposition; 2760
(ii) Γ = b n2 c; 2761

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

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

Cycle-Decomposition for N SHF; 2768
(ii) Γ = m for N SHF : (V, E); 2769
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2770
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2771
Cycle-Decomposition for N SHF : (V, E). 2772

Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2773

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2774
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 2775
SuperHyperHamiltonian-Cycle-Decomposition for N SHF; 2776
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2777

b n c+1 for N SHF : (V, E); 2778
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal SuperHyperHamiltonian-Cycle- 2779
Decomposition for N SHF : (V, E). 2780
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2781
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2782
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 2783
Decomposition for N SHF : (V, E); 2784
(ii) Γ = b n2 c for N SHF : (V, E); 2785

bnc for N SHF : (V, E); 2786
S={vi }i=1
bnc
are only dual maximal SuperHyperHamiltonian-Cycle- 2787
following statements hold; 2790
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2791

SuperHyperHamiltonian-Cycle-Decomposition, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
2792
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2794

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

SuperHyperHamiltonian-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
2800

SuperHyperHamiltonian-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 2803
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2805
SuperHyperGraph. Then following statements hold; 2806

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

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

Proposition 12.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Extreme 2815
(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2819

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


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

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


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

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

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Decomposition. Then following statements 2846

hold; 2847
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 2848

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

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

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


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

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


CHAPTER 13 2867
Extreme Applications in Cancer’s 2868
Extreme Recognition 2869
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2870
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2871
as the consequences of the model, some parameters are used. The cells are under attack of this 2872
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2873
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2874
In the following, some Extreme steps are Extreme devised on this disease. 2875
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2876
function. 2877
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2878
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2879
effects of the cancer on that region; this event leads us to choose another model [it’s said 2882
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2883
what’s done. 2884
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2885
they’ve got the names, and some general Extreme models. The moves and the Extreme 2886
traces of the cancer on the complex tracks and between complicated groups of cells could 2887
be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Decomposition, 2888
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 2889
aim is to find either the Extreme SuperHyperHamiltonian-Cycle-Decomposition or the Extreme 2890
SuperHyperHamiltonian-Cycle-Decomposition in those Extreme Extreme SuperHyperModels. 2891
135
CHAPTER 14 2892
Case 1: The Initial Extreme Steps 2893
Toward Extreme SuperHyperBipartite 2894
as Extreme SuperHyperModel 2895
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2896
is Extreme highlighted and Extreme featured. 2897
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2898
partite is obtained. 2899
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2900
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

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

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

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

CHAPTER 15 2904
Case 2: The Increasing Extreme Steps 2905
Toward Extreme 2906
SuperHyperMultipartite as Extreme 2907
SuperHyperModel 2908
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2909
ite is Extreme highlighted and Extreme featured. 2910
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2911
partite is obtained. 2912
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2913
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- 2914

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

CHAPTER 16 2917
Wondering Open Problems But As The 2918
Directions To Forming The Motivations 2919
In what follows, some “problems” and some “questions” are proposed. 2920
The SuperHyperHamiltonian-Cycle-Decomposition and the Extreme SuperHyperHamiltonian-Cycle- 2921
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 2922
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2923
recognitions? 2924
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle- 2925

and the Extreme SuperHyperHamiltonian-Cycle-Decomposition?
Decomposition 2926
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2927
them? 2928
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 2929
and the Extreme SuperHyperHamiltonian-Cycle-Decomposition?
Problem 16.0.5. The SuperHyperHamiltonian-Cycle-Decomposition and the Extreme SuperHyperHamiltonian- 2931

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperHamiltonian-Cycle-Decomposition, are there else? 2933
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2934
Numbers types-results? 2935
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2936
the multiple types of SuperHyperNotions? 2937
141
CHAPTER 17 2938
Conclusion and Closing Remarks 2939
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2940
research are illustrated. Some benefits and some advantages of this research are highlighted. 2941
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2942
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Cycle- 2943
Decomposition. For that sake in the second definition, the main definition of the Extreme 2944
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for 2945
the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian- 2946
Cycle-Decomposition, finds the convenient background to implement some results based on that. 2947
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 2948
on the modeling of the regions where are under the attacks of the cancer to recognize this 2949
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 2950
the SuperHyperNotion, SuperHyperHamiltonian-Cycle-Decomposition, the new SuperHyperClasses and 2951
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 2952
SuperHyperHamiltonian-Cycle-Decomposition and the Extreme SuperHyperHamiltonian-Cycle-Decomposition. 2953

The clarifications, instances and literature reviews have taken the whole way through. In this 2954
research, the literature reviews have fulfilled the lines containing the notions and the results. The 2955
Recognitions” and both bases are the background of this research. Sometimes the cancer has 2957
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 2958
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 2959
moves of the cancer in the longest and strongest styles with the formation of the design and 2960
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 2963
for this research are, figured out, pointed out and spoken out. 2964
143
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cycle-Decomposition
3. Extreme SuperHyperHamiltonian-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 2965
Extreme SuperHyperDuality But As The 2966
Extensions Excerpt From Dense And 2967
Super Forms 2968
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 2969

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

Va ∈ Ei , Ej ; 2973
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 2974
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 2975
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2976
Vi , Vj ∈ Ea ; 2977
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 2978
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 2979
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 2980
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 2981

SuperHyperDuality. 2982
Definition 18.0.2. ((Extreme) SuperHyperDuality). 2983

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2988
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 2989
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 2990
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 2991
Extreme SuperHyperDuality; 2992
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 2993

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 2994
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 2995
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 2996
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 2997
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 2998
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 2999

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3000
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3001
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3003
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3004
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3006
coefficient; 3007
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3008

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3031
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3032
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3033
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3034
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3035

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3036

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3044
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3045
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3046
to its Extreme coefficient. 3047
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3048
mentioned Extreme Figures in every Extreme items. 3049
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3050
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3051
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3052
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3053
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- 3058
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3059
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3060
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3061
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3062
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3063
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3064


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

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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3134
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 3136
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3157

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3161
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3162
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. 3174
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 3176
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 : 3177

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

∃!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 3182
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3183
Extreme SuperHyperDuality. 3189

CHAPTER 19 3190
Extreme SuperHyperJoin But As The 3191
Super Forms 3193
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3194

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3205
|Vj |NEUTROSOPIC CARDINALITY ; 3206
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3207
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3208
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3209

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3213
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3214
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3215
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3216
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3217
159
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3218

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3225
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3226
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3227
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3228
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3229
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3230
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3231
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3232

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3244
SuperHyperJoin; 3246
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3247

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3250
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3251
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3252
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3253
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3254

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3257

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

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3265
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3268
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3271
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3272
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3273

SuperHyperJoin. 3278
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 3280
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3281
V3 , is excluded in every given Extreme SuperHyperJoin. 3285

is up. The Extreme Algorithm is Extremely straightforward. 3287


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3408
Extreme SuperHyperPerfect But As The 3409
Super Forms 3411
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3412

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3424
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3425

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3429
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3430
Extreme SuperHyperPerfect; 3434
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3435

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3442
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3443
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3448
coefficient; 3449
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3450

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3486
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3487
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3488
to its Extreme coefficient. 3489
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3492
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3493
SuperHyperPerfect. 3499
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 3501
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3502
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3506


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

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

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

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

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



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

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

Then 3597

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



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

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

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


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

CHAPTER 21 3632
Extreme SuperHyperTotal But As The 3633
Super Forms 3635
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3636
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3639
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3640

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3646
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3647

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3651
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3653
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3654
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3655
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3656

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3663
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3664
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3665
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3666
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3667
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3668
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3669
cient; 3670
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3671

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3672
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3674
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3675
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3676

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3682
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3683
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3684
SuperHyperTotal; 3686
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3687

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3694
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3695
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3698
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3699
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3700
Extreme coefficient; 3701

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3703
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3705
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3706
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3707
cient. 3710
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3713
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3714
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3715
SuperHyperTotal. 3720
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 3722
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3723

V3 , is excluded in every given Extreme SuperHyperTotal. 3727



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3775
(31.1), is the SuperHyperTotal. 3778
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 3780
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. 3787
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 3789
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3851
Extreme SuperHyperConnected But As 3852
Super Forms 3854
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3855

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3869
SuperHyperConnected. 3870
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3871
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3874

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

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3883
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3884
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3885
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3886
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3887

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3888
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3889
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3890
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3891
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3894
power is corresponded to its Extreme coefficient; 3895
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3896


(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,3905

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

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

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

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

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


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

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


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

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

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 3996
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. 4000
(31.1), is the SuperHyperConnected. 4003
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 4005
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. 4012
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 4014



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4033

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4068
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4069
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4070
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4071
some representatives. The latter is straightforward. 4072
Extreme SuperHyperConnected. 4077

CHAPTER 23 4078
Background 4079
215











in Scribd. 4237



Bibliography 4269
10.33140/JMTCM.01.03.09) 4276
221
10.20944/preprints202301.0282.v1). 4304
10.20944/preprints202301.0267.v1). 4307

(doi: 10.20944/preprints202301.0265.v1). 4312
prints202301.0262.v1). 4316
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4322
prints202301.0105.v1). 4325
Preprints 2023, 2023010044 4331
10.20944/preprints202301.0043.v1). 4334

(doi: 10.20944/preprints202212.0549.v1). 4343
(doi: 10.20944/preprints202212.0500.v1). 4350
10.5281/zenodo.7791952). 4362

(doi: 10.5281/zenodo.7791982). 4365
10.5281/zenodo.7790026). 4368
2023, (doi: 10.5281/zenodo.7790052). 4371
2023, (doi: 10.5281/zenodo.7787066). 4374

10.5281/zenodo.7781476). 4380
10.5281/zenodo.7783082). 4383
10.5281/zenodo.7777857). 4386
10.5281/zenodo.7779286). 4389
(doi: 10.5281/zenodo.7771831). 4392
2023, (doi: 10.5281/zenodo.7772468). 4395
10.13140/RG.2.2.20913.25446). 4398
10.5281/zenodo.7764916). 4401
10.13140/RG.2.2.11770.98247). 4404
10.13140/RG.2.2.12400.12808). 4407
2023, (doi: 10.13140/RG.2.2.22545.10089). 4410

10.13140/RG.2.2.11377.76644). 4416
10.13140/RG.2.2.23750.96329). 4419
10.13140/RG.2.2.31366.24641). 4422
10.13140/RG.2.2.34721.68960). 4425
10.13140/RG.2.2.24288.35842). 4434
10.13140/RG.2.2.32467.25124). 4437
10.13140/RG.2.2.31025.45925). 4440
10.13140/RG.2.2.17184.25602). 4443
10.13140/RG.2.2.23423.28327). 4446
10.13140/RG.2.2.28456.44805). 4449
10.13140/RG.2.2.23525.68320). 4452

10.13140/RG.2.2.20170.24000). 4455
10.13140/RG.2.2.36475.59683). 4458
10.13140/RG.2.2.29764.71046). 4461
2023, (doi: 10.13140/RG.2.2.18780.87683). 4464
10.13140/RG.2.2.26134.01603). 4470
10.13140/RG.2.2.27392.30721). 4473
10.13140/RG.2.2.33028.40321). 4476
10.13140/RG.2.2.21389.20966). 4479
10.13140/RG.2.2.16356.04489). 4482
10.13140/RG.2.2.21756.21129). 4485
10.13140/RG.2.2.30983.68009). 4488
10.13140/RG.2.2.28552.29445). 4491

10.13140/RG.2.2.35105.89447). 4497
(doi: 10.13140/RG.2.2.30072.72960). 4500
10.13140/RG.2.2.31147.52003). 4503
10.13140/RG.2.2.32825.24163). 4506
10.13140/RG.2.2.13059.58401). 4509
10.13140/RG.2.2.11172.14720). 4512
2023, (doi: 10.13140/RG.2.2.22011.80165). 4515
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4518
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4524
2023, (doi: 10.13140/RG.2.2.19944.14086). 4527
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4530

(doi: 10.13140/RG.2.2.33103.76968). 4533
2023, (doi: 10.13140/RG.2.2.23037.44003). 4536
(doi: 10.13140/RG.2.2.35646.56641). 4539
(doi: 10.13140/RG.2.2.18030.48967). 4542
(doi: 10.13140/RG.2.2.13973.81121). 4545
2023, (doi: 10.13140/RG.2.2.34106.47047). 4548
2023, (doi: 10.13140/RG.2.2.31956.88961). 4554
2023, (doi: 10.13140/RG.2.2.15179.67361). 4557
10.13140/RG.2.2.21510.45125). 4560
2023, (doi: 10.13140/RG.2.2.13121.84321). 4563
10.13140/RG.2.2.11758.69441). 4566
2023, (doi: 10.13140/RG.2.2.31891.35367). 4569

10.13140/RG.2.2.19360.87048). 4572
2023, (doi: 10.13140/RG.2.2.32363.21286). 4575
(doi: 10.13140/RG.2.2.23266.81602). 4578
10.13140/RG.2.2.19911.37285). 4581
10.13140/RG.2.2.11050.90569). 4584
(doi: 10.13140/RG.2.2.30182.50241). 4596

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

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


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


10.20944/preprints202301.0282.v1). 4662

10.20944/preprints202301.0267.v1).). 4665

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4670
prints202301.0262.v1). 4674


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

10.13140/RG.2.2.35061.65767). 4683

10.13140/RG.2.2.18494.15680). 4687
10.13140/RG.2.2.32530.73922). 4691
10.13140/RG.2.2.15897.70243). 4695

10.13140/RG.2.2.32530.73922). 4699
prints202301.0105.v1). 4702
10.13140/RG.2.2.23172.19849). 4709

10.13140/RG.2.2.17385.36968). 4719

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

2023, (doi: 10.13140/RG.2.2.28945.92007). 4728
10.13140/RG.2.2.35774.77123). 4734

10.13140/RG.2.2.29430.88642). 4740
(doi: 10.20944/preprints202212.0549.v1). 4746
10.13140/RG.2.2.19380.94084). 4749


(doi: 10.20944/preprints202212.0500.v1). 4760

10.13140/RG.2.2.20993.12640). 4763



10.13140/RG.2.2.29173.86244). 4778

(doi: 10.5281/zenodo.7792307). 4785
(doi: 10.5281/zenodo.7790728). 4787
2023 (doi: 10.5281/zenodo.7787712). 4789
10.5281/zenodo.7783791). 4791
10.5281/zenodo.7780123). 4793
(doi: 10.5281/zenodo.7773119). 4795
odo.7637762). 4797

10.5281/zenodo.7766174). 4799
10.5281/zenodo.7762232). 4801
(doi: 10.5281/zenodo.7758601). 4803
10.5281/zenodo.7754661). 4805
10.5281/zenodo.7750995) . 4807
(doi: 10.5281/zenodo.7749875). 4809
10.5281/zenodo.7747236). 4811
10.5281/zenodo.7742587). 4813
(doi: 10.5281/zenodo.7738635). 4815
10.5281/zenodo.7734719). 4817
10.5281/zenodo.7730484). 4819
(doi: 10.5281/zenodo.7730469). 4821
10.5281/zenodo.7722865). 4823
odo.7713563). 4825
odo.7709116). 4827
10.5281/zenodo.7706415). 4829
(doi: 10.5281/zenodo.7706063). 4831
(doi: 10.5281/zenodo.7701906). 4833

odo.7700205). 4835
10.5281/zenodo.7694876). 4837
10.5281/zenodo.7679410). 4839
10.5281/zenodo.7675982). 4841
10.5281/zenodo.7672388). 4843
odo.7668648). 4845
10.5281/zenodo.7662810). 4847
10.5281/zenodo.7659162). 4849
odo.7653233). 4851
odo.7653204). 4853
odo.7653142). 4855
odo.7653117). 4857
odo.7653089). 4859
odo.7651687). 4861
odo.7651619). 4863
odo.7651439). 4865
odo.7650729). 4867
odo.7647868). 4869

odo.7647017). 4871
odo.7644894). 4873
odo.7641880). 4875
odo.7632923). 4877
odo.7623459). 4879
10.5281/zenodo.7606416). 4881
10.5281/zenodo.7606416). 4883
odo.7606404). 4885
10.5281/zenodo.7580018). 4887
odo.7580018). 4889
odo.7580018). 4891
odo.7579929). 4893
10.5281/zenodo.7563170). 4895
odo.7563164). 4897
odo.7563160). 4899
odo.7563160). 4901
10.5281/zenodo.7563160). 4903
10.5281/zenodo.7557063). 4905

10.5281/zenodo.7557009). 4907
10.5281/zenodo.7539484). 4909
10.5281/zenodo.7523390). 4911
10.5281/zenodo.7523390). 4913
10.5281/zenodo.7523390). 4915
odo.7574952). 4917
10.5281/zenodo.7574992). 4919
odo.7523357). 4921
10.5281/zenodo.7523357). 4923
10.5281/zenodo.7504782). 4925
10.5281/zenodo.7504782). 4927
10.5281/zenodo.7504782). 4929
10.5281/zenodo.7499395). 4931
odo.7499395). 4933
10.5281/zenodo.7499395). 4935
10.5281/zenodo.7497450). 4937
10.5281/zenodo.7497450). 4939
10.5281/zenodo.7494862). 4941

odo.7494862). 4943
10.5281/zenodo.7494862). 4945
10.5281/zenodo.7493845). 4947
10.5281/zenodo.7493845). 4949
10.5281/zenodo.7493845). 4951
odo.7539484). 4953
odo.7523390). 4955
odo.7523357). 4957
odo.7504782). 4959
odo.7499395). 4961
odo.7497450). 4963
odo.7494862). 4965
odo.7493845). 4967
odo.7480110). 4969
odo.7378758). 4971
odo.6320305). 4973
odo.6677173). 4975

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5056
Then the research has taken more motivations to define SuperHyperClasses and to find some 5057
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5058
some instances and examples to make clarifications about the framework of this research. The 5059
general results and some results about some connections are some avenues to make key point of 5060
this research, “Cancer’s Recognition”, more understandable and more clear. 5061
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5062
research on the modeling of the regions where are under the attacks of the cancer to 5063
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5064
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5065
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5066
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5067

instances and literature reviews have taken the whole way through. In this scientific research, 5068
the literature reviews have fulfilled the lines containing the notions and the results. The 5069
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5070
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5071
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5072
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5073
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5074
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5075
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5076
to figure out the background for the SuperHyperNotions. 5077

CHAPTER 25 5078
Neutrosophic 5079
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5081
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5082
2023, (doi: 10.13140/RG.2.2.34953.52320). 5083
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5084
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5085
(doi: 10.13140/RG.2.2.33275.80161). 5086
10.13140/RG.2.2.11050.90569). 5089
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5090
10.13140/RG.2.2.17761.79206). 5092
10.13140/RG.2.2.19911.37285). 5095
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5096
10.13140/RG.2.2.23266.81602). 5098
10.13140/RG.2.2.19360.87048). 5101
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5102
10.13140/RG.2.2.32363.21286). 5104
10.13140/RG.2.2.11758.69441). 5107
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5108
10.13140/RG.2.2.31891.35367). 5110
245

10.13140/RG.2.2.21510.45125). 5113
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5114
10.13140/RG.2.2.13121.84321). 5116

CHAPTER 26 5117
New Ideas In Recognition of Cancer And 5118
Neutrosophic SuperHyperGraph By 5119
Hamiltonian-Cycle-Decomposition As 5120
Hyper Decompress On Super 5121
Decompensation 5122
247
CHAPTER 27 5123
ABSTRACT 5124
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5125

Cycle-Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Hamiltonian-Cycle- 5126
0
Decomposition pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5127
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperHamiltonian- 5128
Cycle-Decomposition if the following expression is called Neutrosophic e-SuperHyperHamiltonian-Cycle- 5129

Decomposition criteria holds 5130
∀E 0 ∈ C : C is
Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called 5131

Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 5132
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5133

SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called Neutrosophic v- 5134
SuperHyperHamiltonian-Cycle-Decomposition criteria holds 5135
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition if the following expression is called 5136

Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 5137
∀V 0 ∈ C : C is
249
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5138

SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian- 5139
Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic v- 5140
SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle- 5141
Decomposition. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Decomposition). Assume a Neutrosophic 5142
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 5143
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperHamiltonian-Cycle- 5144

Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic 5145
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme Super- 5147
HyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5148
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Ex- 5149
treme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5150
form the Extreme SuperHyperHamiltonian-Cycle-Decomposition; a Neutrosophic SuperHyperHamiltonian- 5151
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 5155
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutro- 5156

sophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic Supe- 5157
rHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition; 5158
an Extreme SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial if it’s either of 5159

defined as the Extreme number of the maximum Extreme cardinality of the Extreme Su- 5164
perHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 5165
the Extreme SuperHyperHamiltonian-Cycle-Decomposition; and the Extreme power is corresponded 5167
to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHy- 5168

perPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neut- 5169
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for 5171
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 5172
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 5173
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5174
SuperHyperHamiltonian-Cycle-Decomposition; and the Neutrosophic power is corresponded to its 5177
Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition if it’s either of 5178

N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 5182

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5184
the Extreme SuperHyperHamiltonian-Cycle-Decomposition; a Neutrosophic V-SuperHyperHamiltonian- 5185
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinal- 5189
ity of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5190

an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial if it’s either of 5193

defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5198
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5199
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 5200
treme SuperHyperHamiltonian-Cycle-Decomposition; and the Extreme power is corresponded to its 5201
Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPoly- 5202

nomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic 5203
and Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for a Neutrosophic 5205
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5206
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5207
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5208

and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific 5211
research, new setting is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian- 5212
Cycle-Decomposition and Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. Two different types 5213
of SuperHyperDefinitions are debut for them but the research goes further and the SuperHy- 5214
perNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 5215
well-reviewed. The literature review is implemented in the whole of this research. For shining the 5216
elegancy and the significancy of this research, the comparison between this SuperHyperNotion 5217
with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 5218
definitions are followed by the examples and the instances thus the clarifications are driven 5219
with different tools. The applications are figured out to make sense about the theoretical 5220
aspect of this ongoing research. The “Cancer’s Recognition” are the under research to figure 5221
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 5226
are chosen and elected to research about “Cancer’s Recognition”. Thus these complex and 5227
dense SuperHyperModels open up some avenues to research on theoretical segments and 5228
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 5229

collected in the form of some questions and some problems. Assume a SuperHyperGraph. 5230
Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Cycle-Decomposition is a maximal of 5231
SuperHyperVertices with a maximum cardinality such that either of the following expres- 5232
sions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 5233
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 5235
S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Decomposition is 5236

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

SuperHyperHamiltonian-Cycle-Decomposition . Since there’s more ways to get type-results to make 5243
a SuperHyperHamiltonian-Cycle-Decomposition more understandable. For the sake of having Neut- 5244
rosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to “redefine” the notion of a 5245
“SuperHyperHamiltonian-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are 5246
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5247
position of labels to assign to the values. Assume a SuperHyperHamiltonian-Cycle-Decomposition . It’s 5248

redefined a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if the mentioned Table holds, 5249
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5250
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5251
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5252
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5253
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 5254
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5255
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5256
based on a SuperHyperHamiltonian-Cycle-Decomposition . It’s the main. It’ll be disciplinary to have 5257
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 5258
have all SuperHyperHamiltonian-Cycle-Decomposition until the SuperHyperHamiltonian-Cycle-Decomposition, 5259
then it’s officially called a “SuperHyperHamiltonian-Cycle-Decomposition” but otherwise, it isn’t a 5260

SuperHyperHamiltonian-Cycle-Decomposition . There are some instances about the clarifications for 5261
the main definition titled a “SuperHyperHamiltonian-Cycle-Decomposition ”. These two examples 5262
get more scrutiny and discernment since there are characterized in the disciplinary ways 5263
of the SuperHyperClass based on a SuperHyperHamiltonian-Cycle-Decomposition . For the sake 5264
of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to “redefine” 5265

the notion of a “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition” and a “Neutrosophic 5266
SuperHyperHamiltonian-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 5267
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 5268
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 5269
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 5270
SuperHyperHamiltonian-Cycle-Decomposition are redefined to a “Neutrosophic SuperHyperHamiltonian- 5271

Cycle-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 5272
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5273
Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition more understandable. Assume a Neutro- 5274
sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 5275

Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 5276

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5277
SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”, “Neutrosophic Super- 5278
HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 5279
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 5280
has a “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition” where it’s the strongest [the 5281
maximum Neutrosophic value from all the SuperHyperHamiltonian-Cycle-Decomposition amid the 5282
maximum value amid all SuperHyperVertices from a SuperHyperHamiltonian-Cycle-Decomposition .] 5283
SuperHyperHamiltonian-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a SuperHyper- 5284
Graph and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 5285
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 5286
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 5287
it’s SuperHyperHamiltonian-Cycle-Decomposition if it’s only one SuperVertex as intersection amid 5288

two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5289
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5290
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 5291
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 5292
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 5293
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 5294
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 5295
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 5296
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 5297
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 5298
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 5299
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 5300
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 5301
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 5302
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 5303
Recognition” and the results and the definitions will be introduced in redeemed ways. The 5304
recognition of the cancer in the long-term function. The specific region has been assigned 5305
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 5306
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 5309
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 5310
done. There are some specific models, which are well-known and they’ve got the names, and 5311
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 5312
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 5313
SuperHyperPath(-/SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, SuperHyperBipart- 5314
ite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest 5315
SuperHyperHamiltonian-Cycle-Decomposition or the strongest SuperHyperHamiltonian-Cycle-Decomposition in 5316
those Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Cycle-Decomposition, 5317

called SuperHyperHamiltonian-Cycle-Decomposition, and the strongest SuperHyperHamiltonian-Cycle- 5318
Decomposition, called Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, some general results 5319
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only 5320
two SuperHyperEdges but it’s not enough since it’s essential to have at least three Supe- 5321

rHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Decomposition. There isn’t any 5322

formation of any SuperHyperHamiltonian-Cycle-Decomposition but literarily, it’s the deformation of 5323
any SuperHyperHamiltonian-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. A basic 5324
familiarity with Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition theory, SuperHyperGraphs, 5325
and Neutrosophic SuperHyperGraphs theory are proposed. 5326
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Cycle-Decomposition, Cancer’s 5327


CHAPTER 28 5330
Applied Notions Under The Scrutiny Of 5331
The Motivation Of This Scientific 5332
Research 5333
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5334
try to bring the motivations in the narrative ways. Some cells have been faced with some 5335
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5336
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5337
as some groups and some groups or individuals have excessive labels which all are raised from 5338
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5339
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5340
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5341
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5342
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5343
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5344
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5345
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5346
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5347
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5348
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5349
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5350
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5351
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5352
case of this disease is considered and as the consequences of the model, some parameters are used. 5353
The cells are under attack of this disease but the moves of the cancer in the special region are the 5354
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5355
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5356
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5357
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5358
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5360
255
figure out the background for the SuperHyperNotions. The recognition of the cancer in the long- 5363
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5364
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5367
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5368
well-known and they’ve got the names, and some general models. The moves and the traces of 5370
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5371
by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 5372
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5373
the optimal SuperHyperHamiltonian-Cycle-Decomposition or the Neutrosophic SuperHyperHamiltonian- 5374
Cycle-Decomposition in those Neutrosophic SuperHyperModels. Some general results are introduced. 5375
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only 5376
two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5377
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Cycle-Decomposition. There isn’t 5378
any formation of any SuperHyperHamiltonian-Cycle-Decomposition but literarily, it’s the deformation 5379
of any SuperHyperHamiltonian-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. 5380
amount of SuperHyperHamiltonian-Cycle-Decomposition” of either individual of cells or the groups of cells 5382

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperHamiltonian- 5383
Cycle-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 5384
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5385
these messy and dense SuperHyperModels where embedded notions are illustrated? 5386
Thus it motivates us to define different types of “ SuperHyperHamiltonian-Cycle-Decomposition” and 5388
“Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition” on “SuperHyperGraph” and “Neutrosophic 5389

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5390
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5391
motivates us to get some instances and examples to make clarifications about the framework of 5392
this research. The general results and some results about some connections are some avenues to 5393
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5394
The framework of this research is as follows. In the beginning, I introduce basic definitions 5395
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5396
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5397
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5398
review literature are applied to make sense about what’s going to figure out about the 5399
upcoming sections. The main definitions and their clarifications alongside some results about 5400
new notions, SuperHyperHamiltonian-Cycle-Decomposition and Neutrosophic SuperHyperHamiltonian- 5401

Cycle-Decomposition, are figured out in sections “ SuperHyperHamiltonian-Cycle-Decomposition” and 5402
“Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”. In the sense of tackling on getting 5403
results and in Hamiltonian-Cycle-Decomposition to make sense about continuing the research, the 5404
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5405
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5406
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5407

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5408
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5409
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5410
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5411
and as concluding and closing section of theoretical research are contained in the section “General 5412
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5413
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 5414
SuperHyperHamiltonian-Cycle-Decomposition”, “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”, 5415
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There 5416
are curious questions about what’s done about the SuperHyperNotions to make sense about 5417
excellency of this research and going to figure out the word “best” as the description and adjective 5418
for this research as presented in section, “ SuperHyperHamiltonian-Cycle-Decomposition”. The keyword 5419
of this research debut in the section “Applications in Cancer’s Recognition” with two cases and 5420
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 5421
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 5422
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 5423
happened in this research in the terms of “questions” and “problems” to make sense to figure 5424
out this research in featured style. The advantages and the limitations of this research alongside 5425
about what’s done in this research to make sense and to get sense about what’s figured out are 5426
included in the section, “Conclusion and Closing Remarks”. 5427

CHAPTER 29 5428
Neutrosophic Preliminaries Of This 5429
Scientific Research On the Redeemed 5430
Ways 5431
In this section, the basic material in this scientific research, is referred to [Single Valued 5432
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5433

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5434
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5435
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5436
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5437
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5438
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5439
their clarifications are addressed to Ref.[HG38]. 5440
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5441
the new ideas and their clarifications are elicited. 5442
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a Hamiltonian-Cycle-Decomposition 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). 5444
where 5446
1, 2, . . . , n0 ); 5451
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5452
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5453

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5482
x, y, z, w ∈ [0, 1]: 5483
(i) 1 ⊗ x = x; 5484
(ii) x ⊗ y = y ⊗ x; 5485
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5486
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5487

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

where 5490

1, 2, . . . , n0 ); 5495
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5496
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5497
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5498
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5499
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5511
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5512
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5513
SuperEdge; 5519
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5522
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5523
makes the patterns and regularities. 5524
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5525
of elements of SuperHyperEdges are the same. 5526

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5527
makes to have SuperHyperUniform more understandable. 5528
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5529
Classes as follows. 5530
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5531
two given SuperHyperEdges with two exceptions; 5532
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5533
SuperHyperEdges; 5534
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5535
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5536
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5537
in common; 5538
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5539
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5540
SuperHyperEdge in common; 5541
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5542
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5543
SuperVertex. 5544
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 5545
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5546
(i) Vi , Vi+1 ∈ Ei0 ; 5547
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5548
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5549
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5550
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5551
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5552
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5553
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5554
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5556
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5557
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5558
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5559
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5560
perPath . 5561
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 5562
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5563
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5564
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5565
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5566
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5567

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

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


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

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

Decomposition). 5584
(i) Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 5588

is called Neutrosophic e-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 5589
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 5590

is called Neutrosophic re-SuperHyperHamiltonian-Cycle-Decomposition criteria holds 5591
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5592
(iii) Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 5593
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Cycle-Decomposition if the following expression 5595
∀V 0 ∈ C : C is

(v) Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutro- 5598

Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Cycle-Decomposition). 5602

(i) an Extreme SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutrosophic 5605

e-SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Cycle- 5606
Decomposition, Neutrosophic v-SuperHyperHamiltonian-Cycle-Decomposition, and Neutrosophic 5607
rv-SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyper- 5608
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5609
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5610
(ii) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition if it’s either of Neutro- 5613

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5618

(iii) an Extreme SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 5621


(iv) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 5631


of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 5637
is corresponded to its Neutrosophic coefficient; 5641

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

SuperHyperHamiltonian-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 5645
of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5647

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


(vii) an Extreme V-SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 5658


(viii) a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition SuperHyperPolynomial 5668

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 5674

is corresponded to its Neutrosophic coefficient. 5678
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Cycle-Decomposition). 5679

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5680
(i) an δ−SuperHyperHamiltonian-Cycle-Decomposition is a Neutrosophic kind of Neutrosophic 5681
SuperHyperHamiltonian-Cycle-Decomposition such that either of the following expressions hold 5682


136TBL3
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5683
|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 5684
(29.1), holds if S is an δ−SuperHyperDefensive; 5685
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Cycle-Decomposition is a Neutrosophic kind 5686

of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition such that either of the following 5687
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5688
of s ∈ S : 5689
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 5690
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5691
For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need 5692

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5701
Thus Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, 5702
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5703
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5704
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5705
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5706
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 5707
. Since there’s more ways to get type-results to make a Neutrosophic


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

136TBL4

136TBL1
SuperHyperHamiltonian-Cycle-Decomposition more Neutrosophicly understandable. 5709

For the sake of having a Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, there’s a need to 5710
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition”. 5711
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5712
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 5713
values. 5714
136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Cycle-Decomposition. It’s redefined a Neutro- 5715
sophic SuperHyperHamiltonian-Cycle-Decomposition if the Table (29.3) holds. 5716

CHAPTER 30 5717
Neutrosophic SuperHyper But Hamiltonian-Cycle-Decomposition 5718
As The Extensions Excerpt From Dense 5719
And Super Forms 5720
Definition 30.0.1. (Neutrosophic event). 5721
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5722
is a probability Hamiltonian-Cycle-Decomposition. Any Neutrosophic k-subset of A of V is called 5723
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5724
Neutrosophic event. The following expression is called Neutrosophic probability of 5725
A. 5726
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5727

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5728
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. s Neutrosophic k-events Ai , i ∈ I 5729
is called Neutrosophic s-independent if the following expression is called Neutrosophic 5730
s-independent criteria 5731
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. 5732

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

is a probability Hamiltonian-Cycle-Decomposition. Any k-function Hamiltonian-Cycle-Decomposition like E is 5736
called Neutrosophic k-Variable. If k = 2, then any 2-function Hamiltonian-Cycle-Decomposition like 5737

E is called Neutrosophic Variable. 5738
The notion of independent on Neutrosophic Variable is likewise. 5739
271
Definition 30.0.4. (Neutrosophic Expectation). 5740

is a probability Hamiltonian-Cycle-Decomposition. A Neutrosophic k-Variable E has a number is called 5742
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5743
criteria 5744
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5745

is a probability Hamiltonian-Cycle-Decomposition. A Neutrosophic number is called Neutrosophic 5747

Crossing if the following expression is called Neutrosophic Crossing criteria 5748
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). 5749
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let m and n propose special 5750
Hamiltonian-Cycle-Decomposition. Then with m ≥ 4n, 5751
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Hamiltonian-Cycle-Decomposition 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: 5752
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5753
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5754
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let P be a SuperHyperSet of 5755
n points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 5756
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5757

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5758

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5759
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5760
SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5761
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5762
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 . 5763
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 5766
Then k < 5n4/3 . 5767
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Con- 5768
sider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Draw a SuperHyperUnit Supe- 5769
rHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic number of 5770
P n−1
these SuperHyperCircles passing through exactly i points of P. Then i = 0 n i = n and 5771
k = 12 i = 0n−1 ini . Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex
P
5772
SuperHyperSet P whose SuperHyperEdges are the SuperHyperArcs between conseNeighborive 5773

SuperHyperPoints on the SuperHyperCircles that pass through at least three SuperHyperPoints 5774
of P. Then 5775
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 5776

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

Neutrosophic Variable and t a positive real number. Then 5785
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. 5786

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5787
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let Xn be a nonnegative integer- 5788
valued variable in a probability Hamiltonian-Cycle-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 5789
n → ∞, then P (Xn = 0) → 1 as n → ∞. 5790
Proof. 5791
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. A special SuperHyperGraph in 5793
Gn,p almost surely has stability number at most d2p−1 log ne. 5794
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5795
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. A special SuperHyperGraph in Gn,p is 5796
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5797
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5798
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5799
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5800
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5801
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5802
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 5803
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5804

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: 5805
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5806
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 5807
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5808
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5809
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5810
Definition 30.0.12. (Neutrosophic Variance). 5811
is a probability Hamiltonian-Cycle-Decomposition. A Neutrosophic k-Variable E has a number is 5813
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 5814
criteria 5815
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let X be a Neutrosophic Variable 5817
and let t be a positive real number. Then 5818
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let X be a Neutrosophic Variable and 5820
let t be a positive real number. Then 5821
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5822
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let Xn be a Neutrosophic 5824

Variable in a probability Hamiltonian-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 5825
V (Xn ) << E 2 (Xn ), then 5826
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 5828
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5829
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5830
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 5832
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 5833
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5834
S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. As in the proof of related Theorem, the 5836
result is straightforward. 5837
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 5839
be as defined in previous Theorem. Then either: 5840
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5841
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5842

Definition 30.0.17. (Neutrosophic Threshold). 5845

is a probability Hamiltonian-Cycle-Decomposition. Let P be a monotone property of SuperHyperGraphs 5847
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5848
for P is a function f (n) such that: 5849
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5850
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5851
Definition 30.0.18. (Neutrosophic Balanced). 5852
is a probability Hamiltonian-Cycle-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. 5854
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 5855
SubSuperHyperGraph is called Neutrosophic Balanced. 5856
Consider S = (V, E) is a probability Hamiltonian-Cycle-Decomposition. Let F be a nonempty 5858
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5859
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5860
SubSuperHyperGraph. 5861
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5864
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5865
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5866
SuperHyperHamiltonian-Cycle-Decomposition, is up. The Neutrosophic Algorithm is Neutro- 5867

sophicly straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 5868
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5869
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5870
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5871
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5872
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5873

Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 5874
C(N SHG)Neutrosophic Hamiltonian-Cycle-Decomposition

= {{E4 }}.
C(N SHG)Neutrosophic Hamiltonian-Cycle-Decomposition SuperHyperPolynomial
= z.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Decomposition
= {{V1 , V2 , V4 }}.
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Decomposition SuperHyperPolynomial
= z3.
5875

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

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

sophicly straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5878

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyper- 5879
Neighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 5880
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 5881
HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 5882
V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 5883

= {{E4 }}.
= z.
= {{V1 , V2 , V4 }}.
= z3.
5884


sophicly straightforward. 5887

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


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




= {{V1 , V2 , V3 , {N }, {F }}}.
= z5.
5892




= {{}}.
= z0.
= {{}}.
= z0.
5896


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



= az 22 .
= {{Vi }22
i=1 }.
= z 22 .
5900


= {{E15 , E13 , E16 , E14 , E17 , E12 }, . . .}.
= z6.
= {{Vi }14
i=1 }.


= z 14 .
5904


= {{}}.
= z0.
= {{}}.
= z0.
5908



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

= az 13
= {Vi }22
i=1 .
= az 22
5912

SuperHyperHamiltonian-Cycle-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5914
begineqnarray* C(NSHG)Neutrosophic Hamiltonian-Cycle-Decomposition 5916
= {E1 , E6 , E2 , E7 , E3 , E4 }. 5917
C(N SHG)Neutrosophic Hamiltonian-Cycle-Decomposition SuperHyperPolynomial 5918
= z6. 5919
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Decomposition 5920
= {Vi }14i=1 . 5921
C(N SHG)Neutrosophic V-Hamiltonian-Cycle-Decomposition SuperHyperPolynomial 5922

= z 14 . 5923





On the Figure (30.11), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5924


= {{E1 , E6 , E3 , E8 }, {E1 , E6 , E3 , E7 }, {E1 , E7 , E3 , E8 }}.
= 3z 4 .
= {{Vi }6i=1 }.
= z6.
5927


= {{}}.


= z0.
= {{}}.
= z0.
5931


= {{E9 , E6 , E3 , E7 }, {E9 , E6 , E3 , E8 }, {E9 , E7 , E3 , E8 }}.
= 3z 4 .
= {{Vi }6i=1 }.
= z6.
5935




= {{}}.
= z0.
= {{}}.
= z0.
5939


= {{}}.


= z0.
= {{}}.
= z0.
5943


= {{}}.


= z0.
= {{}}.
= z0.
5947


= {{}}.
= z0.
= {{}}.
= z0.
5951







= {{}}.
= z0.
= {{}}.
= z0.
5955


= {{Eii=112 }}.



= z 12 .
= {{Vi }ai=1 }.
= za.
5959


= {{}}.
= z0.
= {{}}.
= z0.


5963


= {{E1 , E2 }}.
= z2.
= {VE2 }.
= z 10 .
5967


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

= {}.
= 0z 0 .
= {}.
= 0z 0 .
5971
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 5972
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cycle- 5973


Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 5974
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 5975
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 5976
of them. 5977
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 5978
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 5979
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 5980
Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor to 5981
some of them but not all of them. In other words, there’s only an unique Neutrosophic 5982
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 5983
Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor to 5984
some of them but not all of them. 5985
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle- 5986
Decomposition is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 5987
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 5988
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 5989
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 5990

to Neutrosophic Hamiltonian-Cycle-Decomposition in some cases but the maximum number of the 5991
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 5992
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 5993
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-Cycle-Decomposition has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Hamiltonian-Cycle-Decomposition with the least Neutrosophic 5995

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

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

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

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

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

of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

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

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

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

R-Hamiltonian-Cycle-Decomposition. Since at least two Neutrosophic SuperHyperVertices involve

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

one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic

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

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

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

Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Hamiltonian-Cycle-Decomposition is
{aE , bE , cE , . . . , zE } .

This definition coincides with the definition of the Neutrosophic R-Hamiltonian-Cycle-Decomposition but
with slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

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

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

EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended
SuperHyperVertices but in a Neutrosophic Hamiltonian-Cycle-Decomposition, Ex = E ∈ EESHG:(V,E)
could be different and it’s not unique. To sum them up, in a connected Neutrosophic
SuperHyperGraph ESHG : (V, E). If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E)
has z Neutrosophic SuperHyperVertices, then the Neutrosophic cardinality of the Neutrosophic
R-Hamiltonian-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Cycle- 6004
Decompositionis at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6005
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Supe- 6006
rHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6007
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6008
to Neutrosophic Hamiltonian-Cycle-Decomposition in some cases but the maximum number of the 6009
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic Su- 6010
perHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6011

The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6013
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6014
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6015
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6016
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6017
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6018
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6019

Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6020
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6021
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6022
tices. Thus it forms a Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition where the Neutrosophic 6023
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6024
embedded R-Hamiltonian-Cycle-Decomposition. The SuperHyperNotions of embedded SuperHyperSet 6025

and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets 6026
only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is 6027
elected such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCar- 6028
dinality and they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of 6029
Neutrosophic SuperHyperVertices are included in the minimum Neutrosophic style of the 6030
embedded Neutrosophic R-Hamiltonian-Cycle-Decomposition. The interior types of the Neutrosophic 6031

SuperHyperVertices are deciders. Since the Neutrosophic number of SuperHyperNeighbors 6032
are only affected by the interior Neutrosophic SuperHyperVertices. The common connections, 6033
more precise and more formal, the perfect unique connections inside the Neutrosophic Supe- 6034
rHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic 6035
R-Hamiltonian-Cycle-Decomposition. Thus Neutrosophic exterior SuperHyperVertices could be used 6036
only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6037

the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6038
embedded Neutrosophic Hamiltonian-Cycle-Decomposition, there’s the usage of exterior Neutrosophic 6039
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 6040
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has 6041
no connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic Super- 6042
HyperVertices with one SuperHyperElement has been ignored in the exploring to lead on 6043
the optimal case implying the Neutrosophic R-Hamiltonian-Cycle-Decomposition. The Neutrosophic 6044
R-Hamiltonian-Cycle-Decomposition with the exclusion of the exclusion of all Neutrosophic SuperHy- 6045
perVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic 6046
R-Hamiltonian-Cycle-Decomposition with the inclusion of all Neutrosophic SuperHyperVertices in one 6047
Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition. To sum 6048

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6049
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6050
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6051
quasi-R-Hamiltonian-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor to some of them 6052
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6053
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6054

quasi-R-Hamiltonian-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of them 6055
but not all of them. 6056
The main definition of the Neutrosophic R-Hamiltonian-Cycle-Decomposition has two titles. a Neutro- 6057
sophic quasi-R-Hamiltonian-Cycle-Decomposition and its corresponded quasi-maximum Neutrosophic 6058

R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6059
number, there’s a Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition with that quasi-maximum 6060
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6061
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6062
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian- 6063
Cycle-Decompositions for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6064
number. The essence of the Neutrosophic Hamiltonian-Cycle-Decomposition ends up but this essence 6065
starts up in the terms of the Neutrosophic quasi-R-Hamiltonian-Cycle-Decomposition, again and more in 6066
the operations of collecting all the Neutrosophic quasi-R-Hamiltonian-Cycle-Decompositions acted on the 6067
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6068
number. This Neutrosophic number is 6069
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Cycle-Decompositions. 6070
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Cycle-Decomposition be 6071

a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Cycle- 6072
Decomposition. Then 6073
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Cycle-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Hamiltonian-Cycle-Decomposition is 6074
re-formalized and redefined as follows. 6075
GNeutrosophic Hamiltonian-Cycle-Decomposition ∈ ∪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 6076
definition for the Neutrosophic Hamiltonian-Cycle-Decomposition. 6077
GNeutrosophic Hamiltonian-Cycle-Decomposition =
{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 6078
poses the upcoming expressions.

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

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

And then, 6081

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


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

6084


6085

Now, the extension of these types of approaches is up. Since the new term, “Neutro- 6086
sophic SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic 6087
SuperHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are 6088
incident to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutro- 6089
sophic Quasi-Hamiltonian-Cycle-Decomposition” but, precisely, it’s the generalization of “Neutrosophic 6090
Quasi-Hamiltonian-Cycle-Decomposition” since “Neutrosophic Quasi-Hamiltonian-Cycle-Decomposition” hap- 6091
pens “Neutrosophic Hamiltonian-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph as initial 6092
framework and background but “Neutrosophic SuperHyperNeighborhood” may not happens 6093
“Neutrosophic Hamiltonian-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph as initial frame- 6094
work and preliminarily background since there are some ambiguities about the Neutrosophic 6095
SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Neutrosophic Su- 6096
perHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian-Cycle-Decomposition”, and “Neutrosophic 6097
Hamiltonian-Cycle-Decomposition” are up. 6098
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Cycle-Decomposition
6099
be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 6100
Hamiltonian-Cycle-Decomposition and the new terms are up. 6101

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


6104
And with go back to initial structure, 6105


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

6107

6108


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

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

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

sophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some Neut-
rosophic SuperHyperVertices instead of all given by Neutrosophic Hamiltonian-Cycle-Decomposition
is related to the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic Super-
HyperSet. Thus the non-obvious Neutrosophic Hamiltonian-Cycle-Decomposition is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Decomposition is
a Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Cycle-Decomposition 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-

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

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

, not:
Cycle-Decomposition
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6109
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6110
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6111
type-SuperHyperSet called the 6112
“Neutrosophic R-Hamiltonian-Cycle-Decomposition” 6113
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6114
Neutrosophic R-Hamiltonian-Cycle-Decomposition, 6115
is only and only

In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

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

sharp bound for the cardinality, of a Neutrosophic R-Hamiltonian-Cycle-Decomposition is the cardinality
of
6116
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6117
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Cycle- 6118

Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6119
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6120
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6121
amount of them. 6122
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6123
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6124

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6125
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6126
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6127
Consider there’s a Neutrosophic R-Hamiltonian-Cycle-Decomposition with the least cardinality, the lower 6128
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6129
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6130
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6131
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6132
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Cycle-Decomposition. Since it 6133
doesn’t have 6134
6135
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6136

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6137
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6138
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6139
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Hamiltonian- 6140
Cycle-Decomposition. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6141
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6142

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6143
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6144
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6145
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6146
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6147
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6148
Neutrosophic R-Hamiltonian-Cycle-Decomposition, VESHE is up. The obvious simple Neutrosophic type- 6149
SuperHyperSet of the Neutrosophic R-Hamiltonian-Cycle-Decomposition, VESHE , is a Neutrosophic Su- 6150
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6151
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6152
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6153
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6154
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6155

a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6156
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6157
R-Hamiltonian-Cycle-Decomposition only contains all interior Neutrosophic SuperHyperVertices and 6158
all exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6159
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6160
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6161

peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6162
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6163
The SuperHyperNotion, namely, Hamiltonian-Cycle-Decomposition, is up. There’s neither empty Super- 6164
HyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutro- 6165
sophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6166
the Neutrosophic Hamiltonian-Cycle-Decomposition. The Neutrosophic SuperHyperSet of Neutrosophic 6167

SuperHyperEdges[SuperHyperVertices], 6168
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−Cycle−DecompositionSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−Cycle−DecompositionSuperHyperP olynomial = az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Cycle-Decomposition. 6169
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6170

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

Is an Neutrosophic Hamiltonian-Cycle-Decomposition C(ESHG) for an Neutrosophic SuperHyper- 6171

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6172
6173
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6175
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6176
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6177
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6178
non-obvious Neutrosophic Hamiltonian-Cycle-Decomposition is up. The obvious simple Neutrosophic 6179
type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Decomposition is a Neutrosophic Su- 6180
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6181
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6182

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

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

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

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

Is an Neutrosophic Hamiltonian-Cycle-Decomposition C(ESHG) for an Neutrosophic SuperHyperGraph 6190

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6191
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given 6192
by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Cycle-Decomposition 6193
and it’s an Neutrosophic Hamiltonian-Cycle-Decomposition. Since it’s 6194
6195

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

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


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

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

Is the Neutrosophic SuperHyperSet, not: 6204

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6205
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6206
Neutrosophic type-SuperHyperSet called the 6207
“Neutrosophic Hamiltonian-Cycle-Decomposition ” 6208
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6209
Neutrosophic Hamiltonian-Cycle-Decomposition , 6210
is only and only 6211

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

CHAPTER 31 6213
The Neutrosophic Departures on The 6214
Theoretical Results Toward Theoretical 6215
Motivations 6216
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6217
Neutrosophic SuperHyperClasses. 6218
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6219

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 6220
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6221
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
313
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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


136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6227
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6228
SuperHyperModel (31.1), is the SuperHyperHamiltonian-Cycle-Decomposition. 6229
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6230

= {{E ∈ EN SHG }}.
= z |EN SHG | .

= {{V ∈ VN SHG }}.

= z |VN SHG | .
Proof. Let 6231
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6232
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). 6233

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6238
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the Neut- 6239
rosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 6240
6241
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6242

= {{}}.
= z0.
= {{}}.
= z0.

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

Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6243
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6244
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6245


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

Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6250
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6251
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6252
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6253
the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 6254
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6255
Then 6256

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

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

Proof. Let 6257
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6258
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). 6259

Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6265
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperHamiltonian-Cycle-Decomposition taken from a connected Neutrosophic 6267
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6268
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6269
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6271
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6272

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Example (42.0.11) 136NSHG21a
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6273
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6274

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6275
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6277
Then 6278

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

min
= az |PN SHG | .
|V
N SHG |
= {{Vi }i=1 }.
= z |VN SHG | .
Proof. Let 6279
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6280
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 6282


0
Decomposition could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6287
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6289
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6290
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6294
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6295
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6296
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6297
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Cycle- 6298
Decomposition. 6299

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

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6300
Then, 6301

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

= z |EN SHG |+1 .
|V
N SHG |
= {{Vi }i=1 }.
= z |VN SHG | .
Proof. Let 6302
P :
CEN T ER, E2∗
6303
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition in the Neutrosophic Example
(42.0.15) 136NSHG23a
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 6305

straightforward. Then there’s at least one SuperHyperHamiltonian-Cycle-Decomposition. Thus the 6308
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian-Cycle- 6309

Decomposition could be applied. The unique embedded SuperHyperHamiltonian-Cycle-Decomposition 6310
proposes some longest SuperHyperHamiltonian-Cycle-Decomposition excerpt from some representatives. 6311
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6313
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6314
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6315
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6316
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 6317

CHAPTER 32 6318
The Surveys of Mathematical Sets On 6319
The Results But As The Initial Motivation 6320
For the SuperHyperHamiltonian-Cycle-Decomposition, Neutrosophic SuperHyperHamiltonian-Cycle- 6321

, and the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition, some general results
Decomposition 6322
are introduced. 6323
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition is 6324

“redefined” on the positions of the alphabets. 6325
Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. Then 6326
N eutrosophic SuperHyperHamiltonian − Cycle − Decomposition =

{theSuperHyperHamiltonian − Cycle − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − Cycle − Decomposition
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−Cycle−Decomposition. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6327
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6328
the neutrality, for i = 1, 2, 3, respectively. 6329
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6330
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition and 6331
SuperHyperHamiltonian-Cycle-Decomposition coincide. 6332
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6333
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6334
SuperHyperHamiltonian-Cycle-Decomposition if and only if it’s a SuperHyperHamiltonian-Cycle-Decomposition. 6335
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6336
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6337
SuperHyperHamiltonian-Cycle-Decomposition if and only if it’s a longest SuperHyperHamiltonian-Cycle- 6338
Decomposition. 6339
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6340

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition is its 6341
323
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Cycle- 6343

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 6344
on the same identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Cycle- 6345
Decomposition is its SuperHyperHamiltonian-Cycle-Decomposition and reversely. 6346
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6347

SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined if and only if its SuperHyperHamiltonian- 6348
Cycle-Decomposition isn’t well-defined. 6349
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6350

its Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined if and only if its 6351

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Decomposition 6354
Then its Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition isn’t well-defined if and only if its 6355
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6357

SuperHyperHamiltonian-Cycle-Decomposition is well-defined if and only if its SuperHyperHamiltonian-Cycle- 6358
Decomposition is well-defined. 6359
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6360
its Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition is well-defined if and only if its 6361

SuperHyperHamiltonian-Cycle-Decomposition is well-defined. 6362
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).

Decomposition 6364
Then its Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition is well-defined if and only if its 6365
SuperHyperHamiltonian-Cycle-Decomposition is well-defined. 6366
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6367
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6368
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6369
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6370
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6371
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6372
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 6373
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6374
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6377

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

independent SuperHyperSet is 6382
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6385
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6389

Graph which is a SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath. Then V is a maximal 6390
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6394
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6395
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6396
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6398

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6399
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6403
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6404
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6405
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6407

perGraph which is a SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath. Then the number 6408
of 6409

(i) : the SuperHyperHamiltonian-Cycle-Decomposition; 6410
(ii) : the SuperHyperHamiltonian-Cycle-Decomposition; 6411
(iii) : the connected SuperHyperHamiltonian-Cycle-Decomposition; 6412
(iv) : the O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 6413
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 6414
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition. 6415
coincide. 6417

Graph which is a SuperHyperWheel. Then the number of 6419
(i) : the dual SuperHyperHamiltonian-Cycle-Decomposition; 6420
(ii) : the dual SuperHyperHamiltonian-Cycle-Decomposition; 6421
(iii) : the dual connected SuperHyperHamiltonian-Cycle-Decomposition; 6422
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 6423
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition; 6424
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Cycle-Decomposition. 6425
coincide. 6427
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6428

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6440
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6441
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6442
SuperHyperPart is a 6443
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6447
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6448
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 6449
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6451

plete SuperHyperMultipartite. Then Then the number of 6452
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6459
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6460
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6462
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6463
(iv) : SuperHyperHamiltonian-Cycle-Decomposition; 6467

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6470
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6471
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6472
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6473

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6481
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6482
of dual 6483
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6487

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6491
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6492

is SuperHyperHamiltonian-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 6493
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of 6494
a dual 6495
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6499
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition; 6500

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition. 6501

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


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

a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such 6517
that 6518
(i) v ∈ Ns (x); 6519
(ii) vx ∈ E. 6520
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6521

a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle-Decomposition, then 6522
(i) S is SuperHyperHamiltonian-Cycle-Decomposition set; 6523
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6524
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6525
(i) Γ ≤ O; 6526
(ii) Γs ≤ On . 6527
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6528
connected. Then 6529
(i) Γ ≤ O − 1; 6530
(ii) Γs ≤ On − Σ3i=1 σi (x). 6531
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6532


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6536
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6537
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6539
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6540

Decomposition; 6541
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6542
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6543
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6544
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Cycle-Decomposition. 6546

Then 6547
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6548

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6558
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6559
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6561
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Cycle-Decomposition; 6562
(ii) Γ = 1; 6563
(iii) Γs = Σ3i=1 σi (c); 6564

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Cycle-Decomposition. 6565
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6566
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6567
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6569
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6570
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6571
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6573
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 6574
(ii) Γ = b n2 c + 1; 6576

b n c+1 ; 6577
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 6578
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6580
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6581
Decomposition; 6582
(ii) Γ = b n2 c; 6583

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

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

Cycle-Decomposition for N SHF; 6590
(ii) Γ = m for N SHF : (V, E); 6591
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6592
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6593
Cycle-Decomposition for N SHF : (V, E). 6594

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6595

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6596
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6597
SuperHyperHamiltonian-Cycle-Decomposition for N SHF; 6598
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6599
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 6600
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperHamiltonian-Cycle- 6601
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6603
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6604
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Cycle- 6605
Decomposition for N SHF : (V, E); 6606
(ii) Γ = b n2 c for N SHF : (V, E); 6607
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 6608
S={vi }i=1
bnc
are only dual maximal SuperHyperHamiltonian-Cycle- 6609
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6613

SuperHyperHamiltonian-Cycle-Decomposition, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
6614

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

SuperHyperHamiltonian-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
6622

SuperHyperHamiltonian-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 6625
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6627

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6637
(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6641

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


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

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


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

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

SuperHyperGraph which is SuperHyperHamiltonian-Cycle-Decomposition. Then following statements hold; 6668
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive 6669
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6671

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

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


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

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

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


CHAPTER 33 6687
Neutrosophic Applications in Cancer’s 6688
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6690
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6691
disease is considered and as the consequences of the model, some parameters are used. The cells 6692
are under attack of this disease but the moves of the cancer in the special region are the matter 6693
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6694
treatments for this Neutrosophic disease. 6695
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6696
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6697
term Neutrosophic function. 6698
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6699
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6700
move from the cancer is identified by this research. Sometimes the move of the cancer 6701
about the moves and the effects of the cancer on that region; this event leads us to 6703
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6704
perception on what’s happened and what’s done. 6705
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6706
known and they’ve got the names, and some general Neutrosophic models. The 6707
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6708
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6709
/SuperHyperHamiltonian-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, Super- 6710
HyperMultipartite, SuperHyperWheel). The aim is to find either the Neutrosophic 6711

SuperHyperHamiltonian-Cycle-Decomposition or the Neutrosophic SuperHyperHamiltonian-Cycle- 6712
Decomposition in those Neutrosophic Neutrosophic SuperHyperModels. 6713
335
CHAPTER 34 6714
Case 1: The Initial Neutrosophic Steps 6715
Toward Neutrosophic 6716
SuperHyperBipartite as Neutrosophic 6717
SuperHyperModel 6718
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6719
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6720
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

337
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6721
perBipartite is obtained. 6722
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6723
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6724
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6725
(34.1), is the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 6726

CHAPTER 35 6727
Case 2: The Increasing Neutrosophic 6728
Steps Toward Neutrosophic 6729
SuperHyperMultipartite as 6730
Neutrosophic SuperHyperModel 6731
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6732
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6733
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6734
perMultipartite is obtained. 6735
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6736
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

339
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6737

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6738
Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition. 6739

CHAPTER 36 6740
Wondering Open Problems But As The 6741
Directions To Forming The Motivations 6742
In what follows, some “problems” and some “questions” are proposed. 6743
The SuperHyperHamiltonian-Cycle-Decomposition and the Neutrosophic SuperHyperHamiltonian-Cycle- 6744
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 6745
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6746
recognitions? 6747
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Cycle- 6748

and the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition?
Decomposition 6749
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6750
them? 6751
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 6752
and the Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition?
Problem 36.0.5. The SuperHyperHamiltonian-Cycle-Decomposition and the Neutrosophic SuperHyperHamiltonian-

6754
do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6755
Cycle-Decomposition
SuperHyperHamiltonian-Cycle-Decomposition, are there else? 6756
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6757
Numbers types-results? 6758
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6759
the multiple types of SuperHyperNotions? 6760
341
CHAPTER 37 6761
Conclusion and Closing Remarks 6762
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6763
research are illustrated. Some benefits and some advantages of this research are highlighted. 6764
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6765
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian- 6766
Cycle-Decomposition. For that sake in the second definition, the main definition of the Neutro- 6767
sophic SuperHyperGraph is redefined on the position of the alphabets. Based on the new 6768
definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic 6769
SuperHyperHamiltonian-Cycle-Decomposition, finds the convenient background to implement some 6770

results based on that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses 6771
are the cases of this research on the modeling of the regions where are under the attacks of 6772
the cancer to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. 6773
To formalize the instances on the SuperHyperNotion, SuperHyperHamiltonian-Cycle-Decomposition, 6774
the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results 6775
are gathered in the section on the SuperHyperHamiltonian-Cycle-Decomposition and the Neutrosophic 6776
SuperHyperHamiltonian-Cycle-Decomposition. The clarifications, instances and literature reviews have 6777
taken the whole way through. In this research, the literature reviews have fulfilled the lines 6778
containing the notions and the results. The SuperHyperGraph and Neutrosophic SuperHy- 6779
perGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the 6780
background of this research. Sometimes the cancer has been happened on the region, full of 6781
cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 6782
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 6783
and strongest styles with the formation of the design and the architecture are formally called 6784
“ SuperHyperHamiltonian-Cycle-Decomposition” in the themes of jargons and buzzwords. The prefix 6785
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6786
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6787
pointed out and spoken out. 6788
343
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Cycle-Decomposition
3. Neutrosophic SuperHyperHamiltonian-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6789
Neutrosophic SuperHyperDuality But As 6790
Super Forms 6792
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6793

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6797

Va ∈ Ei , Ej ; 6798
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6799

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6800
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6801

Vi , Vj ∈ Ea ; 6802
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6803

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6804
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6805

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6806
sophic rv-SuperHyperDuality. 6807
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6808

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6811

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6813
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6814
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6815
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6816
form the Extreme SuperHyperDuality; 6817
345
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6818

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6820
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6821
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6822
such that they form the Neutrosophic SuperHyperDuality; 6824
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6825
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6826

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6827
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6828
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6829
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6830
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6832
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6834

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6836
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6837
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6838
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6839
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6842
coefficient; 6843
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6844

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6846
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6847
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6849
form the Extreme SuperHyperDuality; 6850
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6851

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6852
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6853
such that they form the Neutrosophic SuperHyperDuality; 6857
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6858

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6859
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6860

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6862
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6865
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6867

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6869

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6872
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6875
coefficient. 6876
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6877
the mentioned Neutrosophic Figures in every Neutrosophic items. 6878

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6880
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6881
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6882
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6883
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6884
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6885
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6886
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 6890
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6891
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6892
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6893
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6894

every given Neutrosophic SuperHyperDuality. 6895




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

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6954
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 6955
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 6957


the Neutrosophic SuperHyperDuality. 6966
Then 6968
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 6969
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 6975
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 6978

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 6979
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 6988

(V, E). Then 6989

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 6990
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 6991


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 6995
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 6996
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 SuperHyperDuality. 7008
Then, 7010
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 7011
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 7012


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7017
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7018
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7024

CHAPTER 39 7025
Neutrosophic SuperHyperJoin But As 7026
Super Forms 7028
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7029

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7033
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7035

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7036
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7038

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7040

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7043

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7044
rv-SuperHyperJoin. 7045
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7046

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

359

Extreme SuperHyperJoin; 7055
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7056

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7058
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7059

form the Neutrosophic SuperHyperJoin; 7062
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7063

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7064
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7065
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7070
coefficient; 7071
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7072

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7073
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7074
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7075
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7076
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7077
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7078

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7079
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7080
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7081

Extreme SuperHyperJoin; 7087
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7088

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7090
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7091
form the Neutrosophic SuperHyperJoin; 7094

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7095

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7097
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7101

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7102
to its Extreme coefficient; 7103
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7104

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7106
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7107

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7108
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7109
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7112
coefficient. 7113
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7117

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7118

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7183

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7192
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 7194


the Neutrosophic SuperHyperJoin. 7203
Then 7205
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 7206
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 7212
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7214

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7225

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7227


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

Then, 7245

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

.
Proof. Let 7246
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7247


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7251
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7252
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7253
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7258

CHAPTER 40 7259
Neutrosophic SuperHyperPerfect But As 7260
Super Forms 7262
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7263

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

Va ∈ Ei , Ej ; 7268
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7269

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7275

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7276
rv-SuperHyperPerfect. 7277
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7278

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7283
373
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7288

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7290
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7291
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7292
form the Neutrosophic SuperHyperPerfect; 7294
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7295

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7296
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7297
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7300
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7304

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7306
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7312
coefficient; 7313
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7314

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7322
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7323
such that they form the Neutrosophic SuperHyperPerfect; 7327
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7328

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7330

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7333
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7337

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7339

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7345
coefficient. 7346

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7350

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7416
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 7418
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7436
Then 7438
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 7439
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 7443
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7444
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7445
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7448

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7459

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7482


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7485
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7486
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7487
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7488
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7494

CHAPTER 41 7495
Neutrosophic SuperHyperTotal But As 7496
Super Forms 7498
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7499

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7503

Va ∈ Ei , Ej ; 7504
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7505

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7506
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7507

Vi , Vj ∈ Ea ; 7508
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7509

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7511

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7512
rv-SuperHyperTotal. 7513
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7514

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7519
Extreme SuperHyperTotal; 7523
387
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7524

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7526
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7527
form the Neutrosophic SuperHyperTotal; 7530
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7531
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7532

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7533
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7538
coefficient; 7539
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7540
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7541

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7542
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7543
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7548
cient; 7549
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7550

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7552
Extreme SuperHyperTotal; 7556
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7557

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7559
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7560
form the Neutrosophic SuperHyperTotal; 7563
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7564

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7565
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7566


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7571
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7573

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7574
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7575
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7576

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7581
cient. 7582

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7586
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. 7601




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7652
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 7654
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. 7661
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 7663



the Neutrosophic SuperHyperTotal. 7672
Then 7674
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 7675
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7681
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7683
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7694

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7701
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. 7712
Then, 7714
∗
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 7715
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7716


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7720
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7721

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7722
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7728

CHAPTER 42 7729
Neutrosophic SuperHyperConnected But 7730
As The Extensions Excerpt From Dense 7731
And Super Forms 7732
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7733

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7737
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7738
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7739

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7740
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7741
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7742

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7743
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7744

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7745
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7746
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7747
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7748
rosophic rv-SuperHyperConnected. 7749
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7750

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7753
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7754
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7755
401
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7757

that they form the Extreme SuperHyperConnected; 7759
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7760

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7761
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7762
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7763
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7764
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7765

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7766
nected; 7767
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7768

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7769
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7770
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7771
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7772
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7773

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7775
Extreme power is corresponded to its Extreme coefficient; 7776
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7777

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7778
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7779
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7780
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7781
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7782

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7784
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7785
its Neutrosophic coefficient; 7786
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7787

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7790
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7791

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7792
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7793
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7794

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7797
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7798
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7799

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7800
nected; 7801
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7802

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7805
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7806
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7807
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7808

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7809
and the Extreme power is corresponded to its Extreme coefficient; 7810
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7811

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7814
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7815

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7816
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7818
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7819
its Neutrosophic coefficient. 7820
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7823
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7824
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7826
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7827
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7828
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7829
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7830
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. 7838


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 7882
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. 7889
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 7891
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. 7898
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 7900



the Neutrosophic SuperHyperConnected. 7909
Then 7911
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 7912
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 7917
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 7918
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 7921

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7932
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 7933
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 7934


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 7938
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 7939
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 7940
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. 7951
Then, 7953
∗
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 7954
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 7955


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 7958
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 7959
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 7960
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 7961
some representatives. The latter is straightforward. 7962
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 7967

CHAPTER 43 7968
Background 7969
415











in Scribd. 8127



Bibliography 8159
10.33140/JMTCM.01.03.09) 8166
421
10.20944/preprints202301.0282.v1). 8194
10.20944/preprints202301.0267.v1). 8197

(doi: 10.20944/preprints202301.0265.v1). 8202
prints202301.0262.v1). 8206
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8212
prints202301.0105.v1). 8215
Preprints 2023, 2023010044 8221
10.20944/preprints202301.0043.v1). 8224

(doi: 10.20944/preprints202212.0549.v1). 8233
(doi: 10.20944/preprints202212.0500.v1). 8240
10.5281/zenodo.7791952). 8252

(doi: 10.5281/zenodo.7791982). 8255
10.5281/zenodo.7790026). 8258
2023, (doi: 10.5281/zenodo.7790052). 8261
2023, (doi: 10.5281/zenodo.7787066). 8264

10.5281/zenodo.7781476). 8270
10.5281/zenodo.7783082). 8273
10.5281/zenodo.7777857). 8276
10.5281/zenodo.7779286). 8279
(doi: 10.5281/zenodo.7771831). 8282
2023, (doi: 10.5281/zenodo.7772468). 8285
10.13140/RG.2.2.20913.25446). 8288
10.5281/zenodo.7764916). 8291
10.13140/RG.2.2.11770.98247). 8294
10.13140/RG.2.2.12400.12808). 8297
2023, (doi: 10.13140/RG.2.2.22545.10089). 8300

10.13140/RG.2.2.11377.76644). 8306
10.13140/RG.2.2.23750.96329). 8309
10.13140/RG.2.2.31366.24641). 8312
10.13140/RG.2.2.34721.68960). 8315
10.13140/RG.2.2.24288.35842). 8324
10.13140/RG.2.2.32467.25124). 8327
10.13140/RG.2.2.31025.45925). 8330
10.13140/RG.2.2.17184.25602). 8333
10.13140/RG.2.2.23423.28327). 8336
10.13140/RG.2.2.28456.44805). 8339
10.13140/RG.2.2.23525.68320). 8342

10.13140/RG.2.2.20170.24000). 8345
10.13140/RG.2.2.36475.59683). 8348
10.13140/RG.2.2.29764.71046). 8351
2023, (doi: 10.13140/RG.2.2.18780.87683). 8354
10.13140/RG.2.2.26134.01603). 8360
10.13140/RG.2.2.27392.30721). 8363
10.13140/RG.2.2.33028.40321). 8366
10.13140/RG.2.2.21389.20966). 8369
10.13140/RG.2.2.16356.04489). 8372
10.13140/RG.2.2.21756.21129). 8375
10.13140/RG.2.2.30983.68009). 8378
10.13140/RG.2.2.28552.29445). 8381

10.13140/RG.2.2.35105.89447). 8387
(doi: 10.13140/RG.2.2.30072.72960). 8390
10.13140/RG.2.2.31147.52003). 8393
10.13140/RG.2.2.32825.24163). 8396
10.13140/RG.2.2.13059.58401). 8399
10.13140/RG.2.2.11172.14720). 8402
2023, (doi: 10.13140/RG.2.2.22011.80165). 8405
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8408
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8414
2023, (doi: 10.13140/RG.2.2.19944.14086). 8417
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8420

(doi: 10.13140/RG.2.2.33103.76968). 8423
2023, (doi: 10.13140/RG.2.2.23037.44003). 8426
(doi: 10.13140/RG.2.2.35646.56641). 8429
(doi: 10.13140/RG.2.2.18030.48967). 8432
(doi: 10.13140/RG.2.2.13973.81121). 8435
2023, (doi: 10.13140/RG.2.2.34106.47047). 8438
2023, (doi: 10.13140/RG.2.2.31956.88961). 8444
2023, (doi: 10.13140/RG.2.2.15179.67361). 8447
10.13140/RG.2.2.21510.45125). 8450
2023, (doi: 10.13140/RG.2.2.13121.84321). 8453
10.13140/RG.2.2.11758.69441). 8456
2023, (doi: 10.13140/RG.2.2.31891.35367). 8459

10.13140/RG.2.2.19360.87048). 8462
2023, (doi: 10.13140/RG.2.2.32363.21286). 8465
(doi: 10.13140/RG.2.2.23266.81602). 8468
10.13140/RG.2.2.19911.37285). 8471
10.13140/RG.2.2.11050.90569). 8474
(doi: 10.13140/RG.2.2.30182.50241). 8486

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

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


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


10.20944/preprints202301.0282.v1). 8552

10.20944/preprints202301.0267.v1).). 8555

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8560
prints202301.0262.v1). 8564


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

10.13140/RG.2.2.35061.65767). 8573

10.13140/RG.2.2.18494.15680). 8577
10.13140/RG.2.2.32530.73922). 8581
10.13140/RG.2.2.15897.70243). 8585

10.13140/RG.2.2.32530.73922). 8589
prints202301.0105.v1). 8592
10.13140/RG.2.2.23172.19849). 8599

10.13140/RG.2.2.17385.36968). 8609

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

2023, (doi: 10.13140/RG.2.2.28945.92007). 8618
10.13140/RG.2.2.35774.77123). 8624

10.13140/RG.2.2.29430.88642). 8630
(doi: 10.20944/preprints202212.0549.v1). 8636
10.13140/RG.2.2.19380.94084). 8639


(doi: 10.20944/preprints202212.0500.v1). 8650

10.13140/RG.2.2.20993.12640). 8653



10.13140/RG.2.2.29173.86244). 8668

(doi: 10.5281/zenodo.7792307). 8675
(doi: 10.5281/zenodo.7790728). 8677
2023 (doi: 10.5281/zenodo.7787712). 8679
10.5281/zenodo.7783791). 8681
10.5281/zenodo.7780123). 8683
(doi: 10.5281/zenodo.7773119). 8685
odo.7637762). 8687

10.5281/zenodo.7766174). 8689
10.5281/zenodo.7762232). 8691
(doi: 10.5281/zenodo.7758601). 8693
10.5281/zenodo.7754661). 8695
10.5281/zenodo.7750995) . 8697
(doi: 10.5281/zenodo.7749875). 8699
10.5281/zenodo.7747236). 8701
10.5281/zenodo.7742587). 8703
(doi: 10.5281/zenodo.7738635). 8705
10.5281/zenodo.7734719). 8707
10.5281/zenodo.7730484). 8709
(doi: 10.5281/zenodo.7730469). 8711
10.5281/zenodo.7722865). 8713
odo.7713563). 8715
odo.7709116). 8717
10.5281/zenodo.7706415). 8719
(doi: 10.5281/zenodo.7706063). 8721
(doi: 10.5281/zenodo.7701906). 8723

odo.7700205). 8725
10.5281/zenodo.7694876). 8727
10.5281/zenodo.7679410). 8729
10.5281/zenodo.7675982). 8731
10.5281/zenodo.7672388). 8733
odo.7668648). 8735
10.5281/zenodo.7662810). 8737
10.5281/zenodo.7659162). 8739
odo.7653233). 8741
odo.7653204). 8743
odo.7653142). 8745
odo.7653117). 8747
odo.7653089). 8749
odo.7651687). 8751
odo.7651619). 8753
odo.7651439). 8755
odo.7650729). 8757
odo.7647868). 8759

odo.7647017). 8761
odo.7644894). 8763
odo.7641880). 8765
odo.7632923). 8767
odo.7623459). 8769
10.5281/zenodo.7606416). 8771
10.5281/zenodo.7606416). 8773
odo.7606404). 8775
10.5281/zenodo.7580018). 8777
odo.7580018). 8779
odo.7580018). 8781
odo.7579929). 8783
10.5281/zenodo.7563170). 8785
odo.7563164). 8787
odo.7563160). 8789
odo.7563160). 8791
10.5281/zenodo.7563160). 8793
10.5281/zenodo.7557063). 8795

10.5281/zenodo.7557009). 8797
10.5281/zenodo.7539484). 8799
10.5281/zenodo.7523390). 8801
10.5281/zenodo.7523390). 8803
10.5281/zenodo.7523390). 8805
odo.7574952). 8807
10.5281/zenodo.7574992). 8809
odo.7523357). 8811
10.5281/zenodo.7523357). 8813
10.5281/zenodo.7504782). 8815
10.5281/zenodo.7504782). 8817
10.5281/zenodo.7504782). 8819
10.5281/zenodo.7499395). 8821
odo.7499395). 8823
10.5281/zenodo.7499395). 8825
10.5281/zenodo.7497450). 8827
10.5281/zenodo.7497450). 8829
10.5281/zenodo.7494862). 8831

odo.7494862). 8833
10.5281/zenodo.7494862). 8835
10.5281/zenodo.7493845). 8837
10.5281/zenodo.7493845). 8839
10.5281/zenodo.7493845). 8841
odo.7539484). 8843
odo.7523390). 8845
odo.7523357). 8847
odo.7504782). 8849
odo.7499395). 8851
odo.7497450). 8853
odo.7494862). 8855
odo.7493845). 8857
odo.7480110). 8859
odo.7378758). 8861
odo.6320305). 8863
odo.6677173). 8865

CHAPTER 44 8866
Books’ Contributions 8867
“Books’ Contributions”: | Featured Threads 8868

The following references are cited by chapters. 8869
8870
[Ref227] 8871
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Hamiltonian- 8872
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 8873
8875
[Ref228] 8876
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8877
Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 8878
2023, (doi: 10.5281/zenodo.7793372). 8879
8880
The links to the contributions of this scientific research book are listed below. 8881
[HG227 8882
8886
[TITLE] “New Ideas On Super Decompensation By Hyper Decompress Of Hamiltonian- 8887
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 8888

8889
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 8890
https://www.researchgate.net/publication/369737397 8891
8892
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8893
https://www.scribd.com/document/635620581 8894
8895
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8896
https://zenodo.org/record/7793410 8897
8898
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8899
https://www.academia.edu/99527181 8900
441
Figure 44.1: Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of
Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper-
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7793410).
8901
[ADDRESSED CITATION] 8902
[ASSIGNED NUMBER] #227 Article 8906
[DATE] April 2023 8907

[DOI] 10.5281/zenodo.7793410 8908
[LICENSE] CC BY-NC-ND 4.0 8909
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8910
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 8911
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 8912
8913
[HG228] 8914
2023, (doi: 10.5281/zenodo.7793372). 8917
8918
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 8919

Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation” 8920
8921
https://www.researchgate.net/publication/369737369 8923
8924
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 8925


Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372).
https://www.scribd.com/document/635618214 8926
8927
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 8928
8930
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 8931
https://www.academia.edu/99526305 8932
8933
2023, (doi: 10.5281/zenodo.7793372). 8937
[ASSIGNED NUMBER] #228 Article 8938
[DATE] April 2023 8939
[DOI] 10.5281/zenodo.7793372 8940
[LICENSE] CC BY-NC-ND 4.0 8941

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 8942
[AVAILABLE AT TWITTER’S IDS] 8943
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 8944
googlebooks GooglePlay 8945
8946
[ASSIGNED NUMBER] | Book #154 8947

HG154b
Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 8949
2023 (doi: 10.5281/zenodo.7793875). 8950


[TITLE] Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 8951

#Latest_Updates 8952
#The_Links 8953
8957
8959
#The_Links 8960
8961
[ASSIGNED NUMBER] | Book #154 8962

8963
[TITLE] Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 8964
8965
8969
– 8970
8971
[PUBLISHER] 8972
(Paperback): https://www.amazon.com/dp/- 8973
(Hardcover): https://www.amazon.com/dp/- 8974

(Kindle Edition): https://www.amazon.com/dp/- 8975
8976
– 8977
8978
[ISBN] 8979
(Paperback): - 8980
(Hardcover): - 8981
(Kindle Edition): CC BY-NC-ND 4.0 8982
(EBook): CC BY-NC-ND 4.0 8983
8984
– 8985
8986
[PRINT LENGTH] 8987
(Paperback): - pages 8988
(Hardcover): - pages 8989
(Kindle Edition): - pages 8990
(E-Book): - pages 8991
8992
– 8993
8994
8996

#The_Links 8997
8998
https://www.researchgate.net/publication/- 9000
9001
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9002
https://drhenrygarrett.wordpress.com/2023/04/22/ 9003
Hamiltonian-Cycle-Decomposition-In-SuperHyperGraphs/ 9004
9005
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9006
https://www.scribd.com/document/- 9007
9008
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9009
https://www.academia.edu/- 9010
9011
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9012
9014
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9015
https://books.google.com/books/about?id=- 9016
9017
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9018
https://play.google.com/store/books/details?id=- 9019

[TITLE] Hamiltonian-Cycle-Decomposition In SuperHyperGraphs (Published Version) 9020

9021
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9022
9023
https://drhenrygarrett.wordpress.com/2023/04/22/ 9024
Hamiltonian-Cycle-Decomposition-In-SuperHyperGraphs/ 9025
9026
– 9027
9028
[POSTED BY] Dr. Henry Garrett 9029
9030
[DATE] April 003, 2023 9031

9032
[POSTED IN] 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs 9033
9034
[TAGS] 9035
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9036
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9037
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9038
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9039
neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Cycle-Decomposition In Super- 9040
HyperGraphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, 9041
Questions, Real-World Applications, Recent Research, Recognitions, Research, scientific re- 9042
search Article, scientific research Articles, scientific research Book, scientific research Chapter, 9043
scientific research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, 9044

SuperHyperGraph Theory, SuperHyperGraphs, Hamiltonian-Cycle-Decomposition In SuperHy- 9045
perGraphs, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9046
In this scientific research book, there are some scientific research chapters on “Extreme 9047
Hamiltonian-Cycle-Decomposition In SuperHyperGraphs” and “Neutrosophic Hamiltonian- 9048
Cycle-Decomposition In SuperHyperGraphs” about some scientific research on Hamiltonian- 9049
Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Ex- 9050

treme Hamiltonian-Cycle-Decomposition In SuperHyperGraphs and Neutrosophic Hamiltonian- 9051
Cycle-Decomposition In SuperHyperGraphs. With scientific research on the basic scientific 9052
research properties, the scientific research book starts to make Extreme Hamiltonian- 9053
Cycle-Decomposition In SuperHyperGraphs theory and Neutrosophic Hamiltonian-Cycle- 9054
Decomposition In SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9055

CHAPTER 45 9056
“SuperHyperGraph-Based Books”: | 9057
Featured Tweets 9058
“SuperHyperGraph-Based Books”: | Featured Tweets 9059
449
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 9060
CV 9061
477
9062
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

9063
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)
9064
Publications: Articles
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
@ResearchGate: https://www.researchgate.net/publication/369456588
@Scribd: https://www.scribd.com/document/633165164
@ZENODO_ORG: https://zenodo.org/record/7763661
@academia: https://www.academia.edu/98987491
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
@Scribd: https://www.scribd.com/document/-
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript

9065
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript

9066
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor
10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

9067
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript

9068
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In
10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

9069
By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

9070
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript

9071
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity
10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

9072
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

9073
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

9074
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
9075
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

9076

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

9077
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

9078
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

9079
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: -
9080
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
9081
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
9082
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
9083
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
9084
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).
9085
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”,

9086
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”,

9087
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

9088
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).
9089
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).
9090
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
9091
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).
9092

(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).
9093
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).
9094
Publications: Books
2023 147 | SuperHyperDuality Amazon
[ADDRESSED CITATION]
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
@academia:https://www.academia.edu/96858234
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
(Kindle Edition): CC BY-NC-ND 4.0
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9095
[HG145b] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7762232).
@googlebooks:https://books.google.com/books/about?id=q021EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q021EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBY449B
(Hardcover): https://www.amazon.com/dp/B0BZFCBXYR
(Kindle Edition): https://www.amazon.com/dp/B0BZCP4DSW
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388173157
2023 144 | Edge-Decomposition In SuperHyperGraphs Amazon
[HG144b] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7758601).
@googlebooks:https://books.google.com/books/about?id=5Pm0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5Pm0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBGNQTR
(Hardcover): https://www.amazon.com/dp/B0BZ6SNCXJ
(Kindle Edition): https://www.amazon.com/dp/B0BZ7WZF48
ISBN
(Paperback): 9798388014078
(Hardcover): 9798388014962
2023 143 | Edge-Cut In SuperHyperGraphs Amazon

9096
[HG143b] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7754661).
@googlebooks:https://books.google.com/books/about?id=L u0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=L u0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZ324MLT
(Hardcover): https://www.amazon.com/dp/B0BZ34DF21
(Kindle Edition): https://www.amazon.com/dp/B0BZ3Z9J8W
ISBN
(Paperback): 9798387863837
(Hardcover): 9798387865688
2023 142 | Vertex-Neighbor In SuperHyperGraphs Amazon
[HG142b] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7750995).
@googlebooks:https://books.google.com/books/about?id=5JO0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5JO0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR8YN3V
(Hardcover): https://www.amazon.com/dp/B0BYRL26L7
(Kindle Edition): https://www.amazon.com/dp/B0BYYW89VD
ISBN
(Paperback): 9798387725944
(Hardcover): 9798387727511
2023 141 | Vertex-Decomposition In SuperHyperGraphs Amazon

9097
[HG141b] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7749875).
@googlebooks:https://books.google.com/books/about?id=-oS0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=-oS0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR862GV
(Hardcover): https://www.amazon.com/dp/B0BYR7TZXZ
(Kindle Edition): https://www.amazon.com/dp/B0BYX3144B
ISBN
(Paperback): 9798387614910
(Hardcover): 9798387616792
2023 140 | Vertex-Cut In SuperHyperGraphs Amazon
[HG140b] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7747236).
@googlebooks:https://books.google.com/books/about?id=fmC0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=fmC0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRC9P2F
(Hardcover): https://www.amazon.com/dp/B0BYR7YKMC
(Kindle Edition): https://www.amazon.com/dp/B0BYX1HCTN
ISBN
(Paperback): 9798387610660
(Hardcover): 9798387611964
2023 139 | Stable-Neighbor In SuperHyperGraphs Amazon

9098
[HG139b] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7742587).
@googlebooks:https://books.google.com/books/about?id=5y60EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5y60EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR5PWBJ
(Hardcover): https://www.amazon.com/dp/B0BYRBV5KL
(Kindle Edition): https://www.amazon.com/dp/B0BYVK1CCH
ISBN
(Paperback): 9798387498947
(Hardcover): 9798387510786
2023 138 | Stable-Decompositions In SuperHyperGraphs Amazon
[HG138b] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7738635).
@googlebooks:https://books.google.com/books/about?id=q-CzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q-CzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR86GDV
(Hardcover): https://www.amazon.com/dp/B0BYR5GCRQ
(Kindle Edition): https://www.amazon.com/dp/B0BYVFCRJ3
ISBN
(Paperback): 9798387492839
(Hardcover): 9798387495489
2023 137 | Stable-Cut In SuperHyperGraphs Amazon

9099
[HG137b] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7734719).
@googlebooks:https://books.google.com/books/about?id=oKmzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=oKmzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRNDT1Z
(Hardcover): https://www.amazon.com/dp/B0BYR5GF4P
(Kindle Edition): https://www.amazon.com/dp/B0BYS8MJD6
ISBN
(Paperback): 9798387367335
(Hardcover): 9798387369513
2023 136 | Clique-Neighbors In SuperHyperGraphs Amazon
[HG136b] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7730484).
@googlebooks:https://books.google.com/books/about?id=NXyzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=NXyzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Neighbors-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM8JSFJ
(Hardcover): https://www.amazon.com/dp/B0BYLPSR1C
(Kindle Edition): https://www.amazon.com/dp/B0BYBQK51T
ISBN
(Paperback): 9798386938741
(Hardcover): 9798386938772
2023 135 | Clique-Decompositions In SuperHyperGraphs Amazon

9100
[HG135b] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7730469).
@googlebooks:https://books.google.com/books/about?id=D3yzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=D3yzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM1CV3S
(Hardcover): https://www.amazon.com/dp/B0BYLXRXTJ
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386938598
(Hardcover): 9798386938635
2023 134 | Clique-Cut In SuperHyperGraphs Amazon
[HG134b] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7722865).
@googlebooks:https://books.google.com/books/about?id=BEuzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=BEuzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYLPSHS5
(Hardcover): https://www.amazon.com/dp/B0BYM4QTKG
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386709860
(Hardcover): 9798386709891
2023 133 | Space In SuperHyperGraphs Amazon

9101
[HG133b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7713563).
@googlebooks:https://books.google.com/books/about?id=je-yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=je-yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/List-Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNPGDB5
(Hardcover): https://www.amazon.com/dp/B0BXNCSNBJ
(Kindle Edition): https://www.amazon.com/dp/B0BXYYCS5H
ISBN
(Paperback): 9798386468965
(Hardcover): 9798386469030
2023 0132 | Space In SuperHyperGraphs Amazon
[HG132b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7709116).
@googlebooks:https://books.google.com/books/about?id=M56yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=M56yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Space-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 131 | Edge-Connectivity In SuperHyperGraphs Amazon

9102
[HG131b] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7706415).
@googlebooks:https://books.google.com/books/about?id=9XKyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=9XKyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/B0BXN418BY
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): 9798386229306
2023 130 | Vertex-Connectivity In SuperHyperGraphs Amazon
[HG130b] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7706063).
@googlebooks:https://books.google.com/books/about?id=12myEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=12myEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN7F5VZ
(Hardcover): https://www.amazon.com/dp/B0BXN6NP8X
(Kindle Edition): https://www.amazon.com/dp/B0BXR1ZMKJ
ISBN
(Paperback): 9798386225056
(Hardcover): 9798386225872
2023 129 | Tree-Decomposition In SuperHyperGraphs Amazon

9103
[HG129b] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7701906).
@googlebooks:https://books.google.com/books/about?id=FBmyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=FBmyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/04/22/Tree-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN4X4MD
(Hardcover): https://www.amazon.com/dp/B0BXNK5C1D
(Kindle Edition): https://www.amazon.com/dp/B0BXM1FT1M
ISBN
(Paperback): 9798386069155
(Hardcover): 9798386070076
2023 128 | Chord In SuperHyperGraphs Amazon
[HG128b] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7700205).
@googlebooks:https://books.google.com/books/about?id=mfSxEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=mfSxEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Chord-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW3HR3CT
(Hardcover): https://www.amazon.com/dp/B0BW2KMGVJ
(Kindle Edition): https://www.amazon.com/dp/B0BXJYTWD3
ISBN
(Paperback): 9798385981755
(Hardcover): 9798385984046
2023 127 | (i,j)-Domination In SuperHyperGraphs Amazon

9104
[HG127b] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7694876).
@googlebooks:https://books.google.com/books/about?id=QoexEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=QoexEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/(i,j)-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2GWHR4
(Hardcover): https://www.amazon.com/dp/B0BW3HG682
(Kindle Edition): https://www.amazon.com/dp/B0BXDK4WLM
ISBN
(Paperback): 9798385701025
(Hardcover): 9798385701797
2023 0126 | Edge-Domination In SuperHyperGraphs Amazon
[HG126b] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7679410).
@googlebooks:https://books.google.com/books/about?id=PEiwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=PEiwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/28/Edge-Domination-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2QM56Q
(Hardcover): https://www.amazon.com/dp/B0BW3GJNWL
(Kindle Edition): https://www.amazon.com/dp/B0BWWXGLX6
ISBN
(Paperback): 9798379089597
(Hardcover): 9798379090531
2023 0125 | K-Domination In SuperHyperGraphs Amazon

9105
[HG125b] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7675982).
@googlebooks:https://books.google.com/books/about?id=WyKwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=WyKwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/27/K-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 124 | K-Number In SuperHyperGraphs Amazon
[HG124b] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7672388).
@googlebooks:https://books.google.com/books/about?id=TtCvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TtCvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODO_ORG:
https://zenodo.org/record/7672388
(Paperback): https://www.amazon.com/dp/B0BW32LV1S
(Hardcover): https://www.amazon.com/dp/B0BW31GSZB
(Kindle Edition): https://www.amazon.com/dp/B0BWR36VFF
ISBN
(Paperback): 9798378775477
(Hardcover): 9798378776733
2023 123 | Order In SuperHyperGraphs Amazon

9106
[HG123b] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7668648).
@googlebooks:https://books.google.com/books/about?id=U56vEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=U56vEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/Order-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2KJKJD
(Hardcover): https://www.amazon.com/dp/B0BW2BSXTG
(Kindle Edition): https://www.amazon.com/dp/B0BWMKNH7H
ISBN
(Paperback): 9798378647705
(Hardcover): 9798378648146
2023 122 | Coloring In SuperHyperGraphs Amazon
[HG122b] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7662810).
@googlebooks:https://books.google.com/books/about?id=jGavEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jGavEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW28MKQP
(Hardcover): https://www.amazon.com/dp/B0BW35Y9YW
(Kindle Edition): https://www.amazon.com/dp/B0BWN81GT3
ISBN
(Paperback): 9798378499175
(Hardcover): 9798378499717
2023 121 || “Dimension In SuperHyperGraphs” Amazon

9107
[HG9121b] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7659162).
@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW38DB6M
(Hardcover): https://www.amazon.com/dp/B0BW2KMB1J
(Kindle Edition): https://www.amazon.com/dp/B0BWCW6KJL
ISBN
(Paperback): 9798378343188
(Hardcover): 9798378343812
2023 120 || “Cancer In SuperHyperGraphs” Amazon
[HG120b] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653233).
@googlebooks:https://books.google.com/books/about?id=ZdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=ZdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/Cancer-in-
SuperHyperGraphs/
@Scribd:https://www.scribd.com/document/-
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0
2023 0119 || “SuperHyperWheel” Amazon

9108
[HG119b] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653204).
SuperHyperWheel
@googlebooks:https://books.google.com/books/about?id=S9muEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=S9muEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperWheel/
|| SuperHyperWheel
Link (Paperback): https://www.amazon.com/dp/B0BW2BX6X1
(Hardcover): https://www.amazon.com/dp/B0BW23H1M2 (Kindle Edition):
https://www.amazon.com/dp/B0BW6H5TVG
ND 4.0
2023 0118 || “SuperHyperMultipartite” Amazon
[HG118b] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653142).
SuperHyperMultipartite
@googlebooks:https://books.google.com/books/about?id=SdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=SdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperMultipartite/
|| SuperHyperMultipartite
Link (Paperback): https://www.amazon.com/dp/B0BW358WXN
(Hardcover): https://www.amazon.com/dp/B0BW2CR178 (Kindle Edition):
https://www.amazon.com/dp/B0BW6FTXNH
ND 4.0
2023 0117 || “SuperHyperBipartite” Amazon

9109
[HG117b] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653117).
SuperHyperBipartite
@googlebooks:https://books.google.com/books/about?id=s9iuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=s9iuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperBipartite/
|| SuperHyperBipartite
Link (Paperback): https://www.amazon.com/dp/B0BW267JRF
(Hardcover): https://www.amazon.com/dp/B0BW2ZSL9D (Kindle Edition):
https://www.amazon.com/dp/B0BW6G294W
ND 4.0
2023 0116 || “SuperHyperStar” Amazon
[HG116b] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653089).
SuperHyperStar
@googlebooks:https://books.google.com/books/about?id=8deuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8deuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperStar/
|| SuperHyperStar
Link (Paperback): https://www.amazon.com/dp/B0BW2XKM25
(Hardcover): https://www.amazon.com/dp/B0BW2RKDDX (Kindle Edition):
https://www.amazon.com/dp/B0BW6CTTXM
ND 4.0
2023 0115 || “SuperHyperCycle” Amazon

9110
[HG115b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651687).
SuperHyperCycle
@googlebooks:https://books.google.com/books/about?id=u8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperCycle/
|| SuperHyperCycle
Link (Paperback): https://www.amazon.com/dp/B0BW2XKLRW
(Hardcover): https://www.amazon.com/dp/B0BW2R9SSF (Kindle Edition):
https://www.amazon.com/dp/B0BW5G2J68
ND 4.0
2023 0114 || “SuperHyperPath” Amazon
[HG114b] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651619).
SuperHyperPath
@googlebooks:https://books.google.com/books/about?id=t8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=t8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/
|| SuperHyperPath
Link (Paperback): https://www.amazon.com/dp/B0BW2B6DPZ
(Hardcover): https://www.amazon.com/dp/B0BW2B6DP3 (Kindle Edition):
https://www.amazon.com/dp/B0BW5D6T17
ND 4.0
2023 0113 || “SuperHyperDomination” Amazon

9111
[HG113b] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651439).
SuperHyperDomination
@googlebooks:https://books.google.com/books/about?id=scSuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=scSuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDomination/
|| SuperHyperDomination
Link (Paperback): https://www.amazon.com/dp/B0BW2R9STC
(Hardcover): https://www.amazon.com/dp/B0BW3BJZRF (Kindle Edition):
https://www.amazon.com/dp/B0BW5FPZC8
ND 4.0
2023 0112 || “SuperHyperDominating” Amazon
[HG112b] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7650729).
SuperHyperDominating
@googlebooks:https://books.google.com/books/about?id=17uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=17uuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDominating/
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0
2023 0111 || “SuperHyperConnected” Amazon

9112
[HG111b] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647868).
SuperHyperConnected
@googlebooks:https://books.google.com/books/about?id=AmquEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=AmquEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/17/SuperHyperConnected/
|| SuperHyperConnected
Link (Paperback): https://www.amazon.com/dp/B0BW2LMPN5
(Hardcover): https://www.amazon.com/dp/B0BW358DDG (Kindle Edition):
https://www.amazon.com/dp/B0BW2ZBHG7
ND 4.0
2023 0110 || “SuperHyperTotal” Amazon
[HG110b] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647017).
SuperHyperTotal
@googlebooks:https://books.google.com/books/about?id=81uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=81uuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/17/superhypertotal/
|| SuperHyperTotal
Link (Paperback): https://www.amazon.com/dp/B0BW35VNQS
(Hardcover): https://www.amazon.com/dp/B0BW2CQZJZ (Kindle Edition):
https://www.amazon.com/dp/B0BW1TZTPX
ND 4.0
2023 0109 || “SuperHyperPerfect” Amazon

9113
[HG109b] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7644894).
SuperHyperPerfect
@googlebooks:https://books.google.com/books/about?id=JymuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=JymuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/16/SuperHyperPerfect/
|| SuperHyperPerfect
Link (Paperback): https://www.amazon.com/dp/B0BVSXB7TC
(Hardcover): https://www.amazon.com/dp/B0BVT8FRC2 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6CGKZ
ND 4.0
2023 0108 || “SuperHyperJoin” Amazon
[HG108b] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7641880).
SuperHyperJoin
@googlebooks:https://books.google.com/books/about?id=TeStEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TeStEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/15/superhyperjoin/
|| SuperHyperJoin
Link (Paperback): https://www.amazon.com/dp/B0BVT7HJ1K
(Hardcover): https://www.amazon.com/dp/B0BVSXX9W5 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6P9KC
ND 4.0
2023 0107 || “Path SuperHyperColoring” Amazon
[HG107b] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7632923).
|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ND 4.0
9114
2023 0106 || “SuperHyperDensity” Amazon
[HG106b] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7623459).
|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ND 4.0
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
2023 0105 || “Neutrosophic SuperHyperConnectivities” Amazon
[HG105b] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023.
Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=YeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=YeurEAAAQBAJ
2023 Book 104 || “Extreme SuperHyperConnectivities” Amazon
[HG104b] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606416).
Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=X-urEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=X-urEAAAQBAJ
2023 Book 103 || “SuperHyperConnectivities” Amazon

9115
[HG103b] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606404).
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=UeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=UeurEAAAQBAJ
2023 Book 102 || “Neutrosophic SuperHyperCycle” Amazon
[HG102b] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=OCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=OCeqEAAAQBAJ
@WordPress: -
2023 Book 101 || “Extreme SuperHyperCycle” Amazon
[HG101b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=MCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=MCeqEAAAQBAJ
@WordPress: -
2023 Book 100 || “Extreme SuperHyperCycle” Amazon
[HG100b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ND 4.0
2023 Book 99 || “SuperHyperCycle” Amazon

9116
[HG99b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7579929).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=LieqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=LieqEAAAQBAJ
@WordPress: -
2023 0098 | Neutrosophic SuperHyperGirth Amazon
[HG98b] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563170).
https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
@WordPress: -
@Scribd: -
2023 0097 | Extreme SuperHyperGirth Amazon
[HG97b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563164).
https://www.amazon.com/dp/B0BSJPZV9J
https://www.amazon.com/dp/B0BSJPYVWJ
9798374731309
9798374736915
CC BY-NC-ND 4.0
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367351526E xtremeS uperHyperGirth
@Scribd: -
2023 0096 | “SuperHyperGirth” Amazon

9117
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
@ZENODOO RG : https : //zenodo.org/record/7563160
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9118
[HG92b] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557009).
@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
https://www.amazon.com/dp/B0BSJDJSN7
https://www.amazon.com/dp/B0BSLKWW3F
9798374564266
9798374564785
CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0091 | “Overlook On SuperHyperMatching” Amazon
[HG91b] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
2023 0090 | “Neutrosophic Failed SuperHyperClique” Amazon
[HG90b] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ
2023 0089 | “Extreme Failed SuperHyperClique” Amazon
[HG89b] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ
2023 0088 | “Overlook On Failed SuperHyperClique” Amazon
[HG88b] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
2023 0087 | “Extreme SuperHyperClique” Amazon

9119
[HG87b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574952).
Link (Paperback): https://www.amazon.com/dp/B0BT6WSZLD (Hardcover):

https://www.amazon.com/dp/B0BT743MW2 (Kindle Edition): ISBN (Paperback):
9798375140049 (Hardcover): 9798375141510 (Kindle Edition): CC BY-NC-ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=52 pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
@WordPress: -
2023 0086 | “Neutrosophic SuperHyperClique” Amazon
[HG86b] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574992).
@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):
https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
@WordPress: -
2023 0085 | “Extreme SuperHyperClique” Amazon
[HG85b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
2023 0084 | “Overlook On SuperHyperClique” Amazon
[HG84b] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
9120
2023 0083 | “Neutrosophic Failed SuperHyperStable” Amazon
[HG83b] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ
2023 0082 | “Extreme Failed SuperHyperStable” Amazon
[HG82b] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ
2023 0081 | “Overlook On Failed SuperHyperStable” Amazon
[HG81b] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ
2023 0080 | “Neutrosophic SuperHyperStable” Amazon
[HG80b] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ
2023 0079 | “Extreme SuperHyperStable” Amazon
[HG79b] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ
2023 0078 | “Overlook On SuperHyperStable” Amazon
[HG78b] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ
2023 0077 | Neutrosophic Failed SuperHyperForcing Amazon

9121
“Neutrosophic Failed SuperHyperForcing”
[HG77b] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ
2023 0076 | Extreme Failed SuperHyperForcing Amazon
[HG76b] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
“Extreme Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ
2023 0075 | Neutrosophic SuperHyperForcing Amazon
[HG75b] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Neutrosophic SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ
2023 0074 | Extreme SuperHyperForcing Amazon
[HG74b] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Extreme SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
2023 0073 | Overlook On SuperHyperForcing Amazon
[HG73b] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Overlook On SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
2023 0072 | Neutrosophic SuperHyperAlliances Amazon

9122
[HG72b] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Neutrosophic SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ
2023 0071 | Extreme SuperHyperAlliances Amazon
[HG71b] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Extreme SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ
2023 0070 | Overlook On SuperHyperAlliances Amazon
[HG70b] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Overlook On SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ
2023 0069 | SuperHyperMatching Amazon
[HG69b] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: https://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/16/superhypermatching-
published-version/
Link
(Paperback): https://www.amazon.com/dp/B0BSDPXX1P
(Hardcover): https://www.amazon.com/dp/B0BSDC1L66
(Kindle Edition):
ISBN
(Paperback): 9798373872683
(Hardcover): 9798373875424
ASIN : B0BSDPXX1P Publisher : Independently published (January 15, 2023) Language
: English Paperback : 582 pages ISBN-13 : 979-8373872683 Item Weight : 3.6 pounds
Dimensions : 8.5 x 1.37 x 11 inches
ASIN : B0BSDC1L66 Publisher : Independently published (January 16, 2023) Language
: English Hardcover : 548 pages ISBN-13 : 979-8373875424 Item Weight : 3.3 pounds
9123
2023 0068 | Failed SuperHyperClique Amazon
[HG68b] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
https://www.amazon.com/dp/B0BRZ67NYN
https://www.amazon.com/dp/B0BRYZTK24
9798373274227
9798373277273
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/11/failed-superhyperclique-
published-version
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language
ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
: English Hardcover : 460 pages ISBN-13 : 979-8373277273 Item Weight : 2.78 pounds
2023 0067 | SuperHyperClique Amazon
[HG67b] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
https://www.amazon.com/dp/B0BRWK4S1Y
https://www.amazon.com/dp/B0BRM24YJX
9798373040471
9798373041935
@ZENODOO RG : zenodo.org/record/7523357
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/10/superhyperclique-published-
version-2/
ASIN : B0BRWK4S1Y Publisher : Independently published (January 8, 2023) Language
ASIN : B0BRM24YJX Publisher : Independently published (January 8, 2023) Language :
English Hardcover : 388 pages ISBN-13 : 979-8373041935 Item Weight : 2.36 pounds Dimensions
: 8.25 x 1.1 x 11 inches
2023 0066 | Failed SuperHyperStable Amazon

9124
[HG66b] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
https://www.amazon.com/dp/B0BRNG7DC8
https://www.amazon.com/dp/B0BRLVN39L
9798372597976
9798372599765
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/06/failed-superhyperstable-
published-version/
ASIN : B0BRNG7DC8 Publisher : Independently published (January 4, 2023) Language
ASIN : B0BRLVN39L Publisher : Independently published (January 4, 2023) Language :
: 8.25 x 0.91 x 11 inches
2023 0065 | SuperHyperStable Amazon
[HG65b] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
https://www.amazon.com/dp/B0BRDG5Z4Y
https://www.amazon.com/dp/B0BRJPG56M
9798372248519
9798372252011
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/03/superhyperstable-published-
version/
ASIN : B0BRDG5Z4Y Publisher : Independently published (January 2, 2023) Language
Dimensions : 8.27 x 0.7 x 11.69 inches
ASIN : B0BRJPG56M Publisher : Independently published (January 2, 2023) Language :
: 8.25 x 0.87 x 11 inches
2023 0064 | Failed SuperHyperForcing Amazon

9125
[HG64b] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
https://www.amazon.com/dp/B0BRH5B4QM
https://www.amazon.com/dp/B0BRGX4DBJ
9798372123649
9798372124509
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/01/failed-superhyperforcing-
published-version/
ASIN : B0BRH5B4QM Publisher : Independently published (January 1, 2023) Language
ASIN : B0BRGX4DBJ Publisher : Independently published (January 1, 2023) Language :
: 8.25 x 0.98 x 11 inches
2022 0063 | SuperHyperForcing Amazon
[HG63b] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language :
: 8.25 x 0.86 x 11 inches
https://www.amazon.com/dp/B0BRDG1KN1 https://www.amazon.com/dp/B0BRDFFQMF
9798371873347 9798371874092
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/30/superhyperforcing-
published-versian/
2022 0062 | SuperHyperAlliances Amazon

9126
[HG62b] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
ASIN : B0BR6YC3HG Publisher : Independently published (December 27, 2022) Language

ASIN : B0BR7CBTC6 Publisher : Independently published (December 27, 2022) Language :
: 8.25 x 0.64 x 11 inches
https://www.amazon.com/dp/B0BR6YC3HG https://www.amazon.com/dp/B0BR7CBTC6
9798371488343 9798371494849
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/28/superhyperalliances-
published-version/
2022 0061 | SuperHyperGraphs Amazon
[HG61b] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7480110).
@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wor
ASIN : B0BR1NHY4Z Publisher : Independently published (December 24, 2022) Language :
English Paperback : 117 pages ISBN-13 : 979-8371090133 Item Weight : 13 ounces Dimensions
: 8.5 x 0.28 x 11 inches
ASIN : B0BQXTHTXY Publisher : Independently published (December 24, 2022) Language :
English Hardcover : 117 pages ISBN-13 : 979-8371093240 Item Weight : 12.6 ounces Dimensions
: 8.25 x 0.47 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):
https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ND 4.0
2022 0060 | Neut. SuperHyperEdges Amazon

9127
[HG60b] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7378758).
@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
ASIN : B0BNH11ZDY Publisher : Independently published (November 27, 2022) Language :
: 8.5 x 0.26 x 11 inches
ASIN : B0BNGZGPP6 Publisher : Independently published (November 27, 2022) Language :
: 8.25 x 0.45 x 11 inches
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):
https://www.amazon.com/dp/B0BNGZGPP6
ND 4.0
2022 0059 | Neutrosophic k-Number Amazon
ASIN : B0BF3P5X4N Publisher : Independently published (September 14, 2022) Language

ASIN : B0BF2XCDZM Publisher : Independently published (September 14, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0058 | Neutrosophic Schedule Amazon
ASIN : B0BBJWJJZF Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJLPWKH Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1.35 x 11 inches
2022 0057 | Neutrosophic Wheel Amazon
ASIN : B0BBJRHXXG Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBK3KG82 Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.65 x 11 inches
2022 0056 | Neutrosophic t-partite Amazon
ASIN : B0BBJLZCHS Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJDFGJS Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.75 x 11 inches
2022 0055 | Neutrosophic Bipartite Amazon

9128
ASIN : B0BB5Z9GHW Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBGG9RDZ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.72 x 11 inches
2022 0054 | Neutrosophic Star Amazon
ASIN : B0BB5ZHSSZ Publisher : Independently published (August 22, 2022) Language :

English Paperback : 215 pages ISBN-13 : 979-8847794374 Item Weight : 1.4 pounds Dimensions
: 8.5 x 0.51 x 11 inches
ASIN : B0BBC4BL9P Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.7 x 11 inches
2022 0053 | Neutrosophic Cycle Amazon
ASIN : B0BB62NZQK Publisher : Independently published (August 22, 2022) Language

ASIN : B0BB65QMKQ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1 x 11 inches
2022 0052 | Neutrosophic Path Amazon
ASIN : B0BB67WCXL Publisher : Independently published (August 8, 2022) Language :

English Paperback : 315 pages ISBN-13 : 979-8847730570 Item Weight : 2 pounds Dimensions
: 8.5 x 0.74 x 11 inches
ASIN : B0BB5Z9FXL Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.93 x 11 inches
2022 0051 | Neutrosophic Complete Amazon
ASIN : B0BB6191KN Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB5RRQN7 Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.73 x 11 inches
2022 0050 | Neutrosophic Dominating Amazon
ASIN : B0BB5QV8WT Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB61WL9M Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.03 x 11 inches
2022 0049 | Neutrosophic Resolving Amazon
ASIN : B0BBCJMRH8 Publisher : Independently published (August 8, 2022) Language

ASIN : B0BBCB6DFC Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.06 x 11 inches
2022 0048 | Neutrosophic Stable Amazon

9129
ASIN : B0B7QGTNFW Publisher : Independently published (July 28, 2022) Language :

English Paperback : 133 pages ISBN-13 : 979-8842880348 Item Weight : 14.6 ounces Dimensions
: 8.5 x 0.32 x 11 inches
ASIN : B0B7QJWQ35 Publisher : Independently published (July 28, 2022) Language :
: 8.25 x 0.51 x 11 inches
2022 0047 | Neutrosophic Total Amazon
ASIN : B0B7GLB23F Publisher : Independently published (July 25, 2022) Language : English
Paperback : 137 pages ISBN-13 : 979-8842357741 Item Weight : 14.9 ounces Dimensions : 8.5
x 0.33 x 11 inches
ASIN : B0B6XVTDYC Publisher : Independently published (July 25, 2022) Language :
: 8.25 x 0.52 x 11 inches
2022 0046 | Neutrosophic Perfect Amazon
ASIN : B0B7CJHCYZ Publisher : Independently published (July 22, 2022) Language :

: 8.5 x 0.3 x 11 inches
ASIN : B0B7C732Z1 Publisher : Independently published (July 22, 2022) Language : English
Hardcover : 127 pages ISBN-13 : 979-8842028757 Item Weight : 13.6 ounces Dimensions : 8.25
x 0.49 x 11 inches
2022 0045 | Neutrosophic Joint Set Amazon
ASIN : B0B6L8WJ77 Publisher : Independently published (July 15, 2022) Language : English
Paperback : 139 pages ISBN-13 : 979-8840802199 Item Weight : 15 ounces Dimensions : 8.5 x
0.33 x 11 inches
ASIN : B0B6L9GJWR Publisher : Independently published (July 15, 2022) Language :
: 8.25 x 0.52 x 11 inches
August 30, 0044 | Neutrosophic Duality GLOBAL

2022 KNOWLEDGE -
Publishing
House&Amazon&Google
Scholar&UNM
[HG44b] H. Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6677173).
Neutrosophic Duality, GLOBAL KNOWLEDGE - Publishing House:
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131
United States. ISBN: 978-1-59973-743-0
Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0
(http://fs.unm.edu/NeutrosophicDuality.pdf).
ASIN : B0B4SJ8Y44 Publisher : Independently published (June 22, 2022) Language : English
Paperback : 115 pages ISBN-13 : 979-8837647598 Item Weight : 12.8 ounces Dimensions : 8.5
x 0.27 x 11 inches
ASIN : B0B46B4CXT Publisher : Independently published (June 22, 2022) Language : English
Hardcover : 115 pages ISBN-13 : 979-8837649981 Item Weight : 12.5 ounces Dimensions : 8.25
x 0.46 x 11 inches
GLOBAL KNOWLEDGE - Publishing House: http://fs.unm.edu/NeutrosophicDuality.pdf
UNM: http://fs.unm.edu/NeutrosophicDuality.pdf
Google Scholar: https://books.google.com/books?id=dWWkEAAAQBAJ
Paperback: https://www.amazon.com/dp/B0B4SJ8Y44
Hardcover: https://www.amazon.com/dp/B0B46B4CXT
2022 0043 | Neutrosophic Path-Coloring Amazon
9130
ASIN : B0B3F2BZC4 Publisher : Independently published (June 7, 2022) Language : English

Paperback : 161 pages ISBN-13 : 979-8834894469 Item Weight : 1.08 pounds Dimensions : 8.5
x 0.38 x 11 inches
ASIN : B0B3FGPGQ3 Publisher : Independently published (June 7, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0042 | Neutrosophic Density Amazon
ASIN : B0B19CDX7W Publisher : Independently published (May 15, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B0B14PLPGL Publisher : Independently published (May 15, 2022) Language :
: 8.25 x 0.53 x 11 inches
2022 0041 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Google Commerce Ltd
Publisher Infinite Study Seller Google Commerce Ltd Published on Apr 27, 2022 Pages
30 Features Original pages Best for web, tablet, phone, eReader Language English Genres
Antiques & Collectibles / Reference Content protection This content is DRM free GooglePlay
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Front Cover Henry
Garrett Infinite Study, 27 Apr 2022 - Antiques & Collectibles - 30 pages GoogleBooks
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”,
Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 893 10.5281/zenodo.6456413).
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
2022 0040 | Neutrosophic Connectivity Amazon
ASIN : B09YQJG2ZV Publisher : Independently published (April 26, 2022) Language :

: 8.5 x 0.29 x 11 inches
ASIN : B09YQJG2DZ Publisher : Independently published (April 26, 2022) Language :
: 8.25 x 0.48 x 11 inches
2022 0039 | Neutrosophic Cycles Amazon
ASIN : B09X4KVLQG Publisher : Independently published (April 8, 2022) Language

ASIN : B09X4LZ3HL Publisher : Independently published (April 8, 2022) Language : English
Hardcover : 169 pages ISBN-13 : 979-8449144157 Item Weight : 1.09 pounds Dimensions : 8.25
x 0.59 x 11 inches
2022 0038 | Girth in Neutrosophic Graphs Amazon
ASIN : B09WQ5PFV8 Publisher : Independently published (March 29, 2022) Language

ASIN : B09WQQGXPZ Publisher : Independently published (March 29, 2022) Language :
: 8.25 x 0.58 x 11 inches
2022 0037 | Matching Number in Neutrosophic Graphs Amazon
ASIN : B09W7FT8GM Publisher : Independently published (March 22, 2022) Language

ASIN : B09W4HF99L Publisher : Independently published (March 22, 2022) Language :
English Hardcover : 153 pages ISBN-13 : 979-8437539057 Item Weight : 1 pounds Dimensions
: 8.25 x 0.55 x 11 inches
9131
2022 0036 | Clique Number in Neutrosophic Graph Amazon
ASIN : B09TV82Q7T Publisher : Independently published (March 7, 2022) Language

ASIN : B09TZBPWJG Publisher : Independently published (March 7, 2022) Language :
: 8.25 x 0.56 x 11 inches
2022 0035 | Independence in Neutrosophic Graphs Amazon
ASIN : B09TF227GG Publisher : Independently published (February 27, 2022) Language :

English Paperback : 149 pages ISBN-13 : 979-8424231681 Item Weight : 1 pounds Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09TL1LSKD Publisher : Independently published (February 27, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0034 | Zero Forcing Number in Neutrosophic Graphs Amazon
ASIN : B09SW2YVKB Publisher : Independently published (February 18, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B09SWLK7BG Publisher : Independently published (February 18, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0033 | Neutrosophic Quasi-Order Amazon
ASIN : B09S3RXQ5C Publisher : Independently published (February 8, 2022) Language :

: 8.5 x 0.26 x 11 inches
ASIN : B09S232DQH Publisher : Independently published (February 8, 2022) Language :
: 8.25 x 0.43 x 11 inches
Jan 29, 2022 0032 | Beyond Neutrosophic Graphs E-

publishing&Amazon&Google
Scholar&UNM
[HG32b] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6320305).
Beyond Neutrosophic Graphs, E-publishing:
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States
ISBN 978-1-59973-725-6
Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
ASIN : B0BBCQJQG5 Publisher : Independently published (August 8, 2022) Language
ASIN : B0BBC4BJZ5 Publisher : Independently published (August 8, 2022) Language : English
Hardcover : 257 pages ISBN-13 : 979-8847567497 Item Weight : 1.61 pounds Dimensions : 8.25
x 0.8 x 11 inches
E-publishing: Educational Publisher: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
UNM: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
Google Scholar:https://books.google.com/books?id=cWWkEAAAQBAJ
Paperback: https://www.amazon.com/gp/product/B0BBCQJQG5
Hardcover: https://www.amazon.com/Beyond-Neutrosophic-Graphs-Henry-
Garrett/dp/B0BBC4BJZ5
2022 0031 | Neutrosophic Alliances Amazon

9132
ASIN : B09RB5XLVB Publisher : Independently published (January 26, 2022) Language :

: 8.5 x 0.21 x 11 inches
ASIN : B09R39MTSW Publisher : Independently published (January 26, 2022) Language :

: 8.25 x 0.4 x 11 inches
2022 0030 | Neutrosophic Hypergraphs Amazon
ASIN : B09PMBKVD4 Publisher : Independently published (January 7, 2022) Language :

: 8.5 x 0.19 x 11 inches
ASIN : B09PP8VZ3D Publisher : Independently published (January 7, 2022) Language :
: 8.25 x 0.38 x 11 inches
2022 0029 | Collections of Articles Amazon
-
ASIN : B09PHHDDQK Publisher : Independently published (January 2, 2022) Language :
: 8.25 x 1.47 x 11 inches
2022 0028 | Collections of Math Amazon
-
ASIN : B09PHBWT5D Publisher : Independently published (January 1, 2022) Language :
: 8.25 x 1.28 x 11 inches
2022 0027 | Collections of US Amazon
-
ASIN : B09PHBT924 Publisher : Independently published (December 31, 2021) Language :
: 8.25 x 0.81 x 11 inches
2021 0026 | Neutrosophic Chromatic Number Amazon
ASIN : B09NRD25MG Publisher : Independently published (December 20, 2021) Language

: English Paperback : 67 pages ISBN-13 : 979-8787858174 Item Weight : 8.2 ounces Dimensions
: 8.5 x 0.16 x 11 inches Language : English
-
2021 0025 | Simple Ideas Amazon
ASIN : B09MYTN6NT Publisher : Independently published (December 9, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0024 | Neutrosophic Graphs Amazon
ASIN : B09MYXVNF9 Publisher : Independently published (December 7, 2021) Language

: English Paperback : 55 pages ISBN-13 : 979-8780775652 Item Weight : 7 ounces Dimensions
: 8.5 x 0.13 x 11 inches
-
2021 0023 | List Amazon

9133
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0022 | Theorems Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0021 | Dimension Amazon
ASIN : B09K2BBQG7 Publisher : Independently published (October 25, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8753577146 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-
2021 0020 | Beyond The Graph Theory Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0019 | Located Heart And Memories Amazon
ASIN : B09F14PL8T Publisher : Independently published (August 31, 2021) Language :

8.5 x 0.14 x 11 inches
-
2021 0018 | Number Graphs And Numbers Amazon
ASIN : B099BQRSF8 Publisher : Independently published (July 14, 2021) Language : English
Paperback : 32 pages ISBN-13 : 979-8537474135 Item Weight : 4.8 ounces Dimensions : 8.5 x
0.08 x 11 inches
-
2021 0017 | First Place Is Reserved Amazon
ASIN : B098CWD5PT Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.13 x 11 inches
-
2021 0016 | Detail-oriented Groups And Ideas Amazon
ASIN : B098CYYG3Q Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.17 x 11 inches
-
2021 0015 | Definition And Its Necessities Amazon
ASIN : B098DHRJFD Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.19 x 11 inches
-
9134
2021 0014 | Words And Their Directionss Amazon
ASIN : B098CYS8G2 Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.16 x 11 inches
-
2021 0013 | Tattooed Heart But Forever Amazon
ASIN : B098CR8HM6 Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0012 | Metric Number In Dimension Amazon
ASIN : B0913597TV Publication date : March 24, 2021 Language : English File size : 28445
KB Text-to-Speech : Enabled Enhanced typesetting : Enabled X-Ray : Not Enabled Word
Wise : Not Enabled Print length : 48 pages Lending : Not Enabled Kindle
-
2021 0011 | Domination Theory And Beyond Amazon
ASIN : B098DMMZ87 Publisher : Independently published (June 30, 2021) Language

-
2021 0010 | Vital Glory Amazon
ASIN : B08PVNJYRM Publication date : December 6, 2020 Language : English File size
: 1544 KB Simultaneous device usage : Unlimited Text-to-Speech : Enabled Screen Reader :
Supported Enhanced typesetting : Enabled X-Ray : Not Enabled Word Wise : Enabled Print
length : 24 pages Lending : Enabled Kindle
-
2021 0009 | Análisis de modelos y orientación más allá AmazonUK&MoreBooks
Análisis de modelos y orientación más allá Planteamiento y problemas en dos modelos

Ediciones Nuestro Conocimiento (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59902-
2 ISBN-10:6203599026EAN:9786203599022Book language:Blurb/Shorttext:El enfoque para la
resolución de problemas es una selección obvia para hacer la investigación y el análisis de la
situación que puede provocar las perspectivas vagas que queremos no ser para extraer ideas
creativas y nuevas que queremos ser. Estudio simultáneamente dos modelos. Este estudio se
basa tanto en la investigación como en la discusión que el autor piensa que puede ser útil
para entender y hacer crecer nuestra fantası́a y la realidad juntas.Publishing house: Ediciones
Nuestro Conocimiento Website: https://sciencia-scripts.com By (author) : Henry Garrett
Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Dos modelos, optimización de rutas y transporte, Two Models, Optimizing Routes
and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/análisis-de-modelos-y-orientación-más-
allá/isbn/978-620-3-59902-2
Product details Publisher : Ediciones Nuestro Conocimiento (6 April 2021) Language :
Spanish ISBN-10 : 6203599026 ISBN-13 : 978-6203599022 Dimensions : 15 x 0.4 x 22 cm
Paperback:
https://www.amazon.co.uk/Análisis-modelos-orientación-allá-Planteamiento/dp/6203599026
2021 0008 | Анализ моделей и руководство за пределами Amazon&MoreBooks

9135
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях Sciencia Scripts (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59908-4 ISBN-
10:6203599085EAN:9786203599084Book language: Russian Blurb/Shorttext:Подход к реше-
нию проблем является очевидным выбором для проведения исследований и анализа си-
туации, которая может вызвать смутные перспективы, которыми мы не хотим быть для
извлечения творческих и новых идей, которыми мы хотим быть. Я одновременно изучаю
две модели. Это исследование основано как на исследовании, так и на обсуждении, кото-
рое, по мнению автора, может быть полезным для понимания и развития наших фантазий
и реальности вместе.Publishing house: Sciencia Scripts Website: https://sciencia-scripts.com
By (author) : Генри Гарретт Number of pages:68Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Две модели, оптимизация маршрутов и
транспорта, Two Models, Optimizing Routes and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/анализ-моделей-и-руководство-за-
пределами/isbn/978-620-3-59908-4
Анализ моделей и руководство за пределами: Подход и проблемы в двух моделях

(Russian Edition) Publisher : Sciencia Scripts (April 6, 2021) Language : Russian Paperback :
68 pages ISBN-10 : 6203599085 ISBN-13 : 978-6203599084 Item Weight : 5.3 ounces Dimensions
: 5.91 x 0.16 x 8.66 inches
2021 0007 | Análise e Orientação de Modelos Além Amazon | MoreBooks |

Walmart
Análise e Orientação de Modelos Além Abordagem e Problemas em Dois Modelos Edições
Nosso Conhecimento (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59907-7 ISBN-
10:6203599077EAN:9786203599077Book language:Blurb/Shorttext:A abordagem para resolver
problemas é uma seleção óbvia para fazer pesquisa e análise da situação, que pode trazer
as perspectivas vagas que queremos não ser para extrair idéias criativas e novas idéias que
queremos ser. Eu estudo simultaneamente dois modelos. Este estudo é baseado tanto na
pesquisa como na discussão que o autor pensa que pode ser útil para compreender e fazer crescer
juntos a nossa fantasia e realidade.Publishing house: Edições Nosso Conhecimento Website:
https://sciencia-scripts.com By (author) : Henry Garrett Number of pages:64Published
on:2021-04-06Stock:Available Category: Mathematics Price:39.90 Keywords:Dois Modelos,
Otimização de Rotas e Transporte, Two Models, Optimizing Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/análise-e-orientação-de-modelos-
além/isbn/978-620-3-59907-7
Henry Garrett Análise e Orientação de Modelos Além (Paperback) About this item
Product details
A abordagem para resolver problemas é uma seleção óbvia para fazer pesquisa e análise da
situação, que pode trazer as perspectivas vagas que queremos não ser para extrair idéias
criativas e novas idéias que queremos ser. Eu estudo simultaneamente dois modelos. Este
estudo é baseado tanto na pesquisa como na discussão que o autor pensa que pode ser útil
para compreender e fazer crescer juntos a nossa fantasia e realidade. Análise e Orientação de
Modelos Além (Paperback) We aim to show you accurate product information. Manufacturers,
suppliers and others provide what you see here, and we have not verified it. See our disclaimer
Specifications
Language Portuguese Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 64 Author Henry Garrett Title Análise e Orientação de Modelos Além ISBN-13
9786203599077 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599077 Walmart
Análise e Orientação de Modelos Além: Abordagem e Problemas em Dois Modelos

(Portuguese Edition) Publisher : Edições Nosso Conhecimento (April 6, 2021) Language :
Portuguese Paperback : 64 pages ISBN-10 : 6203599077 ISBN-13 : 978-6203599077 Item Weight
: 3.67 ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0006 | Analizy modelowe i wytyczne wykraczaja˛ce poza Amazon&MoreBooks

9136
Analizy modelowe i wytyczne wykraczaja˛ce poza Podejście i problemy w dwóch
modelach Wydawnictwo Nasza Wiedza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-
59906-0 ISBN-10:6203599069EAN:9786203599060Book language:Blurb/Shorttext:Podejście do
rozwia˛zywania problemów jest oczywistym wyborem do prowadzenia badań i analizowania
sytuacji, które moga˛ wywo lywać niejasne perspektywy, których nie chcemy dla wydobycia
kreatywnych i nowych pomys lów, które chcemy. I jednocześnie studiować dwa modele.
Badanie to oparte jest zarówno na badaniach jak i dyskusji, które zdaniem autora moga˛
być przydatne do zrozumienia i rozwoju naszych fantazji i rzeczywistości razem.Publishing
house: Wydawnictwo Nasza Wiedza Website: https://sciencia-scripts.com By (author) : Henry
Garrett Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics
Price:39.90 Keywords:Dwa modele, optymalizacja tras i transportu, Two Models, Optimizing
Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/analizy-modelowe-i-wytyczne-wykraczaja˛ce-
poza/isbn/978-620-3-59906-0
Analizy modelowe i wytyczne wykraczaja˛ce poza: Podejście i problemy w dwóch modelach
(Polish Edition) Publisher : Wydawnictwo Nasza Wiedza (April 6, 2021) Language : Polish
Paperback : 64 pages ISBN-10 : 6203599069 ISBN-13 : 978-6203599060 Item Weight : 3.67
ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0005 | Modelanalyses en begeleiding daarna Amazon&MoreBooks
Modelanalyses en begeleiding daarna Aanpak en problemen in twee modellen

Uitgeverij Onze Kennis (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59905-3
ISBN-10:6203599050EAN:9786203599053Book language:Blurb/Shorttext:De aanpak voor het
oplossen van problemen is een voor de hand liggende keuze voor het doen van onderzoek en het
analyseren van de situatie die de vage perspectieven kan oproepen die we niet willen zijn voor
het extraheren van creatieve en nieuwe ideeën die we willen zijn. Ik bestudeer tegelijkertijd twee
modellen. Deze studie is gebaseerd op zowel onderzoek als discussie waarvan de auteur denkt dat
ze nuttig kunnen zijn voor het begrijpen en laten groeien van onze fantasieën en de werkelijkheid
samen.Publishing house: Uitgeverij Onze Kennis Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Twee modellen, optimalisering van routes en transport,
Two Models, Optimizing Routes and Transportation
MoreBooks
Modelanalyses en begeleiding daarna: Aanpak en problemen in twee modellen (Dutch
Edition) Publisher : Uitgeverij Onze Kennis (April 6, 2021) Language : Dutch Paperback : 64
pages ISBN-10 : 6203599050 ISBN-13 : 978-6203599053 Item Weight : 3.99 ounces Dimensions
: 5.91 x 0.15 x 8.66 inches
2021 0004 | Analisi dei modelli e guida oltre Amazon | MoreBooks |

Walmart
9137
Analisi dei modelli e guida oltre Approccio e problemi in due modelli Edizioni
Sapienza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59904-6 ISBN-
10:6203599042EAN:9786203599046Book language:Blurb/Shorttext:L’approccio per risolvere
i problemi è una selezione ovvia per fare ricerca e analisi della situazione che può suscitare
le prospettive vaghe che non vogliamo essere per estrarre idee creative e nuove che vogliamo
essere. Studio contemporaneamente due modelli. Questo studio si basa sia sulla ricerca che
sulla discussione che l’autore pensa possa essere utile per capire e far crescere insieme la nostra
fantasia e la realtà.Publishing house: Edizioni Sapienza Website: https://sciencia-scripts.com
By (author) : Henry Garrett Number of pages:60Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Due modelli, ottimizzazione dei percorsi e del
trasporto, Two Models, Optimizing Routes and Transportation
MoreBooks Henry Garrett Analisi dei modelli e guida oltre (Paperback) About this item
Product details
L’approccio per risolvere i problemi è una selezione ovvia per fare ricerca e analisi della
situazione che può suscitare le prospettive vaghe che non vogliamo essere per estrarre idee
creative e nuove che vogliamo essere. Studio contemporaneamente due modelli. Questo studio
si basa sia sulla ricerca che sulla discussione che l’autore pensa possa essere utile per capire e far
crescere insieme la nostra fantasia e la realtà. Analisi dei modelli e guida oltre (Paperback) We
aim to show you accurate product information. Manufacturers, suppliers and others provide
what you see here, and we have not verified it. See our disclaimer Specifications
Publisher KS Omniscriptum Publishing Book Format Paperback Number of Pages 60 Author
Henry Garrett Title Analisi dei modelli e guida oltre ISBN-13 9786203599046 Publication Date
April, 2021 Assembled Product Dimensions (L x W x H) 9.00 x 6.00 x 1.50 Inches ISBN-10
6203599042 Walmart
Analisi dei modelli e guida oltre: Approccio e problemi in due modelli (Italian Edition)
Publisher : Edizioni Sapienza (April 6, 2021) Language : Italian Paperback : 60 pages ISBN-10
: 6203599042 ISBN-13 : 978-6203599046 Item Weight : 3.53 ounces Dimensions : 5.91 x 0.14 x
8.66 inches
2021 0003 | Analyses de modèles et orientations au-delà Amazon | MoreBooks |

Walmart
Analyses de modèles et orientations au-delà Approche et problèmes dans deux
modèles Editions Notre Savoir (2021-04-06 ) eligible for voucher eligible for voucher
ISBN-13: 978-620-3-59903-9 ISBN-10:6203599034EAN:9786203599039Book language: French
Blurb/Shorttext:L’approche pour résoudre les problèmes est une sélection évidente pour faire
la recherche et l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne
voulons pas être pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie
simultanément deux modèles. Cette étude est basée à la fois sur la recherche et la discussion,
ce qui, selon l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité
ensemble.Publishing house: Editions Notre Savoir Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Two Models, Optimizing Routes and Transportation, Deux
modèles, optimisation des itinéraires et des transports
MoreBooks:
https://www.morebooks.shop/store/gb/book/analyses-de-modèles-et-orientations-au-
delà/isbn/978-620-3-59903-9
Henry Garrett Analyses de modèles et orientations au-delà (Paperback) About this item
Product details
L’approche pour résoudre les problèmes est une sélection évidente pour faire la recherche et
l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne voulons pas être
pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie simultanément
deux modèles. Cette étude est basée à la fois sur la recherche et la discussion, ce qui, selon
l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité ensemble.
Analyses de modèles et orientations au-delà (Paperback) We aim to show you accurate product
information. Manufacturers, suppliers and others provide what you see here, and we have not
verified it. See our disclaimer Specifications
Language French Publisher KS Omniscriptum Publishing Book Format Paperback Number of
Pages 64 Author Henry Garrett Title Analyses de modèles et orientations au-delà ISBN-13
9786203599039 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599034 Walmart
Analyses de modèles et orientations au-delà: Approche et problèmes dans deux modèles

(French Edition) Publisher : Editions Notre Savoir (April 6, 2021) Language : French Paperback
: 64 pages ISBN-10 : 6203599034 ISBN-13 : 978-6203599039 Item Weight : 3.67 ounces
Dimensions : 5.91 x 0.15 x 8.66 inches
9138
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |
Walmart | eBay
eligible for voucher ISBN-13: 978-620-3-59901-5 ISBN-
10:6203599018EAN:9786203599015Book language: German Blurb/Shorttext:Die
Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann.Publishing house: Verlag
Unser Wissen Website: https://sciencia-scripts.com By (author) : Henry Garrett Number
of pages:68Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Zwei Modelle, Optimierung von Routen und Transport, Two Models, Optimizing
Routes and Transportation
MoreBooksHenry Garrett Modell-Analysen und Anleitungen darüber hinaus (Paperback)
About this item
Product details
Die Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann. Modell-Analysen und
Anleitungen darüber hinaus (Paperback) We aim to show you accurate product information.
Manufacturers, suppliers and others provide what you see here, and we have not verified it.
See our disclaimer Specifications
Language German Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 68 Author Henry Garrett Title Modell-Analysen und Anleitungen darüber hinaus
ISBN-13 9786203599015 Publication Date April, 2021 Assembled Product Dimensions (L x W
x H) 9.00 x 6.00 x 1.50 Inches ISBN-10 6203599018
Walmart
Seller assumes all responsibility for this listing. Item specifics Condition: New: A new, unread,
unused book in perfect condition with no missing or damaged pages. See the ... Read
moreabout the condition ISBN: 9786203599015 EAN: 9786203599015 Publication Year: 2021
Type: Textbook Format: Paperback Language: German Publication Name: Modell-Analysen
Und Anleitungen Daruber Hinaus Item Height: 229mm Author: Henry Garrett Publisher:
Verlag Unser Wissen Item Width: 152mm Subject: Mathematics Item Weight: 113g Number of
Pages: 68 Pages About this product Product Information Die Herangehensweise zur Loesung
von Problemen ist eine offensichtliche Auswahl fur die Forschung und Analyse der Situation, die
die vagen Perspektiven, die wir nicht sein wollen, fur die Extraktion von kreativen und neuen
Ideen, die wir sein wollen, hervorbringen kann. Ich studiere gleichzeitig zwei Modelle. Diese
Studie basiert sowohl auf der Forschung als auch auf der Diskussion, von der der Autor denkt,
dass sie fur das Verstandnis und das Zusammenwachsen unserer Fantasie und Realitat nutzlich
sein kann. Product Identifiers Publisher Verlag Unser Wissen ISBN-13 9786203599015 eBay
Product ID (ePID) 11049032082 Product Key Features Publication Name Modell-Analysen
Und Anleitungen Daruber Hinaus Format Paperback Language German Subject Mathematics
Publication Year 2021 Type Textbook Author Henry Garrett Number of Pages 68 Pages
Dimensions Item Height 229mm Item Width 152mm Item Weight 113g Additional Product
Features Title
A uthorHenryGarrett
eBay
Modell-Analysen und Anleitungen darüber hinaus: Ansatz und Probleme in zwei Modellen
(German Edition) Publisher : Verlag Unser Wissen (April 6, 2021) Language : German
Paperback : 68 pages ISBN-10 : 6203599018 ISBN-13 : 978-6203599015 Item Weight : 3.99
ounces Dimensions : 5.91 x 0.16 x 8.66 inches Paperback
2021 0001 | Model Analyses and Guidance Beyond Amazon&MoreBooks

9139
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
9140
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
...
9141
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/
9142
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
9143

Hamiltonian-Cycle-Decomposition in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Hamiltonian-Cycle-Decomposition in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Hamiltonian-Cycle-

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 41

6 New Ideas On Super Decompensation By Hyper Decompress Of

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 59

10 Extreme SuperHyperHamiltonian-Cycle-Decomposition But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 135

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 143

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 241

25 Neutrosophic Hamiltonian-Cycle-Decomposition 245

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

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

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 335

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 343

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 441

45 “SuperHyperGraph-Based Books”: | Featured Tweets 449

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

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