Eulerian-Type-Path-Decomposition in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/370129197
Eulerian-Type-Path-Decomposition In SuperHyperGraphs
Book · April 2023

DOI: 10.5281/zenodo.7848019
CITATIONS
1 author:
Henry Garrett
451 PUBLICATIONS 13,005 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
On Algebraic Structures and Algebraic Hyperstructures View project
All content following this page was uploaded by Henry Garrett on 20 April 2023.
The user has requested enhancement of the downloaded file.

Eulerian-Type-Path-
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 41
4 Cancer In Extreme SuperHyperGraph 43
5 Extreme Eulerian-Type-Path-Decomposition 47
6 New Ideas On Super Decompensation By Hyper Decompress Of

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

Scientific Research 57
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61
10 Extreme SuperHyperEulerian-Type-Path-Decomposition But As The Extensions

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

Graph By Eulerian-Type-Path-Decomposition As Hyper Decompress On
Super Decompensation 251
27 ABSTRACT 253
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 259

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 263
30 Neutrosophic SuperHyperEulerian-Type-Path-Decomposition But As The Exten-

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

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

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

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

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

Motivations 347
37 Conclusion and Closing Remarks 349
38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 407
43 Background 421
Bibliography 427
44 Books’ Contributions 449
45 “SuperHyperGraph-Based Books”: | Featured Tweets 457
46 CV 485

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

SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.3) . . . . . . 79
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Decomposition in the Example (42.0.5) . . . . . . . . . . . 116
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 SuperHyperEulerian-Type-Path-Decomposition in the Example (42.0.11) . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.15) 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Example
(42.0.11) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

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

Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206). . . . . . . . . . 450
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). . . . . . . . . . . 452

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

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

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

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

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 344

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

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

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

Graph” are chosen and elected to scientific research about “Cancer’s Recognition”. Thus 28
these complex and dense SuperHyperModels open up some avenues to scientific research on 29
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 δ−Eulerian-Type-Path-Decomposition In SuperHyperGraphs is a 32
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 33
1
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 34

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 36
an δ−SuperHyperDefensive; a Neutrosophic δ−Eulerian-Type-Path-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 Eulerian-Type-Path- 43
Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make a 44
Eulerian-Type-Path-Decomposition In SuperHyperGraphs more understandable. For the sake 45
of having Neutrosophic Eulerian-Type-Path-Decomposition In SuperHyperGraphs, there’s a 46

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

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

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

redefined to a “Neutrosophic Eulerian-Type-Path-Decomposition In SuperHyperGraphs” if 76
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 Eulerian- 78
Type-Path-Decomposition In SuperHyperGraphs more understandable. Assume a Neutrosophic 79

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

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

In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 87
the Eulerian-Type-Path-Decomposition In SuperHyperGraphs amid the maximum value amid 88
all SuperHyperVertices from a Eulerian-Type-Path-Decomposition In SuperHyperGraphs .] 89
Eulerian-Type-Path-Decomposition In SuperHyperGraphs . A graph is a SuperHyperUniform 90
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 Eulerian-Type-Path-Decomposition In SuperHyperGraphs if it’s only 94
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only 95
one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only 96
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
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 99
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 106
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 107
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 108
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 109
foundation will be based on the “Cancer’s Recognition” and the results and the definitions will 110
be introduced in redeemed ways. The recognition of the cancer in the long-term function. The 111
specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle 112
of the move from the cancer is identified by this research. Sometimes the move of the cancer 113
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 114
about the moves and the effects of the cancer on that region; this event leads us to choose 115
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 116
on what’s happened and what’s done. There are some specific models, which are well-known 117
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 118
and the traces of the cancer on the complex tracks and between complicated groups of cells 119
could be fantasized by a Neutrosophic SuperHyperPath(-/Eulerian-Type-Path-Decomposition 120
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Supe- 121

rHyperWheel). The aim is to find either the longest Eulerian-Type-Path-Decomposition In 122
SuperHyperGraphs or the strongest Eulerian-Type-Path-Decomposition In SuperHyperGraphs 123
in those Neutrosophic SuperHyperModels. For the longest Eulerian-Type-Path-Decomposition 124
In SuperHyperGraphs, called Eulerian-Type-Path-Decomposition In SuperHyperGraphs, and 125

the strongest Eulerian-Type-Path-Decomposition In SuperHyperGraphs, called Neutrosophic 126

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

and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 133
SuperHyperGraph theory are proposed. 134
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Type-Path-Decomposition In Super- 135
HyperGraphs, 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 Eulerian-Type-Path-Decomposition In SuperHyperGraphs . Two 140

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 SuperHyperNum- 145
bers are featured. The definitions are followed by the examples and the instances thus the 146
clarifications are driven with different tools. The applications are figured out to make sense 147
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 148
are the under scientific research to figure out the challenges make sense about ongoing and 149
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 150
different types of them. Some of them are individuals and some of them are well-modeled by 151
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 152
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 153
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s 154
Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 155
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 156
Some avenues are posed to pursue this research. It’s also officially collected in the form of 157
some questions and some problems. Assume a SuperHyperGraph. Then an “δ−Eulerian-Type- 158
Path-Decomposition In SuperHyperGraphs” is a maximal Eulerian-Type-Path-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 163
S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Eulerian-Type-Path-Decomposition In 164

SuperHyperGraphs” is a maximal Neutrosophic Eulerian-Type-Path-Decomposition In Super- 165
HyperGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 166
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 167
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 Eulerian-Type- 171

Path-Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to 172
make Eulerian-Type-Path-Decomposition In SuperHyperGraphs more understandable. For the 173
sake of having Neutrosophic Eulerian-Type-Path-Decomposition In SuperHyperGraphs, there’s 174
a need to “redefine” the notion of “Eulerian-Type-Path-Decomposition In SuperHyperGraphs 175
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 176
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 177
assign to the values. Assume a Eulerian-Type-Path-Decomposition In SuperHyperGraphs . 178
It’s redefined Neutrosophic Eulerian-Type-Path-Decomposition In SuperHyperGraphs if the 179
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, 180
and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, 181
“The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The 182
SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The max- 183
imum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its 184
Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 185
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 186
of SuperHyperGraph based on Eulerian-Type-Path-Decomposition In SuperHyperGraphs 187
. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 188
kind of SuperHyperClass. If there’s a need to have all Eulerian-Type-Path-Decomposition 189

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

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

all SuperHyperVertices from a Eulerian-Type-Path-Decomposition In SuperHyperGraphs .] 217

Eulerian-Type-Path-Decomposition In SuperHyperGraphs . A graph is SuperHyperUniform 218
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 Eulerian-Type-Path-Decomposition In SuperHyperGraphs if it’s only 222
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only 223
one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only 224
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 225
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 226
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 227
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 238
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 239
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 240
and the long cycle of the move from the cancer is identified by this research. Sometimes the 241
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 242
and neutrality about the moves and the effects of the cancer on that region; this event leads us 243
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 244
perception on what’s happened and what’s done. There are some specific models, which are 245
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 246
moves and the traces of the cancer on the complex tracks and between complicated groups of cells 247
could be fantasized by a Neutrosophic SuperHyperPath(-/Eulerian-Type-Path-Decomposition 248
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Supe- 249
rHyperWheel). The aim is to find either the longest Eulerian-Type-Path-Decomposition In 250
SuperHyperGraphs or the strongest Eulerian-Type-Path-Decomposition In SuperHyperGraphs 251
in those Neutrosophic SuperHyperModels. For the longest Eulerian-Type-Path-Decomposition 252

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

any Eulerian-Type-Path-Decomposition In SuperHyperGraphs but literarily, it’s the deforma- 259
tion of any Eulerian-Type-Path-Decomposition In SuperHyperGraphs. It, literarily, deforms 260
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 261
SuperHyperGraph theory are proposed. 262

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Eulerian-Type-Path- 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 Eulerian-Type-Path-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

1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyper- 404
Graphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry 405
(Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 407
on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 408
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett 409

(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic 410
SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial 411
Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutro- 412
sophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] 413
by Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 414
HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; 415
HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; 418

HG244; HG245; HG246; HG247; HG248; HG249], there are some endeavors to formalize 431
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 432
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 433
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; 434
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 437
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 438

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

HG240; HG241; HG242; HG243; HG244; HG245; HG246; HG247; HG248; HG249] 481
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 482

HG161b; HG162b; HG163b]. Two popular scientific research books in Scribd in the 494
terms of high readers, 4276 and 5274 respectively, on neutrosophic science is on [HG32b; 495
HG44b]. 496

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

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

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

10.5281/zenodo.7834229). 593
HG246 [28] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 594
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 595
10.5281/zenodo.7834261). 596
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 598
10.5281/zenodo.7824560). 599
HG244 [30] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 600
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 601
(doi: 10.5281/zenodo.7824623). 602

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 604
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 607
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 610
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 612
2023, (doi: 10.5281/zenodo.7809365). 613
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 615
2023, (doi: 10.5281/zenodo.7809358). 616
HG238 [36] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 617
10.5281/zenodo.7809219). 619
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 621

10.5281/zenodo.7809328). 622
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 624
2023, (doi: 10.5281/zenodo.7806767). 625
HG235 [39] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 626
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 627
2023, (doi: 10.5281/zenodo.7806838). 628
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 630
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 631
HG233 [41] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 632
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 633
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 634
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 636
(doi: 10.5281/zenodo.7799902). 637
HG231 [43] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 638
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 639
2023, (doi: 10.5281/zenodo.7804218). 640

By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 642
(doi: 10.5281/zenodo.7796334). 643
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 645
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 648
10.5281/zenodo.7791952). 649
HG225 [47] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 650
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 651
(doi: 10.5281/zenodo.7791982). 652
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 654
10.5281/zenodo.7790026). 655
HG223 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 656
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 657
2023, (doi: 10.5281/zenodo.7790052). 658
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 660
2023, (doi: 10.5281/zenodo.7787066). 661
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 663
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 664
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 666
10.5281/zenodo.7781476). 667
HG219 [53] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 668
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 669
10.5281/zenodo.7783082). 670
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 672
10.5281/zenodo.7777857). 673
HG217 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 674
10.5281/zenodo.7779286). 676
HG215 [56] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 677
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 678
(doi: 10.5281/zenodo.7771831). 679

HG214 [57] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 680
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 681
2023, (doi: 10.5281/zenodo.7772468). 682
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 684
10.13140/RG.2.2.20913.25446). 685
HG212 [59] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 686
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 687
10.5281/zenodo.7764916). 688
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 690
10.13140/RG.2.2.11770.98247). 691
HG210 [61] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 692
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 693
10.13140/RG.2.2.12400.12808). 694
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 696
2023, (doi: 10.13140/RG.2.2.22545.10089). 697
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 699
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 700
HG207 [64] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 701
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 702
10.13140/RG.2.2.11377.76644). 703
HG206 [65] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 704
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 705
10.13140/RG.2.2.23750.96329). 706
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 708
10.13140/RG.2.2.31366.24641). 709
HG204 [67] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 710
10.13140/RG.2.2.34721.68960). 712
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 714
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 717

Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 720
10.13140/RG.2.2.24288.35842). 721
HG200 [71] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 722
10.13140/RG.2.2.32467.25124). 724
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 726
10.13140/RG.2.2.31025.45925). 727
HG198 [73] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 728
10.13140/RG.2.2.17184.25602). 730
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 732
10.13140/RG.2.2.23423.28327). 733
HG196 [75] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 734
10.13140/RG.2.2.28456.44805). 736
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.23525.68320). 739
HG194 [77] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 740
10.13140/RG.2.2.20170.24000). 742
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.36475.59683). 745
HG192 [79] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 746
10.13140/RG.2.2.29764.71046). 748
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 750
2023, (doi: 10.13140/RG.2.2.18780.87683). 751
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 753
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.26134.01603). 757

HG188 [83] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 758
10.13140/RG.2.2.27392.30721). 760
HG187 [84] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 761
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.33028.40321). 763
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 765
10.13140/RG.2.2.21389.20966). 766
HG185 [86] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 767
10.13140/RG.2.2.16356.04489). 769
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 771
10.13140/RG.2.2.21756.21129). 772
HG183 [88] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 773
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 774
10.13140/RG.2.2.30983.68009). 775
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 777
10.13140/RG.2.2.28552.29445). 778
HG181 [90] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 779
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 780
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 781
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 783
10.13140/RG.2.2.35105.89447). 784
HG179 [92] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 785
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 786
(doi: 10.13140/RG.2.2.30072.72960). 787
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 789
10.13140/RG.2.2.31147.52003). 790
HG177 [94] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 791
10.13140/RG.2.2.32825.24163). 793
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 795
10.13140/RG.2.2.13059.58401). 796

HG175 [96] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 797
10.13140/RG.2.2.11172.14720). 799
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 801
2023, (doi: 10.13140/RG.2.2.22011.80165). 802
HG173 [98] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 803
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 804
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 805
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 807
HG171 [100] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 809
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 811
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 813
2023, (doi: 10.13140/RG.2.2.19944.14086). 814
HG169 [102] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 815
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 817
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 819
(doi: 10.13140/RG.2.2.33103.76968). 820
HG167 [104] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 821
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 822
2023, (doi: 10.13140/RG.2.2.23037.44003). 823
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 825
(doi: 10.13140/RG.2.2.35646.56641). 826
HG165 [106] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 827
(doi: 10.13140/RG.2.2.18030.48967). 829
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 831
(doi: 10.13140/RG.2.2.13973.81121). 832
HG163 [108] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 833
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 834
2023, (doi: 10.13140/RG.2.2.34106.47047). 835

HG162 [109] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 836
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 837
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 840
2023, (doi: 10.13140/RG.2.2.31956.88961). 841
HG160 [111] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 842
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 843
2023, (doi: 10.13140/RG.2.2.15179.67361). 844
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 846
10.13140/RG.2.2.21510.45125). 847
HG158 [113] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 848
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 849
2023, (doi: 10.13140/RG.2.2.13121.84321). 850
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 852
10.13140/RG.2.2.11758.69441). 853
HG156 [115] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 854
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 855
2023, (doi: 10.13140/RG.2.2.31891.35367). 856
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 858
10.13140/RG.2.2.19360.87048). 859
HG154 [117] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyper- 860
Total In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 861
2023, (doi: 10.13140/RG.2.2.32363.21286). 862
HG153 [118] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 863
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 864
(doi: 10.13140/RG.2.2.23266.81602). 865
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 867
10.13140/RG.2.2.19911.37285). 868
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 870
10.13140/RG.2.2.11050.90569). 871
HG150 [121] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 872
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, 873

HG149 [122] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHy- 875
perDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 876
HG148 [123] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyper- 878
Graph By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, 879
HG147 [124] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 881
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 882
(doi: 10.13140/RG.2.2.30182.50241). 883
HG146 [125] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 884
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 885
HG145 [126] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 887
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 888
HG144 [127] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 890
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 891
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 892
HG143 [128] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 893
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 894
Super separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 895
Super separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 898
Super separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 901
HG140 [131] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 902
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 903
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 904
separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 907
separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 910
HG137 [134] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 911
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 912

HG136 [135] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 914
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 915
2023, (doi: 10.13140/RG.2.2.17252.24968). 916
HG135 [136] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the 917
Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super 918
Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 919
HG134 [137] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 920
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 921

ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 922
HG132 [138] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 923
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 924

2023, 2023010396 (doi: 10.20944/preprints202301.0396.v1). 925
HG131 [139] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 926
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 927
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 928
HG130 [140] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 929
Recognition in The Confrontation With Super Attacks In Hyper Situations By 930
Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to 931

Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 932
HG129 [141] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 933

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

HG128 [142] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 937
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 938

SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 939
HG127 [143] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 940
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 941
2023,(doi: 10.13140/RG.2.2.36745.93289). 942
HG126 [144] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 943
HG125 [145] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 946
10.20944/preprints202301.0282.v1). 949
HG124 [146] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 950
10.20944/preprints202301.0267.v1).). 952

HG123 [147] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected 953
Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 954
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching 955
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 956
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 957
HG122 [148] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 958
prints202301.0262.v1). 961
HG121 [149] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 962
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 963
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 964
2023010224, (doi: 10.20944/preprints202301.0224.v1). 967
HG24 [151] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 968
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 969

10.13140/RG.2.2.35061.65767). 970
HG25 [152] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 971
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 972

Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 973
10.13140/RG.2.2.18494.15680). 974
HG26 [153] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 975
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 976

perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 977
10.13140/RG.2.2.32530.73922). 978
HG27 [154] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 979
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 980

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 981
10.13140/RG.2.2.15897.70243). 982

10.13140/RG.2.2.32530.73922). 986

prints202301.0105.v1). 989
HG28 [157] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 990
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 991

HG29 [158] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 993
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 994
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 995
10.13140/RG.2.2.23172.19849). 996
HG30 [161] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1003
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1004
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1005
10.13140/RG.2.2.17385.36968). 1006
HG107 [162] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 1007
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 1008
Beyond”, Preprints 2023, 2023010044 1009
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 1011
(doi: 10.20944/preprints202301.0043.v1). 1012
HG31 [164] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1013
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1014

2023, (doi: 10.13140/RG.2.2.28945.92007). 1015
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1020
10.13140/RG.2.2.35774.77123). 1021
HG35 [168] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1025
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1026

10.13140/RG.2.2.29430.88642). 1027

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

10.13140/RG.2.2.19380.94084). 1036
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 1040
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1044
(doi: 10.20944/preprints202212.0500.v1). 1047
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1049
10.13140/RG.2.2.20993.12640). 1050
HG952 [176] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1051
perHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1052

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

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1058
Classes”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1). 1059
HG94 [179] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic 1060

SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyper- 1061
Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1062
HG37 [180] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1063
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1064

10.13140/RG.2.2.29173.86244). 1065
HG38 [181] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1066
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1067
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1068

HG163b [182] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1069

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1070
HG162b [183] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1071
(doi: 10.5281/zenodo.7835063). 1072
HG161b [184] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1073
(doi: 10.5281/zenodo.7826705). 1074
HG160b [185] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1075
2023 (doi: 10.5281/zenodo.7820680). 1076
HG159b [186] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1077
10.5281/zenodo.7812750). 1078
HG158b [187] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1079

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

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1082
HG156b [189] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1083
2023 (doi: 10.5281/zenodo.7807782). 1084
HG155b [190] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1085
2023 (doi: 10.5281/zenodo.7804449). 1086
HG154b [191] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1087

HG153b [192] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1089
(doi: 10.5281/zenodo.7792307). 1090
HG152b [193] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1091
(doi: 10.5281/zenodo.7790728). 1092
HG151b [194] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1093
2023 (doi: 10.5281/zenodo.7787712). 1094
HG150b [195] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1095
10.5281/zenodo.7783791). 1096
HG149b [196] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1097
10.5281/zenodo.7780123). 1098
HG148b [197] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1099
(doi: 10.5281/zenodo.7773119). 1100
HG147b [198] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1101
odo.7637762). 1102
HG146b [199] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1103
10.5281/zenodo.7766174). 1104

HG145b [200] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1105
10.5281/zenodo.7762232). 1106
HG144b [201] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1107
(doi: 10.5281/zenodo.7758601). 1108
HG143b [202] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1109
10.5281/zenodo.7754661). 1110
HG142b [203] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1111
10.5281/zenodo.7750995) . 1112
HG141b [204] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1113
(doi: 10.5281/zenodo.7749875). 1114
HG140b [205] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1115
10.5281/zenodo.7747236). 1116
HG139b [206] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1117
10.5281/zenodo.7742587). 1118
HG138b [207] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1119
(doi: 10.5281/zenodo.7738635). 1120
HG137b [208] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1121
10.5281/zenodo.7734719). 1122
HG136b [209] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1123
10.5281/zenodo.7730484). 1124
HG135b [210] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1125
(doi: 10.5281/zenodo.7730469). 1126
HG134b [211] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1127
10.5281/zenodo.7722865). 1128
HG133b [212] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1129
odo.7713563). 1130
odo.7709116). 1132
HG131b [214] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1133
10.5281/zenodo.7706415). 1134
HG130b [215] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1135
(doi: 10.5281/zenodo.7706063). 1136
HG129b [216] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1137
(doi: 10.5281/zenodo.7701906). 1138
HG128b [217] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1139
odo.7700205). 1140

HG127b [218] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1141
10.5281/zenodo.7694876). 1142
HG126b [219] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1143
10.5281/zenodo.7679410). 1144
HG125b [220] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1145
10.5281/zenodo.7675982). 1146
HG124b [221] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1147
10.5281/zenodo.7672388). 1148
HG123b [222] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1149
odo.7668648). 1150
HG122b [223] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1151
10.5281/zenodo.7662810). 1152
HG121b [224] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1153
10.5281/zenodo.7659162). 1154
HG120b [225] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1155
odo.7653233). 1156
HG119b [226] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1157
odo.7653204). 1158
HG118b [227] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1159
odo.7653142). 1160
HG117b [228] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1161
odo.7653117). 1162
HG116b [229] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1163
odo.7653089). 1164
HG115b [230] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1165
odo.7651687). 1166
HG114b [231] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1167
odo.7651619). 1168
HG113b [232] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1169
odo.7651439). 1170
HG112b [233] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1171
odo.7650729). 1172
HG111b [234] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1173
odo.7647868). 1174
HG110b [235] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1175
odo.7647017). 1176

HG109b [236] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1177
odo.7644894). 1178
HG108b [237] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1179
odo.7641880). 1180
HG107b [238] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1181
odo.7632923). 1182
HG106b [239] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1183
odo.7623459). 1184
HG105b [240] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1185
10.5281/zenodo.7606416). 1186
HG104b [241] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1187
10.5281/zenodo.7606416). 1188
HG103b [242] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1189
odo.7606404). 1190
HG102b [243] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1191
10.5281/zenodo.7580018). 1192
HG101b [244] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1193
odo.7580018). 1194
odo.7580018). 1196
odo.7579929). 1198
HG98b [247] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1199
10.5281/zenodo.7563170). 1200
HG97b [248] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1201
odo.7563164). 1202
HG96b [249] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1203
odo.7563160). 1204
odo.7563160). 1206
HG94b [251] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1207
10.5281/zenodo.7563160). 1208
HG93b [252] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1209
10.5281/zenodo.7557063). 1210
HG92b [253] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1211
10.5281/zenodo.7557009). 1212

HG91b [254] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1213
10.5281/zenodo.7539484). 1214
HG90b [255] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1215
10.5281/zenodo.7523390). 1216
HG89b [256] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.7523390). 1218
HG88b [257] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1219
10.5281/zenodo.7523390). 1220
HG87b [258] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7574952). 1222
HG86b [259] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7574992). 1224
odo.7523357). 1226
HG84b [261] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1227
10.5281/zenodo.7523357). 1228
HG83b [262] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1229
10.5281/zenodo.7504782). 1230
HG82b [263] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1231
10.5281/zenodo.7504782). 1232
HG81b [264] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1233
10.5281/zenodo.7504782). 1234
HG80b [265] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1235
10.5281/zenodo.7499395). 1236
HG79b [266] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1237
odo.7499395). 1238
HG78b [267] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1239
10.5281/zenodo.7499395). 1240
HG77b [268] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1241
10.5281/zenodo.7497450). 1242
HG76b [269] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1243
10.5281/zenodo.7497450). 1244
HG75b [270] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1245
10.5281/zenodo.7494862). 1246
HG74b [271] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1247
odo.7494862). 1248

HG73b [272] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7494862). 1250
HG72b [273] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1251
10.5281/zenodo.7493845). 1252
HG71b [274] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1253
10.5281/zenodo.7493845). 1254
HG70b [275] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1255
10.5281/zenodo.7493845). 1256
HG69b [276] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1257
odo.7539484). 1258
HG68b [277] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1259
odo.7523390). 1260
HG67b [278] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1261
odo.7523357). 1262
HG66b [279] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1263
odo.7504782). 1264
HG65b [280] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1265
odo.7499395). 1266
HG64b [281] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1267
odo.7497450). 1268
HG63b [282] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1269
odo.7494862). 1270
HG62b [283] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1271
odo.7493845). 1272
HG61b [284] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1273
odo.7480110). 1274
HG60b [285] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1275
odo.7378758). 1276
HG32b [286] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1277
odo.6320305). 1278
HG44b [287] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1279
odo.6677173). 1280

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1330
is going to figure out what’s going on this phenomenon. The special case of this disease is 1331
considered and as the consequences of the model, some parameters are used. The cells are 1332
under attack of this disease but the moves of the cancer in the special region are the matter of 1333
mind. The recognition of the cancer could help to find some treatments for this disease. The 1334
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1335
Recognition” and both bases are the background of this research. Sometimes the cancer has 1336
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1337
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1338
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1339
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1340
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1341
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1342
and neutrality about the moves and the effects of the cancer on that region; this event leads 1346
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1347
perception on what’s happened and what’s done. There are some specific models, which 1348
are well-known and they’ve got the names, and some general models. The moves and the 1349
traces of the cancer on the complex tracks and between complicated groups of cells could 1350
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1351
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1352
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1353

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1354
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1355
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1356
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1357
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1358
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1359
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1360
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1361
based on the fixed groups of cells or the fixed groups of group of cells? 1362
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1363
messy and dense SuperHyperModels where embedded notions are illustrated? 1364
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1365
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1366
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1367

research has taken more motivations to define SuperHyperClasses and to find some connections 1368
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1369
instances and examples to make clarifications about the framework of this research. The general 1370
results and some results about some connections are some avenues to make key point of this 1371
research, “Cancer’s Recognition”, more understandable and more clear. 1372
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1373
on the modeling of the regions where are under the attacks of the cancer to recognize 1374
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1375
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1376
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1377
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1378
instances and literature reviews have taken the whole way through. In this scientific research, 1379
the literature reviews have fulfilled the lines containing the notions and the results. The 1380
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1382
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1383
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1384
of the moves of the cancer in the longest and strongest styles with the formation of the design 1385
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1386
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1387
out the background for the SuperHyperNotions. 1388

CHAPTER 5 1389
Extreme 1390
Eulerian-Type-Path-Decomposition 1391
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1392
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1393
2023, (doi: 10.13140/RG.2.2.34953.52320). 1394
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1395
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1396
(doi: 10.13140/RG.2.2.33275.80161). 1397
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1398
10.13140/RG.2.2.11050.90569). 1400
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1401
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1402
10.13140/RG.2.2.17761.79206). 1403
10.13140/RG.2.2.19911.37285). 1406
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1407
10.13140/RG.2.2.23266.81602). 1409
10.13140/RG.2.2.19360.87048). 1412
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1413
10.13140/RG.2.2.32363.21286). 1415
10.13140/RG.2.2.11758.69441). 1418
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1419
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1420
10.13140/RG.2.2.31891.35367). 1421
47

10.13140/RG.2.2.21510.45125). 1424
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1425
10.13140/RG.2.2.13121.84321). 1427

CHAPTER 6 1428
New Ideas On Super Decompensation By 1429
Hyper Decompress Of 1430
Eulerian-Type-Path-Decomposition In 1431
Cancer’s Recognition With 1432
(Neutrosophic) SuperHyperGraph 1433
49
CHAPTER 7 1434
ABSTRACT 1435
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1436

Type-Path-Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path- 1437
0
Decomposition pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1438
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type- 1439
Path-Decomposition if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path- 1440

Decomposition criteria holds 1441
∀E 0 ∈ P : P is
a SuperHyperPath and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition if the following expression is called 1442

Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition criteria holds 1443
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1444

SuperHyperEulerian-Type-Path-Decomposition if the following expression is called Neutrosophic v- 1445
SuperHyperEulerian-Type-Path-Decomposition criteria holds 1446
∀V 0 ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition if the following expression is called 1447

Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition criteria holds 1448
∀V 0 ∈ P : P is
51
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1449

SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian- 1450
Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic 1451
v-SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path- 1452
Decomposition. ((Neutrosophic) SuperHyperEulerian-Type-Path-Decomposition). Assume a Neutrosophic 1453
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 1454
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian- 1455

Type-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, 1456
Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type- 1457
Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) 1458
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 1459
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHy- 1460
perEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 1461

Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Path- 1462
Decomposition; a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutrosophic e- 1463
SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition, 1464
Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian- 1465
Type-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1466
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1467

sophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic 1468
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1469
SuperHyperEulerian-Type-Path-Decomposition; an Extreme SuperHyperEulerian-Type-Path-Decomposition Su- 1470
perHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, 1471

for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1474
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1475
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1476
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1477
that they form the Extreme SuperHyperEulerian-Type-Path-Decomposition; and the Extreme power is 1478
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition 1479

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, 1480
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 1483
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 1484
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1485
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1486
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1487
SuperHyperEulerian-Type-Path-Decomposition; and the Neutrosophic power is corresponded to its 1488
Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Path-Decomposition if it’s either 1489
of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian- 1490

Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic 1491
rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1492
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1493
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1494

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1495
form the Extreme SuperHyperEulerian-Type-Path-Decomposition; a Neutrosophic V-SuperHyperEulerian- 1496
Type-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, 1497
Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for 1499
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of 1500
the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1501

cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 1502
tices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; an Extreme 1503
V-SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic e- 1504
Type-Path-Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 1507
Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 1508
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1509
SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1510
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Path- 1511
Decomposition; and the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic 1512
SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic e- 1513

the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1517
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 1518
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1519

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1520
the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; and the Neutrosophic power is corres- 1521
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced for 1522
new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Path-Decomposition and Neutrosophic 1523
SuperHyperEulerian-Type-Path-Decomposition. Two different types of SuperHyperDefinitions are debut 1524
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1525
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1526
implemented in the whole of this research. For shining the elegancy and the significancy of this 1527
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1528
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1529
and the instances thus the clarifications are driven with different tools. The applications are 1530
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1531
Recognition” are the under research to figure out the challenges make sense about ongoing and 1532
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 1533
are different types of them. Some of them are individuals and some of them are well-modeled 1534
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 1535
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 1536
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 1537
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 1538
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 1539
this research. It’s also officially collected in the form of some questions and some problems. 1540

Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Path- 1541

Decomposition is a maximal of SuperHyperVertices with a maximum cardinality such that either 1542
of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 1543
of s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1544
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 1545
S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Path-Decomposition is 1546
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1547

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

make a SuperHyperEulerian-Type-Path-Decomposition more understandable. For the sake of having 1554
Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to “redefine” the notion of 1555
a “SuperHyperEulerian-Type-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 1556
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1557
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Path-Decomposition 1558
. It’s redefined a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if the mentioned Table 1559

holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy- 1560
perEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of 1561
The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1562
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1563
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1564
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1565
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 1566
based on a SuperHyperEulerian-Type-Path-Decomposition . It’s the main. It’ll be disciplinary to have 1567
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 1568
have all SuperHyperEulerian-Type-Path-Decomposition until the SuperHyperEulerian-Type-Path-Decomposition, 1569
then it’s officially called a “SuperHyperEulerian-Type-Path-Decomposition” but otherwise, it isn’t a 1570
SuperHyperEulerian-Type-Path-Decomposition . There are some instances about the clarifications for 1571
the main definition titled a “SuperHyperEulerian-Type-Path-Decomposition ”. These two examples 1572
get more scrutiny and discernment since there are characterized in the disciplinary ways 1573
of the SuperHyperClass based on a SuperHyperEulerian-Type-Path-Decomposition . For the sake 1574
of having a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to “redefine” 1575
the notion of a “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition” and a “Neutrosophic 1576

SuperHyperEulerian-Type-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 1577
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 1578
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 1579
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 1580
SuperHyperEulerian-Type-Path-Decomposition are redefined to a “Neutrosophic SuperHyperEulerian- 1581
Type-Path-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 1582
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1583
Neutrosophic SuperHyperEulerian-Type-Path-Decomposition more understandable. Assume a Neutro- 1584
sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 1585
Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Path-Decomposition, SuperHyperStar, 1586

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1587

SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition”, “Neutrosophic Supe- 1588
rHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 1589
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 1590
has a “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition” where it’s the strongest [the 1591
maximum Neutrosophic value from all the SuperHyperEulerian-Type-Path-Decomposition amid the 1592
maximum value amid all SuperHyperVertices from a SuperHyperEulerian-Type-Path-Decomposition .] 1593

SuperHyperEulerian-Type-Path-Decomposition . A graph is a SuperHyperUniform if it’s a SuperHyper- 1594
Graph and the number of elements of SuperHyperEdges are the same. Assume a Neutrosophic 1595
SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s 1596
only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; 1597
it’s SuperHyperEulerian-Type-Path-Decomposition if it’s only one SuperVertex as intersection amid 1598
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 1599
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 1600
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 1601
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex 1602
as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 1603
separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one 1604
SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one 1605
SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific 1606
designs and the specific architectures. The SuperHyperModel is officially called “SuperHy- 1607
perGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” 1608
cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the 1609
common and intended properties between “specific” cells and “specific group” of cells are 1610
SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1611

determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1612
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1613
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1614
in redeemed ways. The recognition of the cancer in the long-term function. The specific 1615
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 1616
the move from the cancer is identified by this research. Sometimes the move of the cancer 1617
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 1618
about the moves and the effects of the cancer on that region; this event leads us to choose 1619
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 1620
on what’s happened and what’s done. There are some specific models, which are well-known 1621
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 1622
the traces of the cancer on the complex tracks and between complicated groups of cells could 1623
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path-Decomposition, 1624
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 1625
aim is to find either the longest SuperHyperEulerian-Type-Path-Decomposition or the strongest 1626
SuperHyperEulerian-Type-Path-Decomposition in those Neutrosophic SuperHyperModels. For the 1627
longest SuperHyperEulerian-Type-Path-Decomposition, called SuperHyperEulerian-Type-Path-Decomposition, 1628

and the strongest SuperHyperEulerian-Type-Path-Decomposition, called Neutrosophic SuperHyperEulerian- 1629
Type-Path-Decomposition, some general results are introduced. Beyond that in SuperHyperStar, 1630
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 1631
essential to have at least three SuperHyperEdges to form any style of a SuperHyperEulerian- 1632

. There isn’t any formation of any SuperHyperEulerian-Type-Path-Decomposition

Type-Path-Decomposition 1633
but literarily, it’s the deformation of any SuperHyperEulerian-Type-Path-Decomposition. It, literarily, 1634
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type- 1635
Path-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1636
proposed. 1637
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Decomposition, Cancer’s 1638
Neutrosophic Recognition 1639


CHAPTER 8 1641
Applied Notions Under The Scrutiny Of 1642
The Motivation Of This Scientific 1643
Research 1644
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1645
try to bring the motivations in the narrative ways. Some cells have been faced with some 1646
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1647
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1648
as some groups and some groups or individuals have excessive labels which all are raised from 1649
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1650
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1651
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1652
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1653
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1654
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1655
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1656
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1657
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1658
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1659
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1660
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1661
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1662
disease but the model is going to figure out what’s going on this phenomenon. The special case 1663
of this disease is considered and as the consequences of the model, some parameters are used. 1664
The cells are under attack of this disease but the moves of the cancer in the special region are 1665
the matter of mind. The recognition of the cancer could help to find some treatments for this 1666
disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1667
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1668
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1669
of the moves of the cancer in the forms of alliances’ styles with the formation of the design 1671
and the architecture are formally called “ SuperHyperEulerian-Type-Path-Decomposition” in the themes 1672
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 1673
57
styles to figure out the background for the SuperHyperNotions. The recognition of the cancer 1674
in the long-term function. The specific region has been assigned by the model [it’s called 1675
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 1676
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 1677
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 1678
this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] to 1679
have convenient perception on what’s happened and what’s done. There are some specific 1680
models, which are well-known and they’ve got the names, and some general models. The moves 1681
and the traces of the cancer on the complex tracks and between complicated groups of cells 1682
could be fantasized by an Extreme SuperHyperPath (-/SuperHyperEulerian-Type-Path-Decomposition, 1683
aim is to find either the optimal SuperHyperEulerian-Type-Path-Decomposition or the Extreme 1685
SuperHyperEulerian-Type-Path-Decomposition in those Extreme SuperHyperModels. Some general 1686

results are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath 1687
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1688
SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Path-Decomposition. There isn’t any 1689
formation of any SuperHyperEulerian-Type-Path-Decomposition but literarily, it’s the deformation of 1690
any SuperHyperEulerian-Type-Path-Decomposition. It, literarily, deforms and it doesn’t form. 1691
amount of SuperHyperEulerian-Type-Path-Decomposition” of either individual of cells or the groups of cells 1693

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 1694
Type-Path-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 1695
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1696
messy and dense SuperHyperModels where embedded notions are illustrated? 1697
Thus it motivates us to define different types of “ SuperHyperEulerian-Type-Path-Decomposition” 1699
and “Extreme SuperHyperEulerian-Type-Path-Decomposition” on “SuperHyperGraph” and “Extreme 1700

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 1701
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 1702
motivates us to get some instances and examples to make clarifications about the framework of 1703
this research. The general results and some results about some connections are some avenues to 1704
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 1705
The framework of this research is as follows. In the beginning, I introduce basic definitions 1706
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1707
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1708
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1709
review literature are applied to make sense about what’s going to figure out about the 1710
upcoming sections. The main definitions and their clarifications alongside some results 1711
about new notions, SuperHyperEulerian-Type-Path-Decomposition and Extreme SuperHyperEulerian- 1712

Type-Path-Decomposition, are figured out in sections “ SuperHyperEulerian-Type-Path-Decomposition” and 1713
“Extreme SuperHyperEulerian-Type-Path-Decomposition”. In the sense of tackling on getting results 1714
and in Eulerian-Type-Path-Decomposition to make sense about continuing the research, the ideas of 1715
SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their consequences, 1716
corresponded SuperHyperClasses are figured out to debut what’s done in this section, 1717
titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As 1718

going back to origin of the notions, there are some smart steps toward the common 1719
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1720
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Extreme 1721
SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1722
concluding and closing section of theoretical research are contained in the section “General 1723
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1724
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 1725
“ SuperHyperEulerian-Type-Path-Decomposition”, “Extreme SuperHyperEulerian-Type-Path-Decomposition”, 1726
“Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 1727
questions about what’s done about the SuperHyperNotions to make sense about excellency 1728
of this research and going to figure out the word “best” as the description and adjective for 1729
this research as presented in section, “ SuperHyperEulerian-Type-Path-Decomposition”. The keyword of 1730
this research debut in the section “Applications in Cancer’s Recognition” with two cases and 1731
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 1732
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 1733
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 1734
happened in this research in the terms of “questions” and “problems” to make sense to figure 1735
out this research in featured style. The advantages and the limitations of this research alongside 1736
about what’s done in this research to make sense and to get sense about what’s figured out are 1737
included in the section, “Conclusion and Closing Remarks”. 1738

CHAPTER 9 1739
Extreme Preliminaries Of This Scientific 1740
Research On the Redeemed Ways 1741
In this section, the basic material in this scientific research, is referred to [Single Valued 1742
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1743
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1744

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1745
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1746
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1747
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1748
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1749
their clarifications are addressed to Ref.[HG38]. 1750

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

Let X be a Eulerian-Type-Path-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 [. 1753
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}.
61
Definition 9.0.3. The degree of truth-membership, indeterminacy-membership and

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

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1770
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1771
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1772
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1773
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1774
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1775

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

(Ref.[HG38],Definition 2.7,p.3). 1777
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1778
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1779
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1780
(i) If |Vi | = 1, then Vi is called vertex; 1781
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1782
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1783
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1784
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1785
SuperEdge; 1786
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1787
SuperHyperEdge. 1788
If we choose different types of binary operations, then we could get hugely diverse types of 1789
general forms of Neutrosophic SuperHyperGraph (NSHG). 1790
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1791

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1792
x, y, z, w ∈ [0, 1]: 1793
(i) 1 ⊗ x = x; 1794
(ii) x ⊗ y = y ⊗ x; 1795
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1796
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1797

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

where 1800

1, 2, . . . , n0 ); 1805
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1806
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1807
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1808
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1809
0


SuperEdge; 1829
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1832
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1833
makes the patterns and regularities. 1834
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1835
of elements of SuperHyperEdges are the same. 1836

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1837
makes to have SuperHyperUniform more understandable. 1838
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1839
Classes as follows. 1840
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1841
two given SuperHyperEdges with two exceptions; 1842
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1843
SuperHyperEdges; 1844
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1845
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1846
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1847
in common; 1848
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1849
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1850
SuperHyperEdge in common; 1851
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1852
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1853
SuperVertex. 1854
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 1855
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1856
(i) Vi , Vi+1 ∈ Ei0 ; 1857
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1858
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1859
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1860
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1861
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1862
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1863
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1864
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1866
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1867
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1868
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1869
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1870
perPath . 1871
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 1872
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1873
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1874
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1875
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1876
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1877

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1890
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1891
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1892
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Path- 1893

Decomposition). 1894
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1896
or E 0 is called 1897
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition if the following expression 1898

is called Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition criteria holds 1899
∀E 0 ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition if the following expression 1900

is called Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition criteria holds 1901
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1902
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition if the following expression 1903
is called Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition criteria holds 1904
∀V 0 ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition if the following expression 1905
∀V 0 ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1907

(v) Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 1908

sophic e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Type- 1909
Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic 1910
rv-SuperHyperEulerian-Type-Path-Decomposition. 1911
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Decomposition). 1912

(i) an Extreme SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 1915

rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for an Extreme SuperHyper- 1918
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1919
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1920
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1921
that they form the Extreme SuperHyperEulerian-Type-Path-Decomposition; 1922
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 1923

rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyper- 1926
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1927
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1928

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1929
such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; 1930
(iii) an Extreme SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial 1931

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic 1932
re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Path- 1933
Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) 1934
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 1937

Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 1938
perVertices such that they form the Extreme SuperHyperEulerian-Type-Path-Decomposition; and 1939
the Extreme power is corresponded to its Extreme coefficient; 1940
(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolyno- 1941

mial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, Neut- 1942
rosophic re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian- 1943
Type-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and 1944
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 1945
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 1946
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1947
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1948
the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; and the Neutrosophic power is 1950
corresponded to its Neutrosophic coefficient; 1951

(v) an Extreme V-SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 1952

S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1957

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 1960


SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1965
(vii) an Extreme V-SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial 1968

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

(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolyno- 1978

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1984

corresponded to its Neutrosophic coefficient. 1988
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Decomposition). 1989

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 1990
(i) an δ−SuperHyperEulerian-Type-Path-Decomposition is a Neutrosophic kind of Neutrosophic 1991
SuperHyperEulerian-Type-Path-Decomposition such that either of the following expressions hold 1992

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 1993
|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 1994
(29.1), holds if S is an δ−SuperHyperDefensive; 1995
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Decomposition is a Neutrosophic kind 1996

of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition such that either of the following 1997
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 1998
of s ∈ S : 1999
|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 2000
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2001
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need 2002

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2011
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Path-Decomposition, SuperHyperStar, 2012
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2013
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2014
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2015
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2016
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian- 2017
. Since there’s more ways to get type-results to make a Neutrosophic


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

136TBL4

136TBL1
SuperHyperEulerian-Type-Path-Decomposition more Neutrosophicly understandable. 2019

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to 2020
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition”. 2021
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 2022
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 2023
values. 2024
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Path-Decomposition. It’s redefined a Neutro- 2025
sophic SuperHyperEulerian-Type-Path-Decomposition if the Table (29.3) holds. 2026

CHAPTER 10 2027
Extreme SuperHyper But As Eulerian-Type-Path-Decomposition 2028
The Extensions Excerpt From Dense And 2029
Super Forms 2030
Definition 10.0.1. (Extreme event). 2031
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2032
a probability Eulerian-Type-Path-Decomposition. Any Extreme k-subset of A of V is called Extreme 2033
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2034
expression is called Extreme probability of A. 2035
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2036

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2037
is a probability Eulerian-Type-Path-Decomposition. s Extreme k-events Ai , i ∈ I is called Extreme 2038

s-independent if the following expression is called Extreme s-independent criteria 2039
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 2040
following expression is called Extreme independent criteria 2041
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2042

is a probability Eulerian-Type-Path-Decomposition. Any k-function Eulerian-Type-Path-Decomposition like E is 2044

called Extreme k-Variable. If k = 2, then any 2-function Eulerian-Type-Path-Decomposition like E 2045
is called Extreme Variable. 2046
The notion of independent on Extreme Variable is likewise. 2047
Definition 10.0.4. (Extreme Expectation). 2048
73
is a probability Eulerian-Type-Path-Decomposition. an Extreme k-Variable E has a number is called 2050

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

a probability Eulerian-Type-Path-Decomposition. an Extreme number is called Extreme Crossing if 2054

the following expression is called Extreme Crossing criteria 2055
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 2056
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let m and n propose special Eulerian-Type- 2057
Path-Decomposition. Then with m ≥ 4n, 2058
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Eulerian-Type-Path-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: 2059
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2060
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2061
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let P be a SuperHyperSet of n 2062
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 2063
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2064
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2065

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 2073
Then k < 5n4/3 . 2074
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2075
(V, E) is a probability Eulerian-Type-Path-Decomposition. Draw a SuperHyperUnit SuperHyperCircle 2076
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2077
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2078
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2079

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2084
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2085
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2086
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2087
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2088
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let X be a nonnegative Extreme 2089
Variable and t a positive real number. Then 2090
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. 2091
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2092
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let Xn be a nonnegative integer- 2093
valued variable in a probability Eulerian-Type-Path-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2094

n → ∞, then P (Xn = 0) → 1 as n → ∞. 2095
Proof. 2096
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. A special SuperHyperGraph in 2098
Gn,p almost surely has stability number at most d2p−1 log ne. 2099

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2100
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. A special SuperHyperGraph in Gn,p 2101
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2102
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2103
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2104
SuperHyperEdge of the Extreme SuperHyperGraph G. 2105
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2106
Extreme Variable for this Extreme Event. By equation, we have 2107
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 2108
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2109
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: 2110
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2111
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 2112
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2113
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2114
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2115
Definition 10.0.12. (Extreme Variance). 2116

is a probability Eulerian-Type-Path-Decomposition. an Extreme k-Variable E has a number is called 2118
Extreme Variance if the following expression is called Extreme Variance criteria 2119
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let X be an Extreme Variable 2121
and let t be a positive real number. Then 2122
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let X be an Extreme Variable and let t 2124
be a positive real number. Then 2125
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2126
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let Xn be an Extreme Variable in 2128
a probability Eulerian-Type-Path-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2129
then 2130
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Set X := Xn and t := |Ex(Xn )| in 2132
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2133
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2134
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 2136
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 2137
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2138
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. As in the proof of related Theorem, the 2140
result is straightforward. 2141
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 2143
be as defined in previous Theorem. Then either: 2144
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2145
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2146
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. The latter is straightforward. 2148
Definition 10.0.17. (Extreme Threshold). 2149

a probability Eulerian-Type-Path-Decomposition. Let P be a monotone property of SuperHyperGraphs 2151
(one which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for 2152
P is a function f (n) such that: 2153
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2154
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2155

Definition 10.0.18. (Extreme Balanced). 2156

is a probability Eulerian-Type-Path-Decomposition. Let F be a fixed Extreme SuperHyperGraph. 2158
Then there is a threshold function for the property of containing a copy of F as an Extreme 2159
SubSuperHyperGraph is called Extreme Balanced. 2160
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let F be a nonempty balanced 2162
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2163

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2164
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2167
the mentioned Extreme Figures in every Extreme items. 2168
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2169
Type-Path-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2170
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2171
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2172
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2173
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2174
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2175

V3 , is excluded in every given Extreme SuperHyperEulerian-Type-Path-Decomposition. 2176
C(N SHG)Extreme Eulerian-Type-Path-Decomposition

= {{E4 }}.
C(N SHG)Extreme Eulerian-Type-Path-Decomposition SuperHyperPolynomial
= z.
C(N SHG)Extreme V-Eulerian-Type-Path-Decomposition
= {{V1 }, {V2 }, {V4 }}.
C(N SHG)Extreme V-Eulerian-Type-Path-Decomposition SuperHyperPolynomial
= 3z.
2177
E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2180

SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2181
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2182
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2183
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2184
SuperHyperEulerian-Type-Path-Decomposition. 2185

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.3) 136NSHG1
= {{E4 }}.
= z.
= {{V1 }, {V2 }, {V4 }}.
= 3z.
2186

= {{E4 }}.
= z.
= {{V1 }, {V2 }, {V3 }}.
= 3z.
2189



= {{E4 , E1 , E2 }, {E5 , E1 , E2 }}.
= 2z 3 .
= {{Vi ∈ VN SHG }}.
= 2z 9 .
2192

= {{E1 , E4 }, {Ei , Ej }}.
= 6z 2 .
= {{Vi ∈ VEa , Vj ∈ VEb }}.

= z 10 + 4z 9 + z 8 .
2195

= {Eii=110 , Eii=2232 }, . . .}.
= 11z 10 .
= {{Vii=122 }}.
= 11z 22 .
2198

= {{Eii=110 , E17 , E14 , E13 }}.

= 3z 13 .
= {{Vi ∈ VN SHG }}.
= 3z 13 .
2201

= {{E3 , E4 , E2 }}.
= 3z 3 .
= {{Vii=414 }, . . .}.

= z 11 + 2z 10 .
2204

= {{Eii=110 , E22 , E23 }}.
= 11z 12 .
= {{Vii=122 }}.
= 11z 22 .
2207
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2208

SuperHyperEulerian-Type-Path-Decomposition, is up. The Extreme Algorithm is Extremely 2209
straightforward. 2210


= {{E2 , E7 , E3 }}.
= 3z 3 .
= {{Vii=414 }, . . .}.
= z 11 + 2z 10 .
2211


= {{E1 , E6 , E5 , E4 }}.
= 3z 4 .
= {{Vii=16 }}.

= 3z 6 .
2215


= {{E1 , E6 }}.
= 5z 2 .
= {{Vii=13 , Vii=79 }, . . .}
= 5z 6 .
2219


= {{E10 , E1 , E6 , E5 , E4 }}.
= 4z 5 .
= {{Vii=16 }}.
= 4z 6 .
2223


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


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


= {{E1 , E2 , E3 , E4 , E5 }}.
= z5.
= {{V1 , V2 , V3 , V4 , V5 , V6 }}.
= z6.
2231



= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
2235




= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
2239


= {{Ei ∈ EN SHG }}.


= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
2243


= {{Ei ∈ EN SHG \ {Ej }}}.
= |EN SHG |z |{Ei ∈EN SHG \{Ej }}| .
= {{Vi ∈ VN SHG \ {VEj }}}.

= |EN SHG |z |Vi ∈VN SHG \{VEj }| .
2247


= {{Ei , Ej }}.
= Ten Choose Two z 2 .
= {{VEi , VEj }}.
X |{V ,V }|
= z Ei Ej .
2251


= {{E2 }}.
= z.
= {{V2 , {R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }, V1 , V3 }}.
= z 10 .
2255


= {{Ei ∈ EN SHG \ {E1 }}}.

SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.3) 95NHG1
= z |{Ei ∈EN SHG \{E1 }}| .

= {{Vi ∈ VN SHG \ {VE1 }}}.
= z {|Vi ∈VN SHG \{VE1 }}| .
2259
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2260
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Decomposition 2261
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2262
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2263
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2264
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2265
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2266

SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.3) 95NHG2
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2267
quasi-R-Eulerian-Type-Path-Decomposition minus all Extreme SuperHypeNeighbor to some of them but not 2268
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2269
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Path- 2270
Decomposition, minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2271
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Type-Path-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Decomposition 2272
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2273
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2274
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2275
of Extreme SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Decomposition in some cases 2276
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2277
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2278
R-Eulerian-Type-Path-Decomposition. 2279
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition with the least Extreme cardinality, 2280

the lower sharp Extreme bound for cardinality. 2281
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2282
Then in the worst case, literally, 2283
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−Decomposition

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Eulerian-Type-Path-Decomposition. In other words, the least cardinality, the 2284
lower sharp bound for the cardinality, of an Extreme type-result-Eulerian-Type-Path-Decomposition is the 2285
cardinality of 2286

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

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

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

EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended
SuperHyperVertices but in an Extreme Eulerian-Type-Path-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-Eulerian-Type-Path-
Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Path-Decomposition 2289
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2290
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2291
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2292
number of Extreme SuperHyperVertices are renamed to Extreme Eulerian-Type-Path-Decomposition in 2293
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2294
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2295
contained in an Extreme R-Eulerian-Type-Path-Decomposition. 2296

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Ex- 2297
treme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2298
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme Super- 2299
HyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2300
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2301
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2302
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2303
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2304
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyper- 2305
Vertices. Thus it forms an Extreme quasi-R-Eulerian-Type-Path-Decomposition where the Extreme 2306
completion of the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embed- 2307
ded R-Eulerian-Type-Path-Decomposition. The SuperHyperNotions of embedded SuperHyperSet and 2308

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2309
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 2310
those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2311
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2312
included in the minimum Extreme style of the embedded Extreme R-Eulerian-Type-Path-Decomposition. 2313
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2314
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2315
common connections, more precise and more formal, the perfect unique connections inside 2316
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2317
Extreme R-Eulerian-Type-Path-Decomposition. Thus Extreme exterior SuperHyperVertices could be 2318
used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2319
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2320
Eulerian-Type-Path-Decomposition, there’s the usage of exterior Extreme SuperHyperVertices since 2321

they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 2322
than the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2323
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has 2324
been ignored in the exploring to lead on the optimal case implying the Extreme R-Eulerian-Type- 2325
Path-Decomposition. The Extreme R-Eulerian-Type-Path-Decomposition with the exclusion of the exclusion 2326
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2327
Extreme R-Eulerian-Type-Path-Decomposition with the inclusion of all Extreme SuperHyperVertices 2328
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Eulerian-Type-Path-Decomposition. To sum 2329
them up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2330
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2331
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Type- 2332
Path-Decomposition minus all Extreme SuperHypeNeighbor to some of them but not all of them. In 2333
other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 2334
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Path-Decomposition, minus 2335
all Extreme SuperHypeNeighbor to some of them but not all of them. 2336
The main definition of the Extreme R-Eulerian-Type-Path-Decomposition has two titles. an Ex- 2337
treme quasi-R-Eulerian-Type-Path-Decomposition and its corresponded quasi-maximum Extreme R- 2338
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2339
there’s an Extreme quasi-R-Eulerian-Type-Path-Decomposition with that quasi-maximum Extreme Su- 2340
perHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2341
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us 2342
to take the collection of all the Extreme quasi-R-Eulerian-Type-Path-Decompositions for all Extreme 2343
numbers less than its Extreme corresponded maximum number. The essence of the Extreme 2344
Eulerian-Type-Path-Decomposition ends up but this essence starts up in the terms of the Extreme quasi- 2345
R-Eulerian-Type-Path-Decomposition, again and more in the operations of collecting all the Extreme 2346
quasi-R-Eulerian-Type-Path-Decompositions acted on the all possible used formations of the Extreme 2347
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2348
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Path-Decompositions. Let 2349
zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Type-Path-Decomposition be an Extreme 2350

number, an Extreme SuperHyperSet and an Extreme Eulerian-Type-Path-Decomposition. Then 2351
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Path-Decomposition ,

|SExtreme SuperHyperSet |Extreme Cardinality

= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Path-Decomposition is re- 2352
formalized and redefined as follows. 2353
GExtreme Eulerian-Type-Path-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 2354
definition for the Extreme Eulerian-Type-Path-Decomposition. 2355
GExtreme Eulerian-Type-Path-Decomposition =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Eulerian-Type- 2356
poses the upcoming expressions.
Path-Decomposition 2357
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2358
= max zExtreme Number

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

And then, 2359

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


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

2362

2363

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2364
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2365
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2366
HyperEdge. It’s, literarily, another name for “Extreme Quasi-Eulerian-Type-Path-Decomposition” but, 2367
precisely, it’s the generalization of “Extreme Quasi-Eulerian-Type-Path-Decomposition” since “Extreme 2368

Quasi-Eulerian-Type-Path-Decomposition” happens “Extreme Eulerian-Type-Path-Decomposition” in an Extreme 2369

SuperHyperGraph as initial framework and background but “Extreme SuperHyperNeighborhood” 2370
may not happens “Extreme Eulerian-Type-Path-Decomposition” in an Extreme SuperHyperGraph as 2371
initial framework and preliminarily background since there are some ambiguities about the 2372
Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Extreme 2373
SuperHyperNeighborhood”, “Extreme Quasi-Eulerian-Type-Path-Decomposition”, and “Extreme Eulerian- 2374
Type-Path-Decomposition” are up. 2375

Thus, let 2376
zExtreme Number , NExtreme SuperHyperNeighborhood and 2377
GExtreme Eulerian-Type-Path-Decomposition be an Extreme number, an Extreme SuperHyperNeighbor- 2378
hood and an Extreme Eulerian-Type-Path-Decomposition and the new terms are up. 2379
GExtreme Eulerian-Type-Path-Decomposition ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2380
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2381
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2382

And with go back to initial structure, 2383
GExtreme Eulerian-Type-Path-Decomposition ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

2385

2386

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

The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Decomposition. The

Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Eulerian-Type-Path-Decomposition C(ESHG) for an Extreme SuperHyperGraph

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

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Eulerian-Type-Path-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 Eulerian-Type-Path-Decomposition is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Eulerian-Type-Path-Decomposition is an Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-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-Eulerian-Type-Path-

. Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Decomposition
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Eulerian-Type-Path-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 Eulerian-Type-Path-Decomposition and
it’s an Extreme Eulerian-Type-Path-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
Eulerian-Type-Path-Decomposition. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Eulerian-Type-Path-Decomposition,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type-Path-

Decomposition, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2387
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2388
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2389
the 2390
“Extreme R-Eulerian-Type-Path-Decomposition” 2391
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2392
Extreme R-Eulerian-Type-Path-Decomposition, 2393
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only an Extreme free-triangle embedded SuperHyperModel and an
Extreme on-triangle embedded SuperHyperModel but also it’s an Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Eulerian-Type-Path-Decomposition amid those obvious simple Extreme type-SuperHyperSets
of the Extreme Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition. In other words, the least cardinality, the lower

sharp bound for the cardinality, of an Extreme R-Eulerian-Type-Path-Decomposition is the cardinality
of
2394
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2395
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Path-Decomposition if for 2396
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2397
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2398
all minus all Extreme SuperHypeNeighbors to any amount of them. 2399
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2400
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2401
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2402
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2403
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2404
R-Eulerian-Type-Path-Decomposition with the least cardinality, the lower sharp Extreme bound for 2405
Extreme cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2406
Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme 2407
SuperHyperSet S of the Extreme SuperHyperVertices such that there’s an Extreme Supe- 2408
rHyperEdge to have some Extreme SuperHyperVertices uniquely but it isn’t an Extreme 2409
R-Eulerian-Type-Path-Decomposition. Since it doesn’t have 2410
2411
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2412
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2413
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2414
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Super- 2415
HyperVertices but it isn’t an Extreme R-Eulerian-Type-Path-Decomposition. Since it doesn’t do 2416
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2417
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2418
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2419
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2420
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2421
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2422
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2423

Thus the obvious Extreme R-Eulerian-Type-Path-Decomposition, VESHE is up. The obvious simple Ex- 2424
treme type-SuperHyperSet of the Extreme R-Eulerian-Type-Path-Decomposition, VESHE , is an Extreme 2425
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2426
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2427
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2428
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2429

S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2430
some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2431
ESHG : (V, E). Any Extreme R-Eulerian-Type-Path-Decomposition only contains all interior Extreme 2432
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2433
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2434
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2435

SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2436
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2437
The SuperHyperNotion, namely, Eulerian-Type-Path-Decomposition, is up. There’s neither empty 2438
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2439
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2440
the Extreme Eulerian-Type-Path-Decomposition. The Extreme SuperHyperSet of Extreme SuperHy- 2441
perEdges[SuperHyperVertices], 2442

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type-Path-Decomposition. The 2443
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2444

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Decomposition C(ESHG) for an Extreme SuperHyperGraph 2445

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2446
2447
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2448
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2449
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2450
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2451
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Path-Decomposition is up. The 2452
obvious simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Decomposition is 2453

an Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2454
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2455

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

= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2456
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type- 2457
Path-Decomposition is up. To sum them up, the Extreme SuperHyperSet of the Extreme 2458
SuperHyperEdges[SuperHyperVertices], 2459

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Eulerian-Type-Path-Decomposition C(ESHG) for an Extreme SuperHyperGraph 2463
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2464
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2465
that Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Path-Decomposition and it’s an 2466
Extreme Eulerian-Type-Path-Decomposition. Since it’s 2467
2468
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2469
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2470
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2471
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2472
intended Extreme SuperHyperSet, 2473

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Eulerian-Type-Path-Decomposition , 2474

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

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2478
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2479
SuperHyperSet called the 2480
“Extreme Eulerian-Type-Path-Decomposition ” 2481
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2482
Extreme ,
is only and only 2484

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

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

= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
Proof. Let 2493
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2494
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
115
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Path-Decomposition in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2495
new way to redefine as 2496
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 2497
to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Path-Decomposition. The latter is 2498

136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2500
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2501
(31.1), is the SuperHyperEulerian-Type-Path-Decomposition. 2502
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2503

= {{Ei ∈ EN SHG \ {Ej }}}.

= {{Vi ∈ VN SHG \ {VEj }}}.

Proof. Let 2504
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2505
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 2506

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

= {{Ei , Ej }}.
= |EN SHG |Choose Two z 2 .
= {{VEi , VEj }}.
X |{V ,V }|
= z Ei Ej .

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

SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2515
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2516
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 2517
way to redefine as 2518


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

SuperHyperEulerian-Type-Path-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), 2522
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2523
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2524
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2525
Type-Path-Decomposition. 2526
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2527

= {{Ei ∈ PNmin
SHG }}.
X min
= z |{Ei ∈PN SHG }| .
= {{VEi ∈PNmin
SHG
}}.
X |{V min }|
= z Ei ∈PN SHG .
Proof. Let 2528
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
2529
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 2530
a new way to redefine as 2531

straightforward. Then there’s no at least one SuperHyperEulerian-Type-Path-Decomposition. Thus the 2534
notion of quasi may be up but the SuperHyperNotions based on SuperHyperEulerian-Type-Path- 2535
Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2536
could have one SuperHyperVertex as the representative in the 2537
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Decomposition taken from a connected Extreme SuperHy- 2538

perBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme- 2539
of-SuperHyperPart SuperHyperEdges are attained in any solution 2540
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2541
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2542
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2543
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2544
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2545
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Type-Path-Decomposition. 2546

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

Extreme SuperHyperEulerian-Type-Path-Decomposition in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2547
Then 2548

= {{Ei ∈ PNmin
SHG }}.
X min
= z |{Ei ∈PN SHG }| .
= {{VEi ∈PNmin
SHG
}}.
X |{V min }|
= z Ei ∈PN SHG .
Proof. Let 2549
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

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

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

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

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

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

= {{Ei ∈ (EN SHG \ {Ej }) ∪ {Ek∗ }}}.

∗
= |EN SHG |z |{Ei ∈(EN SHG \{Ej })∪{Ek }}| .
= {{VEi ∈(EN SHG \{Ej })∪{Ek∗ } }}.
X |{V ∗ }|
= z Ei ∈(EN SHG \{Ej })∪{Ek } .
Proof. Let 2570
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2571
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

Extreme SuperHyperEulerian-Type-Path-Decomposition in the Extreme Example (42.0.15) 136NSHG23a
perWheel ESHW : (V, E). There’s a new way to redefine as 2573

straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Decomposition. Thus the 2576
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Path- 2577
Decomposition could be applied. The unique embedded SuperHyperEulerian-Type-Path-Decomposition 2578
proposes some longest SuperHyperEulerian-Type-Path-Decomposition excerpt from some representatives. 2579

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2581
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2582
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2583
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2584
Extreme SuperHyperEulerian-Type-Path-Decomposition. 2585

CHAPTER 12 2586
The Surveys of Mathematical Sets On 2587
The Results But As The Initial Motivation 2588
For the SuperHyperEulerian-Type-Path-Decomposition, Extreme SuperHyperEulerian-Type-Path-Decomposition, and 2589

the Extreme SuperHyperEulerian-Type-Path-Decomposition, some general results are introduced. 2590
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Type-Path-Decomposition is “re- 2591
defined” on the positions of the alphabets. 2592
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Type-Path-Decomposition. Then 2593
Extreme SuperHyperEulerian − T ype − P ath − Decomposition =

{theSuperHyperEulerian − T ype − P ath − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − Decomposition
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−P ath−Decomposition. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2594
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2595

and the neutrality, for i = 1, 2, 3, respectively. 2596
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the al- 2597
phabet. Then the notion of Extreme SuperHyperEulerian-Type-Path-Decomposition and SuperHyperEulerian- 2598
Type-Path-Decomposition coincide. 2599
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2600
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2601
SuperHyperEulerian-Type-Path-Decomposition if and only if it’s a SuperHyperEulerian-Type-Path-Decomposition. 2602
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2603
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2604
SuperHyperEulerian-Type-Path-Decomposition if and only if it’s a longest SuperHyperEulerian-Type-Path- 2605
Decomposition. 2606
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2607

identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Decomposition is its 2608
SuperHyperEulerian-Type-Path-Decomposition and reversely. 2609
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path-Decomposition, 2610

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2611
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Path-Decomposition is its 2612
SuperHyperEulerian-Type-Path-Decomposition and reversely. 2613
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2614
isn’t well-defined if and only if its SuperHyperEulerian-Type-Path-Decomposition isn’t
well-defined. 2616
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its Ex- 2617
treme SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined if and only if its SuperHyperEulerian- 2618
Type-Path-Decomposition isn’t well-defined. 2619
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path- 2620

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Decomposition 2621
Then its Extreme SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined if and only if its 2622
SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined. 2623
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2624
is well-defined if and only if its SuperHyperEulerian-Type-Path-Decomposition is well-
defined. 2626
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2627
Extreme SuperHyperEulerian-Type-Path-Decomposition is well-defined if and only if its SuperHyperEulerian- 2628

Type-Path-Decomposition is well-defined. 2629
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Path- 2630
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper-

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

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2646
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2647
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2648

independent SuperHyperSet is 2649
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2652
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2656

which is a SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath. Then V is a maximal 2657
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2658
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2659
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2660
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2661
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2662
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2663
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2664
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2665
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2666
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2667
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2668
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2669
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2670
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2671
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2672
which is a SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath. Then the number of 2675

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

which is a SuperHyperWheel. Then the number of 2685
(i) : the dual SuperHyperEulerian-Type-Path-Decomposition; 2686
(ii) : the dual SuperHyperEulerian-Type-Path-Decomposition; 2687
(iii) : the dual connected SuperHyperEulerian-Type-Path-Decomposition; 2688
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 2689
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 2690
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition. 2691
coincide. 2693

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2695
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2696
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2697
is a 2698
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2702
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2703
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2704


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2707
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2708
SuperHyperPart is a 2709
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2713
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2714
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2715

SuperHyperMultipartite. Then Then the number of 2718
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2725
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2726
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2728
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2729
(iv) : SuperHyperEulerian-Type-Path-Decomposition; 2733
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2734
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2735

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2736
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2737
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2738
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2739

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

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

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

SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 2759
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 2760
dual 2761
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2765
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2766

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2767
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2768
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2769

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


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

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

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

Decomposition; 2806
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2807
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2808
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2809
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Decomposition. 2811

Then 2812
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2813

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2823
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2824
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2826
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Decomposition; 2827
(ii) Γ = 1; 2828
(iii) Γs = Σ3i=1 σi (c); 2829

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Path- 2830
Decomposition. 2831
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2832
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2833
SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 2834
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2835
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2836
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2837
SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 2838
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2839
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type- 2840
Path-Decomposition; 2841
(ii) Γ = b n2 c + 1; 2842
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2843
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2844
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2846
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 2847
Decomposition; 2848
(ii) Γ = b n2 c; 2849

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

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

Type-Path-Decomposition for N SHF; 2856
(ii) Γ = m for N SHF : (V, E); 2857
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2858
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2859
Path-Decomposition for N SHF : (V, E). 2860

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2862
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 2863
SuperHyperEulerian-Type-Path-Decomposition for N SHF; 2864
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2865

b n c+1 for N SHF : (V, E); 2866
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal SuperHyperEulerian-Type-Path- 2867
Decomposition for N SHF : (V, E). 2868
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2869
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2870
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 2871
Decomposition for N SHF : (V, E); 2872
(ii) Γ = b n2 c for N SHF : (V, E); 2873

bnc for N SHF : (V, E); 2874
S={vi }i=1
bnc
are only dual maximal SuperHyperEulerian-Type-Path- 2875
following statements hold; 2878
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2879

SuperHyperEulerian-Type-Path-Decomposition, then S is an s-SuperHyperDefensive SuperHyperEulerian-2880
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2882

SuperHyperEulerian-Type-Path-Decomposition, then S is a dual s-SuperHyperDefensive 2883
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2887

SuperHyperEulerian-Type-Path-Decomposition, then S is an s-SuperHyperPowerful SuperHyperEulerian- 2888

SuperHyperEulerian-Type-Path-Decomposition, then S is a dual s-SuperHyperPowerful 2891
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2893
SuperHyperGraph. Then following statements hold; 2894

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

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

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

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


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

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


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

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

SuperHyperGraph which is SuperHyperEulerian-Type-Path-Decomposition. Then following statements 2934

hold; 2935
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 2936
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 2938

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

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


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

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


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

SuperHyperEulerian-Type-Path-Decomposition 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

136TBLaa21aa
result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite 2989

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHyperEulerian- 2990

CHAPTER 15 2992
Case 2: The Increasing Extreme Steps 2993
Toward Extreme 2994
SuperHyperMultipartite as Extreme 2995
SuperHyperModel 2996
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipartite 2997
is Extreme highlighted and Extreme featured. 2998
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2999
partite is obtained. 3000
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, of the 3001
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

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

(V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHyperEulerian-Type-Path- 3003
Decomposition. 3004

CHAPTER 16 3005
Wondering Open Problems But As The 3006
Directions To Forming The Motivations 3007
In what follows, some “problems” and some “questions” are proposed. 3008
The SuperHyperEulerian-Type-Path-Decomposition and the Extreme SuperHyperEulerian-Type-Path-Decomposition 3009
are defined on a real-world application, titled “Cancer’s Recognitions”. 3010
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3011
recognitions? 3012
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path- 3013

and the Extreme SuperHyperEulerian-Type-Path-Decomposition?
Decomposition 3014
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3015
them? 3016
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3017
and the Extreme SuperHyperEulerian-Type-Path-Decomposition?
Problem 16.0.5. The SuperHyperEulerian-Type-Path-Decomposition and the Extreme SuperHyperEulerian- 3019

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperEulerian-Type-Path-Decomposition, are there else? 3021
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3022
Numbers types-results? 3023
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3024
the multiple types of SuperHyperNotions? 3025
143
CHAPTER 17 3026
Conclusion and Closing Remarks 3027
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3028
research are illustrated. Some benefits and some advantages of this research are highlighted. 3029
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3030
In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Path- 3031
Decomposition. For that sake in the second definition, the main definition of the Extreme 3032
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3033
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperEulerian- 3034
Type-Path-Decomposition, finds the convenient background to implement some results based on that. 3035
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3036
on the modeling of the regions where are under the attacks of the cancer to recognize this 3037
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 3038
on the SuperHyperNotion, SuperHyperEulerian-Type-Path-Decomposition, the new SuperHyperClasses 3039
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 3040
the SuperHyperEulerian-Type-Path-Decomposition and the Extreme SuperHyperEulerian-Type-Path-Decomposition. 3041

The clarifications, instances and literature reviews have taken the whole way through. In this 3042
research, the literature reviews have fulfilled the lines containing the notions and the results. The 3043
Recognitions” and both bases are the background of this research. Sometimes the cancer has been 3045
happened on the region, full of cells, groups of cells and embedded styles. In this segment, the 3046
SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the moves 3047
of the cancer in the longest and strongest styles with the formation of the design and the 3048
architecture are formally called “ SuperHyperEulerian-Type-Path-Decomposition” in the themes of jargons 3049
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 3050
the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues for this 3051
research are, figured out, pointed out and spoken out. 3052
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Decomposition
3. Extreme SuperHyperEulerian-Type-Path-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3053
Extreme SuperHyperDuality But As The 3054
Extensions Excerpt From Dense And 3055
Super Forms 3056
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3057

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

Va ∈ Ei , Ej ; 3061
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3062
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3063
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3064
Vi , Vj ∈ Ea ; 3065
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3066
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3067
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3068
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3069

SuperHyperDuality. 3070
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3071

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3076
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3077
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3078
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3079
Extreme SuperHyperDuality; 3080
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3081

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3082
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3083
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3084
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3085
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3086
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3087

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3088
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3089
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3090
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3091
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3092
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3093
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3094
coefficient; 3095
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3096

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3119
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3120
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3121
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3122
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3123

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3124

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

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


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

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

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

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



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

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

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3245

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

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

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

∃!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 3270
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3271
Extreme SuperHyperDuality. 3277

CHAPTER 19 3278
Extreme SuperHyperJoin But As The 3279
Super Forms 3281
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3282

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3293
|Vj |NEUTROSOPIC CARDINALITY ; 3294
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3295
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3296
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3297

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3301
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3302
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3303
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3304
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3305
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3306

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3313
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3314
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3315
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3316
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3317
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3318
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3319
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3320

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3332
SuperHyperJoin; 3334
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3335

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3338
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3339
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3340
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3341
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3342

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3345

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

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

SuperHyperJoin. 3366
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 3368
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3369
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3370
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3371
V3 , is excluded in every given Extreme SuperHyperJoin. 3373

is up. The Extreme Algorithm is Extremely straightforward. 3375


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3496
Extreme SuperHyperPerfect But As The 3497
Super Forms 3499
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3500

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3512
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3513

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3517
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3518
Extreme SuperHyperPerfect; 3522
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3523

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

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

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

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

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

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


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

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


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

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

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

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

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



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

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

Then 3685

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



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

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

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


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

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

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3734
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3735

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3739
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3741
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3742
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3743
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3744

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3751
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3752
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3753
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3754
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3755
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3756
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3757
cient; 3758
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3759

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3760
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3762
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3763
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3764

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3770
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3771
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3772
SuperHyperTotal; 3774
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3775

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3782
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3783
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3786
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3787
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3788
Extreme coefficient; 3789

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

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

V3 , is excluded in every given Extreme SuperHyperTotal. 3815



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3863
(31.1), is the SuperHyperTotal. 3866
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 3868
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. 3875
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 3877
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3939
Extreme SuperHyperConnected But As 3940
Super Forms 3942
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3943

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3957
SuperHyperConnected. 3958
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3959
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3962

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3976
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3977
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3978
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3979
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3982
power is corresponded to its Extreme coefficient; 3983
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3984


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

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

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

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

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

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


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

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


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

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

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 4084
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. 4088
(31.1), is the SuperHyperConnected. 4091
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 4093
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. 4100
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 4102



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4121

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


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

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

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


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

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

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


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 4227
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 4228
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 4229
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 4230
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by Henry Garrett 4231
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 4232
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 4233
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 4234
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 4235
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 4236

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 4237
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 4238
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 4239
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 4240
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 4241
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 4242

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

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

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 4248
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 4249
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 4250
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 4251
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 4252
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 4253
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 4254
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 4255
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 4256
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 4257
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 4258
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 4259

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

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

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett 4272
(2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neut- 4273
rosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 4274
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), 4276
“Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyper- 4277

Resolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material 4278
of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic 4279
SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by 4280
Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 4281

the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 4299
side scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 4300


HG158b; HG159b; HG160b; HG161b; HG162b; HG163b]. Two popular scientific 4312
research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on neutro- 4313
sophic science is on [HG32b; HG44b]. 4314
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 4315
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 4316
than 4276 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 4317
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 4318
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 4325
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 4326
that what’s done in this research book which is popular in the terms of high readers in Scribd. 4327
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 4328
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 4329
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 4330

HG241; HG242; HG243; HG244; HG245; HG246; HG247; HG248; HG249] along- 4347


Bibliography 4363
10.33140/JMTCM.01.03.09) 4370
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 4388
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 4389
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 4390
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 4391
223
10.20944/preprints202301.0282.v1). 4398
10.20944/preprints202301.0267.v1). 4401
Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 4405

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4406
prints202301.0262.v1). 4410
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4416
prints202301.0105.v1). 4419
Preprints 2023, 2023010044 4425
(doi: 10.20944/preprints202301.0043.v1). 4428

(doi: 10.20944/preprints202212.0549.v1). 4437
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Su- 4438
perHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neut- 4439
rosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) Su- 4440
perHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 4441
(doi: 10.20944/preprints202212.0500.v1). 4444
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 4455

10.5281/zenodo.7834229). 4459
10.5281/zenodo.7834261). 4462
10.5281/zenodo.7824560). 4465
(doi: 10.5281/zenodo.7824623). 4468

2023, (doi: 10.5281/zenodo.7809365). 4479
2023, (doi: 10.5281/zenodo.7809358). 4482
10.5281/zenodo.7809219). 4485
HG237 [37] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 4486
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 4487
10.5281/zenodo.7809328). 4488
2023, (doi: 10.5281/zenodo.7806767). 4491
2023, (doi: 10.5281/zenodo.7806838). 4494
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 4496
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 4497
(doi: 10.5281/zenodo.7799902). 4503
2023, (doi: 10.5281/zenodo.7804218). 4506

(doi: 10.5281/zenodo.7796334). 4509
10.5281/zenodo.7791952). 4515
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 4517
10.5281/zenodo.7791982). 4518
10.5281/zenodo.7790026). 4521
HG223 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 4522
10.5281/zenodo.7790052). 4524
2023, (doi: 10.5281/zenodo.7787066). 4527
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 4529
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 4530
10.5281/zenodo.7781476). 4533
10.5281/zenodo.7783082). 4536
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 4538
10.5281/zenodo.7777857). 4539
10.5281/zenodo.7779286). 4542
(doi: 10.5281/zenodo.7771831). 4545

2023, (doi: 10.5281/zenodo.7772468). 4548
10.13140/RG.2.2.20913.25446). 4551
HG212 [59] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 4552
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 4553
odo.7764916). 4554
10.13140/RG.2.2.11770.98247). 4557
10.13140/RG.2.2.12400.12808). 4560
2023, (doi: 10.13140/RG.2.2.22545.10089). 4563
10.13140/RG.2.2.11377.76644). 4569
10.13140/RG.2.2.23750.96329). 4572
10.13140/RG.2.2.31366.24641). 4575
10.13140/RG.2.2.34721.68960). 4578
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 4580
2023, (doi: 10.13140/RG.2.2.30212.81289). 4581

10.13140/RG.2.2.24288.35842). 4587
10.13140/RG.2.2.32467.25124). 4590
10.13140/RG.2.2.31025.45925). 4593
10.13140/RG.2.2.17184.25602). 4596
10.13140/RG.2.2.23423.28327). 4599
10.13140/RG.2.2.28456.44805). 4602
10.13140/RG.2.2.23525.68320). 4605
HG194 [77] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 4606
10.13140/RG.2.2.20170.24000). 4608
10.13140/RG.2.2.36475.59683). 4611
10.13140/RG.2.2.29764.71046). 4614
2023, (doi: 10.13140/RG.2.2.18780.87683). 4617
10.13140/RG.2.2.26134.01603). 4623

HG188 [83] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 4624
10.13140/RG.2.2.27392.30721). 4626
10.13140/RG.2.2.33028.40321). 4629
10.13140/RG.2.2.21389.20966). 4632
10.13140/RG.2.2.16356.04489). 4635
10.13140/RG.2.2.21756.21129). 4638
HG183 [88] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 4639
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 4640
10.13140/RG.2.2.30983.68009). 4641
10.13140/RG.2.2.28552.29445). 4644
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 4646
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 4647
10.13140/RG.2.2.35105.89447). 4650
(doi: 10.13140/RG.2.2.30072.72960). 4653
10.13140/RG.2.2.31147.52003). 4656
10.13140/RG.2.2.32825.24163). 4659
10.13140/RG.2.2.13059.58401). 4662

10.13140/RG.2.2.11172.14720). 4665
2023, (doi: 10.13140/RG.2.2.22011.80165). 4668
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4671
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 4673
2023, (doi: 10.13140/RG.2.2.10493.84962). 4674
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4677
2023, (doi: 10.13140/RG.2.2.19944.14086). 4680
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4683
(doi: 10.13140/RG.2.2.33103.76968). 4686
HG167 [104] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 4687
(doi: 10.13140/RG.2.2.23037.44003). 4689
(doi: 10.13140/RG.2.2.35646.56641). 4692
(doi: 10.13140/RG.2.2.18030.48967). 4695
(doi: 10.13140/RG.2.2.13973.81121). 4698
2023, (doi: 10.13140/RG.2.2.34106.47047). 4701

2023, (doi: 10.13140/RG.2.2.31956.88961). 4707
2023, (doi: 10.13140/RG.2.2.15179.67361). 4710
10.13140/RG.2.2.21510.45125). 4713
HG158 [113] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 4714
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 4715
2023, (doi: 10.13140/RG.2.2.13121.84321). 4716
10.13140/RG.2.2.11758.69441). 4719
2023, (doi: 10.13140/RG.2.2.31891.35367). 4722
10.13140/RG.2.2.19360.87048). 4725
HG154 [117] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 4726
10.13140/RG.2.2.32363.21286). 4728
10.13140/RG.2.2.23266.81602). 4731
10.13140/RG.2.2.19911.37285). 4734
10.13140/RG.2.2.11050.90569). 4737
HG150 [121] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 4738
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 4739
2023, (doi: 10.13140/RG.2.2.17761.79206). 4740

HG149 [122] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 4741
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 4742
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 4745
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4746
(doi: 10.13140/RG.2.2.30182.50241). 4749

2023, (doi: 10.13140/RG.2.2.17252.24968). 4782

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 4790

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4791
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4794
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 4796
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 4797

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 4798


HG128 [142] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 4803
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 4804

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 4805
2023,(doi: 10.13140/RG.2.2.36745.93289). 4808
10.20944/preprints202301.0282.v1). 4815
10.20944/preprints202301.0267.v1).). 4818

2023010265 (doi: 10.20944/preprints202301.0265.v1). 4823
prints202301.0262.v1). 4827
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4833

10.13140/RG.2.2.35061.65767). 4836

10.13140/RG.2.2.18494.15680). 4840

10.13140/RG.2.2.32530.73922). 4844
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 4846

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 4847
10.13140/RG.2.2.15897.70243). 4848

10.13140/RG.2.2.32530.73922). 4852

prints202301.0105.v1). 4855

10.13140/RG.2.2.23172.19849). 4862
10.13140/RG.2.2.17385.36968). 4872
Preprints 2023, 2023010044 4875
(doi: 10.20944/preprints202301.0043.v1). 4878

2023, (doi: 10.13140/RG.2.2.28945.92007). 4881
10.13140/RG.2.2.35774.77123). 4887

10.13140/RG.2.2.29430.88642). 4893

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

10.13140/RG.2.2.19380.94084). 4902
(doi: 10.20944/preprints202212.0500.v1). 4913
10.13140/RG.2.2.20993.12640). 4916
HG952 [176] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 4917

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

10.13140/RG.2.2.29173.86244). 4931
HG38 [181] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 4932
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 4933
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 4934


(doi: 10.5281/zenodo.7835063). 4938
(doi: 10.5281/zenodo.7826705). 4940
2023 (doi: 10.5281/zenodo.7820680). 4942
10.5281/zenodo.7812750). 4944


2023 (doi: 10.5281/zenodo.7807782). 4950
2023 (doi: 10.5281/zenodo.7804449). 4952

(doi: 10.5281/zenodo.7792307). 4956
(doi: 10.5281/zenodo.7790728). 4958
2023 (doi: 10.5281/zenodo.7787712). 4960
10.5281/zenodo.7783791). 4962
10.5281/zenodo.7780123). 4964
(doi: 10.5281/zenodo.7773119). 4966
odo.7637762). 4968
10.5281/zenodo.7766174). 4970

10.5281/zenodo.7762232). 4972
(doi: 10.5281/zenodo.7758601). 4974
10.5281/zenodo.7754661). 4976
10.5281/zenodo.7750995) . 4978
(doi: 10.5281/zenodo.7749875). 4980
10.5281/zenodo.7747236). 4982
10.5281/zenodo.7742587). 4984
(doi: 10.5281/zenodo.7738635). 4986
10.5281/zenodo.7734719). 4988
10.5281/zenodo.7730484). 4990
(doi: 10.5281/zenodo.7730469). 4992
10.5281/zenodo.7722865). 4994
odo.7713563). 4996
odo.7709116). 4998
10.5281/zenodo.7706415). 5000
(doi: 10.5281/zenodo.7706063). 5002
(doi: 10.5281/zenodo.7701906). 5004
odo.7700205). 5006

10.5281/zenodo.7694876). 5008
10.5281/zenodo.7679410). 5010
10.5281/zenodo.7675982). 5012
10.5281/zenodo.7672388). 5014
odo.7668648). 5016
10.5281/zenodo.7662810). 5018
10.5281/zenodo.7659162). 5020
HG120b [225] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 5021
10.5281/zenodo.7653233). 5022
odo.7653204). 5024
odo.7653142). 5026
odo.7653117). 5028
odo.7653089). 5030
odo.7651687). 5032
odo.7651619). 5034
odo.7651439). 5036
odo.7650729). 5038
odo.7647868). 5040
odo.7647017). 5042

odo.7644894). 5044
odo.7641880). 5046
odo.7632923). 5048
odo.7623459). 5050
10.5281/zenodo.7606416). 5052
10.5281/zenodo.7606416). 5054
odo.7606404). 5056
10.5281/zenodo.7580018). 5058
odo.7580018). 5060
odo.7580018). 5062
odo.7579929). 5064
10.5281/zenodo.7563170). 5066
odo.7563164). 5068
odo.7563160). 5070
odo.7563160). 5072
10.5281/zenodo.7563160). 5074
10.5281/zenodo.7557063). 5076
10.5281/zenodo.7557009). 5078

10.5281/zenodo.7539484). 5080
10.5281/zenodo.7523390). 5082
10.5281/zenodo.7523390). 5084
10.5281/zenodo.7523390). 5086
odo.7574952). 5088
10.5281/zenodo.7574992). 5090
odo.7523357). 5092
10.5281/zenodo.7523357). 5094
10.5281/zenodo.7504782). 5096
10.5281/zenodo.7504782). 5098
10.5281/zenodo.7504782). 5100
10.5281/zenodo.7499395). 5102
odo.7499395). 5104
10.5281/zenodo.7499395). 5106
10.5281/zenodo.7497450). 5108
10.5281/zenodo.7497450). 5110
10.5281/zenodo.7494862). 5112
odo.7494862). 5114

10.5281/zenodo.7494862). 5116
10.5281/zenodo.7493845). 5118
10.5281/zenodo.7493845). 5120
10.5281/zenodo.7493845). 5122
odo.7539484). 5124
odo.7523390). 5126
odo.7523357). 5128
odo.7504782). 5130
odo.7499395). 5132
odo.7497450). 5134
odo.7494862). 5136
odo.7493845). 5138
odo.7480110). 5140
odo.7378758). 5142
HG32b [286] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 5143
10.5281/zenodo.6320305). 5144
odo.6677173). 5146

CHAPTER 24 5147
Cancer In Neutrosophic 5148
SuperHyperGraph 5149
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5150
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5151
disease is considered and as the consequences of the model, some parameters are used. The 5152
cells are under attack of this disease but the moves of the cancer in the special region are the 5153
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5154
treatments for this Neutrosophic disease. 5155
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5156
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 5157
Neutrosophic function. 5158
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 5159
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 5160
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5161
easily identified since there are some determinacy, indeterminacy and neutrality about the 5162
moves and the effects of the cancer on that region; this event leads us to choose another 5163
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 5164
what’s happened and what’s done. 5165
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5166
known and they’ve got the names, and some general Neutrosophic models. The moves and 5167
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 5168
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK-Domination, 5169
aim is to find either the Neutrosophic SuperHyperK-Domination or the Neutrosophic 5171
SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyperModels. 5172
Some cells have been faced with some attacks from the situation which is caused by the 5173
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5174
which in that, the cells could be labelled as some groups and some groups or individuals have 5175
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5176
the embedded situations, the individuals of cells and the groups of cells could be considered 5177
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5178
245
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 5179
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 5180
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 5181
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 5182
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 5183
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 5184
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 5185
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 5186
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 5187
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 5188
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 5189
figure out what’s going on this phenomenon. The special case of this disease is considered and 5190
disease but the moves of the cancer in the special region are the matter of mind. The recognition 5192
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5193
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5194
both bases are the background of this research. Sometimes the cancer has been happened on the 5195
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5196
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 5197
forms of alliances’ styles with the formation of the design and the architecture are formally called 5198
“ SuperHyperK-Domination” in the themes of jargons and buzzwords. The prefix “SuperHyper” 5199
refers to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 5200
The recognition of the cancer in the long-term function. The specific region has been assigned 5201
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 5202
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 5203
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 5204
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 5205
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 5206
some specific models, which are well-known and they’ve got the names, and some general models. 5207
The moves and the traces of the cancer on the complex tracks and between complicated groups 5208
of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperK-Domination, 5209

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 5210
is to find either the optimal SuperHyperK-Domination or the Neutrosophic SuperHyperK- 5211
Domination in those Neutrosophic SuperHyperModels. Some general results are introduced. 5212
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5213
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5214
to form any style of a SuperHyperK-Domination. There isn’t any formation of any SuperHyperK- 5215
Domination but literarily, it’s the deformation of any SuperHyperK-Domination. It, literarily, 5216
deforms and it doesn’t form. 5217
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5219
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5220
based on the fixed groups of cells or the fixed groups of group of cells? 5221
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5222
these messy and dense SuperHyperModels where embedded notions are illustrated? 5223

It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5224
it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5225
SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then 5226
the research has taken more motivations to define SuperHyperClasses and to find some 5227
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5228
some instances and examples to make clarifications about the framework of this research. The 5229
general results and some results about some connections are some avenues to make key point of 5230
this research, “Cancer’s Recognition”, more understandable and more clear. 5231
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5232
research on the modeling of the regions where are under the attacks of the cancer to 5233
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5234
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5235
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5236
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5237
instances and literature reviews have taken the whole way through. In this scientific research, 5238
the literature reviews have fulfilled the lines containing the notions and the results. The 5239
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5240
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5241
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5242
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5243
connectivities of the moves of the cancer in the longest and strongest styles with the formation 5244
of the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5245
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5246
figure out the background for the SuperHyperNotions. 5247

CHAPTER 25 5248
Neutrosophic 5249
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5251
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5252
2023, (doi: 10.13140/RG.2.2.34953.52320). 5253
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5254
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5255
(doi: 10.13140/RG.2.2.33275.80161). 5256
10.13140/RG.2.2.11050.90569). 5259
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5260
10.13140/RG.2.2.17761.79206). 5262
10.13140/RG.2.2.19911.37285). 5265
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5266
10.13140/RG.2.2.23266.81602). 5268
10.13140/RG.2.2.19360.87048). 5271
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5272
10.13140/RG.2.2.32363.21286). 5274
10.13140/RG.2.2.11758.69441). 5277
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5278
10.13140/RG.2.2.31891.35367). 5280
249

10.13140/RG.2.2.21510.45125). 5283
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5284
10.13140/RG.2.2.13121.84321). 5286

CHAPTER 26 5287
New Ideas In Recognition of Cancer And 5288
Neutrosophic SuperHyperGraph By 5289
Eulerian-Type-Path-Decomposition As 5290
Hyper Decompress On Super 5291
Decompensation 5292
251
CHAPTER 27 5293
ABSTRACT 5294
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5295

Type-Path-Decomposition). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Eulerian-Type-Path- 5296
0
Decomposition pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5297
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperEulerian-Type- 5298
Path-Decomposition if the following expression is called Neutrosophic e-SuperHyperEulerian-Type-Path- 5299

Decomposition criteria holds 5300
∀E 0 ∈ P : P is
Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition if the following expression is called 5301

Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition criteria holds 5302
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5303

SuperHyperEulerian-Type-Path-Decomposition if the following expression is called Neutrosophic v- 5304
SuperHyperEulerian-Type-Path-Decomposition criteria holds 5305
∀V 0 ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition if the following expression is called 5306

Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition criteria holds 5307
∀V 0 ∈ P : P is
253
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5308

SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian- 5309
Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic v- 5310
SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition. 5311
((Neutrosophic) SuperHyperEulerian-Type-Path-Decomposition). Assume a Neutrosophic SuperHy- 5312
perGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5313
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian-Type-Path- 5314

Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic 5315
re-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition, 5316
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for an Extreme Super- 5317
HyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5318
S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 5319
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5320
the Extreme SuperHyperEulerian-Type-Path-Decomposition; a Neutrosophic SuperHyperEulerian-Type-Path- 5321
and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for a Neutrosophic 5324
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 5325
rosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic car- 5326

dinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 5327
tices such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; an Extreme 5328
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 5334

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5343
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5344
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5345
Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; and the Neutrosophic power is corresponded 5346
to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Path-Decomposition if it’s either 5347
of Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian- 5348
Type-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition, and Neutrosophic 5349

rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 5350
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 5351
high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 5352
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5353

the Extreme SuperHyperEulerian-Type-Path-Decomposition; a Neutrosophic V-SuperHyperEulerian-Type-Path- 5354

and Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition and C(N SHG) for a Neutrosophic 5357
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutro- 5358
sophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 5359
ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5360

such that they form the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; an Extreme V- 5361
SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial if it’s either of Neutrosophic 5362
e-SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition, 5363
number of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5367

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 5376
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5377
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5378
Neutrosophic SuperHyperEulerian-Type-Path-Decomposition; and the Neutrosophic power is correspon- 5379
ded to its Neutrosophic coefficient. In this scientific research, new setting is introduced for 5380
new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Path-Decomposition and Neutrosophic 5381
SuperHyperEulerian-Type-Path-Decomposition. Two different types of SuperHyperDefinitions are debut 5382
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5383
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5384
implemented in the whole of this research. For shining the elegancy and the significancy of this 5385
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5386
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5387
and the instances thus the clarifications are driven with different tools. The applications are 5388
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5389
Recognition” are the under research to figure out the challenges make sense about ongoing and 5390
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5391
are different types of them. Some of them are individuals and some of them are well-modeled 5392
by the group of cells. These types are all officially called “SuperHyperVertex” but the relations 5393
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 5394
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recog- 5395
nition”. Thus these complex and dense SuperHyperModels open up some avenues to research 5396
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5397
research. It’s also officially collected in the form of some questions and some problems. Assume 5398
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Path-Decomposition 5399

is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 5400
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5401
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5402
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5403
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Path-Decomposition is 5404
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5405
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5406
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5407
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5408
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5409
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5410
SuperHyperEulerian-Type-Path-Decomposition . Since there’s more ways to get type-results to make 5411
a SuperHyperEulerian-Type-Path-Decomposition more understandable. For the sake of having Neut- 5412

rosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to “redefine” the notion of a 5413
“SuperHyperEulerian-Type-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are 5414
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of 5415
the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Path-Decomposition . 5416
It’s redefined a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if the mentioned Table holds, 5417
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5418
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5419
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5420
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5421
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 5422
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5423
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 5424
based on a SuperHyperEulerian-Type-Path-Decomposition . It’s the main. It’ll be disciplinary to have 5425
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 5426
have all SuperHyperEulerian-Type-Path-Decomposition until the SuperHyperEulerian-Type-Path-Decomposition, 5427
then it’s officially called a “SuperHyperEulerian-Type-Path-Decomposition” but otherwise, it isn’t a 5428
SuperHyperEulerian-Type-Path-Decomposition . There are some instances about the clarifications for 5429
the main definition titled a “SuperHyperEulerian-Type-Path-Decomposition ”. These two examples get 5430
more scrutiny and discernment since there are characterized in the disciplinary ways of the 5431
SuperHyperClass based on a SuperHyperEulerian-Type-Path-Decomposition . For the sake of having a 5432
Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to “redefine” the notion of 5433
a “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition” and a “Neutrosophic SuperHyperEulerian- 5434
Type-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5435
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5436
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 5437
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Type- 5438
Path-Decomposition are redefined to a “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition” if the 5439
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 5440
there’s more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian- 5441
Type-Path-Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There 5442
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 5443
SuperHyperEulerian-Type-Path-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 5444
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 5445

SuperHyperEulerian-Type-Path-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic Super- 5446

HyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 5447
if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 5448
Type-Path-Decomposition” where it’s the strongest [the maximum Neutrosophic value from all the 5449
SuperHyperEulerian-Type-Path-Decomposition amid the maximum value amid all SuperHyperVertices 5450
from a SuperHyperEulerian-Type-Path-Decomposition .] SuperHyperEulerian-Type-Path-Decomposition . A graph is 5451
a SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 5452

are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5453
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5454
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Path-Decomposition if it’s only one 5455
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5456
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5457
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5458
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one 5459
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5460
multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one 5461
SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one Supe- 5462
rHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs 5463
and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 5464
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 5465
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 5466
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “Supe- 5467
rHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and 5468
neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called 5469
“Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognition” 5470
and the results and the definitions will be introduced in redeemed ways. The recognition of the 5471
cancer in the long-term function. The specific region has been assigned by the model [it’s called 5472
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 5473
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 5474
indeterminacy and neutrality about the moves and the effects of the cancer on that region; this 5475
event leads us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have 5476
convenient perception on what’s happened and what’s done. There are some specific models, 5477
which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyper- 5478
Models. The moves and the traces of the cancer on the complex tracks and between complicated 5479
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 5480
Type-Path-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5481

perWheel). The aim is to find either the longest SuperHyperEulerian-Type-Path-Decomposition or the 5482
strongest SuperHyperEulerian-Type-Path-Decomposition in those Neutrosophic SuperHyperModels. For 5483
the longest SuperHyperEulerian-Type-Path-Decomposition, called SuperHyperEulerian-Type-Path-Decomposition, 5484
and the strongest SuperHyperEulerian-Type-Path-Decomposition, called Neutrosophic SuperHyperEulerian- 5485
Type-Path-Decomposition, some general results are introduced. Beyond that in SuperHyperStar, all 5486
possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential 5487
to have at least three SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Path- 5488
Decomposition. There isn’t any formation of any SuperHyperEulerian-Type-Path-Decomposition but literarily, 5489
it’s the deformation of any SuperHyperEulerian-Type-Path-Decomposition. It, literarily, deforms and 5490
it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian-Type-Path-Decomposition 5491

theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 5492

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Path-Decomposition, Cancer’s 5493


CHAPTER 28 5496
Applied Notions Under The Scrutiny Of 5497
The Motivation Of This Scientific 5498
Research 5499
In this scientific research, there are some ideas in the featured frameworks of motivations. 5500
I try to bring the motivations in the narrative ways. Some cells have been faced with some 5501
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5502
some embedded analysis on the ongoing situations which in that, the cells could be labelled as 5503
some groups and some groups or individuals have excessive labels which all are raised from 5504
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5505
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5506
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5507
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5508
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5509
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5510
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5511
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5512
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5513
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5514
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5515
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5516
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer is 5517
the disease but the model is going to figure out what’s going on this phenomenon. The special 5518
case of this disease is considered and as the consequences of the model, some parameters are 5519
used. The cells are under attack of this disease but the moves of the cancer in the special region 5520
are the matter of mind. The recognition of the cancer could help to find some treatments for this 5521
disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels 5522
on the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5523
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5525
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5526
architecture are formally called “ SuperHyperEulerian-Type-Path-Decomposition” in the themes of jargons 5527
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5528
259
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5529
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5533
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5534
perception on what’s happened and what’s done. There are some specific models, which are 5535
well-known and they’ve got the names, and some general models. The moves and the traces of 5536
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5537
by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type-Path-Decomposition, SuperHyperStar, 5538
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5539
the optimal SuperHyperEulerian-Type-Path-Decomposition or the Neutrosophic SuperHyperEulerian-Type- 5540
Path-Decomposition in those Neutrosophic SuperHyperModels. Some general results are introduced. 5541
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5542
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5543
to form any style of a SuperHyperEulerian-Type-Path-Decomposition. There isn’t any formation of any 5544
SuperHyperEulerian-Type-Path-Decomposition but literarily, it’s the deformation of any SuperHyperEulerian- 5545
Type-Path-Decomposition. It, literarily, deforms and it doesn’t form. 5546
amount of SuperHyperEulerian-Type-Path-Decomposition” of either individual of cells or the groups of cells 5548

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5549
Type-Path-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 5550
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5551
these messy and dense SuperHyperModels where embedded notions are illustrated? 5552
Thus it motivates us to define different types of “ SuperHyperEulerian-Type-Path-Decomposition” and 5554
“Neutrosophic SuperHyperEulerian-Type-Path-Decomposition” on “SuperHyperGraph” and “Neutrosophic 5555

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5556
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5557
motivates us to get some instances and examples to make clarifications about the framework of 5558
this research. The general results and some results about some connections are some avenues to 5559
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5560
The framework of this research is as follows. In the beginning, I introduce basic definitions 5561
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5562
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5563
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5564
review literature are applied to make sense about what’s going to figure out about the 5565
upcoming sections. The main definitions and their clarifications alongside some results 5566
about new notions, SuperHyperEulerian-Type-Path-Decomposition and Neutrosophic SuperHyperEulerian- 5567

Type-Path-Decomposition, are figured out in sections “ SuperHyperEulerian-Type-Path-Decomposition” and 5568
“Neutrosophic SuperHyperEulerian-Type-Path-Decomposition”. In the sense of tackling on getting results 5569
and in Eulerian-Type-Path-Decomposition to make sense about continuing the research, the ideas 5570
of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and as their 5571
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 5572
section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. 5573

As going back to origin of the notions, there are some smart steps toward the common 5574
notions to extend the new notions in new frameworks, SuperHyperGraph and Neutrosophic 5575
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Neutrosophic 5576
SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 5577
concluding and closing section of theoretical research are contained in the section “General 5578
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5579
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5580
“ SuperHyperEulerian-Type-Path-Decomposition”, “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition”, 5581
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are 5582
curious questions about what’s done about the SuperHyperNotions to make sense about excellency 5583
of this research and going to figure out the word “best” as the description and adjective for 5584
this research as presented in section, “ SuperHyperEulerian-Type-Path-Decomposition”. The keyword of 5585
this research debut in the section “Applications in Cancer’s Recognition” with two cases and 5586
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 5587
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 5588
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 5589
happened in this research in the terms of “questions” and “problems” to make sense to figure 5590
out this research in featured style. The advantages and the limitations of this research alongside 5591
about what’s done in this research to make sense and to get sense about what’s figured out are 5592
included in the section, “Conclusion and Closing Remarks”. 5593

CHAPTER 29 5594
Neutrosophic Preliminaries Of This 5595
Scientific Research On the Redeemed 5596
Ways 5597
In this section, the basic material in this scientific research, is referred to [Single Valued 5598
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5599

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Char- 5600
acterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5601
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5602
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5603
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5604
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5605
their clarifications are addressed to Ref.[HG38]. 5606
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5607
the new ideas and their clarifications are elicited. 5608
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 [. 5609
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}.
263

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

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5648
x, y, z, w ∈ [0, 1]: 5649
(i) 1 ⊗ x = x; 5650
(ii) x ⊗ y = y ⊗ x; 5651
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5652
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5653

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

where 5656

1, 2, . . . , n0 ); 5661
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5662
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5663
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5664
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5665
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5677
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5678
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5679
SuperEdge; 5685
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5688
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5689
makes the patterns and regularities. 5690
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5691
of elements of SuperHyperEdges are the same. 5692

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5693
makes to have SuperHyperUniform more understandable. 5694
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5695
Classes as follows. 5696
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5697
two given SuperHyperEdges with two exceptions; 5698
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5699
SuperHyperEdges; 5700
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5701
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5702
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5703
in common; 5704
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5705
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5706
SuperHyperEdge in common; 5707
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5708
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5709
SuperVertex. 5710
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 5711
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5712
(i) Vi , Vi+1 ∈ Ei0 ; 5713
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5714
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5715
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5716
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5717
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5718
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5719
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5720
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5722
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5723
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5724
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5725
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5726
perPath . 5727
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 5728
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5729
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5730
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5731
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5732
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5733

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5746
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5747
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5748
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Path- 5749

Decomposition). 5750
(i) Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition if the following expression 5754

is called Neutrosophic e-SuperHyperEulerian-Type-Path-Decomposition criteria holds 5755
∀E 0 ∈ P : P is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition if the following expression 5756

is called Neutrosophic re-SuperHyperEulerian-Type-Path-Decomposition criteria holds 5757
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5758
(iii) Neutrosophic v-SuperHyperEulerian-Type-Path-Decomposition if the following expression 5759
∀V 0 ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Path-Decomposition if the following expression 5761
∀V 0 ∈ P : P is

(v) Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 5764

rv-SuperHyperEulerian-Type-Path-Decomposition. 5767
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Path-Decomposition). 5768

(i) an Extreme SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 5771

S of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 5776
(ii) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 5779

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5784

(iii) an Extreme SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial 5787


(iv) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolyno- 5797

corresponded to its Neutrosophic coefficient; 5807

(v) an Extreme V-SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 5808

S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5813

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Path-Decomposition if it’s either of Neutro- 5816


(vii) an Extreme V-SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolynomial 5824


(viii) a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition SuperHyperPolyno- 5834


corresponded to its Neutrosophic coefficient. 5844
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Path-Decomposition). 5845

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5846
(i) an δ−SuperHyperEulerian-Type-Path-Decomposition is a Neutrosophic kind of Neutrosophic 5847
SuperHyperEulerian-Type-Path-Decomposition such that either of the following expressions hold 5848


136TBL3
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5849
|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 5850

(29.1), holds if S is an δ−SuperHyperDefensive; 5851
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Path-Decomposition is a Neutrosophic kind 5852

of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition such that either of the following 5853
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5854
of s ∈ S : 5855
|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 5856

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5857
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need 5858

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5867
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Path-Decomposition, SuperHyperStar, 5868
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5869
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5870
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5871
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5872

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 SuperHyperEulerian-Type-Path- 5873

Decomposition. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian- 5874
Type-Path-Decomposition more Neutrosophicly understandable. 5875
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, there’s a need to 5876
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Path-Decomposition”. The 5877

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5878
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 5879
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Path-Decomposition. It’s redefined a Neutro- 5880

sophic SuperHyperEulerian-Type-Path-Decomposition if the Table (29.3) holds. 5881

CHAPTER 30 5882
Neutrosophic SuperHyper But Eulerian-Type-Path-Decomposition 5883
As The Extensions Excerpt From Dense 5884
And Super Forms 5885
Definition 30.0.1. (Neutrosophic event). 5886
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5887
is a probability Eulerian-Type-Path-Decomposition. Any Neutrosophic k-subset of A of V is called 5888
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5889
Neutrosophic event. The following expression is called Neutrosophic probability of 5890
A. 5891
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5892

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5893
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. s Neutrosophic k-events Ai , i ∈ I 5894
is called Neutrosophic s-independent if the following expression is called Neutrosophic 5895
s-independent criteria 5896
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. 5897

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

is a probability Eulerian-Type-Path-Decomposition. Any k-function Eulerian-Type-Path-Decomposition like E 5901
is called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Path-Decomposition 5902

like E is called Neutrosophic Variable. 5903
The notion of independent on Neutrosophic Variable is likewise. 5904
275
Definition 30.0.4. (Neutrosophic Expectation). 5905

is a probability Eulerian-Type-Path-Decomposition. A Neutrosophic k-Variable E has a number is called 5907
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5908
criteria 5909
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5910

is a probability Eulerian-Type-Path-Decomposition. A Neutrosophic number is called Neutrosophic 5912

Crossing if the following expression is called Neutrosophic Crossing criteria 5913
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). 5914
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let m and n propose special 5915
Eulerian-Type-Path-Decomposition. Then with m ≥ 4n, 5916
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

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

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5923

P whose SuperHyperEdge are the segments between conseNeighborive points on the 5924
SuperHyperLines which pass through at least k + 1 points of P. This Neutrosophic 5925
SuperHyperGraph has at least kl SuperHyperEdges and Neutrosophic crossing at most l 5926
choose two. Thus either kl < 4n, in which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ 5927
3
cr(G) ≥ (kl) /64n2 by the Neutrosophic Crossing Lemma, and again l < 32n2 /k 3 . 5928
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 5931
Then k < 5n4/3 . 5932
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Con- 5933
sider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Draw a SuperHyperUnit Su- 5934
perHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic number of 5935
P n−1
these SuperHyperCircles passing through exactly i points of P. Then i = 0 n i = n and 5936
k = 12 i = 0n−1 ini . Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex
P
5937
SuperHyperSet P whose SuperHyperEdges are the SuperHyperArcs between conseNeighborive 5938

SuperHyperPoints on the SuperHyperCircles that pass through at least three SuperHyperPoints 5939
of P. Then 5940
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 5941

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

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5952
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let Xn be a nonnegative integer- 5953
valued variable in a probability Eulerian-Type-Path-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 5954
n → ∞, then P (Xn = 0) → 1 as n → ∞. 5955
Proof. 5956
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. A special SuperHyperGraph in 5958
Gn,p almost surely has stability number at most d2p−1 log ne. 5959
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5960
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. A special SuperHyperGraph in Gn,p 5961
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5962
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5963
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5964
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5965
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5966
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5967
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 5968
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5969

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: 5970
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5971
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 5972
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5973
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5974
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5975
Definition 30.0.12. (Neutrosophic Variance). 5976
is a probability Eulerian-Type-Path-Decomposition. A Neutrosophic k-Variable E has a number is 5978
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 5979
criteria 5980
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let X be a Neutrosophic Variable 5982
and let t be a positive real number. Then 5983
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let X be a Neutrosophic Variable and 5985
let t be a positive real number. Then 5986
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5987
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let Xn be a Neutrosophic 5989

Variable in a probability Eulerian-Type-Path-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 5990
V (Xn ) << E 2 (Xn ), then 5991
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Set X := Xn and t := |Ex(Xn )| in 5993
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5994
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5995
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 5997
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 5998
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5999
S = (V, E) is a probability Eulerian-Type-Path-Decomposition. As in the proof of related Theorem, the 6001
result is straightforward. 6002
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 6004
be as defined in previous Theorem. Then either: 6005
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6006
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6007

Definition 30.0.17. (Neutrosophic Threshold). 6010

is a probability Eulerian-Type-Path-Decomposition. Let P be a monotone property of SuperHyperGraphs 6012
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6013
for P is a function f (n) such that: 6014
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6015
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6016
Definition 30.0.18. (Neutrosophic Balanced). 6017
is a probability Eulerian-Type-Path-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. 6019
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6020
SubSuperHyperGraph is called Neutrosophic Balanced. 6021
Consider S = (V, E) is a probability Eulerian-Type-Path-Decomposition. Let F be a nonempty 6023
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6024
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6025
SubSuperHyperGraph. 6026
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6029
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6030
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6031
SuperHyperEulerian-Type-Path-Decomposition, is up. The Neutrosophic Algorithm is Neutro- 6032

sophicly straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 6033
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6034
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6035
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6036
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6037
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6038

Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6039
C(N SHG)Neutrosophic Eulerian-Type-Path-Decomposition

= {{E4 }}.
C(N SHG)Neutrosophic Eulerian-Type-Path-Decomposition SuperHyperPolynomial
= z.
C(N SHG)Neutrosophic V-Eulerian-Type-Path-Decomposition
= {{V1 }, {V2 }, {V4 }}.
C(N SHG)Neutrosophic V-Eulerian-Type-Path-Decomposition SuperHyperPolynomial
= 3z.
6040

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

Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG1

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

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyper- 6044
Neighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 6045
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 6046
HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 6047
V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6048

= {{E4 }}.
= z.
= {{V1 }, {V2 }, {V4 }}.
= 3z.
6049


sophicly straightforward. 6052

= {{E4 }}.
= z.
= {{V1 }, {V2 }, {V3 }}.
= 3z.
6053


= {{E4 , E1 , E2 }, {E5 , E1 , E2 }}.
= 2z 3 .




= {{Vi ∈ VN SHG }}.
= 2z 9 .
6057




= {{E1 , E4 }, {Ei , Ej }}.
= 6z 2 .
= {{Vi ∈ VEa , Vj ∈ VEb }}.
= z 10 + 4z 9 + z 8 .
6061


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



= 11z 10 .
= {{Vii=122 }}.
= 11z 22 .
6065


= {{Eii=110 , E17 , E14 , E13 }}.
= 3z 13 .
= {{Vi ∈ VN SHG }}.


= 3z 13 .
6069


= {{E3 , E4 , E2 }}.
= 3z 3 .
= {{Vii=414 }, . . .}.
= z 11 + 2z 10 .
6073



= {{Eii=110 , E22 , E23 }}.

= 11z 12 .
= {{Vii=122 }}.
= 11z 22 .
6077


= {{E2 , E7 , E3 }}.
= 3z 3 .
= {{Vii=414 }, . . .}.


= z 11 + 2z 10 .
6081


= {{E1 , E6 , E5 , E4 }}.
= 3z 4 .
= {{Vii=16 }}.
= 3z 6 .
6085






= {{E1 , E6 }}.
= 5z 2 .
= {{Vii=13 , Vii=79 }, . . .}
= 5z 6 .
6089


= {{E10 , E1 , E6 , E5 , E4 }}.
= 4z 5 .



= {{Vii=16 }}.
= 4z 6 .
6093


= {{E1 , E2 }}.
= z2.
= {{V2 , V1 , V3 }}.
= z3.
6097




= {{E1 , E2 , E3 , E4 , E5 }}.
= z5.
= {{V1 , V2 , V3 , V4 , V5 , V6 }}.
= z6.
6101




= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
6105


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



= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
6109


= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
6113






= {{Ei ∈ EN SHG \ {Ej }}}.
= {{Vi ∈ VN SHG \ {VEj }}}.
6117


= {{Ei , Ej }}.
= Ten Choose Two z 2 .



= {{VEi , VEj }}.
X |{V ,V }|
= z Ei Ej .
6121


= {{E2 }}.
= z.
= {{V2 , {R}, {M6 }, {L6 }, {F }, {P }, {J}, {M }, V1 , V3 }}.
= z 10 .


Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example (42.0.3) 95NHG1
6125


= {{Ei ∈ EN SHG \ {E1 }}}.
= z |{Ei ∈EN SHG \{E1 }}| .
= {{Vi ∈ VN SHG \ {VE1 }}}.
= z {|Vi ∈VN SHG \{VE1 }}| .


Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2
6129
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6130
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Path- 6131
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6132
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6133
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6134
of them. 6135
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6136

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6137
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6138
Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition minus all Neutrosophic SuperHypeNeighbor to 6139
some of them but not all of them. In other words, there’s only an unique Neutrosophic 6140
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 6141
Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition, minus all Neutrosophic SuperHypeNeighbor to 6142
some of them but not all of them. 6143
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6144
Decomposition is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6145
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6146
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6147
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6148
to Neutrosophic Eulerian-Type-Path-Decomposition in some cases but the maximum number of the 6149
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 6150

SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6151
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition with the least Neutrosophic 6153

cardinality, the lower sharp Neutrosophic bound for cardinality. 6154
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6155
(V, E). Then in the worst case, literally, 6156
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−Decomposition

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Eulerian-Type-Path-Decomposition. In other words, the least cardinality, the 6157

lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Path-Decomposition is 6158
the cardinality of 6159

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

bound for the cardinality, of a quasi-R-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Eulerian-
Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-Path-
Decomposition. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Path-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-Eulerian-Type-Path-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, 6160
Neutrosophic R-Eulerian-Type-Path-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6161
Neutrosophic R-Eulerian-Type-Path-Decomposition =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition where E ∈

EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended
SuperHyperVertices but in a Neutrosophic Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Path- 6162
Decompositionis at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6163

of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Supe- 6164
rHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6165
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6166
to Neutrosophic Eulerian-Type-Path-Decomposition in some cases but the maximum number of the 6167
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic Su- 6168
perHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6169
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6171
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6172
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6173
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6174
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6175
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6176
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6177
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6178
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6179
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6180
tices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition where the Neutrosophic 6181
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6182
embedded R-Eulerian-Type-Path-Decomposition. The SuperHyperNotions of embedded SuperHyperSet 6183
and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets 6184
only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is 6185
elected such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCar- 6186
dinality and they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of 6187
Neutrosophic SuperHyperVertices are included in the minimum Neutrosophic style of the 6188
embedded Neutrosophic R-Eulerian-Type-Path-Decomposition. The interior types of the Neutrosophic 6189
SuperHyperVertices are deciders. Since the Neutrosophic number of SuperHyperNeighbors 6190
are only affected by the interior Neutrosophic SuperHyperVertices. The common connections, 6191
more precise and more formal, the perfect unique connections inside the Neutrosophic Supe- 6192
rHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic 6193
R-Eulerian-Type-Path-Decomposition. Thus Neutrosophic exterior SuperHyperVertices could be used 6194

only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6195
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6196
embedded Neutrosophic Eulerian-Type-Path-Decomposition, there’s the usage of exterior Neutrosophic 6197
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 6198
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has 6199
no connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic Super- 6200
HyperVertices with one SuperHyperElement has been ignored in the exploring to lead on 6201
the optimal case implying the Neutrosophic R-Eulerian-Type-Path-Decomposition. The Neutrosophic 6202
R-Eulerian-Type-Path-Decomposition with the exclusion of the exclusion of all Neutrosophic SuperHy- 6203
perVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic 6204
R-Eulerian-Type-Path-Decomposition with the inclusion of all Neutrosophic SuperHyperVertices in one 6205

Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition. To sum 6206
them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6207
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6208
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6209

quasi-R-Eulerian-Type-Path-Decomposition minus all Neutrosophic SuperHypeNeighbor to some of them 6210

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6211
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6212
quasi-R-Eulerian-Type-Path-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of them 6213
but not all of them. 6214
The main definition of the Neutrosophic R-Eulerian-Type-Path-Decomposition has two titles. a Neutro- 6215
sophic quasi-R-Eulerian-Type-Path-Decomposition and its corresponded quasi-maximum Neutrosophic 6216

R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6217
number, there’s a Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition with that quasi-maximum 6218
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6219
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6220
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Eulerian- 6221
Type-Path-Decompositions for all Neutrosophic numbers less than its Neutrosophic corresponded 6222
maximum number. The essence of the Neutrosophic Eulerian-Type-Path-Decomposition ends up but this 6223
essence starts up in the terms of the Neutrosophic quasi-R-Eulerian-Type-Path-Decomposition, again and 6224
more in the operations of collecting all the Neutrosophic quasi-R-Eulerian-Type-Path-Decompositions 6225
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6226
Neutrosophic number. This Neutrosophic number is 6227
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Path-Decompositions. Let 6228
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Path-Decomposition be a 6229
Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Path- 6230
Decomposition. Then 6231
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Path-Decomposition ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Path-Decomposition is 6232

re-formalized and redefined as follows. 6233
GNeutrosophic Eulerian-Type-Path-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 6234
definition for the Neutrosophic Eulerian-Type-Path-Decomposition. 6235
GNeutrosophic Eulerian-Type-Path-Decomposition =
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |


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

And then, 6239

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



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

6242

6243

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6244
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6245
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6246
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian- 6247
Type-Path-Decomposition” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Type- 6248

Path-Decomposition” since “Neutrosophic Quasi-Eulerian-Type-Path-Decomposition” happens “Neutrosophic 6249
Eulerian-Type-Path-Decomposition” in a Neutrosophic SuperHyperGraph as initial framework and back- 6250
ground but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Eulerian- 6251
Type-Path-Decomposition” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily 6252
background since there are some ambiguities about the Neutrosophic SuperHyperCardinality 6253
arise from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, 6254
“Neutrosophic Quasi-Eulerian-Type-Path-Decomposition”, and “Neutrosophic Eulerian-Type-Path-Decomposition” 6255
are up. 6256
Thus, let 6257
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6258
GNeutrosophic Eulerian-Type-Path-Decomposition be a Neutrosophic number, a Neutrosophic SuperHy- 6259
perNeighborhood and a Neutrosophic Eulerian-Type-Path-Decomposition and the new terms are up. 6260
GNeutrosophic Eulerian-Type-Path-Decomposition ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |

|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6261
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6262
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6263
And with go back to initial structure, 6264
GNeutrosophic Eulerian-Type-Path-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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


6266

6267

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

. The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Decomposition
Is an Neutrosophic R-Eulerian-Type-Path-Decomposition C(ESHG) for an Neutrosophic Super-

HyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Eulerian-Type-Path-Decomposition is related to the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic Super-
HyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Path-Decomposition is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-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-Eulerian-Type-Path-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-Eulerian-Type-

Path-Decomposition. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Eulerian-Type-Path-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
Eulerian-Type-Path-Decomposition and it’s an Neutrosophic Eulerian-Type-Path-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 Eulerian-Type-Path-Decomposition. There isn’t only less than
two Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Eulerian-Type-Path-Decomposition,

is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-

, not:
Type-Path-Decomposition
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6268
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6269
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6270
type-SuperHyperSet called the 6271
“Neutrosophic R-Eulerian-Type-Path-Decomposition” 6272
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6273
Neutrosophic R-Eulerian-Type-Path-Decomposition, 6274
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-Eulerian-Type-Path-Decomposition amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Eulerian-Type-Path-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-Eulerian-Type-Path-Decomposition. In other words, the least cardinality, the lower

sharp bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Path-Decomposition is the cardinality
of
6275
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6276
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Path- 6277
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6278
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6279
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6280

amount of them. 6281

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6282
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6283
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6284
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6285
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6286
Consider there’s a Neutrosophic R-Eulerian-Type-Path-Decomposition with the least cardinality, the 6287
lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6288
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6289
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6290
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6291
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Path-Decomposition. Since it 6292
doesn’t have 6293

6294
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6295
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6296
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6297
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6298
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian-Type- 6299

Path-Decomposition. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6300
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6301
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6302
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6303
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6304
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6305

only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyper- 6306
Set, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6307
Neutrosophic R-Eulerian-Type-Path-Decomposition, VESHE is up. The obvious simple Neutrosophic type- 6308
SuperHyperSet of the Neutrosophic R-Eulerian-Type-Path-Decomposition, VESHE , is a Neutrosophic Su- 6309
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6310
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6311

SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6312
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6313
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6314
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6315
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6316
R-Eulerian-Type-Path-Decomposition only contains all interior Neutrosophic SuperHyperVertices and 6317
all exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6318
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6319
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6320
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6321
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6322

The SuperHyperNotion, namely, Eulerian-Type-Path-Decomposition, is up. There’s neither empty Supe- 6323
rHyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutro- 6324
sophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6325
the Neutrosophic Eulerian-Type-Path-Decomposition. The Neutrosophic SuperHyperSet of Neutrosophic 6326

SuperHyperEdges[SuperHyperVertices], 6327

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−P ath−DecompositionSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type-Path-Decomposition. 6328

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Path-Decomposition C(ESHG) for an Neutrosophic SuperHy- 6330

perGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6331
6332
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6334
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6335
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6336
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6337
non-obvious Neutrosophic Eulerian-Type-Path-Decomposition is up. The obvious simple Neutrosophic 6338

type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Decomposition is a Neutrosophic 6339
SuperHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6340
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6341

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

= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHy- 6342
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6343
Eulerian-Type-Path-Decomposition is up. To sum them up, the Neutrosophic SuperHyperSet of the 6344
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6345

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

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices given 6351
by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Path-Decomposition 6352
and it’s an Neutrosophic Eulerian-Type-Path-Decomposition. Since it’s 6353
6354
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6356

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

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

= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Eulerian-Type-Path-Decomposition , 6360

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-Type- 6361
, not:
Path-Decomposition 6362

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6364
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6365
Neutrosophic type-SuperHyperSet called the 6366

“Neutrosophic Eulerian-Type-Path-Decomposition ” 6367
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6368
Neutrosophic ,
is only and only 6370

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

CHAPTER 31 6372
The Neutrosophic Departures on The 6373
Theoretical Results Toward Theoretical 6374
Motivations 6375
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 6376
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6378

= {{Ei ∈ EN SHG }}.
= z |{Ei ∈EN SHG }| .
= {{Vi ∈ VN SHG }}.
= z |{Vi ∈VN SHG }| .
Proof. Let 6379
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6380
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
319
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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


136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6386
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6387
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Path-Decomposition. 6388
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6389

= {{Ei ∈ EN SHG \ {Ej }}}.

= {{Vi ∈ VN SHG \ {VEj }}}.

Proof. Let 6390
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6391
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). 6392

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6397
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the Neut- 6398
rosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6399
6400
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6401

= {{Ei , Ej }}.
= |EN SHG |Choose Two z 2 .
= {{VEi , VEj }}.
X |{V ,V }|
= z Ei Ej .

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

Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example (42.0.7) 136NSHG19a
Proof. Let 6402
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6403
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6404


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

Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6409
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6410
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6411
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6412
the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6413
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6414
Then 6415

= {{Ei ∈ PNmin
SHG }}.
X min
= z |{Ei ∈PN SHG }| .
= {{VEi ∈PNmin
SHG
}}.
X |{V min }|
= z Ei ∈PN SHG .

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


Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6424
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Path-Decomposition taken from a connected Neutrosophic 6426
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6427
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6428
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6430
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6431

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Example (42.0.11) 136NSHG21a
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6432
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6433

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6434
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6436
Then 6437

= {{Ei ∈ PNmin
SHG }}.
X min
= z |{Ei ∈PN SHG }| .
= {{VEi ∈PNmin
SHG
}}.
X |{V min }|
= z Ei ∈PN SHG .
Proof. Let 6438
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6439
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 6441


0
Decomposition could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6446
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6448
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6449
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6453
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6454
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6455
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6456
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Path- 6457
Decomposition. 6458

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

Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6459
Then, 6460

= {{Ei ∈ (EN SHG \ {Ej }) ∪ {Ek∗ }}}.
∗
= |EN SHG |z |{Ei ∈(EN SHG \{Ej })∪{Ek }}| .
= {{VEi ∈(EN SHG \{Ej })∪{Ek∗ } }}.
X |{V ∗ }|
= z Ei ∈(EN SHG \{Ej })∪{Ek } .
Proof. Let 6461
P :
CEN T ER, E2∗
6462
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in the Neutrosophic Example
(42.0.15) 136NSHG23a
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 6464

straightforward. Then there’s at least one SuperHyperEulerian-Type-Path-Decomposition. Thus the 6467
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Path- 6468

Decomposition could be applied. The unique embedded SuperHyperEulerian-Type-Path-Decomposition 6469
proposes some longest SuperHyperEulerian-Type-Path-Decomposition excerpt from some representatives. 6470
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6472
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6473
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6474
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6475
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6476

CHAPTER 32 6477
The Surveys of Mathematical Sets On 6478
The Results But As The Initial Motivation 6479
For the SuperHyperEulerian-Type-Path-Decomposition, Neutrosophic SuperHyperEulerian-Type-Path- 6480

, and the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition, some general results are
Decomposition 6481
introduced. 6482
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition is 6483

“redefined” on the positions of the alphabets. 6484
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. Then 6485
N eutrosophic SuperHyperEulerian − T ype − P ath − Decomposition =

{theSuperHyperEulerian − T ype − P ath − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − P ath − Decomposition
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−P ath−Decomposition. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6486
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6487
the neutrality, for i = 1, 2, 3, respectively. 6488
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6489
of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Path-Decomposition and 6490
SuperHyperEulerian-Type-Path-Decomposition coincide. 6491
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6492
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6493
SuperHyperEulerian-Type-Path-Decomposition if and only if it’s a SuperHyperEulerian-Type-Path-Decomposition. 6494
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6495
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6496
SuperHyperEulerian-Type-Path-Decomposition if and only if it’s a longest SuperHyperEulerian-Type-Path- 6497
Decomposition. 6498
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6499

identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path-Decomposition is 6500
its SuperHyperEulerian-Type-Path-Decomposition and reversely. 6501
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path- 6502

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 6503
on the same identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Path- 6504
Decomposition is its SuperHyperEulerian-Type-Path-Decomposition and reversely. 6505
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6506

SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined if and only if its SuperHyperEulerian- 6507
Type-Path-Decomposition isn’t well-defined. 6508
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6509

its Neutrosophic SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined if and only if its 6510

Decomposition 6513
Then its Neutrosophic SuperHyperEulerian-Type-Path-Decomposition isn’t well-defined if and only if its 6514
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6516

SuperHyperEulerian-Type-Path-Decomposition is well-defined if and only if its SuperHyperEulerian-Type- 6517
Path-Decomposition is well-defined. 6518
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6519
its Neutrosophic SuperHyperEulerian-Type-Path-Decomposition is well-defined if and only if its 6520

SuperHyperEulerian-Type-Path-Decomposition is well-defined. 6521

Decomposition 6523
Then its Neutrosophic SuperHyperEulerian-Type-Path-Decomposition is well-defined if and only if its 6524
SuperHyperEulerian-Type-Path-Decomposition is well-defined. 6525
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6526
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6527
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6528
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6529
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6530
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6531
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 6532
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6533
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6536

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

independent SuperHyperSet is 6541
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6544
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6548

Graph which is a SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath. Then V is a maximal 6549
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6553
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6554
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6555
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6557

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6558
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6562
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6563
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6564
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6566

perGraph which is a SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath. Then the number 6567
of 6568

(i) : the SuperHyperEulerian-Type-Path-Decomposition; 6569
(ii) : the SuperHyperEulerian-Type-Path-Decomposition; 6570
(iii) : the connected SuperHyperEulerian-Type-Path-Decomposition; 6571
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 6572
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 6573
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition. 6574
coincide. 6576

Graph which is a SuperHyperWheel. Then the number of 6578
(i) : the dual SuperHyperEulerian-Type-Path-Decomposition; 6579
(ii) : the dual SuperHyperEulerian-Type-Path-Decomposition; 6580
(iii) : the dual connected SuperHyperEulerian-Type-Path-Decomposition; 6581
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 6582
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition; 6583
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Path-Decomposition. 6584
coincide. 6586
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6587

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6599
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6600
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6601
SuperHyperPart is a 6602
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6606
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6607
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 6608
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6610

plete SuperHyperMultipartite. Then Then the number of 6611
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6618
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6619
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6621
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6622
(iv) : SuperHyperEulerian-Type-Path-Decomposition; 6626

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6629
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6630
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6631
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6632

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6640
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6641
of dual 6642
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6646

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6650
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6651

is SuperHyperEulerian-Type-Path-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 6652
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of 6653
a dual 6654
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6658
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition; 6659

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition. 6660

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


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

dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such 6676
that 6677
(i) v ∈ Ns (x); 6678
(ii) vx ∈ E. 6679
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6680

a dual SuperHyperDefensive SuperHyperEulerian-Type-Path-Decomposition, then 6681
(i) S is SuperHyperEulerian-Type-Path-Decomposition set; 6682
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6683
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6684
(i) Γ ≤ O; 6685
(ii) Γs ≤ On . 6686
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6687
connected. Then 6688
(i) Γ ≤ O − 1; 6689
(ii) Γs ≤ On − Σ3i=1 σi (x). 6690
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6691


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6695
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6696
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6698
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 6699

Decomposition; 6700
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6701
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6702
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6703
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Path-Decomposition. 6705

Then 6706
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6707

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6709
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6710
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6711
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Path-Decomposition. Then 6713

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6717
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6718
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6720
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Path-Decomposition; 6721
(ii) Γ = 1; 6722
(iii) Γs = Σ3i=1 σi (c); 6723

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Path- 6724
Decomposition. 6725
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6726
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6727
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6729
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6730
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6731
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6733
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type- 6734
Path-Decomposition; 6735
(ii) Γ = b n2 c + 1; 6736

b n c+1 ; 6737
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6738
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6740
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 6741
Decomposition; 6742
(ii) Γ = b n2 c; 6743

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

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

Type-Path-Decomposition for N SHF; 6750
(ii) Γ = m for N SHF : (V, E); 6751
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6752
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6753
Path-Decomposition for N SHF : (V, E). 6754

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6756
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6757
SuperHyperEulerian-Type-Path-Decomposition for N SHF; 6758
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6759
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 6760
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperEulerian-Type-Path- 6761
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6763
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6764
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Path- 6765
Decomposition for N SHF : (V, E); 6766
(ii) Γ = b n2 c for N SHF : (V, E); 6767
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 6768
S={vi }i=1
bnc
are only dual maximal SuperHyperEulerian-Type-Path- 6769
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6773

SuperHyperEulerian-Type-Path-Decomposition, then S is an s-SuperHyperDefensive SuperHyperEulerian-6774

SuperHyperEulerian-Type-Path-Decomposition, then S is a dual s-SuperHyperDefensive 6777
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6781

SuperHyperEulerian-Type-Path-Decomposition, then S is an s-SuperHyperPowerful SuperHyperEulerian- 6782

SuperHyperEulerian-Type-Path-Decomposition, then S is a dual s-SuperHyperPowerful 6785
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6787

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

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

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

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


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

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


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

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


hold; 6829
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 6830
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 6832

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

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


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

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


CHAPTER 33 6849
Neutrosophic Applications in Cancer’s 6850
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6852
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6853
disease is considered and as the consequences of the model, some parameters are used. The 6854
cells are under attack of this disease but the moves of the cancer in the special region are the 6855
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6856
treatments for this Neutrosophic disease. 6857
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6858
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 6859
Neutrosophic function. 6860
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 6861
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 6862
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 6863
easily identified since there are some determinacy, indeterminacy and neutrality about the 6864
moves and the effects of the cancer on that region; this event leads us to choose another 6865
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 6866
what’s happened and what’s done. 6867
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6868
known and they’ve got the names, and some general Neutrosophic models. The moves and 6869
the Neutrosophic traces of the cancer on the complex tracks and between complicated groups 6870
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Path- 6871
Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper- 6872
Wheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition or 6873

the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition in those Neutrosophic Neutrosophic 6874
SuperHyperModels. 6875
341
CHAPTER 34 6876
Case 1: The Initial Neutrosophic Steps 6877
Toward Neutrosophic 6878
SuperHyperBipartite as Neutrosophic 6879
SuperHyperModel 6880
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6881
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6882
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6883
perBipartite is obtained. 6884
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6885
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 6886
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (34.1), is the 6887

CHAPTER 35 6889
Case 2: The Increasing Neutrosophic 6890
Steps Toward Neutrosophic 6891
SuperHyperMultipartite as 6892
Neutrosophic SuperHyperModel 6893
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6894
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6895
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6896
perMultipartite is obtained. 6897
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6898
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6899

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6900

CHAPTER 36 6902
Wondering Open Problems But As The 6903
Directions To Forming The Motivations 6904
In what follows, some “problems” and some “questions” are proposed. 6905
The SuperHyperEulerian-Type-Path-Decomposition and the Neutrosophic SuperHyperEulerian-Type-Path- 6906
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 6907
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6908
recognitions? 6909
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Path- 6910

and the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition?
Decomposition 6911
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6912
them? 6913
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6914
and the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition?
Problem 36.0.5. The SuperHyperEulerian-Type-Path-Decomposition and the Neutrosophic SuperHyperEulerian-

6916
do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6917
Type-Path-Decomposition
SuperHyperEulerian-Type-Path-Decomposition, are there else? 6918
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6919
Numbers types-results? 6920
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6921
the multiple types of SuperHyperNotions? 6922
347
CHAPTER 37 6923
Conclusion and Closing Remarks 6924
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6925
research are illustrated. Some benefits and some advantages of this research are highlighted. 6926
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6927
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Path- 6928
Decomposition. For that sake in the second definition, the main definition of the Neutrosophic 6929
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for 6930
the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian- 6931
Type-Path-Decomposition, finds the convenient background to implement some results based on that. 6932
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this re- 6933
search on the modeling of the regions where are under the attacks of the cancer to recognize this 6934
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 6935
the SuperHyperNotion, SuperHyperEulerian-Type-Path-Decomposition, the new SuperHyperClasses and 6936
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 6937
SuperHyperEulerian-Type-Path-Decomposition and the Neutrosophic SuperHyperEulerian-Type-Path-Decomposition. 6938

The clarifications, instances and literature reviews have taken the whole way through. In this 6939
research, the literature reviews have fulfilled the lines containing the notions and the results. 6940
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6941
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 6942
of the moves of the cancer in the longest and strongest styles with the formation of the design 6945
and the architecture are formally called “ SuperHyperEulerian-Type-Path-Decomposition” in the themes 6946
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 6947
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 6948
for this research are, figured out, pointed out and spoken out. 6949
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Path-Decomposition
3. Neutrosophic SuperHyperEulerian-Type-Path-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6950
Neutrosophic SuperHyperDuality But As 6951
Super Forms 6953
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6954

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6958

Va ∈ Ei , Ej ; 6959
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6960

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6961
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6962

Vi , Vj ∈ Ea ; 6963
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6964

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6965
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6966

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6967
sophic rv-SuperHyperDuality. 6968
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6969

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6972

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6974
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6975
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6976
form the Extreme SuperHyperDuality; 6978
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6979

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6981
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 6982
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6983
such that they form the Neutrosophic SuperHyperDuality; 6985
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6986
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6987

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6988
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6989
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6990
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6991
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6993
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6995

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6997
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6998
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 6999
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7000
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7003
coefficient; 7004
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7005

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7007
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7008
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 7009
form the Extreme SuperHyperDuality; 7011
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7012

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7013
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7014
such that they form the Neutrosophic SuperHyperDuality; 7018
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7019

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7020
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7021

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7023
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7026
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7028

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7030

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7033
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7036
coefficient. 7037
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7038
the mentioned Neutrosophic Figures in every Neutrosophic items. 7039

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7041
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7042
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7043
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7044
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7045
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7046
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7047
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 7051
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7052
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7053
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7054
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7055

every given Neutrosophic SuperHyperDuality. 7056




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 7097
Neutrosophic SuperHyperClasses. 7098
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 7100
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. 7107
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 7109
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 7115
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7116
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 7118


the Neutrosophic SuperHyperDuality. 7127
Then 7129
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 7130
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7136
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7139

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7140
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7149

(V, E). Then 7150

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 7151
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7152


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7156
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7157
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. 7169
Then, 7171
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 7172
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 7173


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7178
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7179
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7185

CHAPTER 39 7186
Neutrosophic SuperHyperJoin But As 7187
Super Forms 7189
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7190

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7194
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7196

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7197
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7199

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7201

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7204

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7205
rv-SuperHyperJoin. 7206
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7207

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

365

Extreme SuperHyperJoin; 7216
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7217

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7219
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7220
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7221
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7222

form the Neutrosophic SuperHyperJoin; 7223
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7224

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7225
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7226
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7231
coefficient; 7232
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7233

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7234
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7235
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7236
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7237
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7238
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7239

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7240
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7241
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7242

Extreme SuperHyperJoin; 7248
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7249

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7251
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7252
form the Neutrosophic SuperHyperJoin; 7255

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7256

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7258
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7262

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7263
to its Extreme coefficient; 7264
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7265

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7267
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7268

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7269
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7270
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7273
coefficient. 7274
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7278

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7279

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7344

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7353
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 7355


the Neutrosophic SuperHyperJoin. 7364
Then 7366
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 7367
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 7373
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7375

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7386

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7388


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

Then, 7406

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

.
Proof. Let 7407
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7408


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7412
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7413
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7414
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7419

CHAPTER 40 7420
Neutrosophic SuperHyperPerfect But As 7421
Super Forms 7423
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7424

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

Va ∈ Ei , Ej ; 7429
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7430

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7436

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7437
rv-SuperHyperPerfect. 7438
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7439

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7444
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7449

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7451
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7452
form the Neutrosophic SuperHyperPerfect; 7455
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7456

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7457
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7458
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7461
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7465

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7467
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7473
coefficient; 7474
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7475

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7483
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7484
such that they form the Neutrosophic SuperHyperPerfect; 7488
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7489

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7491

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7494
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7498

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7500

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7506
coefficient. 7507

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7511

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7577
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 7579
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7597
Then 7599
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 7600
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 7604
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7605
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7606
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7609

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 7620

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7643


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7646
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7647
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7648
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7649
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7655

CHAPTER 41 7656
Neutrosophic SuperHyperTotal But As 7657
Super Forms 7659
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7660

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7664

Va ∈ Ei , Ej ; 7665
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7666

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7667
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7668

Vi , Vj ∈ Ea ; 7669
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7670

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7672

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7673
rv-SuperHyperTotal. 7674
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7675

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7680
Extreme SuperHyperTotal; 7684
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7685

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7687
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7688
form the Neutrosophic SuperHyperTotal; 7691
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7692
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7693

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7694
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7699
coefficient; 7700
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7701
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7702

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7703
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7704
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7709
cient; 7710
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7711

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7713
Extreme SuperHyperTotal; 7717
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7718

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7720
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7721
form the Neutrosophic SuperHyperTotal; 7724
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7725

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7726
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7727


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7732
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7734

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7735
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7736
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7737

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7742
cient. 7743

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7747
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. 7762




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

SuperHyperModel (31.1), is the SuperHyperTotal. 7813
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 7815
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. 7822
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 7824



the Neutrosophic SuperHyperTotal. 7833
Then 7835
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 7836
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7842
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7844
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7855

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7862
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. 7873
Then, 7875
∗
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 7876
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7877


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7881
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7882

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7883
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7889

CHAPTER 42 7890
Neutrosophic SuperHyperConnected But 7891
As The Extensions Excerpt From Dense 7892
And Super Forms 7893
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7894

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7898
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7899
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7900

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7901
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7902
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7903

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7904
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7905

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7906
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7907
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7908
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7909
rosophic rv-SuperHyperConnected. 7910
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7911

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7914
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7915
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7916
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 7917
407
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 7918

that they form the Extreme SuperHyperConnected; 7920
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7921

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7922
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7923
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7924
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7925
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7926

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7927
nected; 7928
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7929

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7930
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7931
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7932
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7933
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7934

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7936
Extreme power is corresponded to its Extreme coefficient; 7937
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7938

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7939
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7940

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7946
its Neutrosophic coefficient; 7947
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7948

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7951
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7952

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7953
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7954
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7955

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7958
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7959
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7960

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7961
nected; 7962
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7963

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7966
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7967
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7968
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7969

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7970
and the Extreme power is corresponded to its Extreme coefficient; 7971
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7972


the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7980
its Neutrosophic coefficient. 7981
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7984
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7985
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7987
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7988
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7989
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7990
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7991
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. 7999


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 8043
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. 8050
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 8052
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. 8059
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 8061



the Neutrosophic SuperHyperConnected. 8070
Then 8072
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 8073
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 8078
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8079
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8082

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8093
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 8094
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8095


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8099
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8100
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8101
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. 8112
Then, 8114
∗
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 8115
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8116


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8119
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8120
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8121
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8122
some representatives. The latter is straightforward. 8123
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8128

CHAPTER 43 8129
Background 8130
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 8137
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 8138
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 1 8139
and issue 1 with pages 06-14. The research article studies deeply with choosing neutrosophic 8140
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 8141
results based on initial background. 8142
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 8143
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 8144
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 8151
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 8152
and fundamental SuperHyperNumbers. 8153
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co-Super 8154
Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 8155
Applications in Cancer’s Treatments” in Ref. [HG3] by Henry Garrett (2023). In this research 8156
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 8157

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


SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 8190
Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- Supe- 8191
rHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett (2022), 8192
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 8193
(2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyper- 8195
Modeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG17] by 8196
Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 8197
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 8198
[HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 8199

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [HG19] by Henry 8200
Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and Super- 8201
HyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) 8202
SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” 8203
in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutro- 8204
sophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [HG21] 8205

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

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

(R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic Supe- 8211
rHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 8212
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 8213
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 8214
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 8215
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 8216
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 8217
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 8218
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 8219
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 8220
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 8221
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 8222

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

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

on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] by Henry Garrett 8235
(2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neut- 8236
rosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic Notions 8237
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), 8239
“Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyper- 8240

Resolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material 8241
of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic 8242
SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by 8243
Henry Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 8244

the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph along- 8262


Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 8278
in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has more 8279
than 4276 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Dr. 8280
Henry Garrett. This research book covers different types of notions and settings in neutrosophic 8281
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 8288
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 8289
that what’s done in this research book which is popular in the terms of high readers in Scribd. 8290
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 8291
the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 8292
ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 8293

HG241; HG242; HG243; HG244; HG245; HG246; HG247; HG248; HG249] along- 8310


Bibliography 8326
10.33140/JMTCM.01.03.09) 8333
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 8351
European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 8352
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 8353
tps://oa.mg/work/10.13140/rg.2.2.35241.26724 8354
427
10.20944/preprints202301.0282.v1). 8361
10.20944/preprints202301.0267.v1). 8364

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8369
prints202301.0262.v1). 8373
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8379
prints202301.0105.v1). 8382
Preprints 2023, 2023010044 8388
(doi: 10.20944/preprints202301.0043.v1). 8391

(doi: 10.20944/preprints202212.0549.v1). 8400
(doi: 10.20944/preprints202212.0500.v1). 8407
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 8418

10.5281/zenodo.7834229). 8422
10.5281/zenodo.7834261). 8425
10.5281/zenodo.7824560). 8428
(doi: 10.5281/zenodo.7824623). 8431

2023, (doi: 10.5281/zenodo.7809365). 8442
2023, (doi: 10.5281/zenodo.7809358). 8445
10.5281/zenodo.7809219). 8448
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 8450
10.5281/zenodo.7809328). 8451
2023, (doi: 10.5281/zenodo.7806767). 8454
2023, (doi: 10.5281/zenodo.7806838). 8457
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 8459
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 8460
(doi: 10.5281/zenodo.7799902). 8466
2023, (doi: 10.5281/zenodo.7804218). 8469

(doi: 10.5281/zenodo.7796334). 8472
10.5281/zenodo.7791952). 8478
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 8480
10.5281/zenodo.7791982). 8481
10.5281/zenodo.7790026). 8484
HG223 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 8485
10.5281/zenodo.7790052). 8487
2023, (doi: 10.5281/zenodo.7787066). 8490
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 8492
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 8493
10.5281/zenodo.7781476). 8496
10.5281/zenodo.7783082). 8499
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 8501
10.5281/zenodo.7777857). 8502
10.5281/zenodo.7779286). 8505
(doi: 10.5281/zenodo.7771831). 8508

2023, (doi: 10.5281/zenodo.7772468). 8511
10.13140/RG.2.2.20913.25446). 8514
HG212 [59] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 8515
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 8516
odo.7764916). 8517
10.13140/RG.2.2.11770.98247). 8520
10.13140/RG.2.2.12400.12808). 8523
2023, (doi: 10.13140/RG.2.2.22545.10089). 8526
10.13140/RG.2.2.11377.76644). 8532
10.13140/RG.2.2.23750.96329). 8535
10.13140/RG.2.2.31366.24641). 8538
10.13140/RG.2.2.34721.68960). 8541
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 8543
2023, (doi: 10.13140/RG.2.2.30212.81289). 8544

10.13140/RG.2.2.24288.35842). 8550
10.13140/RG.2.2.32467.25124). 8553
10.13140/RG.2.2.31025.45925). 8556
10.13140/RG.2.2.17184.25602). 8559
10.13140/RG.2.2.23423.28327). 8562
10.13140/RG.2.2.28456.44805). 8565
10.13140/RG.2.2.23525.68320). 8568
HG194 [77] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 8569
10.13140/RG.2.2.20170.24000). 8571
10.13140/RG.2.2.36475.59683). 8574
10.13140/RG.2.2.29764.71046). 8577
2023, (doi: 10.13140/RG.2.2.18780.87683). 8580
10.13140/RG.2.2.26134.01603). 8586

HG188 [83] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 8587
10.13140/RG.2.2.27392.30721). 8589
10.13140/RG.2.2.33028.40321). 8592
10.13140/RG.2.2.21389.20966). 8595
10.13140/RG.2.2.16356.04489). 8598
10.13140/RG.2.2.21756.21129). 8601
HG183 [88] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 8602
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 8603
10.13140/RG.2.2.30983.68009). 8604
10.13140/RG.2.2.28552.29445). 8607
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 8609
ate 2023, (doi: 10.13140/RG.2.2.10936.21761). 8610
10.13140/RG.2.2.35105.89447). 8613
(doi: 10.13140/RG.2.2.30072.72960). 8616
10.13140/RG.2.2.31147.52003). 8619
10.13140/RG.2.2.32825.24163). 8622
10.13140/RG.2.2.13059.58401). 8625

10.13140/RG.2.2.11172.14720). 8628
2023, (doi: 10.13140/RG.2.2.22011.80165). 8631
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8634
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 8636
2023, (doi: 10.13140/RG.2.2.10493.84962). 8637
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8640
2023, (doi: 10.13140/RG.2.2.19944.14086). 8643
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8646
(doi: 10.13140/RG.2.2.33103.76968). 8649
HG167 [104] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 8650
(doi: 10.13140/RG.2.2.23037.44003). 8652
(doi: 10.13140/RG.2.2.35646.56641). 8655
(doi: 10.13140/RG.2.2.18030.48967). 8658
(doi: 10.13140/RG.2.2.13973.81121). 8661
2023, (doi: 10.13140/RG.2.2.34106.47047). 8664

2023, (doi: 10.13140/RG.2.2.31956.88961). 8670
2023, (doi: 10.13140/RG.2.2.15179.67361). 8673
10.13140/RG.2.2.21510.45125). 8676
HG158 [113] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 8677
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 8678
2023, (doi: 10.13140/RG.2.2.13121.84321). 8679
10.13140/RG.2.2.11758.69441). 8682
2023, (doi: 10.13140/RG.2.2.31891.35367). 8685
10.13140/RG.2.2.19360.87048). 8688
HG154 [117] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 8689
10.13140/RG.2.2.32363.21286). 8691
10.13140/RG.2.2.23266.81602). 8694
10.13140/RG.2.2.19911.37285). 8697
10.13140/RG.2.2.11050.90569). 8700
HG150 [121] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 8701
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 8702
2023, (doi: 10.13140/RG.2.2.17761.79206). 8703

HG149 [122] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 8704
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 8705
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 8708
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8709
(doi: 10.13140/RG.2.2.30182.50241). 8712

2023, (doi: 10.13140/RG.2.2.17252.24968). 8745

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 8753

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8754
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8757
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implement- 8759
ing (Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 8760

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 8761


HG128 [142] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 8766
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 8767

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 8768
2023,(doi: 10.13140/RG.2.2.36745.93289). 8771
10.20944/preprints202301.0282.v1). 8778
10.20944/preprints202301.0267.v1).). 8781

2023010265 (doi: 10.20944/preprints202301.0265.v1). 8786
prints202301.0262.v1). 8790
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8796

10.13140/RG.2.2.35061.65767). 8799

10.13140/RG.2.2.18494.15680). 8803

10.13140/RG.2.2.32530.73922). 8807
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on 8809

Cancer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 8810
10.13140/RG.2.2.15897.70243). 8811

10.13140/RG.2.2.32530.73922). 8815

prints202301.0105.v1). 8818

10.13140/RG.2.2.23172.19849). 8825
10.13140/RG.2.2.17385.36968). 8835
Preprints 2023, 2023010044 8838
(doi: 10.20944/preprints202301.0043.v1). 8841

2023, (doi: 10.13140/RG.2.2.28945.92007). 8844
10.13140/RG.2.2.35774.77123). 8850

10.13140/RG.2.2.29430.88642). 8856

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

10.13140/RG.2.2.19380.94084). 8865
(doi: 10.20944/preprints202212.0500.v1). 8876
10.13140/RG.2.2.20993.12640). 8879
HG952 [176] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 8880

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

10.13140/RG.2.2.29173.86244). 8894
HG38 [181] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutro- 8895
sophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic Super- 8896
HyperGraph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 8897


(doi: 10.5281/zenodo.7835063). 8901
(doi: 10.5281/zenodo.7826705). 8903
2023 (doi: 10.5281/zenodo.7820680). 8905
10.5281/zenodo.7812750). 8907


2023 (doi: 10.5281/zenodo.7807782). 8913
2023 (doi: 10.5281/zenodo.7804449). 8915

(doi: 10.5281/zenodo.7792307). 8919
(doi: 10.5281/zenodo.7790728). 8921
2023 (doi: 10.5281/zenodo.7787712). 8923
10.5281/zenodo.7783791). 8925
10.5281/zenodo.7780123). 8927
(doi: 10.5281/zenodo.7773119). 8929
odo.7637762). 8931
10.5281/zenodo.7766174). 8933

10.5281/zenodo.7762232). 8935
(doi: 10.5281/zenodo.7758601). 8937
10.5281/zenodo.7754661). 8939
10.5281/zenodo.7750995) . 8941
(doi: 10.5281/zenodo.7749875). 8943
10.5281/zenodo.7747236). 8945
10.5281/zenodo.7742587). 8947
(doi: 10.5281/zenodo.7738635). 8949
10.5281/zenodo.7734719). 8951
10.5281/zenodo.7730484). 8953
(doi: 10.5281/zenodo.7730469). 8955
10.5281/zenodo.7722865). 8957
odo.7713563). 8959
odo.7709116). 8961
10.5281/zenodo.7706415). 8963
(doi: 10.5281/zenodo.7706063). 8965
(doi: 10.5281/zenodo.7701906). 8967
odo.7700205). 8969

10.5281/zenodo.7694876). 8971
10.5281/zenodo.7679410). 8973
10.5281/zenodo.7675982). 8975
10.5281/zenodo.7672388). 8977
odo.7668648). 8979
10.5281/zenodo.7662810). 8981
10.5281/zenodo.7659162). 8983
HG120b [225] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 8984
10.5281/zenodo.7653233). 8985
odo.7653204). 8987
odo.7653142). 8989
odo.7653117). 8991
odo.7653089). 8993
odo.7651687). 8995
odo.7651619). 8997
odo.7651439). 8999
odo.7650729). 9001
odo.7647868). 9003
odo.7647017). 9005

odo.7644894). 9007
odo.7641880). 9009
odo.7632923). 9011
odo.7623459). 9013
10.5281/zenodo.7606416). 9015
10.5281/zenodo.7606416). 9017
odo.7606404). 9019
10.5281/zenodo.7580018). 9021
odo.7580018). 9023
odo.7580018). 9025
odo.7579929). 9027
10.5281/zenodo.7563170). 9029
odo.7563164). 9031
odo.7563160). 9033
odo.7563160). 9035
10.5281/zenodo.7563160). 9037
10.5281/zenodo.7557063). 9039
10.5281/zenodo.7557009). 9041

10.5281/zenodo.7539484). 9043
10.5281/zenodo.7523390). 9045
10.5281/zenodo.7523390). 9047
10.5281/zenodo.7523390). 9049
odo.7574952). 9051
10.5281/zenodo.7574992). 9053
odo.7523357). 9055
10.5281/zenodo.7523357). 9057
10.5281/zenodo.7504782). 9059
10.5281/zenodo.7504782). 9061
10.5281/zenodo.7504782). 9063
10.5281/zenodo.7499395). 9065
odo.7499395). 9067
10.5281/zenodo.7499395). 9069
10.5281/zenodo.7497450). 9071
10.5281/zenodo.7497450). 9073
10.5281/zenodo.7494862). 9075
odo.7494862). 9077

10.5281/zenodo.7494862). 9079
10.5281/zenodo.7493845). 9081
10.5281/zenodo.7493845). 9083
10.5281/zenodo.7493845). 9085
odo.7539484). 9087
odo.7523390). 9089
odo.7523357). 9091
odo.7504782). 9093
odo.7499395). 9095
odo.7497450). 9097
odo.7494862). 9099
odo.7493845). 9101
odo.7480110). 9103
odo.7378758). 9105
HG32b [286] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 9106
10.5281/zenodo.6320305). 9107
odo.6677173). 9109

CHAPTER 44 9110
Books’ Contributions 9111
“Books’ Contributions”: | Featured Threads 9112

The following references are cited by chapters. 9113
9114
[Ref248] 9115
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type- 9116
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 9117
2023, (doi: 10.5281/zenodo.7840206). 9118
9119
[Ref249] 9120
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9121
Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 9122
2023, (doi: 10.5281/zenodo.7839333). 9123
9124
The links to the contributions of this scientific research book are listed below. 9125
[HG248] 9126
2023, (doi: 10.5281/zenodo.7840206). 9129
9130
[TITLE] “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type-Path- 9131
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9132

9133
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9134
https://www.researchgate.net/publication/370074278 9135
9136
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9137
https://www.scribd.com/document/639129547 9138
9139
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9140
https://zenodo.org/record/7840206 9141
9142
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9143
https://www.academia.edu/100379583 9144
449
Figure 44.1: Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper-
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7840206).
9145
[ADDRESSED CITATION] 9146
2023, (doi: 10.5281/zenodo.7840206). 9149
[ASSIGNED NUMBER] #248Article 9150
[DATE] April 2023 9151

[DOI] 10.5281/zenodo.7840206 9152
[LICENSE] CC BY-NC-ND 4.0 9153
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9154
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9155
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9156
9157
[HG249] 9158
2023, (doi: 10.5281/zenodo.7839333). 9161
9162
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9163

Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation” 9164
9165
https://www.researchgate.net/publication/370070007 9167
9168
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9169


Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333).
https://www.scribd.com/document/639059148 9170
9171
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9172
9174
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9175
https://www.academia.edu/100359428 9176
9177
2023, (doi: 10.5281/zenodo.7839333). 9181
[ASSIGNED NUMBER] #249 Article 9182

[DATE] April 2023 9183
[DOI] 10.5281/zenodo.7839333 9184
[LICENSE] CC BY-NC-ND 4.0 9185
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9186
[AVAILABLE AT TWITTER’S IDS] 9187
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9188
googlebooks GooglePlay 9189
9190
[ASSIGNED NUMBER] | Book #163 9191
Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 9193
2023 (doi: 10.5281/zenodo.7848019). 9194


[TITLE] Eulerian-Type-Path-Decomposition In SuperHyperGraphs 9195

#Latest_Updates 9196
#The_Links 9197
9201
9203
#The_Links 9204
9205
[ASSIGNED NUMBER] | Book #163 9206

9207
[TITLE] Eulerian-Type-Path-Decomposition In SuperHyperGraphs 9208
9209
9213
– 9214
9215
[PUBLISHER] 9216
(Paperback): https://www.amazon.com/dp/- 9217
(Hardcover): https://www.amazon.com/dp/- 9218

(Kindle Edition): https://www.amazon.com/dp/- 9219
9220
– 9221
9222
[ISBN] 9223
(Paperback): - 9224
(Hardcover): - 9225
(Kindle Edition): CC BY-NC-ND 4.0 9226
(EBook): CC BY-NC-ND 4.0 9227
9228
– 9229
9230
[PRINT LENGTH] 9231
(Paperback): - pages 9232
(Hardcover): - pages 9233
(Kindle Edition): - pages 9234
(E-Book): 602 pages 9235
9236
– 9237
9238
9240

#The_Links 9241
9242
https://www.researchgate.net/publication/- 9244
9245
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9246
https://drhenrygarrett.wordpress.com/2023/07/22/ 9247
Eulerian-Type-Path-Decomposition-In-SuperHyperGraphs/ 9248
9249
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9250
https://www.scribd.com/document/- 9251
9252
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9253
https://www.academia.edu/- 9254
9255
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9256
9258
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9259
https://books.google.com/books/about?id=- 9260
9261
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9262
https://play.google.com/store/books/details?id=- 9263

[TITLE] Eulerian-Type-Path-Decomposition In SuperHyperGraphs (Published Version) 9264

9265
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9266
9267
https://drhenrygarrett.wordpress.com/2023/07/22/ 9268
Eulerian-Type-Path-Decomposition-In-SuperHyperGraphs/ 9269
9270
– 9271
9272
[POSTED BY] Dr. Henry Garrett 9273
9274
[DATE] April 0120, 2023 9275

9276
[POSTED IN] 163 | Eulerian-Type-Path-Decomposition In SuperHyperGraphs 9277
9278
[TAGS] 9279
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9280
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9281
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9282
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9283
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Path-Decomposition In Supe- 9284
rHyperGraphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, 9285
Questions, Real-World Applications, Recent Research, Recognitions, Research, scientific research 9286
Article, scientific research Articles, scientific research Book, scientific research Chapter, scientific 9287
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHy- 9288

perGraph Theory, SuperHyperGraphs, Eulerian-Type-Path-Decomposition In SuperHyperGraphs, 9289
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9290
In this scientific research book, there are some scientific research chapters on “Extreme Eulerian- 9291
Type-Path-Decomposition In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Path- 9292
Decomposition In SuperHyperGraphs” about some scientific research on Eulerian-Type-Path- 9293
Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme 9294

Eulerian-Type-Path-Decomposition In SuperHyperGraphs and Neutrosophic Eulerian-Type-Path- 9295
Decomposition In SuperHyperGraphs. With scientific research on the basic scientific research 9296
properties, the scientific research book starts to make Extreme Eulerian-Type-Path-Decomposition 9297
In SuperHyperGraphs theory and Neutrosophic Eulerian-Type-Path-Decomposition In SuperHy- 9298
perGraphs theory more (Extremely/Neutrosophicly) understandable. 9299

CHAPTER 45 9300
“SuperHyperGraph-Based Books”: | 9301
Featured Tweets 9302
“SuperHyperGraph-Based Books”: | Featured Tweets 9303
457
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 46 9304
CV 9305
485
9306
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG
My name and affiliation is listed on the journal’s reviewer page:
http://www.sciencepg.com/journal/peerreviewers?journalid=303.
My name and affiliation is listed on the journal’s personal
page:https://membership.sciencepg.com/DrHenryGarrett
PDF: https://drhenrygarrett.files.wordpress.com/2023/04/certificate_for_reviewer.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
9307
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM
Editorial Board Member to Journal of Mathematical Techniques and Computational

Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Editorial Board Member to JCTCSR JCTCSR
Editorial Board Member to Journal of Current Trends in Computer Science

Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
9308
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

9309

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript

9310
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress

Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

9311
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
Zenodo 2023, (doi: 10.5281/zenodo.7793372).
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript

9312
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

9313
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9314
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
9315
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

9316
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

9317
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript

9318
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor
10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

9319
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript

9320
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In
10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript

9321
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

9322
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript

9323
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

9324
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript

9325
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
9326
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

9327

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript

9328
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

9329

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
9330
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript

9331
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
9332
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
9333
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition

Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
9334
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9335
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions

Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
9336
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

9337
2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
9338
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

9339
2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
9340
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
9341
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9342
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).
9343

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
9344
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).
9345
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100157960
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
Decomposition-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

9346
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

9347
[HG157b] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Nhu4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Nhu4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JK83H9
(Hardcover): https://www.amazon.com/dp/B0C1J3J6GZ
(Kindle Edition): https://www.amazon.com/dp/B0C1VXHLYJ
ISBN
(Paperback): 9798390583968
(Hardcover): 9798390584002
2023 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs Amazon
[HG156b] Henry Garrett, “”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7807782).
@googlebooks:https://books.google.com/books/about?id=pu-3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=pu-3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Cut-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1PBHJ
(Hardcover): https://www.amazon.com/dp/B0C1HVLC8V
(Kindle Edition): https://www.amazon.com/dp/B0C1SZJYH8
ISBN
(Paperback): 9798390476758
(Hardcover): 9798390476789
2023 155 | SuperHyperDuality Amazon

9348
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
Neighbor-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

9349
[HG153b] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7792307).
@googlebooks:https://books.google.com/books/about?id=4By3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=4By3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C12DH1TZ
(Hardcover): https://www.amazon.com/dp/B0C12JFJGM
(Kindle Edition): https://www.amazon.com/dp/B0C18V22Y2
ISBN
(Paperback): 9798389815193
(Hardcover): 9798389815209
2023 152 | Hamiltonian-Neighbor In SuperHyperGraphs Amazon
[HG152b] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7790728).
@googlebooks:https://books.google.com/books/about?id=hA63EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hA63EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C128T8FP
(Hardcover): https://www.amazon.com/dp/B0C12DHG8K
(Kindle Edition): https://www.amazon.com/dp/B0C16YJ5KL
ISBN
(Paperback): 9798389655539
(Hardcover): 9798389655638
2023 151 | Hamiltonian-Decomposition In SuperHyperGraphs Amazon

9350
[HG151b] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=84u2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=84u2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-
(Paperback): https://www.amazon.com/dp/B0C12D3JBS
(Hardcover): https://www.amazon.com/dp/B0C12D3K6P
(Kindle Edition): https://www.amazon.com/dp/B0C147QGJC
ISBN
(Paperback): 9798389394353
(Hardcover): 9798389394629
2023 150 | Hamiltonian-Cut In SuperHyperGraphs Amazon
[HG150b] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7783791).
@googlebooks:https://books.google.com/books/about?id=3Gy2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=3Gy2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPJTY4
(Hardcover): https://www.amazon.com/dp/B0C12528LZ
(Kindle Edition): https://www.amazon.com/dp/B0BZYLS8NZ
ISBN
(Paperback): 9798389221505
(Hardcover): 9798389222076
2023 149 | Trace-Neighbor In SuperHyperGraphs Amazon

9351
[HG149b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7780123).
@googlebooks:https://books.google.com/books/about?id=Tie2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Tie2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPDKDF
(Hardcover): https://www.amazon.com/dp/B0BZFP49GT
(Kindle Edition): https://www.amazon.com/dp/B0BZVLWRSD
ISBN
(Paperback): 9798389040786
(Hardcover): 9798389040946
2023 148 | Trace-Decomposition In SuperHyperGraphs Amazon
[HG148b] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7773119).
@googlebooks:https://books.google.com/books/about?id=y8a1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=y8a1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPFVRT
(Hardcover): https://www.amazon.com/dp/B0BZFP491Q
(Kindle Edition): https://www.amazon.com/dp/B0BZP8555H
ISBN
(Paperback): 9798388702937
(Hardcover): 9798388702999

9352
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9353
[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

9354
[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

9355
[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

9356
[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

9357
[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

9358
[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

9359
[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

9360
[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

9361
[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

9362
[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

9363
[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

9364
[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

9365
[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

9366
[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

9367
[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

9368
[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

9369
[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

9370
[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

9371
[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
9372
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

9373
[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

9374
[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

9375
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9376
[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

9377
[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
9378
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

9379
“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

9380
[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
9381
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

9382
[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

9383
[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

9384
[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

9385
[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

9386
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

9387
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
9388
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
9389
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

9390
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

9391
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
-
9392
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

9393
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9394
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
9395
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
9396
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

9397
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
9398
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
...
9399
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/
9400
Certificate of Reviewer
Reference: AJCST Date: December 11, 2022
The certificate is awarded to
Henry Garrett, Department of Mathematics, City University of New York, New York, United States
In recognition of the appointment as a Reviewer of American Journal of Computer Science and Technology(AJCST)
ISSN Print: 2640-0111; ISSN Online: 2640-012X
https://www.sciencepg.com/j/ajcst
from December 11, 2022 to December 11, 2024
9401
9402
9403
Henry Garrett
01/23/2022
9404
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
9405
View publication stats

Eulerian-Type-Path-Decomposition in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Eulerian-Type-Path-Decomposition in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

451 PUBLICATIONS 13,005 CITATIONS

Featured Articles View project

On Algebraic Structures and Algebraic Hyperstructures View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super 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 61

10 Extreme SuperHyperEulerian-Type-Path-Decomposition But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Type-Path-Decomposition 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperEulerian-Type-Path-Decomposition But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 341

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 349

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 449

45 “SuperHyperGraph-Based Books”: | Featured Tweets 457

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

Henry Garrett · Independent Researcher · Department of Mathematics ·