Hamiltonian-Type-Cycle-Decomposition in SuperHyperGraph

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

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

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

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

sions 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-Type-Cycle-Decomposition 245
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decom-
press 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-Type-Cycle-Decomposition But As The

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

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

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

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

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

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

SuperHyperHamiltonian-Type-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-Type-Cycle-Decomposition in the Example (42.0.5) . . . . . . . . . 114
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition in the Example (42.0.11) . . . . 119
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition in the Extreme Example (42.0.15) 122
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-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-Type-Cycle-Decomposition in the Neutrosophic
Example (42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
Example (42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278
Example (42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
Example (42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 279
Example (42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280


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


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

31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of Neut-
rosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Neutrosophic Example
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 316
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of Neut-
rosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Neutrosophic Example
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 317
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Example
(42.0.11) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 319
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic No-
tions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutro-
sophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). . . . . . 444
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). . . . . . . . 446

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

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

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

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

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

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

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

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

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

on Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutro- 4
sophic) notions, namely, Extreme Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 5
and Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs. With sci- 6
entific research on the basic scientific research properties, the scientific research book starts 7
to make Extreme Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs theory and 8
Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs theory more 9

(Extremely/Neutrosophicly) understandable. 10
11
In the some chapters, in some researches, new setting is introduced for new SuperHy- 12
perNotions, namely, a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs and 13
Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . Two different 14
types of SuperHyperDefinitions are debut for them but the scientific research goes further 15
and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 16
well-defined and well-reviewed. The literature review is implemented in the whole of this research. 17
For shining the elegancy and the significancy of this research, the comparison between this 18
SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 19
featured. The definitions are followed by the examples and the instances thus the clarifications 20
are driven with different tools. The applications are figured out to make sense about the 21
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under scientific 22
research to figure out the challenges make sense about ongoing and upcoming research. The 23
special case is up. The cells are viewed in the deemed ways. There are different types of 24
them. Some of them are individuals and some of them are well-modeled by the group of 25
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 26
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 27

SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s Recognition”. 28
Thus these complex and dense SuperHyperModels open up some avenues to scientific research 29
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 30
research. It’s also officially collected in the form of some questions and some problems. Assume 31
a SuperHyperGraph. Then δ−Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 32
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 33
1
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 34

there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 35
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S is an 36
δ−SuperHyperDefensive; a Neutrosophic δ−Hamiltonian-Type-Cycle-Decomposition In Super- 37
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 38
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 39
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 40
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 41
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 42
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Hamiltonian-Type- 43
Cycle-Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make 44
a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs more understandable. For the 45
sake of having Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, 46

there’s a need to “redefine” the notion of a “Hamiltonian-Type-Cycle-Decomposition In SuperHy- 47
perGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from 48
the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign 49
to the values. Assume a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . It’s 50
redefined a Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs if the 51
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 52
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 53
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 54
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 55
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, 56
“The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 57
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 58
based on a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . It’s the main. It’ll 59
be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 60
If there’s a need to have all Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 61
until the Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, then it’s officially 62
called a “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs” but otherwise, it isn’t 63
a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . There are some instances 64

about the clarifications for the main definition titled a “Hamiltonian-Type-Cycle-Decomposition 65
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 66
are characterized in the disciplinary ways of the SuperHyperClass based on a Hamiltonian- 67
Type-Cycle-Decomposition In SuperHyperGraphs . For the sake of having a Neutrosophic 68
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, there’s a need to “redefine” 69

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

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

SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 80

holds. Thus SuperHyperPath, Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, 81
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 82
“Neutrosophic SuperHyperPath”, “Neutrosophic Hamiltonian-Type-Cycle-Decomposition In 83
SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 84
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 85
Table holds. A SuperHyperGraph has a “Neutrosophic Hamiltonian-Type-Cycle-Decomposition 86

In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all the 87
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs amid the maximum value amid 88
all SuperHyperVertices from a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs .] 89
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . A graph is a SuperHyperUni- 90
form if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 91
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 92

SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 93
with two exceptions; it’s Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs if it’s 94
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 95
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 96
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 97
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 98
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 100
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 101
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 102
the specific designs and the specific architectures. The SuperHyperModel is officially called 103
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 104

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

The aim is to find either the longest Hamiltonian-Type-Cycle-Decomposition In SuperHyper- 122
Graphs or the strongest Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs in those 123
Neutrosophic SuperHyperModels. For the longest Hamiltonian-Type-Cycle-Decomposition In 124
SuperHyperGraphs, called Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, and 125

the strongest Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, called Neutro- 126

sophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, some general results 127
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 128
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 129
to form any style of a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs. There 130
isn’t any formation of any Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs but 131
literarily, it’s the deformation of any Hamiltonian-Type-Cycle-Decomposition In SuperHyper- 132

Graphs. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph 133
theory and Neutrosophic SuperHyperGraph theory are proposed. 134
Keywords: SuperHyperGraph, (Neutrosophic) Hamiltonian-Type-Cycle-Decomposition In 135
SuperHyperGraphs, Cancer’s Recognition 136

AMS Subject Classification: 05C17, 05C22, 05E45 137
138
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 139
Notion, namely, Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . 140

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

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

In SuperHyperGraphs” is a maximal Neutrosophic Hamiltonian-Type-Cycle-Decomposition In 165
SuperHyperGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that 166
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeigh- 167
bors of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 168
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 169
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 170

δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Hamiltonian-Type- 171

Cycle-Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to 172
make Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs more understandable. For 173
the sake of having Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, 174
there’s a need to “redefine” the notion of “Hamiltonian-Type-Cycle-Decomposition In SuperHy- 175
perGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 176
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 177
assign to the values. Assume a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . 178
It’s redefined Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs if the 179
based on Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . It’s the main. It’ll 187
be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. 188
If there’s a need to have all Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 189

until the Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, then it’s officially 190
called “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs” but otherwise, it isn’t 191
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs . There are some instances 192
about the clarifications for the main definition titled “Hamiltonian-Type-Cycle-Decomposition 193
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 194
are characterized in the disciplinary ways of the SuperHyperClass based on Hamiltonian- 195
Type-Cycle-Decomposition In SuperHyperGraphs . For the sake of having Neutrosophic 196
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, there’s a need to “redefine” 197
the notion of “Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs” 198
and “Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs ”. The 199
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 200
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 201
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 202
the intended Table holds. And Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 203
are redefined “Neutrosophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs” if 204
the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 205
Since there’s more ways to get Neutrosophic type-results to make Neutrosophic Hamiltonian- 206
Type-Cycle-Decomposition In SuperHyperGraphs more understandable. Assume a Neutrosophic 207
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 208
holds. Thus SuperHyperPath, Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, 209
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 210
“Neutrosophic SuperHyperPath”, “Neutrosophic Hamiltonian-Type-Cycle-Decomposition In 211
SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 212

“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 213
Table holds. A SuperHyperGraph has “Neutrosophic Hamiltonian-Type-Cycle-Decomposition 214
In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 215
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs amid the maximum value amid 216

all SuperHyperVertices from a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs .] 217

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

SuperHyperGraphs, called Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, and 253
the strongest Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, called Neutro- 254
sophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs, some general results 255
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 256
to form any style of a Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs. There 258

isn’t any formation of any Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs but 259
literarily, it’s the deformation of any Hamiltonian-Type-Cycle-Decomposition In SuperHyper- 260
Graphs. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph 261
theory and Neutrosophic SuperHyperGraph theory are proposed. 262

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Hamiltonian-Type-Cycle- 263
Decomposition In SuperHyperGraphs, Cancer’s Neutrosophic Recognition 264

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

33131 United States. This research book presents different types of notions SuperHyperResolving 286
and Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs in the setting of duality in 287

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




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

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

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

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

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

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

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

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

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

HG236; HG237; HG238; HG239; HG240], there are some endeavors to formalize the basic 430
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 431

scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 432
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 433
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 436
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 437

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

HG240] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 479

HG152b; HG153b; HG154b; HG155b; HG156b]. Two popular scientific research books 490
in Scribd in the terms of high readers, 4216 and 5214 respectively, on neutrosophic science is on 491
[HG32b; HG44b]. 492

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 565
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 566
(doi: 10.20944/preprints202212.0549.v1). 567
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 568
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 569
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 570
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 571
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 572
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 573
(doi: 10.20944/preprints202212.0500.v1). 574
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 575
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 576
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 578
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 579
HG240 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 581
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 582
2023, (doi: 10.5281/zenodo.7809365). 583
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 585
2023, (doi: 10.5281/zenodo.7809358). 586
HG238 [27] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 587
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 588

10.5281/zenodo.7809219). 589
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 591
10.5281/zenodo.7809328). 592
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 594
2023, (doi: 10.5281/zenodo.7806767). 595
HG235 [30] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 596
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 597
2023, (doi: 10.5281/zenodo.7806838). 598

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 600
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 601
HG233 [32] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 602
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 603
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 604
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 606
(doi: 10.5281/zenodo.7799902). 607
HG231 [34] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 608
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 609
2023, (doi: 10.5281/zenodo.7804218). 610
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 612
(doi: 10.5281/zenodo.7796334). 613
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 615
Zenodo 2023, (doi: 10.5281/zenodo.7793372). 616
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 618
10.5281/zenodo.7791952). 619
HG225 [38] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 620
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 621
(doi: 10.5281/zenodo.7791982). 622
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 624
10.5281/zenodo.7790026). 625
HG223 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 626
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 627
2023, (doi: 10.5281/zenodo.7790052). 628
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 630
2023, (doi: 10.5281/zenodo.7787066). 631
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 633
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 634
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 636
10.5281/zenodo.7781476). 637

HG219 [44] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 638
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 639
10.5281/zenodo.7783082). 640
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 642
10.5281/zenodo.7777857). 643
HG217 [46] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 644
10.5281/zenodo.7779286). 646
HG215 [47] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 647
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 648
(doi: 10.5281/zenodo.7771831). 649
HG214 [48] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 650
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 651
2023, (doi: 10.5281/zenodo.7772468). 652
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 654
10.13140/RG.2.2.20913.25446). 655
HG212 [50] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 656
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 657
10.5281/zenodo.7764916). 658
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 660
10.13140/RG.2.2.11770.98247). 661
HG210 [52] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 662
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 663
10.13140/RG.2.2.12400.12808). 664
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 666
2023, (doi: 10.13140/RG.2.2.22545.10089). 667
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 669
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 670
HG207 [55] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 671
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 672
10.13140/RG.2.2.11377.76644). 673
HG206 [56] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 674
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 675
10.13140/RG.2.2.23750.96329). 676

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 678
10.13140/RG.2.2.31366.24641). 679
HG204 [58] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 680
10.13140/RG.2.2.34721.68960). 682
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 684
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 687
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 690
10.13140/RG.2.2.24288.35842). 691
HG200 [62] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 692
10.13140/RG.2.2.32467.25124). 694
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 696
10.13140/RG.2.2.31025.45925). 697
HG198 [64] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 698
10.13140/RG.2.2.17184.25602). 700
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.23423.28327). 703
HG196 [66] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 704
10.13140/RG.2.2.28456.44805). 706
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 708
10.13140/RG.2.2.23525.68320). 709
HG194 [68] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 710
10.13140/RG.2.2.20170.24000). 712
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 714
10.13140/RG.2.2.36475.59683). 715

HG192 [70] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 716
10.13140/RG.2.2.29764.71046). 718
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 720
2023, (doi: 10.13140/RG.2.2.18780.87683). 721
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 723
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.26134.01603). 727
HG188 [74] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 728
10.13140/RG.2.2.27392.30721). 730
HG187 [75] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 731
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.33028.40321). 733
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 735
10.13140/RG.2.2.21389.20966). 736
HG185 [77] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 737
10.13140/RG.2.2.16356.04489). 739
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 741
10.13140/RG.2.2.21756.21129). 742
HG183 [79] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 743
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.30983.68009). 745
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 747
10.13140/RG.2.2.28552.29445). 748
HG181 [81] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 749
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 750
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 751
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 753
10.13140/RG.2.2.35105.89447). 754

HG179 [83] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 755
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 756
(doi: 10.13140/RG.2.2.30072.72960). 757
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 759
10.13140/RG.2.2.31147.52003). 760
HG177 [85] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 761
10.13140/RG.2.2.32825.24163). 763
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 765
10.13140/RG.2.2.13059.58401). 766
HG175 [87] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 767
10.13140/RG.2.2.11172.14720). 769
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 771
2023, (doi: 10.13140/RG.2.2.22011.80165). 772
HG173 [89] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 773
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 774
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 775
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 777
HG171 [91] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 779
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 781
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 783
2023, (doi: 10.13140/RG.2.2.19944.14086). 784
HG169 [93] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 785
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 787
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 789
(doi: 10.13140/RG.2.2.33103.76968). 790
HG167 [95] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 791
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 792
2023, (doi: 10.13140/RG.2.2.23037.44003). 793

By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 795
(doi: 10.13140/RG.2.2.35646.56641). 796
HG165 [97] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 797
(doi: 10.13140/RG.2.2.18030.48967). 799
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 801
(doi: 10.13140/RG.2.2.13973.81121). 802
HG163 [99] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 803
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 804
2023, (doi: 10.13140/RG.2.2.34106.47047). 805
HG162 [100] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 806
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 807
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 810
2023, (doi: 10.13140/RG.2.2.31956.88961). 811
HG160 [102] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 812
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 813
2023, (doi: 10.13140/RG.2.2.15179.67361). 814
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 816
10.13140/RG.2.2.21510.45125). 817
HG158 [104] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 818
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 819
2023, (doi: 10.13140/RG.2.2.13121.84321). 820
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 822
10.13140/RG.2.2.11758.69441). 823
HG156 [106] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 824
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 825
2023, (doi: 10.13140/RG.2.2.31891.35367). 826
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 828
10.13140/RG.2.2.19360.87048). 829
HG154 [108] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 830
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 831
2023, (doi: 10.13140/RG.2.2.32363.21286). 832

HG153 [109] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 833
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 834
(doi: 10.13140/RG.2.2.23266.81602). 835
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 837
10.13140/RG.2.2.19911.37285). 838
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 840
10.13140/RG.2.2.11050.90569). 841
HG150 [112] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 842
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 843
HG149 [113] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 845
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 846
HG148 [114] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 848
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 849
HG147 [115] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 851
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 852
(doi: 10.13140/RG.2.2.30182.50241). 853
HG146 [116] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 854
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 855
HG145 [117] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 857
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 858
HG144 [118] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 860
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 861
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 862
HG143 [119] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 863
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 864
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 865
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 868
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 871

HG140 [122] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 872
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 873
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 874
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 877
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 880
HG137 [125] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 881
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 882
HG136 [126] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 884
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 885
2023, (doi: 10.13140/RG.2.2.17252.24968). 886
HG135 [127] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 887
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 888
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 889
HG134 [128] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 890
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 891
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 892
HG132 [129] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 893
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 894
2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 895
HG131 [130] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 896
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 897
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 898
HG130 [131] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 899
Recognition in The Confrontation With Super Attacks In Hyper Situations By 900

Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 901
Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 902
HG129 [132] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 903

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

HG128 [133] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 907
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 908
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 909

HG127 [134] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 910
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 911
2023,(doi: 10.13140/RG.2.2.36745.93289). 912
HG126 [135] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 913
HG125 [136] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 916

10.20944/preprints202301.0282.v1). 919
HG124 [137] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 920
10.20944/preprints202301.0267.v1).). 922
HG123 [138] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 923
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 924
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 925

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 926
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 927
HG122 [139] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 928
prints202301.0262.v1). 931
HG121 [140] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 932
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 933

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 939
10.13140/RG.2.2.35061.65767). 940
HG25 [143] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 941
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 942
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 943
10.13140/RG.2.2.18494.15680). 944
HG26 [144] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 945
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 946
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 947
10.13140/RG.2.2.32530.73922). 948

HG27 [145] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 949
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 950
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 951
10.13140/RG.2.2.15897.70243). 952
10.13140/RG.2.2.32530.73922). 956
prints202301.0105.v1). 959
HG28 [148] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 960
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 961
HG29 [149] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 963
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 964
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 965

10.13140/RG.2.2.23172.19849). 966
HG30 [152] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 973
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 974
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 975
10.13140/RG.2.2.17385.36968). 976
HG107 [153] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 977
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 978
Beyond”, Preprints 2023, 2023010044 979
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 981
(doi: 10.20944/preprints202301.0043.v1). 982
HG31 [155] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 983
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 984
2023, (doi: 10.13140/RG.2.2.28945.92007). 985

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 990
10.13140/RG.2.2.35774.77123). 991

HG35 [159] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 995
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 996
10.13140/RG.2.2.29430.88642). 997
(doi: 10.20944/preprints202212.0549.v1). 1003
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1005

10.13140/RG.2.2.19380.94084). 1006
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 1010
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1014
(doi: 10.20944/preprints202212.0500.v1). 1017
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1019
10.13140/RG.2.2.20993.12640). 1020
HG952 [167] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1021
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1022

SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treat- 1025
ments”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1026

HG942 [169] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1027

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1028
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1029
HG94 [170] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1030
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1031
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1032
HG37 [171] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1033
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1034
10.13140/RG.2.2.29173.86244). 1035
HG38 [172] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1036
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1037
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1038
HG156b [173] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1039
2023 (doi: 10.5281/zenodo.7807782). 1040
HG155b [174] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1041
2023 (doi: 10.5281/zenodo.7804449). 1042
HG154b [175] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1043

Garrett, 2023 (doi: 10.5281/zenodo.7793875). 1044
HG153b [176] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1045
(doi: 10.5281/zenodo.7792307). 1046
HG152b [177] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1047
(doi: 10.5281/zenodo.7790728). 1048
HG151b [178] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1049
2023 (doi: 10.5281/zenodo.7787712). 1050
HG150b [179] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1051
10.5281/zenodo.7783791). 1052
HG149b [180] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1053
10.5281/zenodo.7780123). 1054
HG148b [181] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1055
(doi: 10.5281/zenodo.7773119). 1056
HG147b [182] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1057
odo.7637762). 1058
HG146b [183] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1059
10.5281/zenodo.7766174). 1060
HG145b [184] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1061
10.5281/zenodo.7762232). 1062

HG144b [185] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1063
(doi: 10.5281/zenodo.7758601). 1064
HG143b [186] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1065
10.5281/zenodo.7754661). 1066
HG142b [187] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1067
10.5281/zenodo.7750995) . 1068
HG141b [188] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1069
(doi: 10.5281/zenodo.7749875). 1070
HG140b [189] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1071
10.5281/zenodo.7747236). 1072
HG139b [190] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1073
10.5281/zenodo.7742587). 1074
HG138b [191] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1075
(doi: 10.5281/zenodo.7738635). 1076
HG137b [192] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1077
10.5281/zenodo.7734719). 1078
HG136b [193] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1079
10.5281/zenodo.7730484). 1080
HG135b [194] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1081
(doi: 10.5281/zenodo.7730469). 1082
HG134b [195] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1083
10.5281/zenodo.7722865). 1084
HG133b [196] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1085
odo.7713563). 1086
odo.7709116). 1088
HG131b [198] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1089
10.5281/zenodo.7706415). 1090
HG130b [199] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1091
(doi: 10.5281/zenodo.7706063). 1092
HG129b [200] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1093
(doi: 10.5281/zenodo.7701906). 1094
HG128b [201] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1095
odo.7700205). 1096
HG127b [202] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1097
10.5281/zenodo.7694876). 1098

HG126b [203] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1099
10.5281/zenodo.7679410). 1100
HG125b [204] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1101
10.5281/zenodo.7675982). 1102
HG124b [205] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1103
10.5281/zenodo.7672388). 1104
HG123b [206] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1105
odo.7668648). 1106
HG122b [207] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1107
10.5281/zenodo.7662810). 1108
HG121b [208] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1109
10.5281/zenodo.7659162). 1110
HG120b [209] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1111
odo.7653233). 1112
HG119b [210] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1113
odo.7653204). 1114
HG118b [211] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1115
odo.7653142). 1116
HG117b [212] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1117
odo.7653117). 1118
HG116b [213] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1119
odo.7653089). 1120
HG115b [214] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1121
odo.7651687). 1122
HG114b [215] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1123
odo.7651619). 1124
HG113b [216] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1125
odo.7651439). 1126
HG112b [217] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1127
odo.7650729). 1128
HG111b [218] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1129
odo.7647868). 1130
HG110b [219] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1131
odo.7647017). 1132
HG109b [220] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1133
odo.7644894). 1134

HG108b [221] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1135
odo.7641880). 1136
HG107b [222] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1137
odo.7632923). 1138
HG106b [223] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1139
odo.7623459). 1140
HG105b [224] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7606416). 1142
HG104b [225] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7606416). 1144
HG103b [226] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1145
odo.7606404). 1146
HG102b [227] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1147
10.5281/zenodo.7580018). 1148
HG101b [228] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1149
odo.7580018). 1150
odo.7580018). 1152
odo.7579929). 1154
HG98b [231] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1155
10.5281/zenodo.7563170). 1156
HG97b [232] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1157
odo.7563164). 1158
HG96b [233] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1159
odo.7563160). 1160
odo.7563160). 1162
HG94b [235] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1163
10.5281/zenodo.7563160). 1164
HG93b [236] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1165
10.5281/zenodo.7557063). 1166
HG92b [237] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1167
10.5281/zenodo.7557009). 1168
HG91b [238] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1169
10.5281/zenodo.7539484). 1170

HG90b [239] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1171
10.5281/zenodo.7523390). 1172
HG89b [240] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1173
10.5281/zenodo.7523390). 1174
HG88b [241] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1175
10.5281/zenodo.7523390). 1176
HG87b [242] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1177
odo.7574952). 1178
HG86b [243] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1179
10.5281/zenodo.7574992). 1180
odo.7523357). 1182
HG84b [245] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1183
10.5281/zenodo.7523357). 1184
HG83b [246] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7504782). 1186
HG82b [247] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7504782). 1188
HG81b [248] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1189
10.5281/zenodo.7504782). 1190
HG80b [249] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.7499395). 1192
HG79b [250] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1193
odo.7499395). 1194
HG78b [251] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1195
10.5281/zenodo.7499395). 1196
HG77b [252] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1197
10.5281/zenodo.7497450). 1198
HG76b [253] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1199
10.5281/zenodo.7497450). 1200
HG75b [254] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1201
10.5281/zenodo.7494862). 1202
HG74b [255] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1203
odo.7494862). 1204
HG73b [256] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1205
10.5281/zenodo.7494862). 1206

HG72b [257] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1207
10.5281/zenodo.7493845). 1208
HG71b [258] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1209
10.5281/zenodo.7493845). 1210
HG70b [259] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7493845). 1212
HG69b [260] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1213
odo.7539484). 1214
HG68b [261] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1215
odo.7523390). 1216
HG67b [262] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1217
odo.7523357). 1218
HG66b [263] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1219
odo.7504782). 1220
HG65b [264] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7499395). 1222
HG64b [265] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1223
odo.7497450). 1224
HG63b [266] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1225
odo.7494862). 1226
HG62b [267] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1227
odo.7493845). 1228
HG61b [268] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1229
odo.7480110). 1230
HG60b [269] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1231
odo.7378758). 1232
HG32b [270] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1233
odo.6320305). 1234
HG44b [271] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1235
odo.6677173). 1236

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1286
is going to figure out what’s going on this phenomenon. The special case of this disease is 1287
considered and as the consequences of the model, some parameters are used. The cells are 1288
under attack of this disease but the moves of the cancer in the special region are the matter of 1289
mind. The recognition of the cancer could help to find some treatments for this disease. The 1290
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1291
Recognition” and both bases are the background of this research. Sometimes the cancer has 1292
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1293
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1294
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1295
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1296
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1297
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1298
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1299
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1300
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1301
and neutrality about the moves and the effects of the cancer on that region; this event leads 1302
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1303
perception on what’s happened and what’s done. There are some specific models, which 1304
are well-known and they’ve got the names, and some general models. The moves and the 1305
traces of the cancer on the complex tracks and between complicated groups of cells could 1306
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1307
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1308
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1309

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1310
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1311
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1312
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1313
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1314
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1315
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1316
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1317
based on the fixed groups of cells or the fixed groups of group of cells? 1318
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1319
messy and dense SuperHyperModels where embedded notions are illustrated? 1320
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1321
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1322
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1323

research has taken more motivations to define SuperHyperClasses and to find some connections 1324
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1325
instances and examples to make clarifications about the framework of this research. The general 1326
results and some results about some connections are some avenues to make key point of this 1327
research, “Cancer’s Recognition”, more understandable and more clear. 1328
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1329
on the modeling of the regions where are under the attacks of the cancer to recognize 1330
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1331
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1332
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1333
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1334
instances and literature reviews have taken the whole way through. In this scientific research, 1335
the literature reviews have fulfilled the lines containing the notions and the results. The 1336
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1337
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1338
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1339
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1340
of the moves of the cancer in the longest and strongest styles with the formation of the design 1341
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1342
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1343
out the background for the SuperHyperNotions. 1344

CHAPTER 5 1345
Extreme 1346
Hamiltonian-Type-Cycle-Decomposition 1347
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1348
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1349
2023, (doi: 10.13140/RG.2.2.34953.52320). 1350
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1351
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1352
(doi: 10.13140/RG.2.2.33275.80161). 1353
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1354
10.13140/RG.2.2.11050.90569). 1356
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1357
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1358
10.13140/RG.2.2.17761.79206). 1359
10.13140/RG.2.2.19911.37285). 1362
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1363
10.13140/RG.2.2.23266.81602). 1365
10.13140/RG.2.2.19360.87048). 1368
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1369
10.13140/RG.2.2.32363.21286). 1371
10.13140/RG.2.2.11758.69441). 1374
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1375
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1376
10.13140/RG.2.2.31891.35367). 1377
45

10.13140/RG.2.2.21510.45125). 1380
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1381
10.13140/RG.2.2.13121.84321). 1383

CHAPTER 6 1384
New Ideas On Super Decompensation By 1385
Hyper Decompress Of 1386
In Cancer’s Recognition With 1388
(Neutrosophic) SuperHyperGraph 1389
47
CHAPTER 7 1390
ABSTRACT 1391
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 1392

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

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

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

SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expression is called Neutrosophic 1401
v-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria holds 1402
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expression is called 1403

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

SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian- 1406
Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic 1407
v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type- 1408
Cycle-Decomposition. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Decomposition). Assume a Neut- 1409
rosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 1410
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperHamiltonian-Type- 1411

Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neut- 1412
rosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian- 1413
Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and 1414
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 1415
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 1416
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 1417

Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle- 1418
Decomposition; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutro- 1419
sophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Type- 1420
Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic 1421
rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 1422
perGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1423
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1424
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1425
such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition; an Extreme 1426
SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic 1427
e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Type-Cycle- 1428
Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic rv- 1429

SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1430
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1431
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1432
HyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1433
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 1434
treme SuperHyperHamiltonian-Type-Cycle-Decomposition; and the Extreme power is corresponded to its 1435

Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPoly- 1436
nomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic 1437
re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle- 1438
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for 1439
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1440

contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1441
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyper- 1442
Set S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 1443
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian- 1444
Type-Cycle-Decomposition; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 1445
cient; an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutrosophic 1446

SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1449
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1450

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

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1452
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition; a Neutrosophic V- 1453
Cycle-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1457
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutro- 1458
sophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1459
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutro- 1460
sophic SuperHyperHamiltonian-Type-Cycle-Decomposition; an Extreme V-SuperHyperHamiltonian-Type- 1461
Cycle-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian- 1462

Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 1465
Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1466
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1467
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 1468
Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle- 1469
Decomposition; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 1470
SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic 1471
SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 1474
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 1475
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1476
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1477
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 1478
tices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition; and the 1479
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1480
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Type- 1481

Cycle-Decomposition and Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. Two different 1482
types of SuperHyperDefinitions are debut for them but the research goes further and the 1483
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 1484
and well-reviewed. The literature review is implemented in the whole of this research. For 1485
shining the elegancy and the significancy of this research, the comparison between this Su- 1486
perHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 1487
featured. The definitions are followed by the examples and the instances thus the clarifications 1488
are driven with different tools. The applications are figured out to make sense about the 1489
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under research 1490
to figure out the challenges make sense about ongoing and upcoming research. The special case 1491
is up. The cells are viewed in the deemed ways. There are different types of them. Some of 1492
them are individuals and some of them are well-modeled by the group of cells. These types 1493
are all officially called “SuperHyperVertex” but the relations amid them all officially called 1494
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 1495
are chosen and elected to research about “Cancer’s Recognition”. Thus these complex and 1496

dense SuperHyperModels open up some avenues to research on theoretical segments and 1497
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 1498
collected in the form of some questions and some problems. Assume a SuperHyperGraph. 1499
Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is a max- 1500
imal of SuperHyperVertices with a maximum cardinality such that either of the following 1501
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 1502
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 1503
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 1504
is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is 1505
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1506
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1507
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1508
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1509
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1510
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1511
SuperHyperHamiltonian-Type-Cycle-Decomposition . Since there’s more ways to get type-results to make 1512
a SuperHyperHamiltonian-Type-Cycle-Decomposition more understandable. For the sake of having 1513
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a need to “redefine” the notion 1514
of a “SuperHyperHamiltonian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHy- 1515

perEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s 1516
the usage of the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Type- 1517
Cycle-Decomposition . It’s redefined a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if the 1518
based on a SuperHyperHamiltonian-Type-Cycle-Decomposition . It’s the main. It’ll be disciplinary 1526
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 1527
need to have all SuperHyperHamiltonian-Type-Cycle-Decomposition until the SuperHyperHamiltonian-Type- 1528
Cycle-Decomposition, then it’s officially called a “SuperHyperHamiltonian-Type-Cycle-Decomposition” but 1529
otherwise, it isn’t a SuperHyperHamiltonian-Type-Cycle-Decomposition . There are some instances about 1530
the clarifications for the main definition titled a “SuperHyperHamiltonian-Type-Cycle-Decomposition ”. 1531
These two examples get more scrutiny and discernment since there are characterized in the 1532
disciplinary ways of the SuperHyperClass based on a SuperHyperHamiltonian-Type-Cycle-Decomposition 1533
. For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a 1534
need to “redefine” the notion of a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition” 1535
and a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition ”. The SuperHyperVertices 1536
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 1537
this procedure, there’s the usage of the position of labels to assign to the values. Assume 1538
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 1539
intended Table holds. And a SuperHyperHamiltonian-Type-Cycle-Decomposition are redefined to a 1540
“Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition” if the intended Table holds. It’s 1541
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1542

to get Neutrosophic type-results to make a Neutrosophic SuperHyperHamiltonian-Type-Cycle- 1543

Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There are 1544
some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 1545
SuperHyperHamiltonian-Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyper- 1546
MultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1547
SuperHyperHamiltonian-Type-Cycle-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic 1548
SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic Supe- 1549

rHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 1550
SuperHyperHamiltonian-Type-Cycle-Decomposition” where it’s the strongest [the maximum Neutrosophic 1551
value from all the SuperHyperHamiltonian-Type-Cycle-Decomposition amid the maximum value amid all 1552
SuperHyperVertices from a SuperHyperHamiltonian-Type-Cycle-Decomposition .] SuperHyperHamiltonian- 1553
Type-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the 1554
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHy- 1555
perGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only 1556
one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s 1557
SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s only one SuperVertex as intersection amid 1558
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1559
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1560
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 1561
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 1562
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 1563
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 1564
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 1565
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 1566
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 1567
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 1568
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 1569
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 1570
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 1571
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 1572
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 1573
Recognition” and the results and the definitions will be introduced in redeemed ways. The 1574
recognition of the cancer in the long-term function. The specific region has been assigned by 1575
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1576
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1577
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 1578
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 1579
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1580
are some specific models, which are well-known and they’ve got the names, and some SuperHy- 1581
perGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks 1582
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 1583
/SuperHyperHamiltonian-Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHy- 1584

perMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperHamiltonian- 1585
Type-Cycle-Decomposition or the strongest SuperHyperHamiltonian-Type-Cycle-Decomposition in those 1586
Neutrosophic SuperHyperModels. For the longest SuperHyperHamiltonian-Type-Cycle-Decomposition, 1587
called SuperHyperHamiltonian-Type-Cycle-Decomposition, and the strongest SuperHyperHamiltonian-Type- 1588

, called Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, some general

Cycle-Decomposition 1589
results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have 1590
only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1591
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Decomposition. There 1592
isn’t any formation of any SuperHyperHamiltonian-Type-Cycle-Decomposition but literarily, it’s the 1593
deformation of any SuperHyperHamiltonian-Type-Cycle-Decomposition. It, literarily, deforms and it 1594
doesn’t form. A basic familiarity with Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition 1595

theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 1596
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Type-Cycle-Decomposition, 1597
Cancer’s Neutrosophic Recognition 1598


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

results are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath 1646
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 1647
three SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Decomposition. There 1648
isn’t any formation of any SuperHyperHamiltonian-Type-Cycle-Decomposition but literarily, it’s the 1649
deformation of any SuperHyperHamiltonian-Type-Cycle-Decomposition. It, literarily, deforms and it 1650
doesn’t form. 1651
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find 1652
the “ amount of SuperHyperHamiltonian-Type-Cycle-Decomposition” of either individual of cells or the 1653
groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 1654
SuperHyperHamiltonian-Type-Cycle-Decomposition” based on the fixed groups of cells or the fixed groups 1655
of group of cells? 1656
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1657
messy and dense SuperHyperModels where embedded notions are illustrated? 1658
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1659
it motivates us to define different types of “ SuperHyperHamiltonian-Type-Cycle-Decomposition” and 1660
“Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition” on “SuperHyperGraph” and “Extreme 1661
SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 1662
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 1663
motivates us to get some instances and examples to make clarifications about the framework of 1664
this research. The general results and some results about some connections are some avenues to 1665
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 1666
The framework of this research is as follows. In the beginning, I introduce basic definitions 1667
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1668
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1669
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1670
review literature are applied to make sense about what’s going to figure out about the 1671
upcoming sections. The main definitions and their clarifications alongside some results about 1672
new notions, SuperHyperHamiltonian-Type-Cycle-Decomposition and Extreme SuperHyperHamiltonian- 1673
Type-Cycle-Decomposition, are figured out in sections “ SuperHyperHamiltonian-Type-Cycle-Decomposition” 1674
and “Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition”. In the sense of tackling on getting 1675
results and in Hamiltonian-Type-Cycle-Decomposition to make sense about continuing the research, the 1676
ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their 1677

consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1678
section, titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1679
As going back to origin of the notions, there are some smart steps toward the common 1680
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1681
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Extreme 1682
SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1683
concluding and closing section of theoretical research are contained in the section “General 1684
Results”. Some general SuperHyperRelations are fundamental and they are well-known 1685
as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 1686
Results”, “ SuperHyperHamiltonian-Type-Cycle-Decomposition”, “Extreme SuperHyperHamiltonian-Type- 1687
Cycle-Decomposition”, “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1688
There are curious questions about what’s done about the SuperHyperNotions to make sense 1689
about excellency of this research and going to figure out the word “best” as the description and 1690
adjective for this research as presented in section, “ SuperHyperHamiltonian-Type-Cycle-Decomposition”. 1691
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1692
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1693
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1694
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1695
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1696
to make sense to figure out this research in featured style. The advantages and the limitations 1697
of this research alongside about what’s done in this research to make sense and to get sense 1698
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1699

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

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

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

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

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). 1715
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1716
where 1717
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1718
(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); 1719
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1720
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1721
1, 2, . . . , n0 ); 1722
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1723
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1724

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

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

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

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

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

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

where 1761

1, 2, . . . , n0 ); 1766
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1767
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1768
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1769
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1770
0


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

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

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

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

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

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


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

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

).
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1857
or E 0 is called 1858
(i) Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 1859

sion is called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 1860
holds 1861
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 1862
sion is called Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 1863

holds 1864
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1865
(iii) Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 1866

sion is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 1867
holds 1868
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following ex- 1869

pression is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition cri- 1870
teria holds 1871
∀V 0 ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1872

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

sophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian- 1874
Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neut- 1875
rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition. 1876
Definition 9.0.19. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Decomposition). 1877

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

e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Type- 1881
Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutro- 1882
sophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme Su- 1883
perHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 1884

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 1885
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHy- 1886
perVertices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition; 1887
(ii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutro- 1888

rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic 1891
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 1892
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutro- 1893
sophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 1894

SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 1895
Decomposition; 1896
(iii) an Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial 1897

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic 1898
re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type- 1899

Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and 1900
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 1901
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 1902
maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 1903
perSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 1904
Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian-Type- 1905
Cycle-Decomposition; and the Extreme power is corresponded to its Extreme coefficient; 1906
(iv) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 1907

mial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutro- 1908
sophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian- 1909

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1911
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1912
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1913
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1914
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1915

form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition; and the Neutrosophic 1916

power is corresponded to its Neutrosophic coefficient; 1917
(v) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutro- 1918

rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme Su- 1921

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 1923
(vi) a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either 1926

of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re- 1927
SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type- 1928
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1930
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1931
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1932

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1933
SuperHyperHamiltonian-Type-Cycle-Decomposition; 1934
(vii) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 1935


C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHy- 1939
perPolynomial contains the Extreme coefficients defined as the Extreme number of the 1940
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Supe- 1941
rHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1942
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 1943
Type-Cycle-Decomposition; and the Extreme power is corresponded to its Extreme coefficient; 1944
(viii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 1945


number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1951

power is corresponded to its Neutrosophic coefficient. 1955
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Type-Cycle-Decomposition). 1956
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1957

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
(i) an δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is a Neutrosophic kind of Neutro- 1958
sophic SuperHyperHamiltonian-Type-Cycle-Decomposition such that either of the following expres- 1959

sions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1960
|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 1961

(29.1), holds if S is an δ−SuperHyperDefensive; 1962
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is a Neutrosophic 1963

kind of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition such that either of 1964
the following Neutrosophic expressions hold for the Neutrosophic cardinalities of 1965
SuperHyperNeighbors of s ∈ S : 1966
|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 1967

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1968
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a 1969
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 1970

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 1971
procedure, there’s the usage of the position of labels to assign to the values. 1972
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 1973
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 1974
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1975
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1976
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus 1978
Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Type-Cycle-Decomposition, SuperHyperStar, 1979
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1980
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1981
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1982
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1983

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 1984

. Since there’s more ways to get type-results to make a Neutrosophic
Type-Cycle-Decomposition 1985
SuperHyperHamiltonian-Type-Cycle-Decomposition more Neutrosophicly understandable. 1986
need to “redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Type-Cycle- 1988

Decomposition”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1989
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 1990
to assign to the values. 1991
136DEF1 Definition 9.0.23. Assume a SuperHyperHamiltonian-Type-Cycle-Decomposition. It’s redefined a Neut- 1992

rosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if the Table (29.3) holds. 1993

CHAPTER 10 1994
Extreme SuperHyper But As Hamiltonian-Type-Cycle-Decomposition 1995
The Extensions Excerpt From Dense And 1996
Super Forms 1997
Definition 10.0.1. (Extreme event). 1998
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 1999
probability Hamiltonian-Type-Cycle-Decomposition. Any Extreme k-subset of A of V is called Extreme 2000
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2001
expression is called Extreme probability of A. 2002
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2003

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

s-independent if the following expression is called Extreme s-independent criteria 2006
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 2007
following expression is called Extreme independent criteria 2008
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2009

a probability Hamiltonian-Type-Cycle-Decomposition. Any k-function Hamiltonian-Type-Cycle-Decomposition like 2011

E is called Extreme k-Variable. If k = 2, then any 2-function Hamiltonian-Type-Cycle-Decomposition 2012
like E is called Extreme Variable. 2013
The notion of independent on Extreme Variable is likewise. 2014
Definition 10.0.4. (Extreme Expectation). 2015
71
a probability Hamiltonian-Type-Cycle-Decomposition. an Extreme k-Variable E has a number is called 2017

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

a probability Hamiltonian-Type-Cycle-Decomposition. an Extreme number is called Extreme Crossing 2021

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

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

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

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

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

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

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

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

S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let X be an Extreme Variable and 2091
let t be a positive real number. Then 2092
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2093
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let Xn be an Extreme 2095
Variable in a probability Hamiltonian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 2096
V (Xn ) << E 2 (Xn ), then 2097
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 2099
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2100
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2101
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 2103
0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which 2104
f (k) is less than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2105
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. As in the proof of related Theorem, 2107
the result is straightforward. 2108
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and 2110
k ∗ be as defined in previous Theorem. Then either: 2111
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2112
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2113
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. The latter is straightforward. 2115
Definition 10.0.17. (Extreme Threshold). 2116

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2117
probability Hamiltonian-Type-Cycle-Decomposition. Let P be a monotone property of SuperHyperGraphs 2118
(one which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for 2119
P is a function f (n) such that: 2120
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2121
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2122

Definition 10.0.18. (Extreme Balanced). 2123

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2124
is a probability Hamiltonian-Type-Cycle-Decomposition. Let F be a fixed Extreme SuperHyperGraph. 2125
Then there is a threshold function for the property of containing a copy of F as an Extreme 2126
SubSuperHyperGraph is called Extreme Balanced. 2127
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let F be a nonempty balanced 2129
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2130

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

SuperHyperHamiltonian-Type-Cycle-Decomposition, is up. The Extreme Algorithm is Extremely 2137
straightforward. E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop 2138
Extreme SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of 2139
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 2140
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2141
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2142

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

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

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

Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 2148
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2149
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2150
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2151
SuperHyperHamiltonian-Type-Cycle-Decomposition. 2152

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

straightforward. 2156

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




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


= {{E1 }}.
= z.

= {{V1 , V2 , V3 , V4 , V5 }}.
= z5.
2165


= {{Ei=110 , Ej=2232 , E12 }}.
= 11z 22 .
= {{Vi ∈ VN SHG }}.
= z 22 .
2169


= {{E15 , E13 , E16 , E14 , E17 , E12 }, . . .}.
= 3z 6 .
= {{Vi ∈ VN SHG }}.
= z 14 .
2173


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


= {{Vi=811 , V!4 }}.
= z 14 .
2177


= {{Ei=110 , E22 , E12 }}.
= 11z 12 .
= {{Vi ∈ VN SHG }}.
= z 22 .
2181




= {{E1 , E6 , E2 , E7 , E3 , E4 }, . . .}.
= 3z 6 .
= {{Vi ∈ VN SHG }}.
= z 14 .
2185


= {{E1 , E6 , E3 , E8 }, . . .}.

= 3z 4 .
= {{Vi ∈ VN SHG }}.
= z6.
2189


= {{E1 }}.
= z.
= {{V1 , V2 , V3 , V7 , V8 }}.
= z5.
2193



= {{E9 , E6 , E3 , E8 }, . . .}.
= 3z 4 .
= {{Vi ∈ VN SHG }}.
= z6.
2197


= {{E1 }, {E2 }}.

= z.
= {{V1 , V2 }, {V1 , V3 }}.
= 2z 2 .
2201


= {{E4 }, . . .}.
= 5z.
= {{V3 , V4 }, . . .}.
= 5z 2 .
2205



= {{E4 }, . . .}.
= 5z.
= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
2209




= {{E4 }, . . .}.
= 6z.
= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
2213


= {{E4 }, . . .}.


= 6z.
= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
2217


= {{Ei=112 }}.
X
= aj z |Ei=112 | .
= {{Vi ∈ VN SHG }}.

X
= ai z bj .
2221


= {E6 , . . .}.
= z |E6 | + . . . .
= {Vi ∈ VE6 , . . .}.
X
= ai z bj .
2225


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


= {{E2 }, . . .}.

SuperHyperHamiltonian-Type-Cycle-Decomposition in the Extreme Example (42.0.3) 95NHG1
= 4z.
= {Vi ∈ VE2 , . . .}.
= z 10 + . . . .
2233
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2234
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition 2235
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2236
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2237
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2238
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2239
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2240

SuperHyperHamiltonian-Type-Cycle-Decomposition in the Extreme Example (42.0.3) 95NHG2
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2241
quasi-R-Hamiltonian-Type-Cycle-Decomposition minus all Extreme SuperHypeNeighbor to some of them 2242
but not all of them. In other words, there’s only an unique Extreme SuperHyperEdge 2243
E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in an Extreme quasi- 2244
R-Hamiltonian-Type-Cycle-Decomposition, minus all Extreme SuperHypeNeighbor to some of them but not 2245
all of them. 2246
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Hamiltonian-Type-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Decomposition 2247
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2248
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2249
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2250
of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Decomposition in some 2251

cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2252
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2253
an Extreme R-Hamiltonian-Type-Cycle-Decomposition. 2254
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-Type-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-Type-Cycle-Decomposition with the least Extreme cardinal- 2255
ity, the lower sharp Extreme bound for cardinality. 2256
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2257
Then in the worst case, literally, 2258
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Hamiltonian-Type-Cycle-Decomposition. In other words, the least cardinality, the 2259

lower sharp bound for the cardinality, of an Extreme type-result-Hamiltonian-Type-Cycle-Decomposition is 2260
the cardinality of 2261
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The Super-
HyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Hamiltonian-Type-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-Type-Cycle-Decomposition. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-Type-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-Type-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-Type-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-Type-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-Type-Cycle-Decomposition has the Extreme cardinality of
an Extreme SuperHyperEdge. Thus, an Extreme R-Hamiltonian-Type-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-Type-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-Type-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-Type-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-Type-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-Type-Cycle-Decomposition. Those
Extreme SuperHyperVertices are potentially included in an Extreme style-R-Hamiltonian-Type-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-Type-Cycle-Decomposition is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Hamiltonian-Type-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-Type-Cycle-Decomposition.

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the
Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2262
Extreme R-Hamiltonian-Type-Cycle-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2263
Extreme R-Hamiltonian-Type-Cycle-Decomposition =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Hamiltonian-Type-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-Type-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-Type-
Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Decomposition 2264
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2265
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2266
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2267
number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Decomposition 2268
in some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2269
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2270
contained in an Extreme R-Hamiltonian-Type-Cycle-Decomposition. 2271

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2272
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2273
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2274
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of 2275
Extreme SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken 2276
from that Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme 2277
SuperHyperSet of the Extreme SuperHyperVertices is either has the maximum Extreme 2278
SuperHyperCardinality or it doesn’t have maximum Extreme SuperHyperCardinality. In 2279
a non-obvious SuperHyperModel, there’s at least one Extreme SuperHyperEdge containing at 2280
least all Extreme SuperHyperVertices. Thus it forms an Extreme quasi-R-Hamiltonian-Type-Cycle- 2281
Decomposition where the Extreme completion of the Extreme incidence is up in that. Thus it’s, 2282
literarily, an Extreme embedded R-Hamiltonian-Type-Cycle-Decomposition. The SuperHyperNotions 2283

of embedded SuperHyperSet and quasi-SuperHyperSet coincide. In the original setting, 2284

these types of SuperHyperSets only don’t satisfy on the maximum SuperHyperCardinality. 2285
Thus the embedded setting is elected such that those SuperHyperSets have the maximum 2286
Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. The less than two 2287
distinct types of Extreme SuperHyperVertices are included in the minimum Extreme style of 2288
the embedded Extreme R-Hamiltonian-Type-Cycle-Decomposition. The interior types of the Extreme 2289
SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors are only 2290
affected by the interior Extreme SuperHyperVertices. The common connections, more precise and 2291
more formal, the perfect unique connections inside the Extreme SuperHyperSet for any distinct 2292
types of Extreme SuperHyperVertices pose the Extreme R-Hamiltonian-Type-Cycle-Decomposition. Thus 2293
Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge 2294
and in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that 2295
Extreme SuperHyperEdge. In the embedded Extreme Hamiltonian-Type-Cycle-Decomposition, there’s the 2296

usage of exterior Extreme SuperHyperVertices since they’ve more connections inside more 2297
than outside. Thus the title “exterior” is more relevant than the title “interior”. One 2298
Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet 2299
of the Extreme SuperHyperVertices with one SuperHyperElement has been ignored in the 2300
exploring to lead on the optimal case implying the Extreme R-Hamiltonian-Type-Cycle-Decomposition. 2301
The Extreme R-Hamiltonian-Type-Cycle-Decomposition with the exclusion of the exclusion of all Extreme 2302
SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the Extreme 2303
R-Hamiltonian-Type-Cycle-Decomposition with the inclusion of all Extreme SuperHyperVertices in one 2304
Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition. To sum them 2305
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only one 2306
Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct 2307
interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian-Type-Cycle- 2308

Decomposition minus all Extreme SuperHypeNeighbor to some of them but not all of them. In other 2309
words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct 2310
Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition, minus all 2311
Extreme SuperHypeNeighbor to some of them but not all of them. 2312
The main definition of the Extreme R-Hamiltonian-Type-Cycle-Decomposition has two titles. an 2313
Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition and its corresponded quasi-maximum Extreme 2314

R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2315
there’s an Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition with that quasi-maximum Extreme 2316
SuperHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2317
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to 2318
take the collection of all the Extreme quasi-R-Hamiltonian-Type-Cycle-Decompositions for all Extreme 2319
numbers less than its Extreme corresponded maximum number. The essence of the Extreme 2320
Hamiltonian-Type-Cycle-Decomposition ends up but this essence starts up in the terms of the Extreme 2321
quasi-R-Hamiltonian-Type-Cycle-Decomposition, again and more in the operations of collecting all the 2322
Extreme quasi-R-Hamiltonian-Type-Cycle-Decompositions acted on the all possible used formations of 2323
the Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2324
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Decompositions. 2325

Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Type-Cycle-Decomposition be an 2326
Extreme number, an Extreme SuperHyperSet and an Extreme Hamiltonian-Type-Cycle-Decomposition. 2327
Then 2328
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Hamiltonian-Type-Cycle-Decomposition ,

|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Hamiltonian-Type-Cycle-Decomposition is 2329
re-formalized and redefined as follows. 2330
GExtreme Hamiltonian-Type-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 2331
definition for the Extreme Hamiltonian-Type-Cycle-Decomposition. 2332
GExtreme Hamiltonian-Type-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- 2333
poses the upcoming expressions.
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2335
= max zExtreme Number
[zExtreme
Number ]Extreme Class

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



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


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

2339

2340

Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2341
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2342

such that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHy- 2343
perEdge. It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Type-Cycle-Decomposition” but, 2344
precisely, it’s the generalization of “Extreme Quasi-Hamiltonian-Type-Cycle-Decomposition” since “Ex- 2345
treme Quasi-Hamiltonian-Type-Cycle-Decomposition” happens “Extreme Hamiltonian-Type-Cycle-Decomposition” 2346
in an Extreme SuperHyperGraph as initial framework and background but “Extreme SuperHy- 2347
perNeighborhood” may not happens “Extreme Hamiltonian-Type-Cycle-Decomposition” in an Extreme 2348

SuperHyperGraph as initial framework and preliminarily background since there are some am- 2349
biguities about the Extreme SuperHyperCardinality arise from it. To get orderly keywords, the 2350
terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Hamiltonian-Type-Cycle-Decomposition”, 2351
and “Extreme Hamiltonian-Type-Cycle-Decomposition” are up. 2352
Thus, let zExtreme Number , NExtreme SuperHyperNeighborhood and GExtreme Hamiltonian-Type-Cycle-Decomposition
2353
be an Extreme number, an Extreme SuperHyperNeighborhood and an Extreme Hamiltonian-Type- 2354
Cycle-Decomposition and the new terms are up. 2355

∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2356
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2357
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2358
And with go back to initial structure, 2359



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

2361

2362

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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Decomposition.

The Extreme SuperHyperSet of the Extreme SuperHyperVertices,

Is an Extreme R-Hamiltonian-Type-Cycle-Decomposition C(ESHG) for an Extreme SuperHyper-

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


is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-

Decomposition, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2363
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2364
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2365
the 2366
“Extreme R-Hamiltonian-Type-Cycle-Decomposition” 2367
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2368
Extreme R-Hamiltonian-Type-Cycle-Decomposition, 2369
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 Su-
perHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the Extreme
R-Hamiltonian-Type-Cycle-Decomposition amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Hamiltonian-Type-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-Type-Cycle-Decomposition. In other words, the least cardinality, the lower

sharp bound for the cardinality, of an Extreme R-Hamiltonian-Type-Cycle-Decomposition is the cardinality
of
2370
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2371
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Decomposition if 2372
for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2373
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2374
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2375

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2376
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2377
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2378
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2379
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2380
R-Hamiltonian-Type-Cycle-Decomposition with the least cardinality, the lower sharp Extreme bound 2381
for Extreme cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). 2382
The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme 2383
SuperHyperSet S of the Extreme SuperHyperVertices such that there’s an Extreme Supe- 2384
rHyperEdge to have some Extreme SuperHyperVertices uniquely but it isn’t an Extreme 2385
R-Hamiltonian-Type-Cycle-Decomposition. Since it doesn’t have 2386
2387
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2388

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2389
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2390
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2391
perVertices but it isn’t an Extreme R-Hamiltonian-Type-Cycle-Decomposition. Since it doesn’t do 2392
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2393
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2394
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2395
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2396
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2397
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2398
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2399
Thus the obvious Extreme R-Hamiltonian-Type-Cycle-Decomposition, VESHE is up. The obvious simple 2400
Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Decomposition, VESHE , is 2401
an Extreme SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does 2402
forms any kind of Extreme pairs are titled Extreme SuperHyperNeighbors in a connected 2403
Extreme SuperHyperGraph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme 2404
SuperHyperVertices VESHE , is the maximum Extreme SuperHyperCardinality of an 2405
Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s an Extreme 2406

SuperHyperEdge to have some Extreme SuperHyperVertices uniquely. Thus, in a connected 2407
Extreme SuperHyperGraph ESHG : (V, E). Any Extreme R-Hamiltonian-Type-Cycle-Decomposition only 2408
contains all interior Extreme SuperHyperVertices and all exterior Extreme SuperHyperVertices 2409
from the unique Extreme SuperHyperEdge where there’s any of them has all possible Extreme 2410
SuperHyperNeighbors in and there’s all Extreme SuperHyperNeighborhoods in with no excep- 2411

tion minus all Extreme SuperHypeNeighbors to some of them not all of them but everything is 2412
possible about Extreme SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2413
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Decomposition, is up. There’s neither empty 2414
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme 2415
SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the 2416
Extreme Hamiltonian-Type-Cycle-Decomposition. The Extreme SuperHyperSet of Extreme SuperHy- 2417

perEdges[SuperHyperVertices], 2418
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−Decomposition

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.

C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle-Decomposition. The 2419

Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2420

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2422
2423
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2424
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2425
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2426
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2427
Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Type-Cycle-Decomposition is 2428
up. The obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle- 2429
Decomposition is an Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. 2430
But the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2431

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2432
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type- 2433
Cycle-Decomposition is up. To sum them up, the Extreme SuperHyperSet of the Extreme 2434
SuperHyperEdges[SuperHyperVertices], 2435

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


= 2z b 2 c
.
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian- 2436

. Since the Extreme SuperHyperSet of the Extreme SuperHy-

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

ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that 2440
there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that 2441
Extreme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Decomposition and it’s an 2442
Extreme Hamiltonian-Type-Cycle-Decomposition. Since it’s 2443
2444
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2445

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

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


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

= 2z b 2 c
.
Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type-Cycle- 2451
Decomposition, not: 2452

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Extreme SuperHyperSet, not: 2453

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2454
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2455
SuperHyperSet called the 2456
“Extreme Hamiltonian-Type-Cycle-Decomposition ” 2457
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2458
Extreme Hamiltonian-Type-Cycle-Decomposition, 2459
is only and only 2460

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

CHAPTER 11 2462
The Extreme Departures on The 2463
Theoretical Results Toward Theoretical 2464
Motivations 2465
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2466
SuperHyperClasses. 2467
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2468

= {{Eimax }, . . . , {Eimin }}.
max min
= z |Ei |
+ . . . + z |Ei |
.
= {{Vi ∈ Eimax }, . . . , {Vi ∈ Eimin }}.
max min
= z |{Vi ∈Ei }|
+ . . . + z |{Vi ∈Ei }|
.
Proof. Let 2469
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2470
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-Type-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 2471
new way to redefine as 2472
ViEXT ERN AL ∼ VjEXT ERN AL ≡

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

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

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

= {{Vi ∈ VN SHG }}.

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

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

= {{Eimax }, . . . , {Eimin }}.
max min
= z |Ei |
+ . . . + z |Ei |
.
= {{Vi ∈ Eimax }, . . . , {Vi ∈ Eimin }}.
max min
= z |{Vi ∈Ei }|
+ . . . + z |{Vi ∈Ei }|
.

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

SuperHyperHamiltonian-Type-Cycle-Decomposition in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2492
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2493
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 2494
way to redefine as 2495


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

SuperHyperHamiltonian-Type-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), 2499
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2500
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2501
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperHamiltonian- 2502
Type-Cycle-Decomposition. 2503
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2504

= {{Pimax }, . . . , {Pimin }}.
max min
= z |Pi |
+ . . . + z |Pi |
.
= {{Vi ∈ Pimax }, . . . , {Vi ∈ Pimin }}.
max min
= z |{Vi ∈Pi }|
+ . . . + z |{Vi ∈Pi }|
.
Proof. Let 2505
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
2506
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 2507
a new way to redefine as 2508

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

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 2516
Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 2517
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2518
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2519
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2520
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2521
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2522
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition. 2523

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

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

= {{Pimax }, . . . , {Pimin }}.
max min
= z |Pi |
+ . . . + z |Pi |
.
= {{Vi ∈ Pimax }, . . . , {Vi ∈ Pimin }}.
max min
= z |{Vi ∈Pi }|
+ . . . + z |{Vi ∈Pi }|
.
Proof. Let 2526
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|P i |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG

2527
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 2529

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2537
SuperHyperEdges are attained in any solution 2538
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2539
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2541
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2542
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2543
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2544
the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition. 2545
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2546

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

= {{Ei=1|EN SHG |−1 , Ea∗ , Eb∗ }}.

= |EN SHG |z |EN SHG |+1 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
Proof. Let 2547
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2548
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 2550


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

Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition in the Extreme Example (42.0.15) 136NSHG23a
straightforward. Then there’s at least one SuperHyperHamiltonian-Type-Cycle-Decomposition. Thus 2553

the notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian- 2554
Type-Cycle-Decomposition could be applied. The unique embedded SuperHyperHamiltonian-Type-Cycle- 2555
Decomposition proposes some longest SuperHyperHamiltonian-Type-Cycle-Decomposition excerpt from some 2556
representatives. The latter is straightforward. 2557
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2558
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2559
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2560
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2561
Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition. 2562

CHAPTER 12 2563
The Surveys of Mathematical Sets On 2564
The Results But As The Initial Motivation 2565
For the SuperHyperHamiltonian-Type-Cycle-Decomposition, Extreme SuperHyperHamiltonian-Type-Cycle- 2566

, and the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition, some general results
Decomposition 2567
are introduced. 2568
Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition is 2569

“redefined” on the positions of the alphabets. 2570
Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition. Then 2571
Extreme SuperHyperHamiltonian − T ype − Cycle − Decomposition =

{theSuperHyperHamiltonian − T ype − Cycle − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − Decomposition
|ExtremecardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−Decomposition. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2572
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2573
and the neutrality, for i = 1, 2, 3, respectively. 2574
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of 2575
the alphabet. Then the notion of Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition and 2576
SuperHyperHamiltonian-Type-Cycle-Decomposition coincide. 2577
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2579

SuperHyperHamiltonian-Type-Cycle-Decomposition if and only if it’s a SuperHyperHamiltonian-Type-Cycle- 2580
Decomposition. 2581
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2583
SuperHyperHamiltonian-Type-Cycle-Decomposition if and only if it’s a longest SuperHyperHamiltonian-Type- 2584

Cycle-Decomposition. 2585
123
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2586

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition is its 2587
SuperHyperHamiltonian-Type-Cycle-Decomposition and reversely. 2588
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 2589

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 2590
on the same identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle- 2591
Decomposition is its SuperHyperHamiltonian-Type-Cycle-Decomposition and reversely. 2592
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2593
isn’t well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Decomposition
isn’t well-defined. 2595
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2596

its Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined if and only if its 2597
SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined. 2598

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Decomposition 2600
Then its Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined if and only if its 2601
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian-2603

is well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Decomposition is 2604
Type-Cycle-Decomposition
well-defined. 2605
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2606
its Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined if and only if its 2607

SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined. 2608

Decomposition 2610
Then its Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined if and only if its 2611
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2613
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2614
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2615
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2616
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2617
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2618
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 2619
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2620
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2621
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2622

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2623
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2624
(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2625
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 2626
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2627

independent SuperHyperSet is 2628
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2631
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2635
which is a SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath. Then V is a maximal 2636
(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2637
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2638
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2639
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2640
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2641
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2642
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2643
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2644

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2645
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2646
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2647
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2648
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2649
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2650
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2651


which is a SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath. Then the number of 2654
(i) : the SuperHyperHamiltonian-Type-Cycle-Decomposition; 2655
(ii) : the SuperHyperHamiltonian-Type-Cycle-Decomposition; 2656
(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Decomposition; 2657
(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 2658
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 2659
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition. 2660
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2661
coincide. 2662
which is a SuperHyperWheel. Then the number of 2664
(i) : the dual SuperHyperHamiltonian-Type-Cycle-Decomposition; 2665
(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Decomposition; 2666
(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Decomposition; 2667
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 2668
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 2669
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition. 2670
coincide. 2672

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2674
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2675
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2676
is a 2677
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2681
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2682
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2683
.
Decomposition 2684


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2687
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2688
SuperHyperPart is a 2689
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2693
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2694
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 2695

SuperHyperMultipartite. Then Then the number of 2698
O(ESHG)
O(ESHG)
O(ESHG)
.
Decomposition 2705
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2706
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2707
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2709
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2710
(iv) : SuperHyperHamiltonian-Type-Cycle-Decomposition; 2714
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2715
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 2716

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2717
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2718
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2719
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2720

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

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2727
Decomposition. 2728
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2729
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2730
dual 2731
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2735
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2738
perComplete. Then there’s no independent SuperHyperSet. 2739
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2740

SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 2741
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2742
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2746
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2747

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2748

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


.
Decomposition 2760
Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2761
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2762
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2763
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2764
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2765
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such 2766

that 2767
(i) v ∈ Ns (x); 2768
(ii) vx ∈ E. 2769
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2770
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition, then 2771
(i) S is SuperHyperHamiltonian-Type-Cycle-Decomposition set; 2772
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2773
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2774
(i) Γ ≤ O; 2775
(ii) Γs ≤ On . 2776
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2777
connected. Then 2778
(i) Γ ≤ O − 1; 2779

(ii) Γs ≤ On − Σ3i=1 σi (x). 2780
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2781
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive 2782
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2784
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2785
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2786
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2788
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2789
Decomposition; 2790
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2791
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2792
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2793
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Decomposition. 2795
Then 2796
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 2797

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2808
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2809
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2811

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Decomposition; 2812
(ii) Γ = 1; 2813
(iii) Γs = Σ3i=1 σi (c); 2814
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle- 2815
Decomposition. 2816
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2817
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2818
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 2819
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2820
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2821
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2822
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 2823
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2824
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian- 2825
(ii) Γ = b n2 c + 1; 2827
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2828
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 2829
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2831
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2832
Cycle-Decomposition; 2833
(ii) Γ = b n2 c; 2834

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

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

Type-Cycle-Decomposition for N SHF; 2841

(ii) Γ = m for N SHF : (V, E); 2842
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2843
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2844
Type-Cycle-Decomposition for N SHF : (V, E). 2845
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2846

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

b n c+1 for N SHF : (V, E); 2851
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=12
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 2852
Decomposition for N SHF : (V, E). 2853
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2854
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2855
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2856
Cycle-Decomposition for N SHF : (V, E); 2857
(ii) Γ = b n2 c for N SHF : (V, E); 2858

bnc for N SHF : (V, E); 2859
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1 2
are only dual maximal SuperHyperHamiltonian-Type-Cycle- 2860
following statements hold; 2863
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2864

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

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

SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
2873


SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 2876
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2878

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

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

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

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

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

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


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

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


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

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

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

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

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

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


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

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

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


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

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

136TBLaa21aa
of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : 2974

(V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperHamiltonian-Type- 2975

CHAPTER 15 2977
Case 2: The Increasing Extreme Steps 2978
Toward Extreme 2979
SuperHyperMultipartite as Extreme 2980
SuperHyperModel 2981
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2982
is Extreme highlighted and Extreme featured. 2983
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2984
partite is obtained. 2985
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 2986
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

139
Belong to The Extreme SuperHyperMultipartite

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

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperHamiltonian-Type- 2988

CHAPTER 16 2990
Wondering Open Problems But As The 2991
Directions To Forming The Motivations 2992
In what follows, some “problems” and some “questions” are proposed. 2993
The SuperHyperHamiltonian-Type-Cycle-Decomposition and the Extreme SuperHyperHamiltonian-Type-Cycle- 2994
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 2995
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2996
recognitions? 2997
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle- 2998

and the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition?
Decomposition 2999
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3000
them? 3001
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 3002
and the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition?
Problem 16.0.5. The SuperHyperHamiltonian-Type-Cycle-Decomposition and the Extreme SuperHyperHamiltonian-

3004
do a SuperHyperModel for the Cancer’s recognitions and they’re based on 3005
SuperHyperHamiltonian-Type-Cycle-Decomposition, are there else? 3006
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3007
Numbers types-results? 3008
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3009
the multiple types of SuperHyperNotions? 3010
141
CHAPTER 17 3011
Conclusion and Closing Remarks 3012
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3013
research are illustrated. Some benefits and some advantages of this research are highlighted. 3014
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3015
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Type-Cycle- 3016
Decomposition. For that sake in the second definition, the main definition of the Extreme 3017
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3018
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian- 3019
Type-Cycle-Decomposition, finds the convenient background to implement some results based on that. 3020
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3021
on the modeling of the regions where are under the attacks of the cancer to recognize this 3022
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 3023
the SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Decomposition, the new SuperHyperClasses 3024
and SuperHyperClasses, are introduced. Some general results are gathered in the section 3025
on the SuperHyperHamiltonian-Type-Cycle-Decomposition and the Extreme SuperHyperHamiltonian-Type-Cycle- 3026

Decomposition. The clarifications, instances and literature reviews have taken the whole way through. 3027
In this research, the literature reviews have fulfilled the lines containing the notions and the 3028
results. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 3029
the “Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3030
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 3032
the moves of the cancer in the longest and strongest styles with the formation of the design and 3033
the architecture are formally called “ SuperHyperHamiltonian-Type-Cycle-Decomposition” in the themes of 3034
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 3035
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 3036
for this research are, figured out, pointed out and spoken out. 3037
143
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Type-Cycle-Decomposition
3. Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3038
Extreme SuperHyperDuality But As The 3039
Extensions Excerpt From Dense And 3040
Super Forms 3041
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3042

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

Va ∈ Ei , Ej ; 3046
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3047
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3048
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3049
Vi , Vj ∈ Ea ; 3050
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3051
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3052
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3053
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3054

SuperHyperDuality. 3055
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3056

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3061
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3062
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3063
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3064
Extreme SuperHyperDuality; 3065
145
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3066

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3067
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3068
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3069
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3070
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3071
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3072

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3073
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3074
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3076
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3077
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3078
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3079
coefficient; 3080
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3081

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3104
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3105
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3106
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3107
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3108

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3109

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

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


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

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

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

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



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

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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3230

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3234
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3235
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. 3247
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 3249
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 : 3250

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

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

CHAPTER 19 3263
Extreme SuperHyperJoin But As The 3264
Super Forms 3266
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3267

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3278
|Vj |NEUTROSOPIC CARDINALITY ; 3279
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3280
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3281
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3282

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3286
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3289
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3290
159
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3291

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3298
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3299
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3300
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3301
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3302
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3303
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3304
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3305

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3317
SuperHyperJoin; 3319
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3320

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3323
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3324
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3325
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3326
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3327

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3330

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

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

SuperHyperJoin. 3351
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 3353
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3354
V3 , is excluded in every given Extreme SuperHyperJoin. 3358

is up. The Extreme Algorithm is Extremely straightforward. 3360


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

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

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


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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3428
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 3430
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 3434
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3435
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3436
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3438

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

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


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

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

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

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

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

CHAPTER 20 3481
Extreme SuperHyperPerfect But As The 3482
Super Forms 3484
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3485

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3497
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3498

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3502
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3503
Extreme SuperHyperPerfect; 3507
173
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3508

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

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

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

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

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

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


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

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


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

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

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

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

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



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

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

Then 3670

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3719
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3720

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3724
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3727
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3728
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3729

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3745
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3747
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3748
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3749

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3755
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3756
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3757
SuperHyperTotal; 3759
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3760

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3776
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3778
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3779
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3780
cient. 3783
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3786
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3787
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3788
SuperHyperTotal. 3793
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 3795
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3796

V3 , is excluded in every given Extreme SuperHyperTotal. 3800



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

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

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

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

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

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

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



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

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



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

CHAPTER 22 3924
Extreme SuperHyperConnected But As 3925
Super Forms 3927
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3928

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3942
SuperHyperConnected. 3943
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3944
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3947

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

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3956
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 3957
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 3958
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 3959
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3960

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


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

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

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

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

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

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

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

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

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


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

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

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 4069
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. 4073
(31.1), is the SuperHyperConnected. 4076
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 4078
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. 4085
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 4087



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4106

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4107
SuperHyperPart SuperHyperEdges are attained in any solution 4108
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4114
Then 4116
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 4117
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4118


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

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

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


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

CHAPTER 23 4151
Background 4152
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 4159
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 4160
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 4161
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 4162
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 4163
results based on initial background. 4164
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 4165
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 4166
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 4173
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 4174
and fundamental SuperHyperNumbers. 4175
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 4176
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 4177
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 4178
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 4179

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


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 4212
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 4213
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 4214
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4215
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by Henry Garrett 4216
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 4217
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 4218
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4219
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4220
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 4221

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 4222
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 4223
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 4224
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 4225
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 4226
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 4227

by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4228
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in 4229
Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving 4230
on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic 4231

SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By 4232

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 4233
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4234
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4235
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4236
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4237
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4238
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4239
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4240
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4241
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4242
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4243
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4244

Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 4245
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 4246
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 4247
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 4248
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 4249
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 4250

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 4251
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4252
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 4254
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 4256

“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 4258
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 4259


HG235; HG236; HG237; HG238; HG239; HG240], there are some endeavors to formalize 4282
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4283
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4284

HG150b; HG151b; HG152b; HG153b; HG154b; HG155b; HG156b]. Two popu- 4295
lar scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, 4296
on neutrosophic science is on [HG32b; HG44b]. 4297
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4298
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4299
than 4216 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4300
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4301

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4308
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4309
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4310
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 4311
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 4312
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 4313

HG231; HG232; HG233; HG234; HG235; HG236; HG237; HG238; HG239; HG240] 4329
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4330


Bibliography 4344
10.33140/JMTCM.01.03.09) 4351
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4369
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4370
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4371
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4372
221
10.20944/preprints202301.0282.v1). 4379
10.20944/preprints202301.0267.v1). 4382
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4386

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4387
prints202301.0262.v1). 4391
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4397
prints202301.0105.v1). 4400
Preprints 2023, 2023010044 4406
(doi: 10.20944/preprints202301.0043.v1). 4409

(doi: 10.20944/preprints202212.0549.v1). 4418
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4419
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4420
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4421
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4422
(doi: 10.20944/preprints202212.0500.v1). 4425
2023, (doi: 10.5281/zenodo.7809365). 4434
2023, (doi: 10.5281/zenodo.7809358). 4437

10.5281/zenodo.7809219). 4440
HG237 [28] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4441
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 4442
10.5281/zenodo.7809328). 4443
2023, (doi: 10.5281/zenodo.7806767). 4446
2023, (doi: 10.5281/zenodo.7806838). 4449

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4451
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4452
(doi: 10.5281/zenodo.7799902). 4458
2023, (doi: 10.5281/zenodo.7804218). 4461
(doi: 10.5281/zenodo.7796334). 4464
10.5281/zenodo.7791952). 4470
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4472
10.5281/zenodo.7791982). 4473
10.5281/zenodo.7790026). 4476
HG223 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4477
10.5281/zenodo.7790052). 4479
2023, (doi: 10.5281/zenodo.7787066). 4482
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4484
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4485
10.5281/zenodo.7781476). 4488

10.5281/zenodo.7783082). 4491
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4493
10.5281/zenodo.7777857). 4494
10.5281/zenodo.7779286). 4497
(doi: 10.5281/zenodo.7771831). 4500
2023, (doi: 10.5281/zenodo.7772468). 4503
10.13140/RG.2.2.20913.25446). 4506
HG212 [50] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4507
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4508
odo.7764916). 4509
10.13140/RG.2.2.11770.98247). 4512
10.13140/RG.2.2.12400.12808). 4515
2023, (doi: 10.13140/RG.2.2.22545.10089). 4518
10.13140/RG.2.2.11377.76644). 4524
10.13140/RG.2.2.23750.96329). 4527

10.13140/RG.2.2.31366.24641). 4530
10.13140/RG.2.2.34721.68960). 4533
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4535
2023, (doi: 10.13140/RG.2.2.30212.81289). 4536
10.13140/RG.2.2.24288.35842). 4542
10.13140/RG.2.2.32467.25124). 4545
10.13140/RG.2.2.31025.45925). 4548
10.13140/RG.2.2.17184.25602). 4551
10.13140/RG.2.2.23423.28327). 4554
10.13140/RG.2.2.28456.44805). 4557
10.13140/RG.2.2.23525.68320). 4560
HG194 [68] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4561
10.13140/RG.2.2.20170.24000). 4563
10.13140/RG.2.2.36475.59683). 4566

10.13140/RG.2.2.29764.71046). 4569
2023, (doi: 10.13140/RG.2.2.18780.87683). 4572
10.13140/RG.2.2.26134.01603). 4578
HG188 [74] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4579
10.13140/RG.2.2.27392.30721). 4581
10.13140/RG.2.2.33028.40321). 4584
10.13140/RG.2.2.21389.20966). 4587
10.13140/RG.2.2.16356.04489). 4590
10.13140/RG.2.2.21756.21129). 4593
HG183 [79] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4594
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4595
10.13140/RG.2.2.30983.68009). 4596
10.13140/RG.2.2.28552.29445). 4599
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4601
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4602
10.13140/RG.2.2.35105.89447). 4605

(doi: 10.13140/RG.2.2.30072.72960). 4608
10.13140/RG.2.2.31147.52003). 4611
10.13140/RG.2.2.32825.24163). 4614
10.13140/RG.2.2.13059.58401). 4617
10.13140/RG.2.2.11172.14720). 4620
2023, (doi: 10.13140/RG.2.2.22011.80165). 4623
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4626
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4628
2023, (doi: 10.13140/RG.2.2.10493.84962). 4629
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4632
2023, (doi: 10.13140/RG.2.2.19944.14086). 4635
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4638
(doi: 10.13140/RG.2.2.33103.76968). 4641
HG167 [95] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4642
(doi: 10.13140/RG.2.2.23037.44003). 4644

(doi: 10.13140/RG.2.2.35646.56641). 4647
(doi: 10.13140/RG.2.2.18030.48967). 4650
(doi: 10.13140/RG.2.2.13973.81121). 4653
2023, (doi: 10.13140/RG.2.2.34106.47047). 4656
2023, (doi: 10.13140/RG.2.2.31956.88961). 4662
2023, (doi: 10.13140/RG.2.2.15179.67361). 4665
10.13140/RG.2.2.21510.45125). 4668
HG158 [104] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4669
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4670
2023, (doi: 10.13140/RG.2.2.13121.84321). 4671
10.13140/RG.2.2.11758.69441). 4674
2023, (doi: 10.13140/RG.2.2.31891.35367). 4677
10.13140/RG.2.2.19360.87048). 4680
HG154 [108] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4681
10.13140/RG.2.2.32363.21286). 4683

10.13140/RG.2.2.23266.81602). 4686
10.13140/RG.2.2.19911.37285). 4689
10.13140/RG.2.2.11050.90569). 4692
HG150 [112] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4693
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4694
2023, (doi: 10.13140/RG.2.2.17761.79206). 4695
HG149 [113] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4696
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4697
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4700
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4701
(doi: 10.13140/RG.2.2.30182.50241). 4704

2023, (doi: 10.13140/RG.2.2.17252.24968). 4737
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4745
2023010396 (doi: 10.20944/preprints202301.0396.v1). 4746
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4749
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4751
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4752
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4753


HG128 [133] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4758
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4759
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4760

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

10.20944/preprints202301.0282.v1). 4770
10.20944/preprints202301.0267.v1).). 4773

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4778
prints202301.0262.v1). 4782

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

10.13140/RG.2.2.35061.65767). 4791
10.13140/RG.2.2.18494.15680). 4795
10.13140/RG.2.2.32530.73922). 4799

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4801
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4802
10.13140/RG.2.2.15897.70243). 4803
10.13140/RG.2.2.32530.73922). 4807
prints202301.0105.v1). 4810

10.13140/RG.2.2.23172.19849). 4817
10.13140/RG.2.2.17385.36968). 4827
Preprints 2023, 2023010044 4830
(doi: 10.20944/preprints202301.0043.v1). 4833
2023, (doi: 10.13140/RG.2.2.28945.92007). 4836

10.13140/RG.2.2.35774.77123). 4842

10.13140/RG.2.2.29430.88642). 4848
(doi: 10.20944/preprints202212.0549.v1). 4854

10.13140/RG.2.2.19380.94084). 4857
(doi: 10.20944/preprints202212.0500.v1). 4868
10.13140/RG.2.2.20993.12640). 4871
HG952 [167] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4872

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

10.13140/RG.2.2.29173.86244). 4886
HG38 [172] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4887
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4888
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4889
2023 (doi: 10.5281/zenodo.7807782). 4891
2023 (doi: 10.5281/zenodo.7804449). 4893

(doi: 10.5281/zenodo.7792307). 4897
(doi: 10.5281/zenodo.7790728). 4899
2023 (doi: 10.5281/zenodo.7787712). 4901
10.5281/zenodo.7783791). 4903
10.5281/zenodo.7780123). 4905
(doi: 10.5281/zenodo.7773119). 4907
odo.7637762). 4909
10.5281/zenodo.7766174). 4911
10.5281/zenodo.7762232). 4913

(doi: 10.5281/zenodo.7758601). 4915
10.5281/zenodo.7754661). 4917
10.5281/zenodo.7750995) . 4919
(doi: 10.5281/zenodo.7749875). 4921
10.5281/zenodo.7747236). 4923
10.5281/zenodo.7742587). 4925
(doi: 10.5281/zenodo.7738635). 4927
10.5281/zenodo.7734719). 4929
10.5281/zenodo.7730484). 4931
(doi: 10.5281/zenodo.7730469). 4933
10.5281/zenodo.7722865). 4935
odo.7713563). 4937
odo.7709116). 4939
10.5281/zenodo.7706415). 4941
(doi: 10.5281/zenodo.7706063). 4943
(doi: 10.5281/zenodo.7701906). 4945
odo.7700205). 4947
10.5281/zenodo.7694876). 4949

10.5281/zenodo.7679410). 4951
10.5281/zenodo.7675982). 4953
10.5281/zenodo.7672388). 4955
odo.7668648). 4957
10.5281/zenodo.7662810). 4959
10.5281/zenodo.7659162). 4961
HG120b [209] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 4962
10.5281/zenodo.7653233). 4963
odo.7653204). 4965
odo.7653142). 4967
odo.7653117). 4969
odo.7653089). 4971
odo.7651687). 4973
odo.7651619). 4975
odo.7651439). 4977
odo.7650729). 4979
odo.7647868). 4981
odo.7647017). 4983
odo.7644894). 4985

odo.7641880). 4987
odo.7632923). 4989
odo.7623459). 4991
10.5281/zenodo.7606416). 4993
10.5281/zenodo.7606416). 4995
odo.7606404). 4997
10.5281/zenodo.7580018). 4999
odo.7580018). 5001
odo.7580018). 5003
odo.7579929). 5005
10.5281/zenodo.7563170). 5007
odo.7563164). 5009
odo.7563160). 5011
odo.7563160). 5013
10.5281/zenodo.7563160). 5015
10.5281/zenodo.7557063). 5017
10.5281/zenodo.7557009). 5019
10.5281/zenodo.7539484). 5021

10.5281/zenodo.7523390). 5023
10.5281/zenodo.7523390). 5025
10.5281/zenodo.7523390). 5027
odo.7574952). 5029
10.5281/zenodo.7574992). 5031
odo.7523357). 5033
10.5281/zenodo.7523357). 5035
10.5281/zenodo.7504782). 5037
10.5281/zenodo.7504782). 5039
10.5281/zenodo.7504782). 5041
10.5281/zenodo.7499395). 5043
odo.7499395). 5045
10.5281/zenodo.7499395). 5047
10.5281/zenodo.7497450). 5049
10.5281/zenodo.7497450). 5051
10.5281/zenodo.7494862). 5053
odo.7494862). 5055
10.5281/zenodo.7494862). 5057

10.5281/zenodo.7493845). 5059
10.5281/zenodo.7493845). 5061
10.5281/zenodo.7493845). 5063
odo.7539484). 5065
odo.7523390). 5067
odo.7523357). 5069
odo.7504782). 5071
odo.7499395). 5073
odo.7497450). 5075
odo.7494862). 5077
odo.7493845). 5079
odo.7480110). 5081
odo.7378758). 5083
HG32b [270] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5084
10.5281/zenodo.6320305). 5085
odo.6677173). 5087

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

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5151
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5152
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5153
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5154
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5156
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5157
deforms and it doesn’t form. 5158
Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5159
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5160
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5161
based on the fixed groups of cells or the fixed groups of group of cells? 5162
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5163
these messy and dense SuperHyperModels where embedded notions are illustrated? 5164

it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5166
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5167
the research has taken more motivations to define SuperHyperClasses and to find some 5168
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5169
some instances and examples to make clarifications about the framework of this research. The 5170
general results and some results about some connections are some avenues to make key point of 5171
this research, “Cancer’s Recognition”, more understandable and more clear. 5172
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5173
research on the modeling of the regions where are under the attacks of the cancer to 5174
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5175
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5176
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5177
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5178
instances and literature reviews have taken the whole way through. In this scientific research, 5179
the literature reviews have fulfilled the lines containing the notions and the results. The 5180
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5181
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5182
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5183
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5184
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5185
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5186
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5187
figure out the background for the SuperHyperNotions. 5188

CHAPTER 25 5189
Neutrosophic 5190
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5192
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5193
2023, (doi: 10.13140/RG.2.2.34953.52320). 5194
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5195
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5196
(doi: 10.13140/RG.2.2.33275.80161). 5197
10.13140/RG.2.2.11050.90569). 5200
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5201
10.13140/RG.2.2.17761.79206). 5203
10.13140/RG.2.2.19911.37285). 5206
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5207
10.13140/RG.2.2.23266.81602). 5209
10.13140/RG.2.2.19360.87048). 5212
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5213
10.13140/RG.2.2.32363.21286). 5215
10.13140/RG.2.2.11758.69441). 5218
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5219
10.13140/RG.2.2.31891.35367). 5221
245

10.13140/RG.2.2.21510.45125). 5224
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5225
10.13140/RG.2.2.13121.84321). 5227

CHAPTER 26 5228
New Ideas In Recognition of Cancer And 5229
Neutrosophic SuperHyperGraph By 5230
As Hyper Decompress On Super 5232
Decompensation 5233
247
CHAPTER 27 5234
ABSTRACT 5235
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperHamiltonian- 5236

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

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

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

SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expression is called Neutrosophic v- 5245
SuperHyperHamiltonian-Type-Cycle-Decomposition criteria holds 5246
∀V 0 ∈ C : C is
Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expression is called 5247

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

v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle- 5252
Decomposition. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Decomposition). Assume a Neutrosophic 5253
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5254
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperHamiltonian-Type-Cycle- 5255

Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutro- 5256
sophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle- 5257
Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for 5258
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5259
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5260
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 5261

tices such that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition; a Neutrosophic 5262
v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle- 5265
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5266
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5267

SuperHyperHamiltonian-Type-Cycle-Decomposition; an Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition 5270
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, 5271
Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian- 5272
Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) 5273

for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 5274
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5276
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5277
that they form the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition; and the Extreme power is 5278
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition 5279

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, 5280
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 5283
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 5284
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 5285
SuperHyperHamiltonian-Type-Cycle-Decomposition; and the Neutrosophic power is corresponded to its 5288
Neutrosophic coefficient; an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of 5289
Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian- 5290

Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutrosophic 5291
rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 5292
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5293
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 5294

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5295
the Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition; a Neutrosophic V-SuperHyperHamiltonian- 5296
Type-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, 5297
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 5300
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5301

cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyper- 5302
Vertices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition; an 5303
Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of 5304
rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 5307

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 5308
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 5309
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHy- 5310
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 5311
Type-Cycle-Decomposition; and the Extreme power is corresponded to its Extreme coefficient; a 5312
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of 5313

rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 5316
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 5317
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5318
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5319

cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 5320
tices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition; and the 5321
Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5322
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperHamiltonian-Type-Cycle- 5323
Decomposition and Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. Two different types of 5324
SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNo- 5325
tion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 5326
The literature review is implemented in the whole of this research. For shining the elegancy 5327
and the significancy of this research, the comparison between this SuperHyperNotion with other 5328
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 5329
followed by the examples and the instances thus the clarifications are driven with different tools. 5330
The applications are figured out to make sense about the theoretical aspect of this ongoing research. 5331
The “Cancer’s Recognition” are the under research to figure out the challenges make sense about 5332
ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. 5333
There are different types of them. Some of them are individuals and some of them are well- 5334
modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the 5335
relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 5336
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5337
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research on 5338
theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. 5339
It’s also officially collected in the form of some questions and some problems. Assume a Supe- 5340

rHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperHamiltonian-Type-Cycle-Decomposition 5341

is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5342
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5343
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5344
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5345
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Decomposition 5346
is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5347

such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5348
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5349
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5350
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 5351
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 5352
a SuperHyperHamiltonian-Type-Cycle-Decomposition . Since there’s more ways to get type-results to 5353

make a SuperHyperHamiltonian-Type-Cycle-Decomposition more understandable. For the sake of having 5354
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a need to “redefine” the notion of 5355
a “SuperHyperHamiltonian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 5356
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 5357
the position of labels to assign to the values. Assume a SuperHyperHamiltonian-Type-Cycle-Decomposition 5358
. It’s redefined a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if the mentioned Table 5359

holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy- 5360
perEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of 5361
The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5362
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5363
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5364
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5365
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5366
on a SuperHyperHamiltonian-Type-Cycle-Decomposition . It’s the main. It’ll be disciplinary to have the 5367
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 5368
all SuperHyperHamiltonian-Type-Cycle-Decomposition until the SuperHyperHamiltonian-Type-Cycle-Decomposition, 5369
then it’s officially called a “SuperHyperHamiltonian-Type-Cycle-Decomposition” but otherwise, it isn’t a 5370
SuperHyperHamiltonian-Type-Cycle-Decomposition . There are some instances about the clarifications for 5371
the main definition titled a “SuperHyperHamiltonian-Type-Cycle-Decomposition ”. These two examples 5372
get more scrutiny and discernment since there are characterized in the disciplinary ways of 5373
the SuperHyperClass based on a SuperHyperHamiltonian-Type-Cycle-Decomposition . For the sake of 5374
having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a need to “redefine” 5375
the notion of a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition” and a “Neutrosophic 5376

SuperHyperHamiltonian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 5377
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 5378
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 5379
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 5380
SuperHyperHamiltonian-Type-Cycle-Decomposition are redefined to a “Neutrosophic SuperHyperHamiltonian- 5381
Type-Cycle-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 5382
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5383
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition more understandable. Assume a Neut- 5384
rosophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 5385
Table holds. Thus SuperHyperPath, SuperHyperHamiltonian-Type-Cycle-Decomposition, SuperHyperStar, 5386

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5387

SuperHyperPath”, “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition”, “Neutrosophic Su- 5388
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 5389
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 5390
has a “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition” where it’s the strongest [the 5391
maximum Neutrosophic value from all the SuperHyperHamiltonian-Type-Cycle-Decomposition amid the 5392
maximum value amid all SuperHyperVertices from a SuperHyperHamiltonian-Type-Cycle-Decomposition .] 5393

SuperHyperHamiltonian-Type-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a SuperHyper- 5394
Graph and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 5395
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 5396
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 5397
it’s SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s only one SuperVertex as intersection amid 5398
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 5399
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 5400
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 5401
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 5402
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 5403
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex as 5404
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with 5405
any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific 5406
architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic 5407
SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are 5408
SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between 5409
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. 5410
Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality 5411
to have more precise SuperHyperModel which in this case the SuperHyperModel is called 5412
“Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognition” 5413
and the results and the definitions will be introduced in redeemed ways. The recognition of the 5414
cancer in the long-term function. The specific region has been assigned by the model [it’s called 5415
indeterminacy and neutrality about the moves and the effects of the cancer on that region; this 5418
event leads us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have 5419
convenient perception on what’s happened and what’s done. There are some specific models, 5420
which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyper- 5421
Models. The moves and the traces of the cancer on the complex tracks and between complicated 5422
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian- 5423
Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5424
perWheel). The aim is to find either the longest SuperHyperHamiltonian-Type-Cycle-Decomposition or 5425
the strongest SuperHyperHamiltonian-Type-Cycle-Decomposition in those Neutrosophic SuperHyperModels. 5426
For the longest SuperHyperHamiltonian-Type-Cycle-Decomposition, called SuperHyperHamiltonian-Type-Cycle- 5427
Decomposition, and the strongest SuperHyperHamiltonian-Type-Cycle-Decomposition, called Neutrosophic 5428

SuperHyperHamiltonian-Type-Cycle-Decomposition, some general results are introduced. Beyond that in 5429
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 5430
enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5431
SuperHyperHamiltonian-Type-Cycle-Decomposition. There isn’t any formation of any SuperHyperHamiltonian- 5432

but literarily, it’s the deformation of any SuperHyperHamiltonian-Type-Cycle-

. It, literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic
Decomposition 5434
SuperHyperHamiltonian-Type-Cycle-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHy- 5435
perGraphs theory are proposed. 5436
Keywords: Neutrosophic SuperHyperGraph, SuperHyperHamiltonian-Type-Cycle-Decomposition, Can- 5437
cer’s Neutrosophic Recognition 5438


CHAPTER 28 5440
Applied Notions Under The Scrutiny Of 5441
The Motivation Of This Scientific 5442
Research 5443
In this scientific research, there are some ideas in the featured frameworks of motivations. 5444
I try to bring the motivations in the narrative ways. Some cells have been faced with some 5445
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5446
some embedded analysis on the ongoing situations which in that, the cells could be labelled as 5447
some groups and some groups or individuals have excessive labels which all are raised from 5448
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5449
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5450
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5451
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5452
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5453
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5454
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5455
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5456
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5457
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5458
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5459
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5460
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5461
the disease but the model is going to figure out what’s going on this phenomenon. The special 5462
case of this disease is considered and as the consequences of the model, some parameters are 5463
used. The cells are under attack of this disease but the moves of the cancer in the special region 5464
are the matter of mind. The recognition of the cancer could help to find some treatments for this 5465
disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels 5466
on the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5467
the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5470
the architecture are formally called “ SuperHyperHamiltonian-Type-Cycle-Decomposition” in the themes 5471
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 5472
255
styles to figure out the background for the SuperHyperNotions. The recognition of the cancer 5473
in the long-term function. The specific region has been assigned by the model [it’s called 5474
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 5477
this event leads us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] 5478
to have convenient perception on what’s happened and what’s done. There are some specific 5479
models, which are well-known and they’ve got the names, and some general models. The 5480
moves and the traces of the cancer on the complex tracks and between complicated groups of 5481
cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperHamiltonian-Type-Cycle- 5482
Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 5483
The aim is to find either the optimal SuperHyperHamiltonian-Type-Cycle-Decomposition or the Neutrosophic 5484
SuperHyperHamiltonian-Type-Cycle-Decomposition in those Neutrosophic SuperHyperModels. Some general 5485

results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 5486
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5487
SuperHyperEdges to form any style of a SuperHyperHamiltonian-Type-Cycle-Decomposition. There isn’t 5488
any formation of any SuperHyperHamiltonian-Type-Cycle-Decomposition but literarily, it’s the deformation 5489
of any SuperHyperHamiltonian-Type-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. 5490
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 5491
the “ amount of SuperHyperHamiltonian-Type-Cycle-Decomposition” of either individual of cells or the 5492

groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 5493
SuperHyperHamiltonian-Type-Cycle-Decomposition” based on the fixed groups of cells or the fixed groups 5494
of group of cells? 5495
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5496
these messy and dense SuperHyperModels where embedded notions are illustrated? 5497
it motivates us to define different types of “ SuperHyperHamiltonian-Type-Cycle-Decomposition” and “Neut- 5499

rosophic SuperHyperHamiltonian-Type-Cycle-Decomposition” on “SuperHyperGraph” and “Neutrosophic 5500
SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5501
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5502
motivates us to get some instances and examples to make clarifications about the framework of 5503
this research. The general results and some results about some connections are some avenues to 5504
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5505
The framework of this research is as follows. In the beginning, I introduce basic definitions to 5506
clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHy- 5507
perGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth-discussed. 5508
The elementary concepts are clarified and illustrated completely and sometimes review literature 5509
are applied to make sense about what’s going to figure out about the upcoming sections. The main 5510
definitions and their clarifications alongside some results about new notions, SuperHyperHamiltonian- 5511
Type-Cycle-Decomposition and Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, are figured out in 5512
sections “ SuperHyperHamiltonian-Type-Cycle-Decomposition” and “Neutrosophic SuperHyperHamiltonian-Type- 5513
Cycle-Decomposition”. In the sense of tackling on getting results and in Hamiltonian-Type-Cycle-Decomposition 5514
to make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5515
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5516
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5517

and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5518
there are some smart steps toward the common notions to extend the new notions in new 5519
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 5520
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5521
about the general SuperHyperRelations and as concluding and closing section of theoretical 5522
research are contained in the section “General Results”. Some general SuperHyperRelations 5523
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 5524
discussed in the sections, “General Results”, “ SuperHyperHamiltonian-Type-Cycle-Decomposition”, “Neut- 5525
rosophic SuperHyperHamiltonian-Type-Cycle-Decomposition”, “Results on SuperHyperClasses” and “Results 5526
on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done about 5527
the SuperHyperNotions to make sense about excellency of this research and going to figure 5528
out the word “best” as the description and adjective for this research as presented in section, 5529
“ SuperHyperHamiltonian-Type-Cycle-Decomposition”. The keyword of this research debut in the section 5530

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

CHAPTER 29 5539
Neutrosophic Preliminaries Of This 5540
Scientific Research On the Redeemed 5541
Ways 5542
In this section, the basic material in this scientific research, is referred to [Single Valued 5543
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5544

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5545
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5546
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5547
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5548
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5549
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5550
their clarifications are addressed to Ref.[HG38]. 5551
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5552
the new ideas and their clarifications are elicited. 5553
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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 [. 5554
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

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). 5555
where 5557
1, 2, . . . , n0 ); 5562
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5563
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5564

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5593
x, y, z, w ∈ [0, 1]: 5594
(i) 1 ⊗ x = x; 5595
(ii) x ⊗ y = y ⊗ x; 5596
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5597
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5598

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

where 5601

1, 2, . . . , n0 ); 5606
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5607
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5608
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5609
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5610
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5622
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5623
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5624
SuperEdge; 5630
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5633
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5634
makes the patterns and regularities. 5635
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5636
of elements of SuperHyperEdges are the same. 5637

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5638
makes to have SuperHyperUniform more understandable. 5639
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5640
Classes as follows. 5641
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5642
two given SuperHyperEdges with two exceptions; 5643
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5644
SuperHyperEdges; 5645
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5646
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5647
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5648
in common; 5649
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5650
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5651
SuperHyperEdge in common; 5652
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5653
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5654
SuperVertex. 5655
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 5656
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5657
(i) Vi , Vi+1 ∈ Ei0 ; 5658
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5659
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5660
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5661
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5662
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5663
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5664
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5665
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5667
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5668
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5669
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5670
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5671
perPath . 5672
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 5673
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5674
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5675
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5676
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5677
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5678

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

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


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

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

).
(i) Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 5699

sion is called Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 5700
holds 5701
∀E 0 ∈ C : C is
(ii) Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 5702
sion is called Neutrosophic re-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 5703

holds 5704
∀E 0 ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5705
(iii) Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following expres- 5706

sion is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition criteria 5707
holds 5708
∀V 0 ∈ C : C is
(iv) Neutrosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition if the following ex- 5709

pression is called Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition cri- 5710
teria holds 5711
∀V 0 ∈ C : C is

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

rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition. 5716
Definition 29.0.19. ((Neutrosophic) SuperHyperHamiltonian-Type-Cycle-Decomposition). 5717

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

e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperHamiltonian-Type- 5721
Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type-Cycle-Decomposition, and Neutro- 5722
sophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme Su- 5723

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5725
(ii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutro- 5728

rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic 5731
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the 5732
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutro- 5733
sophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic 5734

SuperHyperVertices such that they form the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 5735
Decomposition; 5736
(iii) an Extreme SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolynomial 5737

if it’s either of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic 5738
re-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type- 5739

maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHy- 5743
perSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 5744
Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian-Type- 5745
Cycle-Decomposition; and the Extreme power is corresponded to its Extreme coefficient; 5746
(iv) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 5747




power is corresponded to its Neutrosophic coefficient; 5757
(v) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either of Neutro- 5758

rosophic rv-SuperHyperHamiltonian-Type-Cycle-Decomposition and C(N SHG) for an Extreme Su- 5761

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 5763
(vi) a Neutrosophic V-SuperHyperHamiltonian-Type-Cycle-Decomposition if it’s either 5766

of Neutrosophic e-SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic re- 5767
SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperHamiltonian-Type- 5768
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5770

(vii) an Extreme V-SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 5775


C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHy- 5779
perPolynomial contains the Extreme coefficients defined as the Extreme number of the 5780
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Supe- 5781
rHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 5782
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperHamiltonian- 5783
Type-Cycle-Decomposition; and the Extreme power is corresponded to its Extreme coefficient; 5784
(viii) a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition SuperHyperPolyno- 5785



power is corresponded to its Neutrosophic coefficient. 5795
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperHamiltonian-Type-Cycle-Decomposition). 5796
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5797


136TBL3
(i) an δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is a Neutrosophic kind of Neutro- 5798
sophic SuperHyperHamiltonian-Type-Cycle-Decomposition such that either of the following expres- 5799

sions hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5800
|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 5801

(29.1), holds if S is an δ−SuperHyperDefensive; 5802
(ii) a Neutrosophic δ−SuperHyperHamiltonian-Type-Cycle-Decomposition is a Neutrosophic 5803

kind of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition such that either of 5804
the following Neutrosophic expressions hold for the Neutrosophic cardinalities of 5805
SuperHyperNeighbors of s ∈ S : 5806
|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 5807

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5808
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 5810

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 5811
procedure, there’s the usage of the position of labels to assign to the values. 5812
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 5814
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5815
to get Neutrosophic type-results to make a Neutrosophic more understandable. 5816
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus 5818
Neutrosophic SuperHyperPath , SuperHyperHamiltonian-Type-Cycle-Decomposition, SuperHyperStar, 5819
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5820
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5821
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5822
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5823

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperHamiltonian- 5824

. Since there’s more ways to get type-results to make a Neutrosophic
SuperHyperHamiltonian-Type-Cycle-Decomposition more Neutrosophicly understandable. 5826
For the sake of having a Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, there’s a need to 5827
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition”. 5828

The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 5829
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5830
5831
136DEF1 Definition 29.0.23. Assume a SuperHyperHamiltonian-Type-Cycle-Decomposition. It’s redefined a 5832

Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition if the Table (29.3) holds. 5833

CHAPTER 30 5834
Neutrosophic SuperHyper But Hamiltonian-Type-Cycle-Decomposition 5835
As The Extensions Excerpt From Dense 5836
And Super Forms 5837
Definition 30.0.1. (Neutrosophic event). 5838

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5839
is a probability Hamiltonian-Type-Cycle-Decomposition. Any Neutrosophic k-subset of A of V is 5840
called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5841
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5842
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5843

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5844
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. s Neutrosophic k-events Ai , i ∈ I 5845

is called Neutrosophic s-independent if the following expression is called Neutrosophic 5846
s-independent criteria 5847
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. 5848
The following expression is called Neutrosophic independent criteria 5849
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5850

is a probability Hamiltonian-Type-Cycle-Decomposition. Any k-function Hamiltonian-Type-Cycle-Decomposition 5852
like E is called Neutrosophic k-Variable. If k = 2, then any 2-function Hamiltonian-Type-Cycle- 5853
Decomposition like E is called Neutrosophic Variable. 5854
The notion of independent on Neutrosophic Variable is likewise. 5855
271
Definition 30.0.4. (Neutrosophic Expectation). 5856

is a probability Hamiltonian-Type-Cycle-Decomposition. A Neutrosophic k-Variable E has a number 5858
is called Neutrosophic Expectation if the following expression is called Neutrosophic 5859
Expectation criteria 5860
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5861

is a probability Hamiltonian-Type-Cycle-Decomposition. A Neutrosophic number is called Neutrosophic 5863
Crossing if the following expression is called Neutrosophic Crossing criteria 5864
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). 5865
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let m and n propose special 5866
Hamiltonian-Type-Cycle-Decomposition. Then with m ≥ 4n, 5867
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-Type-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: 5868
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
5869
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5870
n points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 5872
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5873

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5874

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5875
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5876
SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5877
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5878
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 . 5879
n points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 5882
Then k < 5n4/3 . 5883
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5884
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Draw a SuperHyperUnit Supe- 5885
rHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic number of 5886
P n−1
these SuperHyperCircles passing through exactly i points of P. Then i = 0 n i = n and 5887
k = 12 i = 0n−1 ini . Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex
P
5888
SuperHyperSet P whose SuperHyperEdges are the SuperHyperArcs between conseNeighborive 5889

SuperHyperPoints on the SuperHyperCircles that pass through at least three SuperHyperPoints 5890
of P. Then 5891
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 5892

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

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5903
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let Xn be a nonnegative 5904
integer-valued variable in a probability Hamiltonian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If 5905
E(Xn ) → 0 as n → ∞, then P (Xn = 0) → 1 as n → ∞. 5906
Proof. 5907
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. A special SuperHyperGraph 5909
in Gn,p almost surely has stability number at most d2p−1 log ne. 5910
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. A special SuperHyperGraph in Gn,p 5912
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5913
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5914
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5915
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5916
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5917
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5918
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 5919
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5920

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

Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let X be a Neutrosophic 5933
Variable and let t be a positive real number. Then 5934
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let X be a Neutrosophic Variable 5936
and let t be a positive real number. Then 5937
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5938
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let Xn be a Neutrosophic 5940

Variable in a probability Hamiltonian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 5941
V (Xn ) << E 2 (Xn ), then 5942
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 5944
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5945
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5946
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 5948
0 ≤ k ≤ n, set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which 5949
f (k) is less than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5950
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. As in the proof of related Theorem, 5952
the result is straightforward. 5953
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and 5955
k ∗ be as defined in previous Theorem. Then either: 5956
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5957
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5958

Definition 30.0.17. (Neutrosophic Threshold). 5961

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5962
S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let P be a monotone property 5963
of SuperHyperGraphs (one which is preserved when SuperHyperEdges are added). Then a 5964
Neutrosophic Threshold for P is a function f (n) such that: 5965
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5966
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5967
Definition 30.0.18. (Neutrosophic Balanced). 5968
is a probability Hamiltonian-Type-Cycle-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. 5970
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 5971
SubSuperHyperGraph is called Neutrosophic Balanced. 5972
Consider S = (V, E) is a probability Hamiltonian-Type-Cycle-Decomposition. Let F be a nonempty 5974
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5975
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5976
SubSuperHyperGraph. 5977
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5980
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5981
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5982
SuperHyperHamiltonian-Type-Cycle-Decomposition, is up. The Neutrosophic Algorithm is Neutro- 5983

sophicly straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 5984
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5985
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5986
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5987
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5988
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5989

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

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

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

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

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

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyper- 5995
Neighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 5996
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 5997
HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 5998
V3 , is excluded in every given Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. 5999

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


sophicly straightforward. 6003

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


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




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




= {{E1 }}.
= z.
= {{V1 , V2 , V3 , V4 , V5 }}.
= z5.
6012


= {{Ei=110 , Ej=2232 , E12 }}.



= 11z 22 .
= {{Vi ∈ VN SHG }}.
= z 22 .
6016


= {{E15 , E13 , E16 , E14 , E17 , E12 }, . . .}.
= 3z 6 .
= {{Vi ∈ VN SHG }}.


= z 14 .
6020


= {{E2 }, {E3 }}.
= 2z.
= {{Vi=811 , V!4 }}.
= z 14 .
6024



= {{Ei=110 , E22 , E12 }}.

= 11z 12 .
= {{Vi ∈ VN SHG }}.
= z 22 .
6028


= {{E1 , E6 , E2 , E7 , E3 , E4 }, . . .}.
= 3z 6 .
= {{Vi ∈ VN SHG }}.


= z 14 .
6032


= {{E1 , E6 , E3 , E8 }, . . .}.
= 3z 4 .
= {{Vi ∈ VN SHG }}.
= z6.
6036






= {{E1 }}.
= z.
= {{V1 , V2 , V3 , V7 , V8 }}.
= z5.
6040


= {{E9 , E6 , E3 , E8 }, . . .}.
= 3z 4 .



= {{Vi ∈ VN SHG }}.
= z6.
6044


= {{E1 }, {E2 }}.
= z.
= {{V1 , V2 }, {V1 , V3 }}.
= 2z 2 .
6048




= {{E4 }, . . .}.
= 5z.
= {{V3 , V4 }, . . .}.
= 5z 2 .
6052




= {{E4 }, . . .}.
= 5z.
= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
6056


= {{E4 }, . . .}.
= 6z.



= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
6060


= {{E4 }, . . .}.
= 6z.
= {{Vi=817 }, . . .}.
= z 10 + . . . + z 2 .
6064






= {{Ei=112 }}.
X
= aj z |Ei=112 | .
= {{Vi ∈ VN SHG }}.
X
= ai z bj .
6068


= {E6 , . . .}.


= z |E6 | + . . . .
= {Vi ∈ VE6 , . . .}.
X
= ai z bj .
6072


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


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


= {{E2 }, . . .}.
= 4z.
= {Vi ∈ VE2 , . . .}.
= z 10 + . . . .


Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2
6080
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6081
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type- 6082
Cycle-Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6083
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6084
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6085
of them. 6086
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6087

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6088
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6089
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor 6090
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6091
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 6092
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor 6093
to some of them but not all of them. 6094
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-Type-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle- 6095
Decomposition is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6096
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6097
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6098
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6099
to Neutrosophic Hamiltonian-Type-Cycle-Decomposition in some cases but the maximum number of 6100
the Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 6101
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6102
R-Hamiltonian-Type-Cycle-Decomposition. 6103
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E).

Then the Neutrosophic number of type-result-R-Hamiltonian-Type-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-Type-Cycle-Decomposition with the least Neutrosophic 6104

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

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

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

the lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Type-Cycle- 6109
Decomposition is the cardinality of 6110
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.

C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−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-Type-
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-Type-Cycle-Decomposition. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-Type-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-Type-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-Type-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-Type-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-Type-Cycle-Decomposition has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Hamiltonian-
Type-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-Type-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-Type-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-Type-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-Type-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-Type-Cycle-
Decomposition. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Hamiltonian-Type-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-Type-Cycle-Decomposition is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Hamiltonian-Type-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-Type-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, 6111
Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6112
Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Hamiltonian-Type-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-Type-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-Type-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle- 6113
Decompositionis at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6114

of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Supe- 6115
rHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6116
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6117
to Neutrosophic Hamiltonian-Type-Cycle-Decomposition in some cases but the maximum number of 6118
the Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 6119
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6120
R-Hamiltonian-Type-Cycle-Decomposition. 6121
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6122
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6123
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6124
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6125
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6126
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6127
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6128
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6129
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6130
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms 6131
a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition where the Neutrosophic completion of 6132
the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded 6133
R-Hamiltonian-Type-Cycle-Decomposition. The SuperHyperNotions of embedded SuperHyperSet and 6134
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 6135
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 6136
those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re 6137
Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHy- 6138
perVertices are included in the minimum Neutrosophic style of the embedded Neutrosophic 6139
R-Hamiltonian-Type-Cycle-Decomposition. The interior types of the Neutrosophic SuperHyperVertices 6140
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6141
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6142
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6143
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Hamiltonian-Type- 6144
Cycle-Decomposition. Thus Neutrosophic exterior SuperHyperVertices could be used only in one 6145
Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior 6146
Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded 6147
Neutrosophic Hamiltonian-Type-Cycle-Decomposition, there’s the usage of exterior Neutrosophic SuperHy- 6148
perVertices since they’ve more connections inside more than outside. Thus the title “exterior” is 6149
more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, 6150
inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with 6151
one SuperHyperElement has been ignored in the exploring to lead on the optimal case implying 6152
the Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition. The Neutrosophic R-Hamiltonian-Type-Cycle- 6153
Decomposition with the exclusion of the exclusion of all Neutrosophic SuperHyperVertices in one 6154
Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic R-Hamiltonian-Type-Cycle- 6155
Decomposition with the inclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic 6156
SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition. To sum them up, 6157
in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only 6158
one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6159
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6160

quasi-R-Hamiltonian-Type-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor to some of 6161

them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6162
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6163
quasi-R-Hamiltonian-Type-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of 6164
them but not all of them. 6165
The main definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition has two titles. a 6166
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition and its corresponded quasi-maximum 6167
Neutrosophic R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For 6168
any Neutrosophic number, there’s a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decomposition with 6169
that quasi-maximum Neutrosophic SuperHyperCardinality in the terms of the embedded 6170
Neutrosophic SuperHyperGraph. If there’s an embedded Neutrosophic SuperHyperGraph, 6171
then the Neutrosophic quasi-SuperHyperNotions lead us to take the collection of all the 6172
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decompositions for all Neutrosophic numbers less than 6173
its Neutrosophic corresponded maximum number. The essence of the Neutrosophic Hamiltonian- 6174
Type-Cycle-Decomposition ends up but this essence starts up in the terms of the Neutrosophic 6175
quasi-R-Hamiltonian-Type-Cycle-Decomposition, again and more in the operations of collecting all the 6176
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Decompositions acted on the all possible used formations 6177
of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic number. This Neutrosophic 6178
number is 6179
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Decompositions. 6180
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Type-Cycle-Decomposition 6181
be a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Type- 6182
Cycle-Decomposition. Then 6183
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Hamiltonian-Type-Cycle-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Hamiltonian-Type-Cycle-Decomposition is 6184

re-formalized and redefined as follows. 6185
GNeutrosophic Hamiltonian-Type-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 6186
definition for the Neutrosophic Hamiltonian-Type-Cycle-Decomposition. 6187
GNeutrosophic Hamiltonian-Type-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 6188
poses the upcoming expressions.
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6190
= max zNeutrosophic Number

And then, 6191

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


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


6194

6195

Now, the extension of these types of approaches is up. Since the new term, “Neutro- 6196
sophic SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic 6197
SuperHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are in- 6198
cident to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic 6199
Quasi-Hamiltonian-Type-Cycle-Decomposition” but, precisely, it’s the generalization of “Neutrosophic 6200
Quasi-Hamiltonian-Type-Cycle-Decomposition” since “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Decomposition” 6201
happens “Neutrosophic Hamiltonian-Type-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph 6202
as initial framework and background but “Neutrosophic SuperHyperNeighborhood” may not 6203
happens “Neutrosophic Hamiltonian-Type-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph 6204
as initial framework and preliminarily background since there are some ambiguities about 6205
the Neutrosophic SuperHyperCardinality arise from it. To get orderly keywords, the terms, 6206
“Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Decomposition”, 6207
and “Neutrosophic Hamiltonian-Type-Cycle-Decomposition” are up. 6208
Thus, let zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and GNeutrosophic Hamiltonian-Type-Cycle-Decomposition
6209
be a Neutrosophic number, a Neutrosophic SuperHyperNeighborhood and a Neutrosophic 6210
Hamiltonian-Type-Cycle-Decomposition and the new terms are up. 6211

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


|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6213
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6214
And with go back to initial structure, 6215


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


6217

6218

Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior Neutro-
sophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type-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-Type-Cycle-Decomposition.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-

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

perHyperGraph 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-Type-Cycle-Decomposition
is related to the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,

There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Decomposition is up.
The obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-
Type-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-Type-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 SuperHyper-
Vertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition C(ESHG) for an Neutrosophic SuperHyper-
Graph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVer-
tices such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyper-
Vertices instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic
Hamiltonian-Type-Cycle-Decomposition and it’s an Neutrosophic Hamiltonian-Type-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-Type-Cycle-Decomposition. There isn’t only less
than two Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-

, not:
Is the Neutrosophic SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6219
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6220
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6221
type-SuperHyperSet called the 6222
“Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition” 6223
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6224
Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition, 6225
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-Type-Cycle-Decomposition amid those obvious simple Neutrosophic
type-SuperHyperSets of the Neutrosophic Hamiltonian-Type-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-Type-Cycle-Decomposition. In other words, the least cardinality, the

lower sharp bound for the cardinality, of a Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition is the
cardinality of
6226
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all in- 6227
terior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type-Cycle- 6228
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6229
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6230
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6231
amount of them. 6232

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6233
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6234
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6235
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6236
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6237
Consider there’s a Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition with the least cardinality, the 6238

lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6239
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6240
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6241
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6242
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition. Since 6243
it doesn’t have 6244
6245
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6246
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6247
some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic 6248
SuperHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutro- 6249
sophic SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic 6250
R-Hamiltonian-Type-Cycle-Decomposition. Since it doesn’t do the Neutrosophic procedure such that 6251

such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyper- 6252
Vertices uniquely [there are at least one Neutrosophic SuperHyperVertex outside implying 6253
there’s, sometimes in the connected Neutrosophic SuperHyperGraph ESHG : (V, E), a 6254
Neutrosophic SuperHyperVertex, titled its Neutrosophic SuperHyperNeighbor, to that Neut- 6255
rosophic SuperHyperVertex in the Neutrosophic SuperHyperSet S so as S doesn’t do “the 6256
Neutrosophic procedure”.]. There’s only one Neutrosophic SuperHyperVertex outside the 6257
intended Neutrosophic SuperHyperSet, VESHE ∪ {z}, in the terms of Neutrosophic Su- 6258
perHyperNeighborhood. Thus the obvious Neutrosophic R-Hamiltonian-Type-Cycle-Decomposition, 6259
VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6260
R-Hamiltonian-Type-Cycle-Decomposition, VESHE , is a Neutrosophic SuperHyperSet, VESHE , includes 6261
only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs are 6262
titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6263

ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6264
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6265
SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6266
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a 6267
connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Hamiltonian-Type- 6268
Cycle-Decomposition only contains all interior Neutrosophic SuperHyperVertices and all exterior 6269
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6270
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6271
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6272
to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6273
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6274

The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Decomposition, is up. There’s neither empty 6275
SuperHyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neut- 6276
rosophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet 6277
of the Neutrosophic Hamiltonian-Type-Cycle-Decomposition. The Neutrosophic SuperHyperSet of 6278
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6279
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−Decomposition

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−DecompositionSuperHyperP olynomial = az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type- 6280

Cycle-Decomposition. The Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6281

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Type-Cycle-Decomposition C(ESHG) for an Neutrosophic Super- 6283

HyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6284
6285
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6287
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6288
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6289
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6290
non-obvious Neutrosophic Hamiltonian-Type-Cycle-Decomposition is up. The obvious simple Neutrosophic 6291

type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Decomposition is a Neutrosophic 6292
SuperHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6293
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6294

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

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


= 2z b 2 c
.
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian- 6299

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is an Neutrosophic Hamiltonian-Type-Cycle-Decomposition C(ESHG) for an Neutrosophic SuperHy- 6302

perGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHy- 6303
perVertices such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic 6304
SuperHyperVertices given by that Neutrosophic type-SuperHyperSet called the Neutrosophic 6305

Hamiltonian-Type-Cycle-Decomposition and it’s an Neutrosophic Hamiltonian-Type-Cycle-Decomposition. 6306
Since it’s 6307
6308
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6310
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6311

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6312
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6313

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

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

= 2z b 2 c
.
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type- 6315
Cycle-Decomposition, not: 6316

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
Is the Neutrosophic SuperHyperSet, not: 6317

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

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

CHAPTER 31 6326
The Neutrosophic Departures on The 6327
Theoretical Results Toward Theoretical 6328
Motivations 6329
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6330
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6332

= {{Eimax }, . . . , {Eimin }}.
max min
= z |Ei |
+ . . . + z |Ei |
.
= {{Vi ∈ Eimax }, . . . , {Vi ∈ Eimin }}.
max min
= z |{Vi ∈Ei }|
+ . . . + z |{Vi ∈Ei }|
.
Proof. Let 6333
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6334
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). 6335


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

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

= {{Vi ∈ VN SHG }}.

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


136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6352
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6353
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6354
Decomposition. 6355

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

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

= {{Eimax }, . . . , {Eimin }}.
max min
= z |Ei |
+ . . . + z |Ei |
.
= {{Vi ∈ Eimax }, . . . , {Vi ∈ Eimin }}.
max min
= z |{Vi ∈Ei }|
+ . . . + z |{Vi ∈Ei }|
.
Proof. Let 6357
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6358
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

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

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6364
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6365
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6366
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6367
the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. 6368
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6369

Then 6370

= {{Pimax }, . . . , {Pimin }}.
max min
= z |Pi |
+ . . . + z |Pi |
.
= {{Vi ∈ Pimax }, . . . , {Vi ∈ Pimin }}.
max min
= z |{Vi ∈Pi }|
+ . . . + z |{Vi ∈Pi }|
.
Proof. Let 6371
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6372
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). 6373

Type-Cycle-Decomposition could be applied. There are only two SuperHyperParts. Thus every 6379
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperHamiltonian-Type-Cycle-Decomposition taken from a connected Neutrosophic 6381

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6382
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6383
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6385
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6386
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6387

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6388
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6389
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6391
Then 6392

= {{Pimax }, . . . , {Pimin }}.

max min
= z |Pi |
+ . . . + z |Pi |
.
= {{Vi ∈ Pimax }, . . . , {Vi ∈ Pimin }}.
max min
= z |{Vi ∈Pi }|
+ . . . + z |{Vi ∈Pi }|
.
Proof. Let 6393
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6394
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 6396


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

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6408
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6409
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6410
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6411
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperHamiltonian-Type- 6412
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6414
Then, 6415

= {{Ei=1|EN SHG |−1 , Ea∗ , Eb∗ }}.
= |EN SHG |z |EN SHG |+1 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .

Proof. Let 6416
P :
CEN T ER, E2∗
6417
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

straightforward. Then there’s at least one SuperHyperHamiltonian-Type-Cycle-Decomposition. Thus 6422
the notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperHamiltonian- 6423
Type-Cycle-Decomposition could be applied. The unique embedded SuperHyperHamiltonian-Type-Cycle- 6424
Decomposition proposes some longest SuperHyperHamiltonian-Type-Cycle-Decomposition excerpt from some 6425
representatives. The latter is straightforward. 6426
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6427
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6428
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6429
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6430
SuperHyperModel (31.6), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. 6431

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in the Neutrosophic Example
(42.0.15) 136NSHG23a

CHAPTER 32 6432
The Surveys of Mathematical Sets On 6433
The Results But As The Initial Motivation 6434
For the SuperHyperHamiltonian-Type-Cycle-Decomposition, Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6435

Decomposition, and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition, some general results 6436
are introduced. 6437
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition is 6438

“redefined” on the positions of the alphabets. 6439
Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition. Then 6440
N eutrosophic SuperHyperHamiltonian − T ype − Cycle − Decomposition =

{theSuperHyperHamiltonian − T ype − Cycle − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − Decomposition
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−Decomposition. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6441
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6442
the neutrality, for i = 1, 2, 3, respectively. 6443
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6444
the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition and 6445
SuperHyperHamiltonian-Type-Cycle-Decomposition coincide. 6446
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6447
alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6448

SuperHyperHamiltonian-Type-Cycle-Decomposition if and only if it’s a SuperHyperHamiltonian-Type-Cycle- 6449
Decomposition. 6450
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6451
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6452
SuperHyperHamiltonian-Type-Cycle-Decomposition if and only if it’s a longest SuperHyperHamiltonian-Type- 6453

325
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6455

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition 6456
is its SuperHyperHamiltonian-Type-Cycle-Decomposition and reversely. 6457
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 6458

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 6459
on the same identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type- 6460
Cycle-Decomposition is its SuperHyperHamiltonian-Type-Cycle-Decomposition and reversely. 6461
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6462

SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined if and only if its SuperHyperHamiltonian- 6463
Type-Cycle-Decomposition isn’t well-defined. 6464
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6465

its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined if and only if its 6466

Decomposition 6469
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined if and only if 6470
its SuperHyperHamiltonian-Type-Cycle-Decomposition isn’t well-defined. 6471
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6472
SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined if and only if its SuperHyperHamiltonian- 6473

Type-Cycle-Decomposition is well-defined. 6474
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6475
its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined if and only if its 6476


Decomposition 6479
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition is well-defined if and only if its 6480
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6482
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6483
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6484
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6485
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6486
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6487
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 6488
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6489

(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6492
Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6496

independent SuperHyperSet is 6497
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6500
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6504

perGraph which is a SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath. Then V is a 6505
maximal 6506
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6510
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6511
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6512
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6514

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6515
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6519
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6520
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6521

Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6523
Graph which is a SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath. Then the number 6524

of 6525
(i) : the SuperHyperHamiltonian-Type-Cycle-Decomposition; 6526
(ii) : the SuperHyperHamiltonian-Type-Cycle-Decomposition; 6527
(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Decomposition; 6528
(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 6529
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 6530
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition. 6531
coincide. 6533
Graph which is a SuperHyperWheel. Then the number of 6535
(i) : the dual SuperHyperHamiltonian-Type-Cycle-Decomposition; 6536
(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Decomposition; 6537
(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Decomposition; 6538
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 6539
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition; 6540
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Decomposition. 6541
coincide. 6543
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6544
perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6545

Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6546
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6547
SuperHyperVertices is a 6548
O(ESHG)
O(ESHG)

O(ESHG)
.
Decomposition 6555
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6557

plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6558
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6559
SuperHyperPart is a 6560
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6564
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6565
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition. 6566
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6568

plete SuperHyperMultipartite. Then Then the number of 6569
O(ESHG)
O(ESHG)
O(ESHG)
.
Decomposition 6576
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6577
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6578
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6580
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6581
(iv) : SuperHyperHamiltonian-Type-Cycle-Decomposition; 6585

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6588
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6589
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6590
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6591

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


Decomposition. 6599
Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6600
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6601
of dual 6602
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6606

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6610

SuperHyperHamiltonian-Type-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 6612
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a 6613
dual 6614

(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6618
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition; 6619
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 6620

Decomposition. 6621

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


.
Decomposition 6632
Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6633
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6634
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6635
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6636
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6637

a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S 6638
such that 6639
(i) v ∈ Ns (x); 6640
(ii) vx ∈ E. 6641
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6642

a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Decomposition, then 6643
(i) S is SuperHyperHamiltonian-Type-Cycle-Decomposition set; 6644
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6645
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6646
(i) Γ ≤ O; 6647
(ii) Γs ≤ On . 6648
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6649
connected. Then 6650

(i) Γ ≤ O − 1; 6651
(ii) Γs ≤ On − Σ3i=1 σi (x). 6652
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6653
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6657
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6658
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6660
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 6661

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

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

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6671
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6672
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6673
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Type-Cycle-Decomposition. 6675

Then 6676

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6680
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6681

Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6683
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Decomposition; 6684
(ii) Γ = 1; 6685
(iii) Γs = Σ3i=1 σi (c); 6686
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle- 6687
Decomposition. 6688
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6689
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6690
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6692
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6693
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6694
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6696
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 6697
(ii) Γ = b n2 c + 1; 6699

b n c+1 ; 6700
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 6701
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6703
bnc
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6704
Cycle-Decomposition; 6705
(ii) Γ = b n2 c; 6706

bnc ; 6707
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6708
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6710
perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6711

(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6712

Type-Cycle-Decomposition for N SHF; 6713
(ii) Γ = m for N SHF : (V, E); 6714
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6715
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6716
Type-Cycle-Decomposition for N SHF : (V, E). 6717
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6718

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6719
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6720
SuperHyperHamiltonian-Type-Cycle-Decomposition for N SHF; 6721
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6722
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 6723
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=12
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 6724
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6726

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6727
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6728
Cycle-Decomposition for N SHF : (V, E); 6729
(ii) Γ = b n2 c for N SHF : (V, E); 6730
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 6731
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1 2
are only dual maximal SuperHyperHamiltonian-Type-Cycle- 6732
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6736

SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is an s-SuperHyperDefensive 6737

SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is a dual s-SuperHyperDefensive 6740

(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6744

SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
6745
SuperHyperHamiltonian-Type-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 6748

Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6750

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 33 6812
Neutrosophic Applications in Cancer’s 6813
Neutrosophic Recognition 6814
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6815
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6816
disease is considered and as the consequences of the model, some parameters are used. The 6817
cells are under attack of this disease but the moves of the cancer in the special region are the 6818
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6819
treatments for this Neutrosophic disease. 6820
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6821
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6822
Neutrosophic function. 6823
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6824
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6825
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6826
easily identified since there are some determinacy, indeterminacy and neutrality about the 6827
moves and the effects of the cancer on that region; this event leads us to choose another 6828
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6829
what’s happened and what’s done. 6830
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6831
known and they’ve got the names, and some general Neutrosophic models. The moves and 6832
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6833
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian- 6834
Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Super- 6835
HyperWheel). The aim is to find either the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6836

Decomposition or the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition in those Neutro- 6837
sophic Neutrosophic SuperHyperModels. 6838
337
CHAPTER 34 6839
Case 1: The Initial Neutrosophic Steps 6840
Toward Neutrosophic 6841
SuperHyperBipartite as Neutrosophic 6842
SuperHyperModel 6843
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6844
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6845
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

339
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6846
perBipartite is obtained. 6847
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6848
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6849
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6850

CHAPTER 35 6852
Case 2: The Increasing Neutrosophic 6853
Steps Toward Neutrosophic 6854
SuperHyperMultipartite as 6855
Neutrosophic SuperHyperModel 6856
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6857
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6858
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6859
perMultipartite is obtained. 6860
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6861
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

341
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6862

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6863

CHAPTER 36 6865
Wondering Open Problems But As The 6866
Directions To Forming The Motivations 6867
In what follows, some “problems” and some “questions” are proposed. 6868
The SuperHyperHamiltonian-Type-Cycle-Decomposition and the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6869
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 6870
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6871
recognitions? 6872
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle- 6873

and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition?
Decomposition 6874
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6875
them? 6876
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 6877
and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition?
Problem 36.0.5. The SuperHyperHamiltonian-Type-Cycle-Decomposition and the Neutrosophic 6879

SuperHyperHamiltonian-Type-Cycle-Decomposition do a SuperHyperModel for the Cancer’s recognitions 6880
and they’re based on SuperHyperHamiltonian-Type-Cycle-Decomposition, are there else? 6881
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6882
Numbers types-results? 6883
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6884
the multiple types of SuperHyperNotions? 6885
343
CHAPTER 37 6886
Conclusion and Closing Remarks 6887
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6888
research are illustrated. Some benefits and some advantages of this research are highlighted. 6889
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6890
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Type- 6891
Cycle-Decomposition. For that sake in the second definition, the main definition of the Neutrosophic 6892
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for the 6893
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperHamiltonian- 6894
Type-Cycle-Decomposition, finds the convenient background to implement some results based on that. 6895
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this re- 6896
search on the modeling of the regions where are under the attacks of the cancer to recognize 6897
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 6898
on the SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Decomposition, the new SuperHyperClasses 6899
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 6900
the SuperHyperHamiltonian-Type-Cycle-Decomposition and the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6901

Decomposition. The clarifications, instances and literature reviews have taken the whole way through. 6902
In this research, the literature reviews have fulfilled the lines containing the notions and the 6903
results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on 6904
the “Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 6905
the moves of the cancer in the longest and strongest styles with the formation of the design and 6908
the architecture are formally called “ SuperHyperHamiltonian-Type-Cycle-Decomposition” in the themes of 6909
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 6910
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 6911
for this research are, figured out, pointed out and spoken out. 6912
345
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Type-Cycle-Decomposition
3. Neutrosophic SuperHyperHamiltonian-Type-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6913
Neutrosophic SuperHyperDuality But As 6914
Super Forms 6916
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6917

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6921

Va ∈ Ei , Ej ; 6922
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6923

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6924
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6925

Vi , Vj ∈ Ea ; 6926
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6927

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6928
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6929

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6930
sophic rv-SuperHyperDuality. 6931
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6932

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6935

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6937
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6938
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6939
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6940
form the Extreme SuperHyperDuality; 6941
347
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6942

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6944
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6945
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6946
such that they form the Neutrosophic SuperHyperDuality; 6948
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6949
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6950

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6951
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6952
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6953
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6954
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6956
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6958

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6960
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6961
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6962
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 6963
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6966
coefficient; 6967
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6968

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6970
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6971
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6972
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 6973
form the Extreme SuperHyperDuality; 6974
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6975

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6976
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6977
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6978
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6979
such that they form the Neutrosophic SuperHyperDuality; 6981
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6982

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6983
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6984

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6986
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6989
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6991

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6993

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6996
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6999
coefficient. 7000
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7001
the mentioned Neutrosophic Figures in every Neutrosophic items. 7002

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7004
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7005
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7006
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7007
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7008
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7009
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7010
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 7014
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7015
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7016
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7017
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7018

every given Neutrosophic SuperHyperDuality. 7019




C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .

3 × 3z 2 .



C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.







C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 7060
Neutrosophic SuperHyperClasses. 7061
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 7063
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. 7070
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 7072
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7079
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 7081


the Neutrosophic SuperHyperDuality. 7090
Then 7092
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 7093
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7099
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7102

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7103
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7112

(V, E). Then 7113

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 7114
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7115


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7119
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7120
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. 7132
Then, 7134
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 7135
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 7136


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7141
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7142
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7148

CHAPTER 39 7149
Neutrosophic SuperHyperJoin But As 7150
Super Forms 7152
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7153

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7157
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7159

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7160
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7162

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7164

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7167

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7168
rv-SuperHyperJoin. 7169
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7170

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

361

Extreme SuperHyperJoin; 7179
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7180

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7182
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7183
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7184

form the Neutrosophic SuperHyperJoin; 7186
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7187

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7188
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7189
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7194
coefficient; 7195
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7196

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7197
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7198
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7199
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7200
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7201
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7202

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7203
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7204
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7205

Extreme SuperHyperJoin; 7211
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7212

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7214
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7215
form the Neutrosophic SuperHyperJoin; 7218

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7219

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7221
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7225

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7226
to its Extreme coefficient; 7227
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7228

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7230
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7231

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7232
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7236
coefficient. 7237
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7241

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7242

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7307

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7316
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 7318


the Neutrosophic SuperHyperJoin. 7327
Then 7329
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 7330
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 7336
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7338

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7349

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7351


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

Then, 7369

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

.
Proof. Let 7370
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7371


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7375
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7376
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7377
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7382

CHAPTER 40 7383
Neutrosophic SuperHyperPerfect But As 7384
Super Forms 7386
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7387

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

Va ∈ Ei , Ej ; 7392
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7393

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7399

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7400
rv-SuperHyperPerfect. 7401
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7402

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7407
375
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7412

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7414
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7415
form the Neutrosophic SuperHyperPerfect; 7418
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7419

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7420
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7421
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7424
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7428

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7430
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7436
coefficient; 7437
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7438

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7446
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7447
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7448
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7449
such that they form the Neutrosophic SuperHyperPerfect; 7451
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7452

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7454

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7457
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7461

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7463

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7469
coefficient. 7470

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7474

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7540
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 7542
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7560
Then 7562
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 7563
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 7567
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7568
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7569
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7572

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7583

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7606


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7609
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7610
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7611
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7612
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7618

CHAPTER 41 7619
Neutrosophic SuperHyperTotal But As 7620
Super Forms 7622
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7623

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7627

Va ∈ Ei , Ej ; 7628
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7629

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7630
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7631

Vi , Vj ∈ Ea ; 7632
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7633

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7635

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7636
rv-SuperHyperTotal. 7637
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7638

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7643
Extreme SuperHyperTotal; 7647
389
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7648

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7650
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7651
form the Neutrosophic SuperHyperTotal; 7654
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7655
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7656

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7657
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7662
coefficient; 7663
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7664
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7665

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7666
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7667
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7672
cient; 7673
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7674

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7676
Extreme SuperHyperTotal; 7680
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7681

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7683
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7684
form the Neutrosophic SuperHyperTotal; 7687
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7688

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7689
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7690


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7695
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7697

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7698
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7699
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7700

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7705
cient. 7706

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7710
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. 7725




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7776
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 7778
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. 7785
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 7787



the Neutrosophic SuperHyperTotal. 7796
Then 7798
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 7799
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7805
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7807
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7818

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7825
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. 7836
Then, 7838
∗
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 7839
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7840


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7844
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7845

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7846
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7852

CHAPTER 42 7853
Neutrosophic SuperHyperConnected But 7854
As The Extensions Excerpt From Dense 7855
And Super Forms 7856
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7857

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7861
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7862
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7863

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7864
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7865
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7866

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7867
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7868

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7869
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7870
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7871
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7872
rosophic rv-SuperHyperConnected. 7873
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7874

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7877
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7878
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7879
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7880
403
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7881

Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 7882
that they form the Extreme SuperHyperConnected; 7883
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7884

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7885
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7886
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7887
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7888
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7889

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7890
nected; 7891
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7892

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7893
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7894
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7895
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7896
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7897

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7899
Extreme power is corresponded to its Extreme coefficient; 7900
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7901

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7902
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7903

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7908
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7909
its Neutrosophic coefficient; 7910
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7911

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7914
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7915

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7916
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7917
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7918

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7921
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7922
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7923

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7924
nected; 7925
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7926

maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7931
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7932

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7933
and the Extreme power is corresponded to its Extreme coefficient; 7934
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7935


Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 7942
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7943
its Neutrosophic coefficient. 7944
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7947
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7948
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7950
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7951
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7952
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7953
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7954
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. 7962


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 8006
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. 8013
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 8015
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. 8022
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 8024



the Neutrosophic SuperHyperConnected. 8033
Then 8035
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 8036
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 8041
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8042
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8045

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8056
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 8057
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8058


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8062
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8063
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8064
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. 8075
Then, 8077
∗
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 8078
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8079


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8082
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8083
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8084
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8085
some representatives. The latter is straightforward. 8086
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8091

CHAPTER 43 8092
Background 8093
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 8100
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 8101
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 8102
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 8103
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 8104
results based on initial background. 8105
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8106
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8107
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8114
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8115
and fundamental SuperHyperNumbers. 8116
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 8117
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 8118
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8119
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8120

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


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 8153
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 8154
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 8155
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 8156
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 8158
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 8159
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8160
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8161
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 8162

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 8163
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 8164
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 8165
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 8166
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 8167
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 8168

by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8169
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments” in 8170
Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHyperResolving 8171
on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic 8172

SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatching By 8173

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 8174
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8175
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8176
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8177
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8178
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8179
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8180
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8181
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8182
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8183
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8184
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8185

Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 8186
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 8187
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 8188
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 8189
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 8190
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 8191

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 8192
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 8193
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 8195
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 8197

“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Supe- 8199
rHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 8200


HG235; HG236; HG237; HG238; HG239; HG240], there are some endeavors to formalize 8223
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8224
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8225

Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8239
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8240
than 4216 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8241
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8242

SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8249
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8250
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8251
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 8252
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 8253
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 8254

HG231; HG232; HG233; HG234; HG235; HG236; HG237; HG238; HG239; HG240] 8270
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 8271


Bibliography 8285
10.33140/JMTCM.01.03.09) 8292
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8310
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8311
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8312
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8313
423
10.20944/preprints202301.0282.v1). 8320
10.20944/preprints202301.0267.v1). 8323

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8328
prints202301.0262.v1). 8332
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8338
prints202301.0105.v1). 8341
Preprints 2023, 2023010044 8347
(doi: 10.20944/preprints202301.0043.v1). 8350

(doi: 10.20944/preprints202212.0549.v1). 8359
(doi: 10.20944/preprints202212.0500.v1). 8366
2023, (doi: 10.5281/zenodo.7809365). 8375
2023, (doi: 10.5281/zenodo.7809358). 8378

10.5281/zenodo.7809219). 8381
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 8383
10.5281/zenodo.7809328). 8384
2023, (doi: 10.5281/zenodo.7806767). 8387
2023, (doi: 10.5281/zenodo.7806838). 8390

By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8392
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8393
(doi: 10.5281/zenodo.7799902). 8399
2023, (doi: 10.5281/zenodo.7804218). 8402
(doi: 10.5281/zenodo.7796334). 8405
10.5281/zenodo.7791952). 8411
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8413
10.5281/zenodo.7791982). 8414
10.5281/zenodo.7790026). 8417
HG223 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8418
10.5281/zenodo.7790052). 8420
2023, (doi: 10.5281/zenodo.7787066). 8423
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8425
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8426
10.5281/zenodo.7781476). 8429

10.5281/zenodo.7783082). 8432
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8434
10.5281/zenodo.7777857). 8435
10.5281/zenodo.7779286). 8438
(doi: 10.5281/zenodo.7771831). 8441
2023, (doi: 10.5281/zenodo.7772468). 8444
10.13140/RG.2.2.20913.25446). 8447
HG212 [50] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8448
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8449
odo.7764916). 8450
10.13140/RG.2.2.11770.98247). 8453
10.13140/RG.2.2.12400.12808). 8456
2023, (doi: 10.13140/RG.2.2.22545.10089). 8459
10.13140/RG.2.2.11377.76644). 8465
10.13140/RG.2.2.23750.96329). 8468

10.13140/RG.2.2.31366.24641). 8471
10.13140/RG.2.2.34721.68960). 8474
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8476
2023, (doi: 10.13140/RG.2.2.30212.81289). 8477
10.13140/RG.2.2.24288.35842). 8483
10.13140/RG.2.2.32467.25124). 8486
10.13140/RG.2.2.31025.45925). 8489
10.13140/RG.2.2.17184.25602). 8492
10.13140/RG.2.2.23423.28327). 8495
10.13140/RG.2.2.28456.44805). 8498
10.13140/RG.2.2.23525.68320). 8501
HG194 [68] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8502
10.13140/RG.2.2.20170.24000). 8504
10.13140/RG.2.2.36475.59683). 8507

10.13140/RG.2.2.29764.71046). 8510
2023, (doi: 10.13140/RG.2.2.18780.87683). 8513
10.13140/RG.2.2.26134.01603). 8519
HG188 [74] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8520
10.13140/RG.2.2.27392.30721). 8522
10.13140/RG.2.2.33028.40321). 8525
10.13140/RG.2.2.21389.20966). 8528
10.13140/RG.2.2.16356.04489). 8531
10.13140/RG.2.2.21756.21129). 8534
HG183 [79] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8535
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8536
10.13140/RG.2.2.30983.68009). 8537
10.13140/RG.2.2.28552.29445). 8540
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8542
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8543
10.13140/RG.2.2.35105.89447). 8546

(doi: 10.13140/RG.2.2.30072.72960). 8549
10.13140/RG.2.2.31147.52003). 8552
10.13140/RG.2.2.32825.24163). 8555
10.13140/RG.2.2.13059.58401). 8558
10.13140/RG.2.2.11172.14720). 8561
2023, (doi: 10.13140/RG.2.2.22011.80165). 8564
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8567
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8569
2023, (doi: 10.13140/RG.2.2.10493.84962). 8570
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8573
2023, (doi: 10.13140/RG.2.2.19944.14086). 8576
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8579
(doi: 10.13140/RG.2.2.33103.76968). 8582
HG167 [95] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8583
(doi: 10.13140/RG.2.2.23037.44003). 8585

(doi: 10.13140/RG.2.2.35646.56641). 8588
(doi: 10.13140/RG.2.2.18030.48967). 8591
(doi: 10.13140/RG.2.2.13973.81121). 8594
2023, (doi: 10.13140/RG.2.2.34106.47047). 8597
2023, (doi: 10.13140/RG.2.2.31956.88961). 8603
2023, (doi: 10.13140/RG.2.2.15179.67361). 8606
10.13140/RG.2.2.21510.45125). 8609
HG158 [104] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8610
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8611
2023, (doi: 10.13140/RG.2.2.13121.84321). 8612
10.13140/RG.2.2.11758.69441). 8615
2023, (doi: 10.13140/RG.2.2.31891.35367). 8618
10.13140/RG.2.2.19360.87048). 8621
HG154 [108] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8622
10.13140/RG.2.2.32363.21286). 8624

10.13140/RG.2.2.23266.81602). 8627
10.13140/RG.2.2.19911.37285). 8630
10.13140/RG.2.2.11050.90569). 8633
HG150 [112] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8634
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8635
2023, (doi: 10.13140/RG.2.2.17761.79206). 8636
HG149 [113] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8637
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8638
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8641
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8642
(doi: 10.13140/RG.2.2.30182.50241). 8645

2023, (doi: 10.13140/RG.2.2.17252.24968). 8678
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8686
2023010396 (doi: 10.20944/preprints202301.0396.v1). 8687
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8690
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8692
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8693
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8694


HG128 [133] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8699
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8700
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8701

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

10.20944/preprints202301.0282.v1). 8711
10.20944/preprints202301.0267.v1).). 8714

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8719
prints202301.0262.v1). 8723

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

10.13140/RG.2.2.35061.65767). 8732
10.13140/RG.2.2.18494.15680). 8736
10.13140/RG.2.2.32530.73922). 8740

of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8742
Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8743
10.13140/RG.2.2.15897.70243). 8744
10.13140/RG.2.2.32530.73922). 8748
prints202301.0105.v1). 8751

10.13140/RG.2.2.23172.19849). 8758
10.13140/RG.2.2.17385.36968). 8768
Preprints 2023, 2023010044 8771
(doi: 10.20944/preprints202301.0043.v1). 8774
2023, (doi: 10.13140/RG.2.2.28945.92007). 8777

10.13140/RG.2.2.35774.77123). 8783

10.13140/RG.2.2.29430.88642). 8789
(doi: 10.20944/preprints202212.0549.v1). 8795

10.13140/RG.2.2.19380.94084). 8798
(doi: 10.20944/preprints202212.0500.v1). 8809
10.13140/RG.2.2.20993.12640). 8812
HG952 [167] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8813

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

10.13140/RG.2.2.29173.86244). 8827
HG38 [172] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8828
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8829
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8830
2023 (doi: 10.5281/zenodo.7807782). 8832
2023 (doi: 10.5281/zenodo.7804449). 8834

(doi: 10.5281/zenodo.7792307). 8838
(doi: 10.5281/zenodo.7790728). 8840
2023 (doi: 10.5281/zenodo.7787712). 8842
10.5281/zenodo.7783791). 8844
10.5281/zenodo.7780123). 8846
(doi: 10.5281/zenodo.7773119). 8848
odo.7637762). 8850
10.5281/zenodo.7766174). 8852
10.5281/zenodo.7762232). 8854

(doi: 10.5281/zenodo.7758601). 8856
10.5281/zenodo.7754661). 8858
10.5281/zenodo.7750995) . 8860
(doi: 10.5281/zenodo.7749875). 8862
10.5281/zenodo.7747236). 8864
10.5281/zenodo.7742587). 8866
(doi: 10.5281/zenodo.7738635). 8868
10.5281/zenodo.7734719). 8870
10.5281/zenodo.7730484). 8872
(doi: 10.5281/zenodo.7730469). 8874
10.5281/zenodo.7722865). 8876
odo.7713563). 8878
odo.7709116). 8880
10.5281/zenodo.7706415). 8882
(doi: 10.5281/zenodo.7706063). 8884
(doi: 10.5281/zenodo.7701906). 8886
odo.7700205). 8888
10.5281/zenodo.7694876). 8890

10.5281/zenodo.7679410). 8892
10.5281/zenodo.7675982). 8894
10.5281/zenodo.7672388). 8896
odo.7668648). 8898
10.5281/zenodo.7662810). 8900
10.5281/zenodo.7659162). 8902
HG120b [209] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8903
10.5281/zenodo.7653233). 8904
odo.7653204). 8906
odo.7653142). 8908
odo.7653117). 8910
odo.7653089). 8912
odo.7651687). 8914
odo.7651619). 8916
odo.7651439). 8918
odo.7650729). 8920
odo.7647868). 8922
odo.7647017). 8924
odo.7644894). 8926

odo.7641880). 8928
odo.7632923). 8930
odo.7623459). 8932
10.5281/zenodo.7606416). 8934
10.5281/zenodo.7606416). 8936
odo.7606404). 8938
10.5281/zenodo.7580018). 8940
odo.7580018). 8942
odo.7580018). 8944
odo.7579929). 8946
10.5281/zenodo.7563170). 8948
odo.7563164). 8950
odo.7563160). 8952
odo.7563160). 8954
10.5281/zenodo.7563160). 8956
10.5281/zenodo.7557063). 8958
10.5281/zenodo.7557009). 8960
10.5281/zenodo.7539484). 8962

10.5281/zenodo.7523390). 8964
10.5281/zenodo.7523390). 8966
10.5281/zenodo.7523390). 8968
odo.7574952). 8970
10.5281/zenodo.7574992). 8972
odo.7523357). 8974
10.5281/zenodo.7523357). 8976
10.5281/zenodo.7504782). 8978
10.5281/zenodo.7504782). 8980
10.5281/zenodo.7504782). 8982
10.5281/zenodo.7499395). 8984
odo.7499395). 8986
10.5281/zenodo.7499395). 8988
10.5281/zenodo.7497450). 8990
10.5281/zenodo.7497450). 8992
10.5281/zenodo.7494862). 8994
odo.7494862). 8996
10.5281/zenodo.7494862). 8998

10.5281/zenodo.7493845). 9000
10.5281/zenodo.7493845). 9002
10.5281/zenodo.7493845). 9004
odo.7539484). 9006
odo.7523390). 9008
odo.7523357). 9010
odo.7504782). 9012
odo.7499395). 9014
odo.7497450). 9016
odo.7494862). 9018
odo.7493845). 9020
odo.7480110). 9022
odo.7378758). 9024
HG32b [270] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 9025
10.5281/zenodo.6320305). 9026
odo.6677173). 9028

CHAPTER 44 9029
Books’ Contributions 9030
“Books’ Contributions”: | Featured Threads 9031

The following references are cited by chapters. 9032
9033
[Ref233] 9034
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Hamiltonian- 9035
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 9036
9038
[Ref234] 9039
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9040
Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 9041
9043
The links to the contributions of this scientific research book are listed below. 9044
[HG233 9045
9049
[TITLE] “New Ideas On Super Decompensation By Hyper Decompress Of Hamiltonian- 9050
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9051

9052
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9053
https://www.researchgate.net/publication/369825614 9054
9055
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9056
https://www.scribd.com/document/636441206 9057
9058
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9059
https://zenodo.org/record/7804228 9060
9061
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9062
https://www.academia.edu/99744986 9063
443
Figure 44.1: Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress
Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
9064
[ADDRESSED CITATION] 9065
[ASSIGNED NUMBER] #233 Article 9069
[DATE] April 2023 9070

[DOI] 10.5281/zenodo.7804228 9071
[LICENSE] CC BY-NC-ND 4.0 9072
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9073
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9074
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9075
9076
[HG234] 9077
9081
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9082

Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation” 9083
9084
https://www.researchgate.net/publication/369825816 9086
9087
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9088


Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
https://www.scribd.com/document/636442135 9089
9090
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9091
9093
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9094
https://www.academia.edu/99745312 9095
9096
[ASSIGNED NUMBER] #234 Article 9101
[DATE] April 2023 9102
[DOI] 10.5281/zenodo.7804238 9103
[LICENSE] CC BY-NC-ND 4.0 9104

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9105
[AVAILABLE AT TWITTER’S IDS] 9106
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9107
googlebooks GooglePlay 9108
9109
[ASSIGNED NUMBER] | Book #157 9110

HG157b
Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 9112


[TITLE] Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 9114

#Latest_Updates 9115
#The_Links 9116
9120
9122
#The_Links 9123
9124
[ASSIGNED NUMBER] | Book #157 9125

9126
[TITLE] Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 9127
9128
9132
– 9133
9134
[PUBLISHER] 9135
(Paperback): https://www.amazon.com/dp/- 9136
(Hardcover): https://www.amazon.com/dp/- 9137

(Kindle Edition): https://www.amazon.com/dp/- 9138
9139
– 9140
9141
[ISBN] 9142
(Paperback): - 9143
(Hardcover): - 9144
(Kindle Edition): CC BY-NC-ND 4.0 9145
(EBook): CC BY-NC-ND 4.0 9146
9147
– 9148
9149
[PRINT LENGTH] 9150
(Paperback): - pages 9151
(Hardcover): - pages 9152
(Kindle Edition): - pages 9153
(E-Book): - pages 9154
9155
– 9156
9157
9159

#The_Links 9160
9161
https://www.researchgate.net/publication/- 9163
9164
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9165
https://drhenrygarrett.wordpress.com/2023/04/22/ 9166
Hamiltonian-Type-Cycle-Decomposition-In-SuperHyperGraphs/ 9167
9168
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9169
https://www.scribd.com/document/- 9170
9171
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9172
https://www.academia.edu/- 9173
9174
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9175
9177
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9178
https://books.google.com/books/about?id=- 9179
9180
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9181
https://play.google.com/store/books/details?id=- 9182

[TITLE] Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs (Published Version) 9183

9184
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9185
9186
https://drhenrygarrett.wordpress.com/2023/04/22/ 9187
Hamiltonian-Type-Cycle-Decomposition-In-SuperHyperGraphs/ 9188
9189
– 9190
9191
[POSTED BY] Dr. Henry Garrett 9192
9193
[DATE] April 008 2023 9194

9195
[POSTED IN] 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs 9196
9197
[TAGS] 9198
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9199
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9200
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9201
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9202
neutrosophic SuperHyperGraphs, Neutrosophic Hamiltonian-Type-Cycle-Decomposition In Su- 9203
perHyperGraphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, 9204
Questions, Real-World Applications, Recent Research, Recognitions, Research, scientific research 9205
Article, scientific research Articles, scientific research Book, scientific research Chapter, sci- 9206
entific research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, 9207

SuperHyperGraph Theory, SuperHyperGraphs, Hamiltonian-Type-Cycle-Decomposition In Super- 9208
HyperGraphs, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9209
In this scientific research book, there are some scientific research chapters on “Extreme 9210
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs” and “Neutrosophic Hamiltonian- 9211
Type-Cycle-Decomposition In SuperHyperGraphs” about some scientific research on Hamiltonian- 9212
Type-Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, 9213

namely, Extreme Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs and Neutro- 9214
sophic Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs. With scientific research 9215
on the basic scientific research properties, the scientific research book starts to make Ex- 9216
treme Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs theory and Neutrosophic 9217
Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs theory more (Extremely/Neutro- 9218

sophicly) understandable. 9219

CHAPTER 45 9220
“SuperHyperGraph-Based Books”: | 9221
Featured Tweets 9222
“SuperHyperGraph-Based Books”: | Featured Tweets 9223
451
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 46 9224
CV 9225
479
9226
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

9227
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)
9228
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

9229
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

9230
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

9231
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

9232
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

9233
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

9234
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

9235
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

9236
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

9237
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

9238
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).
9239
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

9240

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

9241
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

9242
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

9243
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: -
9244
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
9245
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
9246
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
9247
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
9248
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).
9249
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”,

9250
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”,

9251
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

9252
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).
9253
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).
9254
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
9255
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).
9256

(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).
9257
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).
9258
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

9259
[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

9260
[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

9261
[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

9262
[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

9263
[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

9264
[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

9265
[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

9266
[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

9267
[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

9268
[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

9269
[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

9270
[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

9271
[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

9272
[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

9273
[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

9274
[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

9275
[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

9276
[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

9277
[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
9278
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

9279
[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

9280
[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

9281
[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

9282
[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

9283
[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
9284
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

9285
“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

9286
[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
9287
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

9288
[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

9289
[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

9290
[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

9291
[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

9292
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

9293
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
9294
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
9295
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

9296
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

9297
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
-
9298
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

9299
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9300
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
9301
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
9302
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

9303
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
9304
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
...
9305
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/
9306
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
9307

Hamiltonian-Type-Cycle-Decomposition in SuperHyperGraph

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Hamiltonian-Type-Cycle-Decomposition in SuperHyperGraph

Uploaded by

Copyright:

Available Formats

Hamiltonian-Type-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-Type-Cycle-Decomposition But As The Exten-

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-Type-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-Type-Cycle-Decomposition But As The

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 337

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 345

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 443

45 “SuperHyperGraph-Based Books”: | Featured Tweets 451

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 144

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

34.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges