Eulerian-Type-Cycle-Decomposition in SuperHyperGraphs

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

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

Eulerian-Type-Cycle-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 an Extreme Preliminaries Of This Scientific Research On the Redeemed

Ways 61
10 an Extreme SuperHyperEulerian-Type-Cycle-Decomposition But As The Exten-

sions Excerpt From Dense And Super Forms 73
11 The an Extreme Departures on The Theoretical Results Toward Theor-

etical Motivations 117
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 129
13 an Extreme Applications in Cancer’s an Extreme Recognition 141
14 Case 1: The Initial an Extreme Steps Toward an Extreme SuperHyper-

Bipartite as an Extreme SuperHyperModel 143
15 Case 2: The Increasing an Extreme Steps Toward an Extreme SuperHy-

perMultipartite as an Extreme SuperHyperModel 145
16 Wondering Open Problems But As The Directions To Forming The

Motivations 147
17 Conclusion and Closing Remarks 149
18 an Extreme SuperHyperDuality But As The Extensions Excerpt From

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

20 an Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 an Extreme SuperHyperTotal But As The Extensions Excerpt From

22 an Extreme SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 207
23 Background 221
Bibliography 227
24 Cancer In Neutrosophic SuperHyperGraph 249
25 Neutrosophic Eulerian-Type-Cycle-Decomposition 253
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Eulerian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation 255
27 ABSTRACT 257
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 263

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 267
30 Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition But As The Ex-

tensions Excerpt From Dense And Super Forms 279
31 The Neutrosophic Departures on The Theoretical Results Toward

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

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

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

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

Motivations 353
37 Conclusion and Closing Remarks 355
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 413
43 Background 427
Bibliography 433
44 Books’ Contributions 455
45 “SuperHyperGraph-Based Books”: | Featured Tweets 467
46 CV 495

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

an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
10.10The an Extreme SuperHyperGraphs Associated to the an Extreme Notions of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
vi

(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
11.1 a an Extreme SuperHyperPath Associated to the Notions of an Extreme

SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.5) . . . . . . . . . . . 119
11.2 a an Extreme SuperHyperCycle Associated to the an Extreme Notions of an Extreme
SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.7) . . . . 120
11.3 a an Extreme SuperHyperStar Associated to the an Extreme Notions of an Extreme
SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.9) . . . . 121
11.4 an Extreme SuperHyperBipartite an Extreme Associated to the an Extreme Notions
of an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.11) . . 123

11.5 a an Extreme SuperHyperMultipartite Associated to the Notions of an Extreme

SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.13) . . . . . . . . . . 125
11.6 a an Extreme SuperHyperWheel an Extreme Associated to the an Extreme Notions
of an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example
(42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
14.1 a an Extreme SuperHyperBipartite Associated to the Notions of an Extreme

SuperHyperEulerian-Type-Cycle-Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . 143
15.1 a an Extreme SuperHyperMultipartite Associated to the Notions of an Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.5) . . . . . . . . . . . 325
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Example
(42.0.11) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329

31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.13) . . . . . . . . . . 331
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type-

Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper-
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). . . . . . . . . . . . . . . . . 456
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7904529). . . . . . . . . . . 458
44.7 [HG169b] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyper-
Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7874677). . . . . . . . . . 463
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 468

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 469
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 470
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 476



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 an Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . 144

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 350

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

Type-Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, 4
namely, Extreme Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs and Neutro- 5
sophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs. With scientific research on 6
the basic scientific research properties, the scientific research book starts to make Extreme 7
Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs theory and Neutrosophic Eulerian- 8
Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs and Neutro- 13
sophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs . Two different types of 14
SuperHyperDefinitions are debut for them but the scientific research goes further and the 15
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 16
and well-reviewed. The literature review is implemented in the whole of this research. For 17
shining the elegancy and the significancy of this research, the comparison between this Su- 18
perHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 19
featured. The definitions are followed by the examples and the instances thus the clarifications 20
are driven with different tools. The applications are figured out to make sense about the 21
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under scientific 22
research to figure out the challenges make sense about ongoing and upcoming research. The 23
special case is up. The cells are viewed in the deemed ways. There are different types of 24
them. Some of them are individuals and some of them are well-modeled by the group of 25
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 26
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 27

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

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

need to “redefine” the notion of a “Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs 50
. It’s redefined a Neutrosophic Eulerian-Type-Cycle-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-Cycle-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-Cycle-Decomposition 61
In SuperHyperGraphs until the Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, 62
then it’s officially called a “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” but 63
otherwise, it isn’t a Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs . There are 64

some instances about the clarifications for the main definition titled a “Eulerian-Type-Cycle- 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-Cycle-Decomposition In SuperHyperGraphs . For the sake of having a Neutro- 68
sophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, there’s a need to “redefine” 69

the notion of a “Neutrosophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” and 70
a “Neutrosophic Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs are 75

redefined to a “Neutrosophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” if the 76
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 77
there’s more ways to get Neutrosophic type-results to make a Neutrosophic Eulerian-Type- 78
Cycle-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-Cycle-Decomposition In SuperHyperGraphs, 81
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 82
“Neutrosophic SuperHyperPath”, “Neutrosophic Eulerian-Type-Cycle-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-Cycle-Decomposition 86

In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 87
the Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs amid the maximum value amid 88
all SuperHyperVertices from a Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs .] 89
Eulerian-Type-Cycle-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-Cycle-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 and 118
the traces of the cancer on the complex tracks and between complicated groups of cells could 119
be fantasized by a Neutrosophic SuperHyperPath(-/Eulerian-Type-Cycle-Decomposition In 120
SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Super- 121

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

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

Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs. There isn’t any formation of 130
any Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs but literarily, it’s the deforma- 131
tion of any Eulerian-Type-Cycle-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-Cycle-Decomposition In 135
SuperHyperGraphs, Cancer’s Recognition 136

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

Two different types of SuperHyperDefinitions are debut for them but the scientific research 141
goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on 142
that are well-defined and well-reviewed. The literature review is implemented in the whole of 143
this research. For shining the elegancy and the significancy of this research, the comparison 144
between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyper- 145
Numbers 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
Cycle-Decomposition In SuperHyperGraphs” is a maximal Eulerian-Type-Cycle-Decomposition 159
In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of 160
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 161
of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 162
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds if 163
S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Eulerian-Type-Cycle-Decomposition In 164

SuperHyperGraphs” is a maximal Neutrosophic Eulerian-Type-Cycle-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

Cycle-Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to 172
make Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs more understandable. For the 173
sake of having Neutrosophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, there’s 174
a need to “redefine” the notion of “Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs 178
. It’s redefined Neutrosophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs if 179
the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, Hy- 180
perEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key 181
points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of 182
The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 183
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 184
Its 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-Cycle-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-Cycle-Decomposition 189

In SuperHyperGraphs until the Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, 190
then it’s officially called “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” but 191
otherwise, it isn’t Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs . There are 192
some instances about the clarifications for the main definition titled “Eulerian-Type-Cycle- 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 Eulerian- 195
Type-Cycle-Decomposition In SuperHyperGraphs . For the sake of having Neutrosophic 196
Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, there’s a need to “redefine” the 197
notion of “Neutrosophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” and “Neut- 198
rosophic Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs are 203
redefined “Neutrosophic Eulerian-Type-Cycle-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
Cycle-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-Cycle-Decomposition In SuperHyperGraphs, 209
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 210
“Neutrosophic SuperHyperPath”, “Neutrosophic Eulerian-Type-Cycle-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-Cycle-Decomposition 214
In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all 215
Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs amid the maximum value amid 216

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

Eulerian-Type-Cycle-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-Cycle-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
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
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-Cycle-Decomposition 248
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Supe- 249
rHyperWheel). The aim is to find either the longest Eulerian-Type-Cycle-Decomposition In 250
SuperHyperGraphs or the strongest Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs 251
in those Neutrosophic SuperHyperModels. For the longest Eulerian-Type-Cycle-Decomposition 252

In SuperHyperGraphs, called Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, and 253
the strongest Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs, called Neutrosophic 254
Eulerian-Type-Cycle-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-Cycle-Decomposition In SuperHyperGraphs. There isn’t any formation of 258

any Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs but literarily, it’s the deforma- 259
tion of any Eulerian-Type-Cycle-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-Cycle- 263
Decomposition In SuperHyperGraphs, Cancer’s Neutrosophic Recognition 264

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

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

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




CHAPTER 2 298
Background 299
There are some scientific researches covering the topic of this research. In what follows, there 300
are some discussion and literature reviews about them. 301
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 302
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 303
Neutrosophic Super Hyper Classes” in Ref. [HG1] by Henry Garrett (2022). In this research 304
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyper- 305
Graph based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses 306
of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 307
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 308

abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 309
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph 310
and SuperHyperGraph. It’s the breakthrough toward independent results based on initial 311
background and fundamental SuperHyperNumbers. 312
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co- 313
Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 314
Applications in Cancer’s Treatments” in Ref. [HG2] by Henry Garrett (2023). In this research 315
article, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHy- 316
perGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 317
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 318
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 319
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 320
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 321
toward independent results based on initial background and fundamental SuperHyperNumbers. 322
The seminal paper and groundbreaking article is titled “A Research on Cancer’s Recognition 323
and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets 324
as Hyper Covering Versus Super separations” 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 Recognition. 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 Comput 329
13
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 333
degree alongside chromatic numbers in the setting of some classes related to neutrosophic hyper- 334
graphs” in Ref. [HG93] by Henry Garrett (2023). In this research article, a novel approach 335
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 336
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 337
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 338
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 2 and 339
issue 1 with pages 16-24. The research article studies deeply with choosing neutrosophic hyper- 340
graphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward independent 341
results based on initial background. In some articles are titled “0039 | Closing Numbers and 342
Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 343
(Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry Garrett (2022), “0049 | (Failed)1- 344
Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] by Henry Garrett (2022), 345
“Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition 346
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. [HG6] by Henry 347
Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions 348
Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs 349
Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), “Neutrosophic Version Of 350
Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic SuperHyperGraphs” in Ref. 351

[HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify Separately The Cells and 352
Affected Cells Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On 353
the Sets Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 354
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry 355
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 356
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in 357
(Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett (2022), “Neutrosophic 358
Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Recognition Based 359
on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. [HG11] by Henry 360
Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 361
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] by Henry 362
Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And 363

Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s 365
Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett (2022), 366
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic 367
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] by 368

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 369
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 370
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 371
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 372
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 373
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 374

in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 375
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 376
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 377
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 378

Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 379
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 380
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 381
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 382
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 383
Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 384
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 385

Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyper- 386
Dominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions 387
in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett 388
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recog- 389
nition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The 390
Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 391
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 392
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 393
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 394
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 395
Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 396
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 397
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 398
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 399
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 400
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 401
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 402
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 403
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 404
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 405
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 406
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 407
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 408
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 409

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 410
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett 411
(2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 412
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG34] 413
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 414

And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), “Basic No- 415
tions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 416
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), 417
“Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyper- 418
Resolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of 419
Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic Super- 420
HyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry 421
Garrett (2022), and [HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; 422
HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; HG24; 423

HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; HG121; 426
HG255; HG256; HG257; HG258; HG259], there are some endeavors to formalize the basic 440
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 441
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 442
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 443
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 446
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 447

HG162b; HG163b; HG164b; HG165b; HG166b; HG167b; HG168b]. Two popular 454
scientific research books in Scribd in the terms of high readers, 4190 and 5189 respectively, on 455
neutrosophic science is on [HG32b; HG44b]. 456
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 457
book in Ref. [HG71b] by Henry Garrett (2023) which is indexed by Google Scholar and has 458
more than 4331 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 459
by Dr. Henry Garrett. This research book covers different types of notions and settings in 460
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 461
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 462
as book in Ref. [HG70b] by Henry Garrett (2023) which is indexed by Google Scholar and 463
has more than 5327 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 464
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 465
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 466
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 467
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 468
that what’s done in this research book which is popular in the terms of high readers in Scribd. 469
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 470

the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs the- 471

ory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; 472
HG251; HG252; HG253; HG254; HG255; HG256; HG257; HG258; HG259] alongside 490


Bibliography 506
HG1 [1] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 507
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 508
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 509
10.33140/JMTCM.01.03.09) 510
HG2 [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 511
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 512
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 513
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 514
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 515
alongside-a.pdf) 516
HG3 [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 517
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 518
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 519
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 520

recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 521
hamiltonian-sets-.pdf) 522
HG93 [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 523
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 524
Trends Comp Sci Res 2(1) (2023) 16-24. (https://www.opastpublishers.com/open-access- 525
articles/neutrosophic-codegree-and-neutrosophic-degree-alongside-chromatic-numbers- 526
in-the-setting-of-some-classes-related-to-neut.pdf) 527
HG4 [5] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 528
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 529
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 530
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 531

https://oa.mg/work/10.5281/zenodo.6319942 532
HG5 [6] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 533
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 534
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 535
https://oa.mg/work/10.13140/rg.2.2.35241.26724 536
19
HG6 [7] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 537
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 538
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 539
HG7 [8] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 540
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 541
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 542
10.20944/preprints202301.0282.v1). 543
HG8 [9] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 544
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 545
10.20944/preprints202301.0267.v1). 546
HG9 [10] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 547
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 548
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 549
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 550

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 580
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 581
(doi: 10.20944/preprints202212.0549.v1). 582
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 583
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 584
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 585
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 586
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 587
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 588
(doi: 10.20944/preprints202212.0500.v1). 589
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 590
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 591
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 593
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 594
HG259 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 596
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 597
10.5281/zenodo.7871026). 598
HG258 [26] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 599
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 600
2023, (doi: 10.5281/zenodo.7874647). 601
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 603

10.5281/zenodo.7857856). 604
HG256 [28] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 605
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 606
2023, (doi: 10.5281/zenodo.7857841). 607
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 609
Zenodo 2023, (doi: 10.5281/zenodo.7855661). 610
HG254 [30] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 611
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 612

HG253 [31] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 614
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 615
10.5281/zenodo.7853867). 616
HG252 [32] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 617
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 618
10.5281/zenodo.7853922). 619
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 621
(doi: 10.5281/zenodo.7851519). 622
HG250 [34] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 623
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 624
(doi: 10.5281/zenodo.7851550). 625
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 627
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 630
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 633
10.5281/zenodo.7834229). 634
HG246 [38] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 635
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 636
10.5281/zenodo.7834261). 637
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 639
10.5281/zenodo.7824560). 640
HG244 [40] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 641

(doi: 10.5281/zenodo.7824623). 643
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 645
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 648
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 651

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 653
2023, (doi: 10.5281/zenodo.7809365). 654
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 656
2023, (doi: 10.5281/zenodo.7809358). 657
HG238 [46] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 658
10.5281/zenodo.7809219). 660
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 662
10.5281/zenodo.7809328). 663
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 665
2023, (doi: 10.5281/zenodo.7806767). 666
HG235 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 667
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 668
2023, (doi: 10.5281/zenodo.7806838). 669
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 671
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 672
HG233 [51] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 673
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 674
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 675
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 677
10.5281/zenodo.7799902). 678
HG231 [53] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 679
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 680
(doi: 10.5281/zenodo.7804218). 681
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 683
(doi: 10.5281/zenodo.7796334). 684
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 686
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 689
10.5281/zenodo.7791952). 690

HG225 [57] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 691
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 692
10.5281/zenodo.7791982). 693
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 695
10.5281/zenodo.7790026). 696
HG223 [59] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 697
10.5281/zenodo.7790052). 699
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 701
2023, (doi: 10.5281/zenodo.7787066). 702
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 704
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 705
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 707
10.5281/zenodo.7781476). 708
HG219 [63] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 709
10.5281/zenodo.7783082). 711
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 713
10.5281/zenodo.7777857). 714
HG217 [65] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 715
10.5281/zenodo.7779286). 717
HG215 [66] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 718
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 719
(doi: 10.5281/zenodo.7771831). 720
HG214 [67] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 721
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 722
2023, (doi: 10.5281/zenodo.7772468). 723
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 725
10.13140/RG.2.2.20913.25446). 726
HG212 [69] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 727
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 728
odo.7764916). 729

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 731
10.13140/RG.2.2.11770.98247). 732
HG210 [71] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 733
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 734
10.13140/RG.2.2.12400.12808). 735
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 737
2023, (doi: 10.13140/RG.2.2.22545.10089). 738
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 740
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 741
HG207 [74] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 742
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 743
10.13140/RG.2.2.11377.76644). 744
HG206 [75] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 745
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 746
10.13140/RG.2.2.23750.96329). 747
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 749
10.13140/RG.2.2.31366.24641). 750
HG204 [77] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 751
10.13140/RG.2.2.34721.68960). 753
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 755
2023, (doi: 10.13140/RG.2.2.30212.81289). 756
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 758
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 761
10.13140/RG.2.2.24288.35842). 762
HG200 [81] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 763
10.13140/RG.2.2.32467.25124). 765
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 767
10.13140/RG.2.2.31025.45925). 768

HG198 [83] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 769
10.13140/RG.2.2.17184.25602). 771
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 773
10.13140/RG.2.2.23423.28327). 774
HG196 [85] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 775
10.13140/RG.2.2.28456.44805). 777
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 779
10.13140/RG.2.2.23525.68320). 780
HG194 [87] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 781
10.13140/RG.2.2.20170.24000). 783
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 785
10.13140/RG.2.2.36475.59683). 786
HG192 [89] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 787
10.13140/RG.2.2.29764.71046). 789
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 791
2023, (doi: 10.13140/RG.2.2.18780.87683). 792
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 794
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 797
10.13140/RG.2.2.26134.01603). 798
HG188 [93] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 799
10.13140/RG.2.2.27392.30721). 801
HG187 [94] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 802
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 803
10.13140/RG.2.2.33028.40321). 804
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 806
10.13140/RG.2.2.21389.20966). 807

HG185 [96] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 808
10.13140/RG.2.2.16356.04489). 810
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 812
10.13140/RG.2.2.21756.21129). 813
HG183 [98] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 814
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 815
10.13140/RG.2.2.30983.68009). 816
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 818
10.13140/RG.2.2.28552.29445). 819
HG181 [100] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 820
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 821
(doi: 10.13140/RG.2.2.10936.21761). 822
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 824
10.13140/RG.2.2.35105.89447). 825
HG179 [102] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 826
(doi: 10.13140/RG.2.2.30072.72960). 828
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 830
10.13140/RG.2.2.31147.52003). 831
HG177 [104] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 832
10.13140/RG.2.2.32825.24163). 834
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 836
10.13140/RG.2.2.13059.58401). 837
HG175 [106] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 838
10.13140/RG.2.2.11172.14720). 840
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 842
2023, (doi: 10.13140/RG.2.2.22011.80165). 843
HG173 [108] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 844
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 845
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 846

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 848
2023, (doi: 10.13140/RG.2.2.10493.84962). 849
HG171 [110] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 850
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 852
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 854
2023, (doi: 10.13140/RG.2.2.19944.14086). 855
HG169 [112] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 856
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 858
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 860
(doi: 10.13140/RG.2.2.33103.76968). 861
HG167 [114] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 862
(doi: 10.13140/RG.2.2.23037.44003). 864
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 866
(doi: 10.13140/RG.2.2.35646.56641). 867
HG165 [116] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 868
10.13140/RG.2.2.18030.48967). 870
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 872
(doi: 10.13140/RG.2.2.13973.81121). 873
HG163 [118] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 874
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 875
2023, (doi: 10.13140/RG.2.2.34106.47047). 876
HG162 [119] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 877
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 878
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 881
2023, (doi: 10.13140/RG.2.2.31956.88961). 882
HG160 [121] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 883
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 884
2023, (doi: 10.13140/RG.2.2.15179.67361). 885

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 887
10.13140/RG.2.2.21510.45125). 888
HG158 [123] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 889
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 890
2023, (doi: 10.13140/RG.2.2.13121.84321). 891
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 893
10.13140/RG.2.2.11758.69441). 894
HG156 [125] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 895
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 896
2023, (doi: 10.13140/RG.2.2.31891.35367). 897
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 899
10.13140/RG.2.2.19360.87048). 900
HG154 [127] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 901
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 902
10.13140/RG.2.2.32363.21286). 903
HG153 [128] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 904
10.13140/RG.2.2.23266.81602). 906
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 908
10.13140/RG.2.2.19911.37285). 909
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 911
10.13140/RG.2.2.11050.90569). 912
HG150 [131] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 913
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 914
2023, (doi: 10.13140/RG.2.2.17761.79206). 915
HG149 [132] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 916
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 917
HG148 [133] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 919
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 920
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 921
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 923
(doi: 10.13140/RG.2.2.30182.50241). 924

HG146 [135] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 925
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 926
HG145 [136] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 928
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 929
HG144 [137] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 931
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 932
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 933
HG143 [138] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 934
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 935
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 936
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 939
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 942
HG140 [141] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 943
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 944
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 945
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 948
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 951
HG137 [144] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 952
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 953
HG136 [145] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 955
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 956
2023, (doi: 10.13140/RG.2.2.17252.24968). 957
HG135 [146] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 958
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 959
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 960
HG134 [147] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 961
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 962

HG132 [148] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 964
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 965
2023010396 (doi: 10.20944/preprints202301.0396.v1). 966
HG131 [149] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 967
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 968
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 969
HG130 [150] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 970
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 971
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 972

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

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 975
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 976
HG128 [152] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 978
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 979

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 980
HG127 [153] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 981
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 982
2023,(doi: 10.13140/RG.2.2.36745.93289). 983
HG126 [154] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 984
HG125 [155] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 987

10.20944/preprints202301.0282.v1). 990
HG124 [156] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 991
10.20944/preprints202301.0267.v1).). 993
(doi: 10.20944/preprints202301.0265.v1). 998
HG122 [158] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 999
prints202301.0262.v1). 1002


2023010224, (doi: 10.20944/preprints202301.0224.v1). 1008
HG24 [161] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1009
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1010

10.13140/RG.2.2.35061.65767). 1011
HG25 [162] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1012
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1013
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1014

10.13140/RG.2.2.18494.15680). 1015
HG26 [163] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1016
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1017
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1018

10.13140/RG.2.2.32530.73922). 1019
HG27 [164] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1020
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1021

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

10.13140/RG.2.2.32530.73922). 1027

prints202301.0105.v1). 1030
HG28 [167] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1031
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1032
HG29 [168] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1034
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1035
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1036

10.13140/RG.2.2.23172.19849). 1037

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

10.13140/RG.2.2.17385.36968). 1047
Preprints 2023, 2023010044 1050
10.20944/preprints202301.0043.v1). 1053
HG31 [174] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1054
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1055
2023, (doi: 10.13140/RG.2.2.28945.92007). 1056
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1061
10.13140/RG.2.2.35774.77123). 1062
HG35 [178] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1066
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1067

10.13140/RG.2.2.29430.88642). 1068
(doi: 10.20944/preprints202212.0549.v1). 1074
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1076
10.13140/RG.2.2.19380.94084). 1077

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1085
(doi: 10.20944/preprints202212.0500.v1). 1088
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1090
10.13140/RG.2.2.20993.12640). 1091
HG952 [186] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1092

HG95 [187] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1095
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1096
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1097
HG37 [190] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1104
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1105

10.13140/RG.2.2.29173.86244). 1106
HG38 [191] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1107
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1108
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1109
HG168b [192] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1110
2023 (doi: 10.5281/zenodo.7874677). 1111
HG167b [193] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1112
(doi: 10.5281/zenodo.7857906). 1113
HG166b [194] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1114
2023 (doi: 10.5281/zenodo.7856329). 1115

HG165b [195] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1116
10.5281/zenodo.7854561). 1117
HG164b [196] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1118
2023 (doi: 10.5281/zenodo.7851893). 1119
HG163b [197] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1120

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1121
HG162b [198] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1122
(doi: 10.5281/zenodo.7835063). 1123
HG161b [199] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1124
(doi: 10.5281/zenodo.7826705). 1125
HG160b [200] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1126
2023 (doi: 10.5281/zenodo.7820680). 1127
HG159b [201] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1128
10.5281/zenodo.7812750). 1129
HG158b [202] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1130

HG157b [203] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1132
HG156b [204] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1134
2023 (doi: 10.5281/zenodo.7807782). 1135
HG155b [205] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1136
2023 (doi: 10.5281/zenodo.7804449). 1137
HG154b [206] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1138
HG153b [207] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1140
(doi: 10.5281/zenodo.7792307). 1141
HG152b [208] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1142
(doi: 10.5281/zenodo.7790728). 1143
HG151b [209] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1144
2023 (doi: 10.5281/zenodo.7787712). 1145
HG150b [210] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1146
10.5281/zenodo.7783791). 1147
HG149b [211] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1148
10.5281/zenodo.7780123). 1149
HG148b [212] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1150
(doi: 10.5281/zenodo.7773119). 1151

HG147b [213] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1152
odo.7637762). 1153
HG146b [214] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.7766174). 1155
HG145b [215] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1156
10.5281/zenodo.7762232). 1157
HG144b [216] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1158
(doi: 10.5281/zenodo.7758601). 1159
HG143b [217] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1160
10.5281/zenodo.7754661). 1161
HG142b [218] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1162
10.5281/zenodo.7750995) . 1163
HG141b [219] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1164
(doi: 10.5281/zenodo.7749875). 1165
HG140b [220] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1166
10.5281/zenodo.7747236). 1167
HG139b [221] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1168
10.5281/zenodo.7742587). 1169
HG138b [222] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1170
(doi: 10.5281/zenodo.7738635). 1171
HG137b [223] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1172
10.5281/zenodo.7734719). 1173
HG136b [224] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1174
10.5281/zenodo.7730484). 1175
HG135b [225] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1176
(doi: 10.5281/zenodo.7730469). 1177
HG134b [226] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1178
10.5281/zenodo.7722865). 1179
HG133b [227] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1180
odo.7713563). 1181
odo.7709116). 1183
HG131b [229] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1184
10.5281/zenodo.7706415). 1185
HG130b [230] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1186
10.5281/zenodo.7706063). 1187

HG129b [231] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1188
10.5281/zenodo.7701906). 1189
HG128b [232] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1190
odo.7700205). 1191
HG127b [233] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1192
10.5281/zenodo.7694876). 1193
HG126b [234] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1194
10.5281/zenodo.7679410). 1195
HG125b [235] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1196
10.5281/zenodo.7675982). 1197
HG124b [236] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1198
10.5281/zenodo.7672388). 1199
HG123b [237] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1200
odo.7668648). 1201
HG122b [238] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1202
10.5281/zenodo.7662810). 1203
HG121b [239] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1204
10.5281/zenodo.7659162). 1205
HG120b [240] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1206
odo.7653233). 1207
HG119b [241] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1208
odo.7653204). 1209
HG118b [242] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1210
odo.7653142). 1211
HG117b [243] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1212
odo.7653117). 1213
HG116b [244] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1214
HG115b [245] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1215
odo.7651687). 1216
HG114b [246] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1217
odo.7651619). 1218
HG113b [247] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1219
odo.7651439). 1220
HG112b [248] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7650729). 1222

HG111b [249] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1223
odo.7647868). 1224
HG110b [250] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1225
odo.7647017). 1226
HG109b [251] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1227
odo.7644894). 1228
HG108b [252] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1229
HG107b [253] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1230
odo.7632923). 1231
HG106b [254] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1232
odo.7623459). 1233
HG105b [255] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1234
10.5281/zenodo.7606416). 1235
HG104b [256] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1236
10.5281/zenodo.7606416). 1237
HG103b [257] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1238
odo.7606404). 1239
HG102b [258] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1240
10.5281/zenodo.7580018). 1241
HG101b [259] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1242
odo.7580018). 1243
odo.7580018). 1245
odo.7579929). 1247
HG98b [262] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1248
10.5281/zenodo.7563170). 1249
HG97b [263] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1250
odo.7563164). 1251
HG96b [264] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1252
odo.7563160). 1253
odo.7563160). 1255
HG94b [266] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1256
10.5281/zenodo.7563160). 1257

HG93b [267] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1258
10.5281/zenodo.7557063). 1259
HG92b [268] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1260
10.5281/zenodo.7557009). 1261
HG91b [269] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1262
10.5281/zenodo.7539484). 1263
HG90b [270] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1264
10.5281/zenodo.7523390). 1265
HG89b [271] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1266
10.5281/zenodo.7523390). 1267
HG88b [272] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1268
10.5281/zenodo.7523390). 1269
HG87b [273] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1270
odo.7574952). 1271
HG86b [274] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1272
10.5281/zenodo.7574992). 1273
odo.7523357). 1275
HG84b [276] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1276
10.5281/zenodo.7523357). 1277
HG83b [277] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1278
10.5281/zenodo.7504782). 1279
HG82b [278] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1280
10.5281/zenodo.7504782). 1281
HG81b [279] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1282
10.5281/zenodo.7504782). 1283
HG80b [280] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1284
10.5281/zenodo.7499395). 1285
HG79b [281] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1286
odo.7499395). 1287
HG78b [282] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1288
10.5281/zenodo.7499395). 1289
HG77b [283] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1290
10.5281/zenodo.7497450). 1291
HG76b [284] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1292
10.5281/zenodo.7497450). 1293

HG75b [285] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1294
10.5281/zenodo.7494862). 1295
HG74b [286] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1296
odo.7494862). 1297
HG73b [287] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1298
10.5281/zenodo.7494862). 1299
HG72b [288] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1300
10.5281/zenodo.7493845). 1301
HG71b [289] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1302
odo.7493845). 1303
HG70b [290] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1304
10.5281/zenodo.7493845). 1305
HG69b [291] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1306
odo.7539484). 1307
HG68b [292] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1308
odo.7523390). 1309
HG67b [293] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1310
odo.7523357). 1311
HG66b [294] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1312
odo.7504782). 1313
HG65b [295] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1314
odo.7499395). 1315
HG64b [296] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1316
odo.7497450). 1317
HG63b [297] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1318
odo.7494862). 1319
HG62b [298] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1320
odo.7493845). 1321
HG61b [299] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1322
odo.7480110). 1323
HG60b [300] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1324
odo.7378758). 1325
HG32b [301] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1326
odo.6320305). 1327
HG44b [302] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1328
odo.6677173). 1329

CHAPTER 3 1330
Acknowledgements 1331
The author is going to express his gratitude and his appreciation about the brains and their 1332
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1333
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1334 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
1335
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 1336
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1337
ideas to be on the star lines of words and shining like stars, forever. 1338
41
CHAPTER 4 1339
Cancer In Extreme SuperHyperGraph 1340
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1341
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1342
as the consequences of the model, some parameters are used. The cells are under attack of this 1343
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1344
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1345
In the following, some Extreme steps are Extreme devised on this disease. 1346
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1347
function. 1348
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1349
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1350
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1351
since there are some determinacy, indeterminacy and neutrality about the moves and the 1352
effects of the cancer on that region; this event leads us to choose another model [it’s said 1353
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1354
what’s done. 1355
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1356
they’ve got the names, and some general Extreme models. The moves and the Extreme 1357
traces of the cancer on the complex tracks and between complicated groups of cells could be 1358
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1359
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1360
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1361
in those Extreme Extreme SuperHyperModels. 1362
Some cells have been faced with some attacks from the situation which is caused by the 1363
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1364
which in that, the cells could be labelled as some groups and some groups or individuals have 1365
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1366
the embedded situations, the individuals of cells and the groups of cells could be considered 1367
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1368
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1369
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1370
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1371
43
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1372
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1373
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1374
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1375
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1376
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1377
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1378

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1379
is going to figure out what’s going on this phenomenon. The special case of this disease is 1380
considered and as the consequences of the model, some parameters are used. The cells are 1381
under attack of this disease but the moves of the cancer in the special region are the matter of 1382
mind. The recognition of the cancer could help to find some treatments for this disease. The 1383
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1384
Recognition” and both bases are the background of this research. Sometimes the cancer has 1385
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1386
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1387
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1388
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1389
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1390
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1391
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1392
and neutrality about the moves and the effects of the cancer on that region; this event leads 1395
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1396
perception on what’s happened and what’s done. There are some specific models, which 1397
are well-known and they’ve got the names, and some general models. The moves and the 1398
traces of the cancer on the complex tracks and between complicated groups of cells could 1399
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1400
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1401
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1402

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1403
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1404
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1405
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1406
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1407
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1408
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1409
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1410
based on the fixed groups of cells or the fixed groups of group of cells? 1411
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1412
messy and dense SuperHyperModels where embedded notions are illustrated? 1413
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1414
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1415
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1416

research has taken more motivations to define SuperHyperClasses and to find some connections 1417
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1418
instances and examples to make clarifications about the framework of this research. The general 1419
results and some results about some connections are some avenues to make key point of this 1420
research, “Cancer’s Recognition”, more understandable and more clear. 1421
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1422
on the modeling of the regions where are under the attacks of the cancer to recognize 1423
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1424
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1425
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1426
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1427
instances and literature reviews have taken the whole way through. In this scientific research, 1428
the literature reviews have fulfilled the lines containing the notions and the results. The 1429
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1430
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1431
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1432
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1433
of the moves of the cancer in the longest and strongest styles with the formation of the design 1434
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1435
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1436
out the background for the SuperHyperNotions. 1437

CHAPTER 5 1438
Extreme 1439
Eulerian-Type-Cycle-Decomposition 1440
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1441
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1442
2023, (doi: 10.13140/RG.2.2.34953.52320). 1443
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1444
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1445
(doi: 10.13140/RG.2.2.33275.80161). 1446
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1447
10.13140/RG.2.2.11050.90569). 1449
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1450
10.13140/RG.2.2.17761.79206). 1452
10.13140/RG.2.2.19911.37285). 1455
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1456
10.13140/RG.2.2.23266.81602). 1458
10.13140/RG.2.2.19360.87048). 1461
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1462
10.13140/RG.2.2.32363.21286). 1464
10.13140/RG.2.2.11758.69441). 1467
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1468
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1469
10.13140/RG.2.2.31891.35367). 1470
47

10.13140/RG.2.2.21510.45125). 1473
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1474
10.13140/RG.2.2.13121.84321). 1476

CHAPTER 6 1477
New Ideas On Super Decompensation By 1478
Hyper Decompress Of 1479
Eulerian-Type-Cycle-Decomposition In 1480
Cancer’s Recognition With 1481
(Neutrosophic) SuperHyperGraph 1482
49
CHAPTER 7 1483
ABSTRACT 1484
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1485

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

Cycle-Decomposition criteria holds 1490
∀Ea ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called 1491

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 1492
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1493

SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called Neutrosophic 1494
v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 1495
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called 1496

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 1497
∀Va ∈ C : C is
51
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1498

SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian- 1499
Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic 1500
v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle- 1501
Decomposition. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Decomposition). Assume a Neutrosophic 1502
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 1503
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian- 1504

Type-Cycle-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, 1505
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type- 1506
Cycle-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) 1507
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 1508
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 1509
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 1510

tices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; a Neutrosophic 1511
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1515
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1516

SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1517
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1518
SuperHyperEulerian-Type-Cycle-Decomposition; an Extreme SuperHyperEulerian-Type-Cycle-Decomposition 1519
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, 1520

for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1523
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1524
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1525
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1526
that they form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; and the Extreme power is 1527
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition 1528

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 1532
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 1533
SuperHyperEulerian-Type-Cycle-Decomposition; and the Neutrosophic power is corresponded to its 1537
Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either 1538
of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian- 1539

Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neutrosophic 1540
rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1541
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 1542
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 1543

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1544
form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; a Neutrosophic V-SuperHyperEulerian- 1545
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 1549
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1550

Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic Su- 1551
perHyperVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition; 1552
an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of 1553
Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian- 1554

N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1557
defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 1558
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 1559
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 1560
treme SuperHyperEulerian-Type-Cycle-Decomposition; and the Extreme power is corresponded to its 1561
Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 1562

mial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re- 1563
SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, 1564
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic 1565
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1566
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1567
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1568

and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific 1571
research, new setting is introduced for new SuperHyperNotions, namely, a SuperHyperEulerian- 1572
Type-Cycle-Decomposition and Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. Two different 1573
types of SuperHyperDefinitions are debut for them but the research goes further and the 1574
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under research 1581
to figure out the challenges make sense about ongoing and upcoming research. The special case 1582
is up. The cells are viewed in the deemed ways. There are different types of them. Some of 1583
them are individuals and some of them are well-modeled by the group of cells. These types 1584
are all officially called “SuperHyperVertex” but the relations amid them all officially called 1585
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 1586
are chosen and elected to research about “Cancer’s Recognition”. Thus these complex and 1587
dense SuperHyperModels open up some avenues to research on theoretical segments and 1588
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 1589

collected in the form of some questions and some problems. Assume a SuperHyperGraph. 1590
Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Decomposition is a maximal 1591
of SuperHyperVertices with a maximum cardinality such that either of the following expres- 1592
sions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 1593
are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 1594
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 1595
is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Decomposition is a 1596

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

a SuperHyperEulerian-Type-Cycle-Decomposition . Since there’s more ways to get type-results to 1603
make a SuperHyperEulerian-Type-Cycle-Decomposition more understandable. For the sake of having 1604
Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to “redefine” the notion of 1605
a “SuperHyperEulerian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 1606
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1607
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Decomposition 1608

. It’s redefined a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if the mentioned Table 1609
holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy- 1610
perEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of 1611
The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1612
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1613
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 1614
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 1615
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1616
on a SuperHyperEulerian-Type-Cycle-Decomposition . It’s the main. It’ll be disciplinary to have the 1617
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 1618
all SuperHyperEulerian-Type-Cycle-Decomposition until the SuperHyperEulerian-Type-Cycle-Decomposition, 1619
then it’s officially called a “SuperHyperEulerian-Type-Cycle-Decomposition” but otherwise, it isn’t a 1620

SuperHyperEulerian-Type-Cycle-Decomposition . There are some instances about the clarifications for 1621
the main definition titled a “SuperHyperEulerian-Type-Cycle-Decomposition ”. These two examples 1622
get more scrutiny and discernment since there are characterized in the disciplinary ways of 1623
the SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Decomposition . For the sake of 1624
having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to “redefine” 1625

the notion of a “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition” and a “Neutrosophic 1626
SuperHyperEulerian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 1627
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 1628
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 1629
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 1630
SuperHyperEulerian-Type-Cycle-Decomposition are redefined to a “Neutrosophic SuperHyperEulerian- 1631

Type-Cycle-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 1632
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 1633
Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition more understandable. Assume a Neutro- 1634
sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 1635

Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Cycle-Decomposition, SuperHyperStar, 1636

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 1637
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition”, “Neutrosophic Su- 1638
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 1639
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 1640
has a “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition” where it’s the strongest [the 1641
maximum Neutrosophic value from all the SuperHyperEulerian-Type-Cycle-Decomposition amid the 1642
maximum value amid all SuperHyperVertices from a SuperHyperEulerian-Type-Cycle-Decomposition 1643
.] SuperHyperEulerian-Type-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a Supe- 1644
rHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a 1645
Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Supe- 1646
rHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1647
with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Decomposition if it’s only one SuperVertex as 1648
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1649
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1650
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1651
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1652
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 1664
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 1665
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 1666
long cycle of the move from the cancer is identified by this research. Sometimes the move of 1667
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 1668
neutrality about the moves and the effects of the cancer on that region; this event leads us 1669
moves and the traces of the cancer on the complex tracks and between complicated groups 1673
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 1674
Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper- 1675
Wheel). The aim is to find either the longest SuperHyperEulerian-Type-Cycle-Decomposition or the 1676
strongest SuperHyperEulerian-Type-Cycle-Decomposition in those Neutrosophic SuperHyperModels. 1677

For the longest SuperHyperEulerian-Type-Cycle-Decomposition, called SuperHyperEulerian-Type-Cycle- 1678
Decomposition, and the strongest SuperHyperEulerian-Type-Cycle-Decomposition, called Neutrosophic 1679
SuperHyperEulerian-Type-Cycle-Decomposition, some general results are introduced. Beyond that in 1680
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 1681

enough since it’s essential to have at least three SuperHyperEdges to form any style of a 1682
SuperHyperEulerian-Type-Cycle-Decomposition. There isn’t any formation of any SuperHyperEulerian- 1683
Type-Cycle-Decomposition but literarily, it’s the deformation of any SuperHyperEulerian-Type-Cycle- 1684
Decomposition. It, literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic 1685
SuperHyperEulerian-Type-Cycle-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHy- 1686
perGraphs theory are proposed. 1687
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Decomposition, Can- 1688
cer’s Neutrosophic Recognition 1689

CHAPTER 8 1691
Applied Notions Under The Scrutiny Of 1692
The Motivation Of This Scientific 1693
Research 1694
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1695
try to bring the motivations in the narrative ways. Some cells have been faced with some 1696
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1697
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1698
as some groups and some groups or individuals have excessive labels which all are raised from 1699
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1700
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1701
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1702
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “an Extreme 1703
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1704
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1705
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1706
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1707
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1708
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1709
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1710
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1711
It’s SuperHyperGraph but it’s officially called “an Extreme SuperHyperGraphs”. The cancer is 1712
the disease but the model is going to figure out what’s going on this phenomenon. The special 1713
case of this disease is considered and as the consequences of the model, some parameters are used. 1714
The cells are under attack of this disease but the moves of the cancer in the special region are the 1715
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 1716
The SuperHyperGraph and an Extreme SuperHyperGraph are the SuperHyperModels on the 1717
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1718
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1719
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 1721
the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Decomposition” in the themes 1722
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 1723
57
styles to figure out the background for the SuperHyperNotions. The recognition of the cancer 1724
in the long-term function. The specific region has been assigned by the model [it’s called 1725
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 1726
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 1727
indeterminacy and neutrality about the moves and the effects of the cancer on that region; this 1728
event leads us to choose another model [it’s said to be an Extreme SuperHyperGraph] to have 1729
convenient perception on what’s happened and what’s done. There are some specific models, 1730
which are well-known and they’ve got the names, and some general models. The moves and 1731
the traces of the cancer on the complex tracks and between complicated groups of cells could 1732
be fantasized by a an Extreme SuperHyperPath (-/SuperHyperEulerian-Type-Cycle-Decomposition, 1733
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 1734
aim is to find either the optimal SuperHyperEulerian-Type-Cycle-Decomposition or the an Extreme 1735
SuperHyperEulerian-Type-Cycle-Decomposition in those an Extreme SuperHyperModels. Some general 1736

results are introduced. Beyond that in SuperHyperStar, all possible an Extreme SuperHyperPath 1737
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1738
SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Decomposition. There isn’t 1739
any formation of any SuperHyperEulerian-Type-Cycle-Decomposition but literarily, it’s the deformation 1740
of any SuperHyperEulerian-Type-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. 1741
amount of SuperHyperEulerian-Type-Cycle-Decomposition” of either individual of cells or the groups of cells 1743

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 1744
Type-Cycle-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 1745
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1746
messy and dense SuperHyperModels where embedded notions are illustrated? 1747
Thus it motivates us to define different types of “ SuperHyperEulerian-Type-Cycle-Decomposition” and 1749
“an Extreme SuperHyperEulerian-Type-Cycle-Decomposition” on “SuperHyperGraph” and “an Extreme 1750

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 1751
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 1752
motivates us to get some instances and examples to make clarifications about the framework of 1753
this research. The general results and some results about some connections are some avenues to 1754
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 1755
The framework of this research is as follows. In the beginning, I introduce basic definitions 1756
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1757
SuperHyperGraphs and an Extreme SuperHyperGraph are deeply-introduced and in-depth- 1758
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1759
review literature are applied to make sense about what’s going to figure out about the 1760
upcoming sections. The main definitions and their clarifications alongside some results about 1761
new notions, SuperHyperEulerian-Type-Cycle-Decomposition and an Extreme SuperHyperEulerian-Type- 1762

Cycle-Decomposition, are figured out in sections “ SuperHyperEulerian-Type-Cycle-Decomposition” and “an 1763
Extreme SuperHyperEulerian-Type-Cycle-Decomposition”. In the sense of tackling on getting results 1764
and in Eulerian-Type-Cycle-Decomposition to make sense about continuing the research, the ideas 1765
of SuperHyperUniform and an Extreme SuperHyperUniform are introduced and as their 1766
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1767
section, titled “Results on SuperHyperClasses” and “Results on an Extreme SuperHyperClasses”. 1768

As going back to origin of the notions, there are some smart steps toward the common 1769
notions to extend the new notions in new frameworks, SuperHyperGraph and an Extreme 1770
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on an Extreme 1771
SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1772
concluding and closing section of theoretical research are contained in the section “General 1773
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1774
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1775
SuperHyperEulerian-Type-Cycle-Decomposition”, “an Extreme SuperHyperEulerian-Type-Cycle-Decomposition”, 1776
“Results on SuperHyperClasses” and “Results on an Extreme SuperHyperClasses”. There 1777
are curious questions about what’s done about the SuperHyperNotions to make sense about 1778
excellency of this research and going to figure out the word “best” as the description and adjective 1779
for this research as presented in section, “ SuperHyperEulerian-Type-Cycle-Decomposition”. The keyword 1780
of this research debut in the section “Applications in Cancer’s Recognition” with two cases and 1781
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 1782
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 1783
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 1784
happened in this research in the terms of “questions” and “problems” to make sense to figure 1785
out this research in featured style. The advantages and the limitations of this research alongside 1786
about what’s done in this research to make sense and to get sense about what’s figured out are 1787
included in the section, “Conclusion and Closing Remarks”. 1788

CHAPTER 9 1789
an Extreme Preliminaries Of This 1790
Scientific Research On the Redeemed 1791
Ways 1792
In this section, the basic material in this scientific research, is referred to [Single Valued 1793
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1794

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1795
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1796
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1797
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1798
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1799
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1800
their clarifications are addressed to Ref.[HG38]. 1801
In this subsection, the basic material which is used in this scientific research, is presented. Also, 1802
the new ideas and their clarifications are elicited. 1803
Definition 9.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Eulerian-Type-Cycle-Decomposition of points (objects) with generic elements in X denoted
by x; then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 1804
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). 1805
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1806
where 1807
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1808
(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); 1809
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1810
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1811
1, 2, . . . , n0 ); 1812
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1813
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1814

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1821
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1822
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1823
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1824
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1825
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1826

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

(Ref.[HG38],Definition 2.7,p.3). 1828
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1829
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1830
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1831
(i) If |Vi | = 1, then Vi is called vertex; 1832
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1833
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1834
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1835
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1836
SuperEdge; 1837
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1838
SuperHyperEdge. 1839
If we choose different types of binary operations, then we could get hugely diverse types of 1840
general forms of Neutrosophic SuperHyperGraph (NSHG). 1841
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1842

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1843
x, y, z, w ∈ [0, 1]: 1844
(i) 1 ⊗ x = x; 1845
(ii) x ⊗ y = y ⊗ x; 1846
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1847
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1848

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

where 1851

1, 2, . . . , n0 ); 1856
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1857
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1858
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1859
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1860
0


SuperEdge; 1880
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1883
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1884
makes the patterns and regularities. 1885
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1886
of elements of SuperHyperEdges are the same. 1887

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1888
makes to have SuperHyperUniform more understandable. 1889
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1890
Classes as follows. 1891
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1892
two given SuperHyperEdges with two exceptions; 1893
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1894
SuperHyperEdges; 1895
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1896
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1897
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1898
in common; 1899
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1900
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1901
SuperHyperEdge in common; 1902
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1903
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1904
SuperVertex. 1905
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 1906
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1907
(i) Vi , Vi+1 ∈ Ei0 ; 1908
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1909
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1910
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1911
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1912
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1913
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1914
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1915
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1917
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1918
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1919
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1920
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1921
perPath . 1922
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 1923
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1924
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1925
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1926
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1927
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1928

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1941
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 1942
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1943
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Cycle- 1944

Decomposition). 1945
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1947
or E 0 is called 1948
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression 1949

is called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 1950
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition if the following expres- 1951

sion is called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition criteria 1952
holds 1953
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1954
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression 1955

is called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 1956
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition if the following expres- 1957

sion is called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria 1958
holds 1959
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1960

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neutrosophic 1961

e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian-Type-Cycle- 1962
Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neutrosophic 1963
rv-SuperHyperEulerian-Type-Cycle-Decomposition. 1964
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Decomposition). 1965

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

Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neutrosophic rv- 1970
SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1971
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1972

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1973
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1974
that they form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; 1975
(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neut- 1976

rosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian- 1977
Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neut- 1978
rosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic 1979
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 1980
rosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1981

cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHy- 1982
perVertices such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition; 1983
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial 1984

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic 1985
re-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle- 1986
Decomposition, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) 1987
contains the Extreme coefficients defined as the Extreme number of the maximum 1989
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 1990

high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 1991
SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type-Cycle- 1992
Decomposition; and the Extreme power is corresponded to its Extreme coefficient; 1993
(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 1994

mial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic 1995
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyper- 1998

Polynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 1999
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2000
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neut- 2001
rosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 2002
the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition; and the Neutrosophic power is 2003
corresponded to its Neutrosophic coefficient; 2004

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neutrosophic 2005

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

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neut- 2013


rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 2018
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial 2021

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 2027

(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 2031

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 2037

corresponded to its Neutrosophic coefficient. 2041
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Decomposition). 2042

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

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 : 2046
|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 2047
(29.1), holds if S is an δ−SuperHyperDefensive; 2048
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Decomposition is a Neutrosophic kind 2049

of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition such that either of the following 2050
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2051
of s ∈ S : 2052
|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 2053
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2054
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need 2055

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2064
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Decomposition, SuperHyperStar, 2065
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2066
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2067
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2068
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2069
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type- 2070
. Since there’s more ways to get type-results to make a Neutrosophic

Cycle-Decomposition 2071

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

136TBL4

136TBL1
SuperHyperEulerian-Type-Cycle-Decomposition more Neutrosophicly understandable. 2072

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to 2073
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition”. 2074
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 2075
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 2076
values. 2077
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Cycle-Decomposition. It’s redefined a Neutro- 2078
sophic SuperHyperEulerian-Type-Cycle-Decomposition if the Table (29.3) holds. 2079

CHAPTER 10 2080
an Extreme SuperHyper But As Eulerian-Type-Cycle-Decomposition 2081
The Extensions Excerpt From Dense And 2082
Super Forms 2083
Definition 10.0.1. (an Extreme event). 2084

Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2085
is a probability Eulerian-Type-Cycle-Decomposition. Any an Extreme k-subset of A of V is called an 2086
Extreme k-event and if k = 2, then an Extreme subset of A of V is called an Extreme 2087
event. The following expression is called an Extreme probability of A. 2088
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (an Extreme Independent). 2089

is a probability Eulerian-Type-Cycle-Decomposition. s an Extreme k-events Ai , i ∈ I is called an 2091
Extreme s-independent if the following expression is called an Extreme s-independent 2092
criteria 2093
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then an Extreme k-events of A and B is called an Extreme independent. The 2094
following expression is called an Extreme independent criteria 2095
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (an Extreme Variable). 2096

is a probability Eulerian-Type-Cycle-Decomposition. Any k-function Eulerian-Type-Cycle-Decomposition like E 2098
is called an Extreme k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Decomposition 2099
like E is called an Extreme Variable. 2100
The notion of independent on an Extreme Variable is likewise. 2101
73
Definition 10.0.4. (an Extreme Expectation). 2102

is a probability Eulerian-Type-Cycle-Decomposition. A an Extreme k-Variable E has a number is called 2104
an Extreme Expectation if the following expression is called an Extreme Expectation 2105
criteria 2106
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (an Extreme Crossing). 2107

is a probability Eulerian-Type-Cycle-Decomposition. A an Extreme number is called an Extreme 2109

Crossing if the following expression is called an Extreme Crossing criteria 2110
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2111
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let m and n propose special 2112
Eulerian-Type-Cycle-Decomposition. Then with m ≥ 4n, 2113
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G an Extreme independently
with probability Eulerian-Type-Cycle-Decomposition p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the an Extreme number of
SuperHyperVertices, Y the an Extreme number of SuperHyperEdges, and Z the an 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 an 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: 2114
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2115
Theorem 10.0.7. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2116
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let P be a SuperHyperSet of n 2117
points in the plane, and let l be the an Extreme number√of SuperHyperLines in the plane passing 2118
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2119
Proof. Form a an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2120

SuperHyperEdge are the segments between conseNeighborive points on the SuperHyperLines 2121
which pass through at least k + 1 points of P. This an Extreme SuperHyperGraph has at least 2122

kl SuperHyperEdges and an Extreme crossing at most l choose two. Thus either kl < 4n, in 2123
3
which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the an Extreme 2124
Crossing Lemma, and again l < 32n2 /k 3 . 2125
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 2128
Then k < 5n4/3 . 2129
Proof. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2130
(V, E) is a probability Eulerian-Type-Cycle-Decomposition. Draw a SuperHyperUnit SuperHyperCircle 2131
around each SuperHyperPoint of P. Let ni be the P an Extreme number of these
PSuperHyperCircles 2132
passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now 2133
form a an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2134
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 2135

SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2136
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 2137

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 2138
so as to obtain a simple an Extreme SuperHyperGraph G with e(G) ≥ k − n. Now 2139

cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 2140
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 2141
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the an Extreme Crossing Lemma, and 2142
4/3 4/3
k < 4n + n < 5n . 2143
Proposition 10.0.9. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2144
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let X be a nonnegative an 2145
Extreme Variable and t a positive real number. Then 2146
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. 2147
Corollary 10.0.10. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2148
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let Xn be a nonnegative integer- 2149
valued variable in a probability Eulerian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2150
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2151

Proof. 2152
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. A special SuperHyperGraph in 2154
Gn,p almost surely has stability number at most d2p−1 log ne. 2155
Proof. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2156
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. A special SuperHyperGraph in Gn,p 2157
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2158

where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2159
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2160
SuperHyperEdge of the an Extreme SuperHyperGraph G. 2161
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2162
an Extreme Variable for this an Extreme Event. By equation, we have 2163
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 2164
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2165

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: 2166
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2167
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 2168
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2169
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a an 2170
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2171
Definition 10.0.12. (an Extreme Variance). 2172

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

S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let X be a an Extreme Variable and 2180
let t be a positive real number. Then 2181
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2182
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let Xn be a an Extreme 2184
Variable in a probability Eulerian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 2185
V (Xn ) << E 2 (Xn ), then 2186
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 2188
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2189
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2190
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 2192
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 2193
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2194
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. As in the proof of related Theorem, the 2196
result is straightforward. 2197
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 2199
be as defined in previous Theorem. Then either: 2200
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2201
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2202
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. The latter is straightforward. 2204
Definition 10.0.17. (an Extreme Threshold). 2205

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

Definition 10.0.18. (an Extreme Balanced). 2212

is a probability Eulerian-Type-Cycle-Decomposition. Let F be a fixed an Extreme SuperHyperGraph. 2214
Then there is a threshold function for the property of containing a copy of F as a an Extreme 2215
SubSuperHyperGraph is called an Extreme Balanced. 2216
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let F be a nonempty balanced an 2218
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2219
is a threshold function for the property of containing F as a an Extreme SubSuperHyperGraph. 2220
136EXM1 Example 10.0.20. Assume a an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2223
the mentioned an Extreme Figures in every an Extreme items. 2224
• On the Figure (30.1), the an Extreme SuperHyperNotion, namely, an Extreme 2225

SuperHyperEulerian-Type-Cycle-Decomposition, is up. The an Extreme Algorithm is an Extremely 2226
straightforward. E1 and E3 are some empty an Extreme SuperHyperEdges but E2 is a 2227

loop an Extreme SuperHyperEdge and E4 is a an Extreme SuperHyperEdge. Thus in the 2228
terms of an Extreme SuperHyperNeighbor, there’s only one an Extreme SuperHyperEdge, 2229
namely, E4 . The an Extreme SuperHyperVertex, V3 is an Extreme isolated means that 2230
there’s no an Extreme SuperHyperEdge has it as a an Extreme endpoint. Thus the an 2231
Extreme SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperEulerian- 2232
Type-Cycle-Decomposition. 2233
C(N SHG)an Extreme Eulerian-Type-Cycle-Decomposition

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

straightforward. E1 , E2 and E3 are some empty an Extreme SuperHyperEdges 2237
but E4 is a an Extreme SuperHyperEdge. Thus in the terms of an Extreme 2238
SuperHyperNeighbor, there’s only one an Extreme SuperHyperEdge, namely, E4 . The an 2239

Extreme SuperHyperVertex, V3 is an Extreme isolated means that there’s no an Extreme 2240
SuperHyperEdge has it as a an Extreme endpoint. Thus the an Extreme SuperHyperVertex, 2241
V3 , is excluded in every given an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. 2242

Figure 10.1: The an Extreme SuperHyperGraphs Associated to the an Extreme Notions of an

Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.3) 136NSHG1
= {{E4 }}.
= z.
= {{V1 , V2 , V4 }}.
= z3.
2243

straightforward. 2246

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







= {{E4 , E1 , E5 , E4 }}.
= z4.
= {{V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }}.
= z8.
2251


= {{E1 }, {E2 }, {E3 }, {E4 }}.
= 4z.


= {{Vi=15 }, {Vi=68 , V5 }, {Vi=912 , V5 }, {Vi=1315 , V5 }}.

= 2z 5 + 2z 4 .
2255


= {{Ei=110 ,Ei=2332 ,E
12 ,E22 },...}.

= az 22 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2259




= {{Ei=110 ,E17 ,E14 ,E13 ,E15 },...}.
= z 14 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2263


= {{E3 }, {E2 }, {E1 }, {E4 }}.



= 4z.
= {{Vi=13 , V12 }, {Vi=47 , V13 }, {Vi=912 , V5 }, {Vi=811 , V14 }}.
= 2z 5 + z 4 + z 3 .
2267


= {{Ei=110 ,E23 ,E12 ,E22 },...}.
= az 13 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .


2271


= {{E1 , E6 , E2 , E7 , E3 , E4 , E5 , E1 }}.
= z |EN SHG | .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2275






= {E1 , E6 , E5 , E4 , E7 , E1 , . . .}.
= 2z 3 + 4z 2 + . . . .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2279


= {{E1 }, Ei=26 }.
= z 5 + 5z 2 .



= {{V1 , V2 , V3 , V7 , V8 }, . . .}.
= z5 + . . . .
2283


= {E1 , E6 , E5 , E4 , E2 , E3 , E7 , E10 , E9 , E1 , . . .}.
= 2z 3 + 7z 2 + . . . .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2287




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


= {{Ei=15 }}.


= 5z 2 .
= {{V{Ei=15 } }}.
= 5z 2 .
2295


= {{Ei=15 }}.


5
X
= z |{Ei=15 }| .
i=1
= {{V{Ei=15 } }}.
5
|{V{E }|
X
}
= z i=15 .
i=1
2299


= {{Ei=16 }}.
6
X
= z |{Ei=16 }| .
i=1
= {{V{Ei=16 } }}.


6
|{V{E }|
X
}
= z i=16 .
i=1
2303


= {{Ei=16 }}.
6
X
= z |{Ei=16 }| .
i=1
= {{V{Ei=16 } }}.
6
|{V{E }|
X
}
= z i=16 .
i=1
2307






= {{Ei=112 }}.
= 12z.
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
2311


= {{Ei=110 }}.


10
X
= z |{Ei=110 }| .
i=1
= {{V{Ei=110 } }}.
10
|{V{E }|
X
}
= z i=110 .
i=1
2315


= {{E2 }, {E1 }}.
= 2z.
= {{VE2 }, {V1 , V3 }}.


Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.3) 95NHG1

= z 10 + z 2 .
2319


= {{Ei=25 }, . . .}.
5
X
= z |{Ei=25 }| + . . . .
i=2


Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.3) 95NHG2
= {{V{Ei=25 } }, . . .}.
5
|{V{E }|
X
}
= z i=25 + ....
i=2
2323
Proposition 10.0.21. Assume a connected an Extreme SuperHyperGraph ESHG : (V, E). The 2324
all interior an Extreme SuperHyperVertices belong to any an Extreme quasi-R-Eulerian-Type-Cycle- 2325
Decomposition if for any of them, and any of other corresponded an Extreme SuperHyperVertex, 2326
some interior an Extreme SuperHyperVertices are mutually an Extreme SuperHyperNeighbors 2327
with no an Extreme exception at all minus all an Extreme SuperHypeNeighbors to any amount 2328
of them. 2329
Proposition 10.0.22. Assume a connected non-obvious an Extreme SuperHyperGraph ESHG : 2330

(V, E). There’s only one an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2331
possibilities of the distinct interior an Extreme SuperHyperVertices inside of any given an 2332
Extreme quasi-R-Eulerian-Type-Cycle-Decomposition minus all an Extreme SuperHypeNeighbor to some 2333
of them but not all of them. In other words, there’s only an unique an Extreme SuperHyperEdge 2334
E ∈ EESHG:(V,E) has only two distinct an Extreme SuperHyperVertices in an an Extreme 2335
quasi-R-Eulerian-Type-Cycle-Decomposition, minus all an Extreme SuperHypeNeighbor to some of them 2336

but not all of them. 2337

Proposition 10.0.23. Assume a connected an Extreme SuperHyperGraph ESHG : (V, E). If a

an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z an Extreme SuperHyperVertices, then the
an Extreme cardinality of the an Extreme R-Eulerian-Type-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the an Extreme cardinality of the an Extreme R-Eulerian-Type-Cycle- 2338
Decomposition is at least the maximum an Extreme number of an Extreme SuperHyperVertices of the 2339
an Extreme SuperHyperEdges with the maximum number of the an Extreme SuperHyperEdges. In 2340
other words, the maximum number of the an Extreme SuperHyperEdges contains the maximum 2341
an Extreme number of an Extreme SuperHyperVertices are renamed to an Extreme Eulerian-Type- 2342
Cycle-Decomposition in some cases but the maximum number of the an Extreme SuperHyperEdge 2343
with the maximum an Extreme number of an Extreme SuperHyperVertices, has the an Extreme 2344
SuperHyperVertices are contained in a an Extreme R-Eulerian-Type-Cycle-Decomposition. 2345
Proposition 10.0.24. Assume a simple an Extreme SuperHyperGraph ESHG : (V, E). Then
the an Extreme number of type-result-R-Eulerian-Type-Cycle-Decomposition has, the least an Extreme
cardinality, the lower sharp an Extreme bound for an Extreme cardinality, is the an 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 a an Extreme type-result-R-Eulerian-Type-Cycle-Decomposition with the least an Extreme 2346
cardinality, the lower sharp an Extreme bound for cardinality. 2347
Proposition 10.0.25. Assume a connected loopless an Extreme SuperHyperGraph ESHG : 2348

(V, E). Then in the worst case, literally, 2349
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−Decomposition

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)anExtremeR−Quasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 5 .
Is a an Extreme type-result-Eulerian-Type-Cycle-Decomposition. In other words, the least cardinality, the 2350

lower sharp bound for the cardinality, of a an Extreme type-result-Eulerian-Type-Cycle-Decomposition is 2351
the cardinality of 2352

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 4 .
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−Decomposition = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)anExtremeR−Quasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless an Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \V \{z} isn’t a quasi-R-Eulerian-Type-Cycle-Decomposition
since neither amount of an Extreme SuperHyperEdges nor amount of SuperHyperVertices where

amount refers to the an Extreme number of SuperHyperVertices(-/SuperHyperEdges) more

than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us
consider the an 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 an Extreme SuperHyperSet of the an Extreme SuperHyperVertices has the eligibilities

to propose property such that there’s no an Extreme SuperHyperVertex of a an Extreme
SuperHyperEdge is common and there’s an an Extreme SuperHyperEdge for all an Extreme
SuperHyperVertices but the maximum an Extreme cardinality indicates that these an Extreme
type-SuperHyperSets couldn’t give us the an Extreme lower bound in the term of an Extreme
sharpness. In other words, the an 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 an Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

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

to the supposition on the connected loopless an Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless an 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-Cycle-Decomposition. In other words, the least cardinality, the lower sharp

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

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

an Extreme SuperHyperEdges for amount of an Extreme SuperHyperVertices taken from the
an Extreme SuperHyperSet
It means that the an Extreme SuperHyperSet of the an Extreme SuperHyperVertices
Is a an Extreme R-Eulerian-Type-Cycle-Decomposition for the an Extreme SuperHyperGraph as used

an Extreme background in the an Extreme terms of worst an Extreme case and the common
theme of the lower an Extreme bound occurred in the specific an Extreme SuperHyperClasses
of the an Extreme SuperHyperGraphs which are an Extreme free-quasi-triangle.
Assume a an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z an Extreme number of the an
Extreme SuperHyperVertices. Then every an Extreme SuperHyperVertex has at least no an
Extreme SuperHyperEdge with others in common. Thus those an Extreme SuperHyperVertices
have the eligibles to be contained in a an Extreme R-Eulerian-Type-Cycle-Decomposition. Those an
Extreme SuperHyperVertices are potentially included in a an Extreme style-R-Eulerian-Type-Cycle-
Decomposition. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the an Extreme SuperHyperVertices of a 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 an Extreme
SuperHyperVertices of the an 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 an Extreme SuperHyperVertices and there’s only and only one
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the an Extreme SuperHyperVertices
Zi and Zj . The other definition for the an Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of an Extreme R-Eulerian-Type-Cycle-Decomposition is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the an Extreme R-Eulerian-Type-Cycle-Decomposition but
with slightly differences in the maximum an Extreme cardinality amid those an Extreme type-
SuperHyperSets of the an Extreme SuperHyperVertices. Thus the an Extreme SuperHyperSet
of the an Extreme SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|an Extreme cardinality ,

z
and
is formalized with mathematical literatures on the an Extreme R-Eulerian-Type-Cycle-Decomposition.
E
Let Zi ∼ Zj , be defined as Zi and Zj are the an Extreme SuperHyperVertices belong to the an
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, 2353
an Extreme R-Eulerian-Type-Cycle-Decomposition =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2354
an Extreme R-Eulerian-Type-Cycle-Decomposition =
Thus E ∈ EESHG:(V,E) is a an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition where E ∈

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

It’s straightforward that the an Extreme cardinality of the an Extreme R-Eulerian-Type-Cycle- 2355
Decomposition is at least the maximum an Extreme number of an Extreme SuperHyperVertices of the 2356
an Extreme SuperHyperEdges with the maximum number of the an Extreme SuperHyperEdges. 2357
In other words, the maximum number of the an Extreme SuperHyperEdges contains the 2358
maximum an Extreme number of an Extreme SuperHyperVertices are renamed to an Extreme 2359
Eulerian-Type-Cycle-Decomposition in some cases but the maximum number of the an Extreme 2360
SuperHyperEdge with the maximum an Extreme number of an Extreme SuperHyperVertices, 2361

has the an Extreme SuperHyperVertices are contained in a an Extreme R-Eulerian-Type-Cycle- 2362
Decomposition. 2363
The obvious SuperHyperGraph has no an Extreme SuperHyperEdges. But the non-obvious an 2364
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2365
the an Extreme optimal SuperHyperObject. It specially delivers some remarks on the an 2366
Extreme SuperHyperSet of the an Extreme SuperHyperVertices such that there’s distinct 2367
amount of an Extreme SuperHyperEdges for distinct amount of an Extreme SuperHyperVertices 2368
up to all taken from that an Extreme SuperHyperSet of the an Extreme SuperHyperVertices 2369
but this an Extreme SuperHyperSet of the an Extreme SuperHyperVertices is either has 2370
the maximum an Extreme SuperHyperCardinality or it doesn’t have maximum an Extreme 2371
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one an Extreme 2372
SuperHyperEdge containing at least all an Extreme SuperHyperVertices. Thus it forms a 2373

an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition where the an Extreme completion of the an 2374
Extreme incidence is up in that. Thus it’s, literarily, a an Extreme embedded R-Eulerian-Type-Cycle- 2375
Decomposition. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2376
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2377
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2378
SuperHyperSets have the maximum an Extreme SuperHyperCardinality and they’re an Extreme 2379
SuperHyperOptimal. The less than two distinct types of an Extreme SuperHyperVertices are 2380
included in the minimum an Extreme style of the embedded an Extreme R-Eulerian-Type-Cycle- 2381
Decomposition. The interior types of the an Extreme SuperHyperVertices are deciders. Since the 2382
an Extreme number of SuperHyperNeighbors are only affected by the interior an Extreme 2383
SuperHyperVertices. The common connections, more precise and more formal, the perfect 2384
unique connections inside the an Extreme SuperHyperSet for any distinct types of an Extreme 2385
SuperHyperVertices pose the an Extreme R-Eulerian-Type-Cycle-Decomposition. Thus an Extreme 2386
exterior SuperHyperVertices could be used only in one an Extreme SuperHyperEdge and in 2387
an Extreme SuperHyperRelation with the interior an Extreme SuperHyperVertices in that an 2388
Extreme SuperHyperEdge. In the embedded an Extreme Eulerian-Type-Cycle-Decomposition, there’s 2389
the usage of exterior an Extreme SuperHyperVertices since they’ve more connections inside more 2390
than outside. Thus the title “exterior” is more relevant than the title “interior”. One an Extreme 2391
SuperHyperVertex has no connection, inside. Thus, the an Extreme SuperHyperSet of the an 2392
Extreme SuperHyperVertices with one SuperHyperElement has been ignored in the exploring 2393
to lead on the optimal case implying the an Extreme R-Eulerian-Type-Cycle-Decomposition. The an 2394
Extreme R-Eulerian-Type-Cycle-Decomposition with the exclusion of the exclusion of all an Extreme 2395
SuperHyperVertices in one an Extreme SuperHyperEdge and with other terms, the an Extreme 2396
R-Eulerian-Type-Cycle-Decomposition with the inclusion of all an Extreme SuperHyperVertices in one an 2397
Extreme SuperHyperEdge, is a an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition. To sum them 2398
up, in a connected non-obvious an Extreme SuperHyperGraph ESHG : (V, E). There’s only 2399
one an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2400

distinct interior an Extreme SuperHyperVertices inside of any given an Extreme quasi-R-Eulerian- 2401
Type-Cycle-Decompositionminus all an Extreme SuperHypeNeighbor to some of them but not all of 2402
them. In other words, there’s only an unique an Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2403
has only two distinct an Extreme SuperHyperVertices in an an Extreme quasi-R-Eulerian-Type- 2404
Cycle-Decomposition, minus all an Extreme SuperHypeNeighbor to some of them but not all of them. 2405
The main definition of the an Extreme R-Eulerian-Type-Cycle-Decomposition has two titles. a an Extreme 2406
quasi-R-Eulerian-Type-Cycle-Decomposition and its corresponded quasi-maximum an Extreme R- 2407

SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any an Extreme number, 2408
there’s a an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition with that quasi-maximum an Extreme 2409
SuperHyperCardinality in the terms of the embedded an Extreme SuperHyperGraph. If there’s 2410
an embedded an Extreme SuperHyperGraph, then the an Extreme quasi-SuperHyperNotions 2411
lead us to take the collection of all the an Extreme quasi-R-Eulerian-Type-Cycle-Decompositions for all 2412
an Extreme numbers less than its an Extreme corresponded maximum number. The essence 2413
of the an Extreme Eulerian-Type-Cycle-Decomposition ends up but this essence starts up in the terms 2414
of the an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition, again and more in the operations of 2415
collecting all the an Extreme quasi-R-Eulerian-Type-Cycle-Decompositions acted on the all possible used 2416
formations of the an Extreme SuperHyperGraph to achieve one an Extreme number. This an 2417
Extreme number is 2418
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Decompositions. 2419

Let zan Extreme Number , San Extreme SuperHyperSet and Gan Extreme Eulerian-Type-Cycle-Decomposition be a 2420
an Extreme number, a an Extreme SuperHyperSet and a an Extreme Eulerian-Type-Cycle-Decomposition. 2421
Then 2422
[zan Extreme Number ]an Extreme Class = {San Extreme SuperHyperSet |

San Extreme SuperHyperSet = Gan Extreme Eulerian-Type-Cycle-Decomposition ,
|San Extreme SuperHyperSet |an Extreme Cardinality
= zan Extreme Number }.
As its consequences, the formal definition of the an Extreme Eulerian-Type-Cycle-Decomposition is 2423

re-formalized and redefined as follows. 2424
Gan Extreme Eulerian-Type-Cycle-Decomposition ∈ ∪zan Extreme Number

[zan Extreme Number ]an Extreme Class =
∪zan Extreme Number
{San Extreme SuperHyperSet |
= zan Extreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2425
definition for the an Extreme Eulerian-Type-Cycle-Decomposition. 2426
Gan Extreme Eulerian-Type-Cycle-Decomposition =

{S ∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =
∪zan Extreme Number {San Extreme SuperHyperSet |


= zan Extreme Number |
= max zan Extreme Number }.
[zan Extreme Number ]an Extreme Class
In more concise and more convenient ways, the modified definition for the an Extreme Eulerian- 2427
poses the upcoming expressions.

Type-Cycle-Decomposition 2428

{S ∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2429

= max zan Extreme Number

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


To get more visions in the closer look-up, there’s an overall overlook. 2431
Gan Extreme Eulerian-Type-Cycle-Decomposition ∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =

2432

{S ∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =



2433


2434


Now, the extension of these types of approaches is up. Since the new term, “an Extreme Super- 2435
HyperNeighborhood”, could be redefined as the collection of the an Extreme SuperHyperVertices 2436
such that any amount of its an Extreme SuperHyperVertices are incident to a an Extreme Su- 2437
perHyperEdge. It’s, literarily, another name for “an Extreme Quasi-Eulerian-Type-Cycle-Decomposition” 2438
but, precisely, it’s the generalization of “an Extreme Quasi-Eulerian-Type-Cycle-Decomposition” since “an 2439
Extreme Quasi-Eulerian-Type-Cycle-Decomposition” happens “an Extreme Eulerian-Type-Cycle-Decomposition” 2440
in a an Extreme SuperHyperGraph as initial framework and background but “an Extreme 2441
SuperHyperNeighborhood” may not happens “an Extreme Eulerian-Type-Cycle-Decomposition” in a an 2442
Extreme SuperHyperGraph as initial framework and preliminarily background since there are 2443
some ambiguities about the an Extreme SuperHyperCardinality arise from it. To get orderly 2444
keywords, the terms, “an Extreme SuperHyperNeighborhood”, “an Extreme Quasi-Eulerian-Type- 2445
Cycle-Decomposition”, and “an Extreme Eulerian-Type-Cycle-Decomposition” are up. 2446
Thus, let 2447
zan Extreme Number , Nan Extreme SuperHyperNeighborhood and 2448
Gan Extreme Eulerian-Type-Cycle-Decomposition be a an Extreme number, a an Extreme SuperHyper- 2449
Neighborhood and a an Extreme Eulerian-Type-Cycle-Decomposition and the new terms are up. 2450
Gan Extreme Eulerian-Type-Cycle-Decomposition ∈ ∪zan Extreme Number

[zan Extreme Number ]an Extreme Class =
∪zan Extreme Number {Nan Extreme SuperHyperNeighborhood |
|Nan Extreme SuperHyperNeighborhood |an Extreme Cardinality
2451

{Nan Extreme SuperHyperNeighborhood

∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =
|Nan Extreme SuperHyperSet |an Extreme Cardinality
2452

∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class |
2453

And with go back to initial structure, 2454
Gan Extreme Eulerian-Type-Cycle-Decomposition ∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =

2455

∈ ∪zan Extreme Number [zan Extreme Number ]an Extreme Class =


2456


2457


Thus, in a connected an Extreme SuperHyperGraph ESHG : (V, E). The all interior an
Extreme SuperHyperVertices belong to any an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition if
for any of them, and any of other corresponded an Extreme SuperHyperVertex, some interior
an Extreme SuperHyperVertices are mutually an Extreme SuperHyperNeighbors with no an
Extreme exception at all minus all an 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 an Extreme SuperHyperSet of an Extreme SuperHyperVertices is the simple an
Extreme type-SuperHyperSet of the an Extreme R-Eulerian-Type-Cycle-Decomposition.
The an Extreme SuperHyperSet of an Extreme SuperHyperVertices,

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

The an Extreme SuperHyperSet of the an Extreme SuperHyperVertices,
Is an an Extreme R-Eulerian-Type-Cycle-Decomposition C(ESHG) for an an Extreme SuperHy-

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

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

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

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

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

Cycle-Decomposition, not:
Is the an Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected an Extreme SuperHy- 2458
perGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an Su- 2459
perHyperEdge. It’s interesting to mention that the only non-obvious simple an Extreme 2460
type-SuperHyperSet called the 2461
“an Extreme R-Eulerian-Type-Cycle-Decomposition” 2462
amid those obvious[non-obvious] simple an Extreme type-SuperHyperSets called the 2463
an Extreme R-Eulerian-Type-Cycle-Decomposition, 2464
is only and only
In a connected an Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

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

sharp bound for the cardinality, of a an Extreme R-Eulerian-Type-Cycle-Decomposition is the cardinality
of
2465
To sum them up, in a connected an Extreme SuperHyperGraph ESHG : (V, E). The all interior 2466
an Extreme SuperHyperVertices belong to any an Extreme quasi-R-Eulerian-Type-Cycle-Decomposition 2467
if for any of them, and any of other corresponded an Extreme SuperHyperVertex, some interior 2468
an Extreme SuperHyperVertices are mutually an Extreme SuperHyperNeighbors with no an 2469
Extreme exception at all minus all an Extreme SuperHypeNeighbors to any amount of them. 2470
Assume a connected an Extreme SuperHyperGraph ESHG : (V, E). Let a an Extreme Super- 2471
HyperEdge ESHE : E ∈ EESHG:(V,E) has some an Extreme SuperHyperVertices r. Consider 2472

all an Extreme numbers of those an Extreme SuperHyperVertices from that an Extreme Super- 2473
HyperEdge excluding excluding more than r distinct an Extreme SuperHyperVertices, exclude 2474
to any given an Extreme SuperHyperSet of the an Extreme SuperHyperVertices. Consider 2475
there’s a an Extreme R-Eulerian-Type-Cycle-Decomposition with the least cardinality, the lower sharp an 2476
Extreme bound for an Extreme cardinality. Assume a connected an Extreme SuperHyperGraph 2477
ESHG : (V, E). The an Extreme SuperHyperSet of the an Extreme SuperHyperVertices 2478

VESHE \ {z} is a an Extreme SuperHyperSet S of the an Extreme SuperHyperVertices such 2479

that there’s a an Extreme SuperHyperEdge to have some an Extreme SuperHyperVertices 2480
uniquely but it isn’t a an Extreme R-Eulerian-Type-Cycle-Decomposition. Since it doesn’t have 2481
2482
the maximum an Extreme cardinality of a an Extreme SuperHyperSet S of an Ex- 2483
treme SuperHyperVertices such that there’s a an Extreme SuperHyperEdge to have some 2484
SuperHyperVertices uniquely. The an Extreme SuperHyperSet of the an Extreme SuperHyper- 2485

Vertices VESHE ∪ {z} is the maximum an Extreme cardinality of a an Extreme SuperHyperSet 2486
S of an Extreme SuperHyperVertices but it isn’t a an Extreme R-Eulerian-Type-Cycle-Decomposition. 2487
Since it doesn’t do the an Extreme procedure such that such that there’s a an Extreme 2488
SuperHyperEdge to have some an Extreme SuperHyperVertices uniquely [there are at least 2489
one an Extreme SuperHyperVertex outside implying there’s, sometimes in the connected an 2490
Extreme SuperHyperGraph ESHG : (V, E), a an Extreme SuperHyperVertex, titled its an 2491
Extreme SuperHyperNeighbor, to that an Extreme SuperHyperVertex in the an Extreme 2492
SuperHyperSet S so as S doesn’t do “the an Extreme procedure”.]. There’s only one an 2493
Extreme SuperHyperVertex outside the intended an Extreme SuperHyperSet, VESHE ∪ {z}, 2494
in the terms of an Extreme SuperHyperNeighborhood. Thus the obvious an Extreme R-Eulerian- 2495
Type-Cycle-Decomposition, VESHE is up. The obvious simple an Extreme type-SuperHyperSet of the 2496
an Extreme R-Eulerian-Type-Cycle-Decomposition, VESHE , is a an Extreme SuperHyperSet, VESHE , 2497

includes only all an Extreme SuperHyperVertices does forms any kind of an Extreme pairs 2498
are titled an Extreme SuperHyperNeighbors in a connected an Extreme SuperHyperGraph 2499
ESHG : (V, E). Since the an Extreme SuperHyperSet of the an Extreme SuperHyperVertices 2500
VESHE , is the maximum an Extreme SuperHyperCardinality of a an Extreme SuperHy- 2501
perSet S of an Extreme SuperHyperVertices such that there’s a an Extreme SuperHyperEdge 2502
to have some an Extreme SuperHyperVertices uniquely. Thus, in a connected an Extreme 2503

SuperHyperGraph ESHG : (V, E). Any an Extreme R-Eulerian-Type-Cycle-Decomposition only contains 2504
all interior an Extreme SuperHyperVertices and all exterior an Extreme SuperHyperVertices 2505
from the unique an Extreme SuperHyperEdge where there’s any of them has all possible an 2506
Extreme SuperHyperNeighbors in and there’s all an Extreme SuperHyperNeighborhoods in 2507
with no exception minus all an Extreme SuperHypeNeighbors to some of them not all of 2508
them but everything is possible about an Extreme SuperHyperNeighborhoods and an Extreme 2509
SuperHyperNeighbors out. 2510
The SuperHyperNotion, namely, Eulerian-Type-Cycle-Decomposition, is up. There’s neither empty 2511
SuperHyperEdge nor loop SuperHyperEdge. The following an Extreme SuperHyperSet of an 2512
Extreme SuperHyperEdges[SuperHyperVertices] is the simple an Extreme type-SuperHyperSet 2513
of the an Extreme Eulerian-Type-Cycle-Decomposition. The an Extreme SuperHyperSet of an Extreme 2514

SuperHyperEdges[SuperHyperVertices], 2515

|EESHG:(V,E) |an Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)anExtremeQuasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)anExtremeR−Quasi−Eulerian−T ype−Cycle−Decomposition = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)anExtremeR−Quasi−Eulerian−T ype−Cycle−DecompositionSuperHyperP olynomial

= az s + bz t .
is the simple an Extreme type-SuperHyperSet of the an Extreme Eulerian-Type-Cycle-Decomposition. 2516

The an Extreme SuperHyperSet of the an Extreme SuperHyperEdges[SuperHyperVertices], 2517

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an an Extreme Eulerian-Type-Cycle-Decomposition C(ESHG) for an an Extreme SuperHyper- 2518
Graph ESHG : (V, E) is a an Extreme type-SuperHyperSet with 2519

2520
the maximum an Extreme cardinality of a an Extreme SuperHyperSet S of an Extreme 2521
SuperHyperEdges[SuperHyperVertices] such that there’s no an Extreme SuperHyperVertex 2522
of a an Extreme SuperHyperEdge is common and there’s an an Extreme SuperHyperEdge 2523
for all an Extreme SuperHyperVertices. There are not only two an Extreme SuperHyper- 2524
Vertices inside the intended an Extreme SuperHyperSet. Thus the non-obvious an Extreme 2525
Eulerian-Type-Cycle-Decomposition is up. The obvious simple an Extreme type-SuperHyperSet called 2526
the an Extreme Eulerian-Type-Cycle-Decomposition is a an Extreme SuperHyperSet includes only 2527
two an Extreme SuperHyperVertices. But the an Extreme SuperHyperSet of the an Extreme 2528

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 an Extreme SuperHyperSet. 2530
Thus the non-obvious simple an Extreme type-SuperHyperSet of the an Extreme Eulerian-Type- 2531
Cycle-Decomposition is up. To sum them up, the an Extreme SuperHyperSet of the an Extreme 2532

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

= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple an Extreme type-SuperHyperSet of the an Extreme Eulerian- 2534
. Since the an Extreme SuperHyperSet of the an Extreme SuperHy-

perEdges[SuperHyperVertices], 2536

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

ESHG : (V, E) is the an Extreme SuperHyperSet S of an Extreme SuperHyperVertices such 2538
that there’s no a an Extreme SuperHyperEdge for some an Extreme SuperHyperVertices given 2539
by that an Extreme type-SuperHyperSet called the an Extreme Eulerian-Type-Cycle-Decomposition and 2540

it’s an an Extreme Eulerian-Type-Cycle-Decomposition. Since it’s 2541
2542
the maximum an Extreme cardinality of a an Extreme SuperHyperSet S of an Extreme 2543
SuperHyperEdges[SuperHyperVertices] such that there’s no an Extreme SuperHyperVertex of a 2544
an Extreme SuperHyperEdge is common and there’s an an Extreme SuperHyperEdge for all an 2545
Extreme SuperHyperVertices. There aren’t only less than three an Extreme SuperHyperVertices 2546
inside the intended an Extreme SuperHyperSet, 2547

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

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


= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple an Extreme type-SuperHyperSet of the an Extreme Eulerian-Type-Cycle- 2549
, not:
Decomposition 2550

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

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 an Extreme SuperHyper- 2552
Graph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple an Extreme 2553
“an Extreme Eulerian-Type-Cycle-Decomposition ” 2555
amid those obvious[non-obvious] simple an Extreme type-SuperHyperSets called the 2556
an Extreme Eulerian-Type-Cycle-Decomposition , 2557
is only and only 2558

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

= 2z b 2 c
.
= az s + bz t .
In a connected an Extreme SuperHyperGraph ESHG : (V, E). 2559

CHAPTER 11 2560
The an Extreme Departures on The 2561
Theoretical Results Toward Theoretical 2562
Motivations 2563
The previous an Extreme approach apply on the upcoming an Extreme results on an Extreme 2564
SuperHyperClasses. 2565
Proposition 11.0.1. Assume a connected an Extreme SuperHyperPath ESHP : (V, E). Then 2566

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

|EN SHG
X |{V{E }| .
= |z i=1|EN SHG | }
i=1
Proof. Let 2567
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
117
2568
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected an Extreme SuperHyperPath ESHP : (V, E). There’s 2569
a new way to redefine as 2570
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 2571
to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Decomposition. The latter is 2572
136EXM18a Example 11.0.2. In the Figure (31.1), the connected an Extreme SuperHyperPath ESHP : 2574
(V, E), is highlighted and featured. The an Extreme SuperHyperSet, in the an Extreme 2575
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Cycle-Decomposition. 2576
Proposition 11.0.3. Assume a connected an Extreme SuperHyperCycle ESHC : (V, E). Then 2577

= {{Ei }i=1|EN SHG | }.
= z |EN SHG | .
= {{Vi }i=1|VN SHG | }.
= z |VN SHG | .
Proof. Let 2578
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2579
P :

Figure 11.1: a an Extreme SuperHyperPath Associated to the Notions of an Extreme

SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.5) 136NSHG18a
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected an Extreme SuperHyperCycle ESHC : (V, E). There’s 2580

136EXM19a Example 11.0.4. In the Figure (31.2), the connected an Extreme SuperHyperCycle N SHC : 2585
(V, E), is highlighted and featured. The obtained an Extreme SuperHyperSet, in the an Extreme 2586
SuperHyperModel (31.2), is the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. 2587

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

Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected an Extreme SuperHyperStar ESHS : (V, E). Then 2588

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

|EN SHG |
X |{V{E }| .
= z i=1|EN SHG | }
i=1
Proof. Let 2589
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2590
P :

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

SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.9) 136NSHG20a
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected an Extreme SuperHyperStar ESHS : (V, E). There’s a 2591
new way to redefine as 2592

136EXM20a Example 11.0.6. In the Figure (31.3), the connected an Extreme SuperHyperStar ESHS : 2596
(V, E), is highlighted and featured. The obtained an Extreme SuperHyperSet, by the Algorithm 2597
in previous an Extreme result, of the an Extreme SuperHyperVertices of the connected an 2598
Extreme SuperHyperStar ESHS : (V, E), in the an Extreme SuperHyperModel (31.3), is the 2599
an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. 2600

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

= {{Ei , Ej }Ei ∩Ej 6=∅ }.
= z |{Ei ,Ej }Ei ∩Ej 6=∅ | .
= {{Vi , Vj }Vi ∈PNr SHG ,Vj ∈PNs SHG ,r6=s }.
{Vi ,Vj }Vi ∈P r ,Vj ∈P s ,r6=s
=z N SHG N SHG .
Proof. Let 2603
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
2604
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 an Extreme SuperHyperBipartite ESHB : (V, E). 2605
There’s a new way to redefine as 2606

straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Decomposition. Thus the 2609
notion of quasi may be up but the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle- 2610
Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2611
could have one SuperHyperVertex as the representative in the 2612
P :
V1EXT ERN AL , E1 ,

Figure 11.4: an Extreme SuperHyperBipartite an Extreme Associated to the an Extreme

Notions of an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.11) 136NSHG21a
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Decomposition taken from a connected an Extreme 2613

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 2614
an Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 2615
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2616
136EXM21a Example 11.0.8. In the an Extreme Figure (31.4), the connected an Extreme SuperHyperBi- 2617
partite ESHB : (V, E), is an Extreme highlighted and an Extreme featured. The obtained an 2618
Extreme SuperHyperSet, by the an Extreme Algorithm in previous an Extreme result, of the an 2619
Extreme SuperHyperVertices of the connected an Extreme SuperHyperBipartite ESHB : (V, E), 2620
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperEulerian-Type-Cycle- 2621
Decomposition. 2622
Proposition 11.0.9. Assume a connected an Extreme SuperHyperMultipartite ESHM : (V, E). 2623

Then 2624

= {{Ei , Ej }Ei ∩Ej 6=∅ }.
= z |{Ei ,Ej }Ei ∩Ej 6=∅ | .
=z N SHG N SHG .
Proof. Let 2625
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2626
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 2628


0
Decomposition could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 2633
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest path taken from a connected an Extreme SuperHyperMultipartite ESHM : (V, E). 2635
Thus only some SuperHyperVertices and only minimum-an Extreme-of-SuperHyperPart 2636
SuperHyperEdges are attained in any solution 2637
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 11.0.10. In the Figure (31.5), the connected an Extreme SuperHyperMultipartite 2640
ESHM : (V, E), is highlighted and an Extreme featured. The obtained an Extreme 2641
SuperHyperSet, by the Algorithm in previous an Extreme result, of the an Extreme 2642
SuperHyperVertices of the connected an Extreme SuperHyperMultipartite ESHM : (V, E), 2643

in the an Extreme SuperHyperModel (31.5), is the an Extreme SuperHyperEulerian-Type-Cycle- 2644
Decomposition. 2645
Proposition 11.0.11. Assume a connected an Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2646

Then, 2647

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


= {{Vi }i=1|VN SHG | }.
= z |VN SHG | .
Proof. Let 2648
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2649
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Decomposition. Thus the 2654
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle- 2655
Decomposition could be applied. The unique embedded SuperHyperEulerian-Type-Cycle-Decomposition 2656

proposes some longest SuperHyperEulerian-Type-Cycle-Decomposition excerpt from some representatives. 2657
136EXM23a Example 11.0.12. In the an Extreme Figure (31.6), the connected an Extreme SuperHyper- 2659
Wheel N SHW : (V, E), is an Extreme highlighted and featured. The obtained an Extreme 2660
SuperHyperSet, by the Algorithm in previous result, of the an Extreme SuperHyperVertices of 2661
the connected an Extreme SuperHyperWheel ESHW : (V, E), in the an Extreme SuperHyper- 2662
Model (31.6), is the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. 2663

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

of an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in the an Extreme Example (42.0.15) 136NSHG23a

CHAPTER 12 2664
The Surveys of Mathematical Sets On 2665
The Results But As The Initial Motivation 2666
For the SuperHyperEulerian-Type-Cycle-Decomposition, an Extreme SuperHyperEulerian-Type-Cycle- 2667

, and the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition, some general results
Decomposition 2668
are introduced. 2669
Remark 12.0.1. Let remind that the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition is 2670

“redefined” on the positions of the alphabets. 2671
Corollary 12.0.2. Assume an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. Then 2672
anExtreme SuperHyperEulerian − T ype − Cycle − Decomposition =

{theSuperHyperEulerian − T ype − Cycle − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − Decomposition
|anExtremecardinalityamidthoseSuperHyperEulerian−T ype−Cycle−Decomposition. }
plus one an Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2673
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 2674
the neutrality, for i = 1, 2, 3, respectively. 2675
Corollary 12.0.3. Assume a an Extreme SuperHyperGraph on the same identical letter of 2676
the alphabet. Then the notion of an Extreme SuperHyperEulerian-Type-Cycle-Decomposition and 2677
SuperHyperEulerian-Type-Cycle-Decomposition coincide. 2678
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a an Extreme 2680
SuperHyperEulerian-Type-Cycle-Decomposition if and only if it’s a SuperHyperEulerian-Type-Cycle-Decomposition. 2681
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2683
SuperHyperEulerian-Type-Cycle-Decomposition if and only if it’s a longest SuperHyperEulerian-Type-Cycle- 2684
Decomposition. 2685
Corollary 12.0.6. Assume SuperHyperClasses of a an Extreme SuperHyperGraph on the same 2686

identical letter of the alphabet. Then its an Extreme SuperHyperEulerian-Type-Cycle-Decomposition is its 2687
SuperHyperEulerian-Type-Cycle-Decomposition and reversely. 2688
129
Corollary 12.0.7. Assume a an Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 2689

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 2690
on the same identical letter of the alphabet. Then its an Extreme SuperHyperEulerian-Type-Cycle- 2691
Decomposition is its SuperHyperEulerian-Type-Cycle-Decomposition and reversely. 2692
Corollary 12.0.8. Assume a an Extreme SuperHyperGraph. Then its an Extreme 2693

SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its SuperHyperEulerian- 2694
Type-Cycle-Decomposition isn’t well-defined. 2695
Corollary 12.0.9. Assume SuperHyperClasses of a an Extreme SuperHyperGraph. Then 2696

its an Extreme SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its 2697
SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined. 2698

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Decomposition 2700
Then its an Extreme SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its 2701
Corollary 12.0.11. Assume a an Extreme SuperHyperGraph. Then its an Extreme 2703

SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its SuperHyperEulerian-Type- 2704
Cycle-Decomposition is well-defined. 2705
Corollary 12.0.12. Assume SuperHyperClasses of a an Extreme SuperHyperGraph. Then its an 2706
Extreme SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its SuperHyperEulerian- 2707

Type-Cycle-Decomposition is well-defined. 2708

Decomposition 2710
Then its an Extreme SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its 2711
SuperHyperEulerian-Type-Cycle-Decomposition is well-defined. 2712
Proposition 12.0.14. Let ESHG : (V, E) be a an Extreme SuperHyperGraph. Then V is 2713
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2714
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2715
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2716
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2717
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2718
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2719
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a an Extreme SuperHyperGraph. Then ∅ is 2720
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2721
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2722
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2723
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2724

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2725
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2726
Proposition 12.0.16. Let ESHG : (V, E) be a an Extreme SuperHyperGraph. Then an 2727

independent SuperHyperSet is 2728
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2731
Proposition 12.0.17. Let ESHG : (V, E) be a an Extreme SuperHyperUniform SuperHyper- 2735

Graph which is a SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath. Then V is a maximal 2736
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2737
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2738
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2739
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2740
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2741
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2742
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2743
Proposition 12.0.18. Let ESHG : (V, E) be a an Extreme SuperHyperGraph which is a 2744

SuperHyperUniform SuperHyperWheel. Then V is a maximal 2745
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2746
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2747
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2748
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2749
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2750
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2751

Graph which is a SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath. Then the number 2754
of 2755

(i) : the SuperHyperEulerian-Type-Cycle-Decomposition; 2756
(ii) : the SuperHyperEulerian-Type-Cycle-Decomposition; 2757
(iii) : the connected SuperHyperEulerian-Type-Cycle-Decomposition; 2758
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 2759
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 2760
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition. 2761
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2762
coincide. 2763

Graph which is a SuperHyperWheel. Then the number of 2765
(i) : the dual SuperHyperEulerian-Type-Cycle-Decomposition; 2766
(ii) : the dual SuperHyperEulerian-Type-Cycle-Decomposition; 2767
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Decomposition; 2768
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 2769
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 2770
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition. 2771
coincide. 2773

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 2775
plete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the 2776
half of multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHy- 2777
perVertices is a 2778
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2782
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2783
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2784


plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 2787
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2788
SuperHyperPart is a 2789
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2793
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2794
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2795

plete SuperHyperMultipartite. Then Then the number of 2798
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2805
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2806
Proposition 12.0.24. Let ESHG : (V, E) be a an Extreme SuperHyperGraph. The number of 2808
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2809
(iv) : SuperHyperEulerian-Type-Cycle-Decomposition; 2813
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2814
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2815

Proposition 12.0.25. Let ESHG : (V, E) be a an Extreme SuperHyperGraph. Then the number 2816
is at most O(ESHG) and the an Extreme number is at most On (ESHG). 2817
Proposition 12.0.26. Let ESHG : (V, E) be a an Extreme SuperHyperGraph which is 2818
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the an Extreme number is 2819

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

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2826
Proposition 12.0.27. Let ESHG : (V, E) be a an Extreme SuperHyperGraph which is ∅. The 2827
number is 0 and the an Extreme number is 0, for an independent SuperHyperSet in the setting 2828
of dual 2829
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2833

SuperHyperComplete. Then there’s no independent SuperHyperSet. 2837
Proposition 12.0.29. Let ESHG : (V, E) be a an Extreme SuperHyperGraph which 2838

is SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 2839
O(ESHG : (V, E)) and the an Extreme number is On (ESHG : (V, E)), in the setting of a dual 2840
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2844
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2845
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2846


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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) an 2857
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2858
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2859
these specific SuperHyperClasses of the an Extreme SuperHyperGraphs. 2860
Proposition 12.0.32. Let ESHG : (V, E) be a strong an Extreme SuperHyperGraph. If S is a 2861
dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such 2862

that 2863
(i) v ∈ Ns (x); 2864
(ii) vx ∈ E. 2865
Proposition 12.0.33. Let ESHG : (V, E) be a strong an Extreme SuperHyperGraph. If S is a 2866

dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition, then 2867
(i) S is SuperHyperEulerian-Type-Cycle-Decomposition set; 2868
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2869
Proposition 12.0.34. Let ESHG : (V, E) be a strong an Extreme SuperHyperGraph. Then 2870
(i) Γ ≤ O; 2871
(ii) Γs ≤ On . 2872
Proposition 12.0.35. Let ESHG : (V, E) be a strong an Extreme SuperHyperGraph which is 2873
connected. Then 2874
(i) Γ ≤ O − 1; 2875
(ii) Γs ≤ On − Σ3i=1 σi (x). 2876
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2877

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

SuperHyperEulerian-Type-Cycle-Decomposition; 2879
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2880
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2881
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2882
SuperHyperEulerian-Type-Cycle-Decomposition. 2883
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2884
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2885
Decomposition; 2886
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2887
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2888
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2889
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Decomposition. 2891

Then 2892
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2893
Type-Cycle-Decomposition; 2894
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2895
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2896
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2897
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Decomposition. 2899

Then 2900
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2904
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2905
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2907
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Decomposition; 2908
(ii) Γ = 1; 2909

(iii) Γs = Σ3i=1 σi (c); 2910
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle- 2911
Decomposition. 2912
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2913
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2914
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 2915
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2916
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2917
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2918
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 2919
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2920
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type- 2921
Cycle-Decomposition; 2922
(ii) Γ = b n2 c + 1; 2923
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2924
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2925
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2927
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2928
Decomposition; 2929
(ii) Γ = b n2 c; 2930

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

perStars with common an Extreme SuperHyperVertex SuperHyperSet. Then 2935
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEulerian- 2936

Type-Cycle-Decomposition for N SHF; 2937
(ii) Γ = m for N SHF : (V, E); 2938
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2939

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2940
Cycle-Decomposition for N SHF : (V, E). 2941
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2942

plete SuperHyperGraphs with common an Extreme SuperHyperVertex SuperHyperSet. Then 2943
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 2944
SuperHyperEulerian-Type-Cycle-Decomposition for N SHF; 2945
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2946
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2947
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1 2
are only a dual maximal SuperHyperEulerian-Type-Cycle- 2948
Decomposition for N SHF : (V, E). 2949
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2950

plete SuperHyperGraphs with common an Extreme SuperHyperVertex SuperHyperSet. Then 2951
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2952
Decomposition for N SHF : (V, E); 2953
(ii) Γ = b n2 c for N SHF : (V, E); 2954
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 2955
S={vi }i=1
bnc
are only dual maximal SuperHyperEulerian-Type-Cycle- 2956
following statements hold; 2959
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2960

SuperHyperEulerian-Type-Cycle-Decomposition, then S is an s-SuperHyperDefensive SuperHyperEulerian-2961
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2963

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

SuperHyperEulerian-Type-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperEulerian-2969

SuperHyperEulerian-Type-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 2972

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

SuperHyperGraph. Then following statements hold; 2975
(i) if ∀a ∈ S, |Ns (a) ∩ S| then ESHG : (V, E) is a dual 2-SuperHyperDefensive 2978
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an V-SuperHyperDefensive 2980

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

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

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

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

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


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

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


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 3008

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

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


SuperHyperGraph which is SuperHyperEulerian-Type-Cycle-Decomposition. Then following statements 3015
hold; 3016
(i) ∀a ∈ S, |Ns (a)∩S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperEulerian- 3017
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3019

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

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


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

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

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


CHAPTER 13 3036
an Extreme Applications in Cancer’s an 3037
Extreme Recognition 3038
The cancer is the an Extreme disease but the an Extreme model is going to figure out what’s 3039
going on this an Extreme phenomenon. The special an Extreme case of this an Extreme disease 3040
is considered and as the consequences of the model, some parameters are used. The cells are 3041
under attack of this disease but the moves of the cancer in the special region are the matter of 3042
mind. The an Extreme recognition of the cancer could help to find some an Extreme treatments 3043
for this an Extreme disease. 3044
In the following, some an Extreme steps are an Extreme devised on this disease. 3045
Step 1. (an Extreme Definition) The an Extreme recognition of the cancer in the long-term 3046
an Extreme function. 3047
Step 2. (an Extreme Issue) The specific region has been assigned by the an Extreme model 3048
[it’s called an Extreme SuperHyperGraph] and the long an Extreme cycle of the move 3049
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 3050
easily identified since there are some determinacy, indeterminacy and neutrality about the 3051
moves and the effects of the cancer on that region; this event leads us to choose another 3052
model [it’s said to be an Extreme SuperHyperGraph] to have convenient perception on 3053
what’s happened and what’s done. 3054
Step 3. (an Extreme Model) There are some specific an Extreme models, which are well- 3055
known and they’ve got the names, and some general an Extreme models. The moves 3056
and the an Extreme traces of the cancer on the complex tracks and between complicated 3057
groups of cells could be fantasized by a an Extreme SuperHyperPath(-/SuperHyperEulerian- 3058
Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 3059
SuperHyperWheel). The aim is to find either the an Extreme SuperHyperEulerian-Type-Cycle- 3060

Decomposition or the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition in those an Extreme 3061
an Extreme SuperHyperModels. 3062
141
CHAPTER 14 3063
Case 1: The Initial an Extreme Steps 3064
Toward an Extreme 3065
SuperHyperBipartite as an Extreme 3066
SuperHyperModel 3067
Step 4. (an Extreme Solution) In the an Extreme Figure (34.1), the an Extreme SuperHyper- 3068
Bipartite is an Extreme highlighted and an Extreme featured. 3069
Figure 14.1: a an Extreme SuperHyperBipartite Associated to the Notions of an Extreme

SuperHyperEulerian-Type-Cycle-Decomposition 136NSHGaa21aa
143
Belong to The an Extreme SuperHyperBipartite

136TBLaa21aa
By using the an Extreme Figure (34.1) and the Table (34.1), the an Extreme SuperHy- 3070
perBipartite is obtained. 3071
The obtained an Extreme SuperHyperSet, by the an Extreme Algorithm in previous an 3072
Extreme result, of the an Extreme SuperHyperVertices of the connected an Extreme 3073
SuperHyperBipartite ESHB : (V, E), in the an Extreme SuperHyperModel (34.1), is the 3074
an Extreme SuperHyperEulerian-Type-Cycle-Decomposition. 3075

CHAPTER 15 3076
Case 2: The Increasing an Extreme 3077
Steps Toward an Extreme 3078
SuperHyperMultipartite as an Extreme 3079
Step 4. (an Extreme Solution) In the an Extreme Figure (35.1), the an Extreme SuperHyper- 3081
Multipartite is an Extreme highlighted and an Extreme featured. 3082
By using the an Extreme Figure (35.1) and the Table (35.1), the an Extreme SuperHy- 3083
perMultipartite is obtained. 3084
The obtained an Extreme SuperHyperSet, by the an Extreme Algorithm in previous result, 3085
Figure 15.1: a an Extreme SuperHyperMultipartite Associated to the Notions of an Extreme

145
Belong to The an Extreme SuperHyperMultipartite

136TBLaa22aa
of the an Extreme SuperHyperVertices of the connected an Extreme SuperHyperMulti- 3086

partite ESHM : (V, E), in the an Extreme SuperHyperModel (35.1), is the an Extreme 3087

CHAPTER 16 3089
Wondering Open Problems But As The 3090
Directions To Forming The Motivations 3091
In what follows, some “problems” and some “questions” are proposed. 3092
The SuperHyperEulerian-Type-Cycle-Decomposition and the an Extreme SuperHyperEulerian-Type-Cycle- 3093
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 3094
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3095
recognitions? 3096
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle- 3097

and the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition?
Decomposition 3098
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3099
them? 3100
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3101
and the an Extreme SuperHyperEulerian-Type-Cycle-Decomposition?
Problem 16.0.5. The SuperHyperEulerian-Type-Cycle-Decomposition and the an Extreme SuperHyperEulerian-3103

do a SuperHyperModel for the Cancer’s recognitions and they’re based on 3104
Type-Cycle-Decomposition
SuperHyperEulerian-Type-Cycle-Decomposition, are there else? 3105
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3106
Numbers types-results? 3107
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3108
the multiple types of SuperHyperNotions? 3109
147
CHAPTER 17 3110
Conclusion and Closing Remarks 3111
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3112
research are illustrated. Some benefits and some advantages of this research are highlighted. 3113
This research uses some approaches to make an Extreme SuperHyperGraphs more under- 3114
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian- 3115
Type-Cycle-Decomposition. For that sake in the second definition, the main definition of the an 3116
Extreme SuperHyperGraph is redefined on the position of the alphabets. Based on the new 3117
definition for the an Extreme SuperHyperGraph, the new SuperHyperNotion, an Extreme 3118
SuperHyperEulerian-Type-Cycle-Decomposition, finds the convenient background to implement some 3119

results based on that. Some SuperHyperClasses and some an Extreme SuperHyperClasses 3120
are the cases of this research on the modeling of the regions where are under the attacks of 3121
the cancer to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. 3122
To formalize the instances on the SuperHyperNotion, SuperHyperEulerian-Type-Cycle-Decomposition, 3123
the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results 3124
are gathered in the section on the SuperHyperEulerian-Type-Cycle-Decomposition and the an Extreme 3125
SuperHyperEulerian-Type-Cycle-Decomposition. The clarifications, instances and literature reviews have 3126
taken the whole way through. In this research, the literature reviews have fulfilled the lines 3127
containing the notions and the results. The SuperHyperGraph and an Extreme SuperHyper- 3128
Graph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the 3129
background of this research. Sometimes the cancer has been happened on the region, full of 3130
cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 3131
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 3132
and strongest styles with the formation of the design and the architecture are formally called 3133
“ SuperHyperEulerian-Type-Cycle-Decomposition” in the themes of jargons and buzzwords. The prefix 3134
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 3135
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 3136
pointed out and spoken out. 3137
149
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining an Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Cycle-Decomposition
3. an Extreme SuperHyperEulerian-Type-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3138
an Extreme SuperHyperDuality But As 3139
Super Forms 3141
Definition 18.0.1. (Different an Extreme Types of an Extreme SuperHyperDuality). 3142

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

Va ∈ Ei , Ej ; 3146
(ii) an Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3147
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3148
(iii) an Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3149
Vi , Vj ∈ Ea ; 3150
(iv) an Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3151
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3152
(v) an Extreme SuperHyperDuality if it’s either of an Extreme e-SuperHyperDuality, 3153
an Extreme re-SuperHyperDuality, an Extreme v-SuperHyperDuality, and an Extreme 3154

rv-SuperHyperDuality. 3155
Definition 18.0.2. ((an Extreme) SuperHyperDuality). 3156

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

rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3161
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3162
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3163
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3164
Extreme SuperHyperDuality; 3165
151
(ii) a an Extreme SuperHyperDuality if it’s either of an Extreme e-SuperHyperDuality, 3166

rv-SuperHyperDuality and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3168
is the maximum an Extreme cardinality of the an Extreme SuperHyperEdges of a an 3169
Extreme SuperHyperSet S of high an Extreme cardinality conseNeighborive an Extreme 3170
SuperHyperEdges and an Extreme SuperHyperVertices such that they form the an Extreme 3171
SuperHyperDuality; 3172
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of an 3173
Extreme e-SuperHyperDuality, an Extreme re-SuperHyperDuality, an Extreme v- 3174

SuperHyperDuality, and an Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3175
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3176
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 3177
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 3178
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3179
they form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3180
Extreme coefficient; 3181
(iv) a an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of an 3182

SuperHyperDuality, and an Extreme rv-SuperHyperDuality and C(N SHG) for a an 3184
Extreme SuperHyperGraph N SHG : (V, E) is the an Extreme SuperHyperPolynomial 3185
contains the an Extreme coefficients defined as the an Extreme number of the maximum an 3186
Extreme cardinality of the an Extreme SuperHyperEdges of a an Extreme SuperHyperSet 3187
S of high an Extreme cardinality conseNeighborive an Extreme SuperHyperEdges and an 3188
Extreme SuperHyperVertices such that they form the an Extreme SuperHyperDuality; 3189
and the an Extreme power is corresponded to its an Extreme coefficient; 3190
(v) an Extreme R-SuperHyperDuality if it’s either of an Extreme e-SuperHyperDuality, 3191

rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3193
cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence 3195
Extreme SuperHyperDuality; 3197
(vi) a an Extreme R-SuperHyperDuality if it’s either of an Extreme e-SuperHyperDuality, 3198

rv-SuperHyperDuality and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3200
is the maximum an Extreme cardinality of the an Extreme SuperHyperVertices of a an 3201
SuperHyperDuality; 3204
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of an 3205

SuperHyperDuality, and an Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3207
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 3208

the Extreme coefficients defined as the Extreme number of the maximum Extreme 3209
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 3212
power is corresponded to its Extreme coefficient; 3213
(viii) a an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of an 3214

SuperHyperDuality, and an Extreme rv-SuperHyperDuality and C(N SHG) for a an 3216
Extreme cardinality of the an Extreme SuperHyperVertices of a an Extreme SuperHyperSet 3219
Extreme SuperHyperVertices such that they form the an Extreme SuperHyperDuality; 3221
and the an Extreme power is corresponded to its an Extreme coefficient. 3222

SuperHyperDuality, is up. The an Extreme Algorithm is an Extremely straightforward. 3226
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop an Extreme 3227
SuperHyperEdge and E4 is a an Extreme SuperHyperEdge. Thus in the terms of an 3228
Extreme SuperHyperNeighbor, there’s only one an Extreme SuperHyperEdge, namely, 3229

E4 . The an Extreme SuperHyperVertex, V3 is an Extreme isolated means that there’s no 3230
an Extreme SuperHyperEdge has it as a an Extreme endpoint. Thus the an Extreme 3231
SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperDuality. 3232
C(N SHG)an Extreme SuperHyperDuality = {E4 }.

C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)an Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)an Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.

E1 , E2 and E3 are some empty an Extreme SuperHyperEdges but E4 is a an Extreme 3235
SuperHyperEdge. Thus in the terms of an Extreme SuperHyperNeighbor, there’s only 3236
one an Extreme SuperHyperEdge, namely, E4 . The an Extreme SuperHyperVertex, V3 3237
is an Extreme isolated means that there’s no an Extreme SuperHyperEdge has it as a 3238
an Extreme endpoint. Thus the an Extreme SuperHyperVertex, V3 , is excluded in every 3239
given an Extreme SuperHyperDuality. 3240





C(N SHG)an Extreme SuperHyperDuality = {E4 , E2 }.

C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)an Extreme R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)an Extreme R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)an Extreme R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)an Extreme SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)an Extreme R-SuperHyperDuality = {V3i+17i=0 }.
C(N SHG)an Extreme SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial = z 3 .
C(N SHG)an Extreme R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)an Extreme R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)an Extreme SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)an Extreme R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .


3 × 3z 2 .


C(N SHG)an 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)an Extreme SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)an Extreme R-SuperHyperDuality = {V2i+1i=05 }.





C(N SHG)an Extreme R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .

C(N SHG)an Extreme SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)an Extreme R-SuperHyperDuality
= {ViEXT ERN AL }i=1 3

.
Y |EESHG:(V,E) |an Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |an Extreme Cardinality z 3 .
Proof. Let 3284
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |an Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |an Extreme Cardinality .
3 3

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3287
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3288
SuperHyperModel (31.1), is the SuperHyperDuality. 3291
C(N SHG)an Extreme SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)an Extreme SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)an Extreme R-SuperHyperDuality


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

SuperHyperModel (31.2), is the an Extreme SuperHyperDuality. 3300
C(N SHG)an Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)an Extreme Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|an Extreme Cardinality |z.
C(N SHG)an Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 3302
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .



an Extreme SuperHyperDuality. 3311
Then 3313
C(N SHG)an 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) |
an Extreme Cardinality
Proof. Let 3314
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. 3318
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3319
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3320
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3321
representative in the 3322
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 an Extreme SuperHyperBipartite 3323
ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-an Extreme-of- 3324
SuperHyperPart SuperHyperEdges are attained in any solution 3325
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperDuality. 3331
Then 3333

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 3334
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected an Extreme SuperHyperMultipartite 3335

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3339
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3340
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperVertices of the connected an Extreme SuperHyperMultipartite ESHM : (V, E), in 3351
the an Extreme SuperHyperModel (31.5), is the an Extreme SuperHyperDuality. 3352

Proposition 18.0.14. Assume a connected an Extreme SuperHyperWheel ESHW : (V, E). 3353
Then, 3354
C(N SHG)an Extreme Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
|z.
C(N SHG)an Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 3355
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |an Extreme Cardinality +1
ESHG:(V,E) an Extreme Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected an Extreme SuperHyperWheel 3356

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

∃!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 3361

SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3362
Model (31.6), is the an Extreme SuperHyperDuality. 3368

CHAPTER 19 3369
an Extreme SuperHyperJoin But As The 3370
Extensions Excerpt From Dense And 3371
Super Forms 3372
Definition 19.0.1. (Different an Extreme Types of an Extreme SuperHyperJoin). 3373

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

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3377
(ii) an Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3378
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 3379

|Ej |NEUTROSOPIC CARDINALITY ; 3380
(iii) an Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3381

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3384
|Vj |NEUTROSOPIC CARDINALITY ; 3385
(v) an Extreme SuperHyperJoin if it’s either of an Extreme e-SuperHyperJoin, an 3386

Extreme re-SuperHyperJoin, an Extreme v-SuperHyperJoin, and an Extreme rv- 3387
SuperHyperJoin. 3388
Definition 19.0.2. ((an Extreme) SuperHyperJoin). 3389
(i) an Extreme SuperHyperJoin if it’s either of an Extreme e-SuperHyperJoin, an Extreme 3392

re-SuperHyperJoin, an Extreme v-SuperHyperJoin, and an Extreme rv-SuperHyperJoin 3393
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3394
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3395
the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme 3396
165
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3397
SuperHyperJoin; 3398
(ii) a an Extreme SuperHyperJoin if it’s either of an Extreme e-SuperHyperJoin, 3399

an Extreme re-SuperHyperJoin, an Extreme v-SuperHyperJoin, and an Extreme rv- 3400
SuperHyperJoin and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3401

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of an Ex- 3406

treme e-SuperHyperJoin, an Extreme re-SuperHyperJoin, an Extreme v-SuperHyperJoin, 3407
and an Extreme rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 3408
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3410
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3411
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3412
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 3413
coefficient; 3414
(iv) a an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of an Extreme 3415

e-SuperHyperJoin, an Extreme re-SuperHyperJoin, an Extreme v-SuperHyperJoin, and 3416
an Extreme rv-SuperHyperJoin and C(N SHG) for a an Extreme SuperHyperGraph 3417
N SHG : (V, E) is the an Extreme SuperHyperPolynomial contains the an Extreme 3418
coefficients defined as the an Extreme number of the maximum an Extreme cardinality 3419
of the an Extreme SuperHyperEdges of a an Extreme SuperHyperSet S of high an 3420
Extreme cardinality conseNeighborive an Extreme SuperHyperEdges and an Extreme 3421

SuperHyperVertices such that they form the an Extreme SuperHyperJoin; and the an 3422
Extreme power is corresponded to its an Extreme coefficient; 3423
(v) an Extreme R-SuperHyperJoin if it’s either of an Extreme e-SuperHyperJoin, 3424

SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3426
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3427

Extreme SuperHyperJoin; 3430
(vi) a an Extreme R-SuperHyperJoin if it’s either of an Extreme e-SuperHyperJoin, 3431

SuperHyperJoin and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) is 3433
the maximum an Extreme cardinality of the an Extreme SuperHyperVertices of a an 3434
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of an Extreme 3438

an Extreme rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 3440

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3443
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3444
that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 3445
its Extreme coefficient; 3446
(viii) a an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of an Extreme 3447

an Extreme rv-SuperHyperJoin and C(N SHG) for a an Extreme SuperHyperGraph 3449

of the an Extreme SuperHyperVertices of a an Extreme SuperHyperSet S of high an 3452
SuperHyperVertices such that they form the an Extreme SuperHyperJoin; and the an 3454
Extreme power is corresponded to its an Extreme coefficient. 3455

SuperHyperJoin, is up. The an Extreme Algorithm is an Extremely straightforward. 3459
E1 and E3 are some empty an Extreme SuperHyperEdges but E2 is a loop an Extreme 3460

SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperJoin. 3465
C(N SHG)an Extreme SuperHyperJoin = {E4 }.

C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)an Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .


given an Extreme SuperHyperJoin. 3473





C(N SHG)an Extreme SuperHyperJoin = {E4 , E2 }.

C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial = 2z 2 .
C(N SHG)an Extreme R-SuperHyperJoin = {V1 , V4 }.
C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial = 15z 2 .


C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)an Extreme R-SuperHyperJoin = {V5 }.
C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial = z.

C(N SHG)an Extreme SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)an Extreme R-SuperHyperJoin = {V3i+17i=0 }.
C(N SHG)an Extreme SuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)an Extreme SuperHyperJoin = {E3i+13i=0 , E23 }.

C(N SHG)an Extreme R-SuperHyperJoin = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .


3 × 3z 2 .


C(N SHG)an Extreme R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4



3 × 3z 2 .






(1 × 5 × 5) + (1 × 2 + 1)z 3 .


C(N SHG)an Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .



C(N SHG)an Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .

C(N SHG)an Extreme SuperHyperJoin = {E3i+1i=03 }.

C(N SHG)an Extreme R-SuperHyperJoin = {V2i+1i=05 }.



C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial = 10z.


C(N SHG)an Extreme R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

C(N SHG)an Extreme SuperHyperJoin =

= {Ei }i=1 3
.
C(N SHG)an Extreme SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)an Extreme R-SuperHyperJoin

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 3521
SuperHyperModel (31.1), is the SuperHyperJoin. 3524

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


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

SuperHyperModel (31.2), is the an Extreme SuperHyperJoin. 3533
C(N SHG)an Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)an Extreme Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)an Extreme R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 3535



an Extreme SuperHyperJoin. 3544
Then 3546
C(N SHG)an 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 |
Proof. Let 3547
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 3551
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3552
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3553
SuperHyperPart could have one SuperHyperVertex as the representative in the 3554
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected an Extreme SuperHyperBipartite 3555

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperJoin. 3563

Then 3565

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



based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3572
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 an Extreme SuperHyperModel (31.5), is the an Extreme SuperHyperJoin. 3583
Then, 3585

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

.

Proof. Let 3586
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected an Extreme SuperHyperWheel ESHW : 3587

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

at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 3591
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 3592
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 3593
Model (31.6), is the an Extreme SuperHyperJoin. 3598

CHAPTER 20 3599
an Extreme SuperHyperPerfect But As 3600
Super Forms 3602
Definition 20.0.1. (Different an Extreme Types of an Extreme SuperHyperPerfect). 3603

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

Va ∈ Ei , Ej ; 3607
(ii) an Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 3608
Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3609
(iii) an Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3610
Vi , Vj ∈ Ea ; 3611
(iv) an Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3612
Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3613
(v) an Extreme SuperHyperPerfect if it’s either of an Extreme e-SuperHyperPerfect, 3614
an Extreme re-SuperHyperPerfect, an Extreme v-SuperHyperPerfect, and an Extreme 3615

rv-SuperHyperPerfect. 3616
Definition 20.0.2. ((an Extreme) SuperHyperPerfect). 3617

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3622
Extreme SuperHyperPerfect; 3626
179
(ii) a an Extreme SuperHyperPerfect if it’s either of an Extreme e-SuperHyperPerfect, 3627

rv-SuperHyperPerfect and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3629
SuperHyperPerfect; 3633
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of an 3634
Extreme e-SuperHyperPerfect, an Extreme re-SuperHyperPerfect, an Extreme v- 3635

SuperHyperPerfect, and an Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3636
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality of 3638
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 3639
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3640
they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3641
Extreme coefficient; 3642
(iv) a an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of an 3643

SuperHyperPerfect, and an Extreme rv-SuperHyperPerfect and C(N SHG) for a an 3645
Extreme SuperHyperVertices such that they form the an Extreme SuperHyperPerfect; 3650
(v) an Extreme R-SuperHyperPerfect if it’s either of an Extreme e-SuperHyperPerfect, 3652

(vi) a an Extreme R-SuperHyperPerfect if it’s either of an Extreme e-SuperHyperPerfect, 3659

rv-SuperHyperPerfect and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3661
SuperHyperPerfect; 3665
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of an 3666

SuperHyperPerfect, and an Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3668
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 3669

the Extreme coefficients defined as the Extreme number of the maximum Extreme 3670
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; and the Extreme 3673
(viii) a an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of an 3675

SuperHyperPerfect, and an Extreme rv-SuperHyperPerfect and C(N SHG) for a an 3677
Extreme SuperHyperVertices such that they form the an Extreme SuperHyperPerfect; 3682

SuperHyperPerfect, is up. The an Extreme Algorithm is an Extremely straightforward. 3687

SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperPerfect. 3693
C(N SHG)an Extreme SuperHyperPerfect = {E4 }.

C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)an Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.

given an Extreme SuperHyperPerfect. 3701





C(N SHG)an Extreme SuperHyperPerfect = {E4 , E2 }.

C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial = 2z 2 .
C(N SHG)an Extreme R-SuperHyperPerfect = {V1 , V4 }.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial = 15z 2 .


C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.

C(N SHG)an Extreme SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial 6z 8 .
C(N SHG)an Extreme R-SuperHyperPerfect = {V3i+17i=0 }.
C(N SHG)an Extreme SuperHyperPerfect = {E15 , E16 , E17 }.

C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial = z 3 .
C(N SHG)an Extreme R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .


3 × 4 × 4z 3 .

C(N SHG)an Extreme Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

C(N SHG)an Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .
C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V3i+13i=0 , V15 }.
C(N SHG)an Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .


3 × 4 × 4z 3 .


3 × 2z 2 .


C(N SHG)an Extreme R-SuperHyperPerfect = {V1 , Vii610=5,7,8 }.
i=4



3 × 3z 2 .






C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V2 , V7 , V17 }.
C(N SHG)an Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .


C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .



C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .

C(N SHG)an Extreme SuperHyperPerfect = {E3i+1i=03 }.

C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)an Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .





C(N SHG)an Extreme R-Quasi-SuperHyperPerfect = {V3 , V6 }.
C(N SHG)an Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

C(N SHG)an Extreme SuperHyperPerfect =

= {Ei }i=1 3
.
C(N SHG)an Extreme SuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)an Extreme R-SuperHyperPerfect

.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 3745
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3749
SuperHyperModel (31.1), is the SuperHyperPerfect. 3752
C(N SHG)an Extreme SuperHyperPerfect =

= {Ei }i=1 3
.
= 3z 3 .
C(N SHG)an Extreme R-SuperHyperPerfect


.
C(N SHG)an Extreme R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 3754
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



an Extreme SuperHyperPerfect. 3772
Then 3774
C(N SHG)an 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)an Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 3775
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 3779
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3780
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3781
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected an Extreme SuperHyperBipartite 3784
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperPerfect. 3792

Then 3794

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)an Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 3795
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected an Extreme SuperHyperMultipartite 3796



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

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

is a longest SuperHyperPerfect taken from a connected an Extreme SuperHyperWheel 3817


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3820
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3821
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3822
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3823
Model (31.6), is the an Extreme SuperHyperPerfect. 3829

CHAPTER 21 3830
an Extreme SuperHyperTotal But As The 3831
Extensions Excerpt From Dense And 3832
Super Forms 3833
Definition 21.0.1. (Different an Extreme Types of an Extreme SuperHyperTotal). 3834

(i) an Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 3837

Va ∈ Ei , Ej ; 3838
(ii) an Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 3839
(iii) an Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 3841
Vi , Vj ∈ Ea ; 3842
(iv) an Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 3843
(v) an Extreme SuperHyperTotal if it’s either of an Extreme e-SuperHyperTotal, an 3845
Extreme re-SuperHyperTotal, an Extreme v-SuperHyperTotal, and an Extreme rv- 3846

SuperHyperTotal. 3847
Definition 21.0.2. ((an Extreme) SuperHyperTotal). 3848

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

Extreme re-SuperHyperTotal, an Extreme v-SuperHyperTotal, and an Extreme rv- 3852
SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3853
Extreme SuperHyperTotal; 3857
193
(ii) a an Extreme SuperHyperTotal if it’s either of an Extreme e-SuperHyperTotal, 3858

an Extreme re-SuperHyperTotal, an Extreme v-SuperHyperTotal, and an Extreme rv- 3859
SuperHyperTotal and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3860
SuperHyperTotal; 3864
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of an Extreme 3865
e-SuperHyperTotal, an Extreme re-SuperHyperTotal, an Extreme v-SuperHyperTotal, 3866

and an Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3867
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3872
coefficient; 3873
(iv) a an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of an Extreme 3874

and an Extreme rv-SuperHyperTotal and C(N SHG) for a an Extreme SuperHyperGraph 3876
SuperHyperVertices such that they form the an Extreme SuperHyperTotal; and the an 3881
Extreme power is corresponded to its an Extreme coefficient; 3882
(v) an Extreme R-SuperHyperTotal if it’s either of an Extreme e-SuperHyperTotal, 3883

SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3885
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3886
(vi) a an Extreme R-SuperHyperTotal if it’s either of an Extreme e-SuperHyperTotal, 3890

SuperHyperTotal and C(N SHG) for a an Extreme SuperHyperGraph N SHG : (V, E) 3892
SuperHyperTotal; 3896
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of 3897

an Extreme e-SuperHyperTotal, an Extreme re-SuperHyperTotal, an Extreme v- 3898
SuperHyperTotal, and an Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme 3899

Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3901
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3902
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3903
tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 3904
corresponded to its Extreme coefficient; 3905
(viii) a an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of an Extreme 3906

and an Extreme rv-SuperHyperTotal and C(N SHG) for a an Extreme SuperHyperGraph 3908

SuperHyperVertices such that they form the an Extreme SuperHyperTotal; and the an 3913
Extreme power is corresponded to its an Extreme coefficient. 3914

SuperHyperTotal, is up. The an Extreme Algorithm is an Extremely straightforward. 3918

SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperTotal. 3924
C(N SHG)an Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)an Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)an Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)an Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.

given an Extreme SuperHyperTotal. 3932




C(N SHG)an Extreme Quasi- = {E4 , E2 }.

C(N SHG)an Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)an Extreme R-Quasi-SuperHyperTotal = {V1 , V4 }.
C(N SHG)an Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 15z 2 .


C(N SHG)an Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)an Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)an Extreme SuperHyperTotal = {Ei+19i=0 }.

C(N SHG)an Extreme SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)an Extreme R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)an 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 Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .


C(N SHG)an Extreme SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)an 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 R-SuperHyperTotal SuperHyperPolynomial = 3z 2 .

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)an Extreme SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)an Extreme R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)an 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)an Extreme SuperHyperTotal = {E1 , E2 }.

C(N SHG)an Extreme SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)an Extreme 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)an Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) an Extreme Cardinality .
C(N SHG)an Extreme SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |an Extreme Cardinality −2 .
C(N SHG)an Extreme R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) an Extreme Cardinality .
C(N SHG)an Extreme R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |an Extreme Cardinality z |EESHG:(V,E) |an Extreme Cardinality −2
Proof. Let 3976
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3980
SuperHyperModel (31.1), is the SuperHyperTotal. 3983
C(N SHG)an Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) an Extreme Cardinality .
= (|EESHG:(V,E) |an Extreme Cardinality − 1)
z |EESHG:(V,E) |an Extreme Cardinality −2 .
C(N SHG)an Extreme R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) an Extreme Cardinality .
C(N SHG)an Extreme R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |an Extreme Cardinality z |EESHG:(V,E) |an Extreme Cardinality −2

Proof. Let 3985
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |an Extreme Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |an Extreme Cardinality −1

SuperHyperModel (31.2), is the an Extreme SuperHyperTotal. 3992
C(N SHG)an Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|an Extreme Cardinality |z 2 .
C(N SHG)an Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|an Extreme Cardinality |) choose (|VESHG:(V,E)|an Extreme Cardinality | − 1)
z2.
Proof. Let 3994
P : ViEXT ERN AL , Ei , CEN T ER, Ej .


an Extreme SuperHyperTotal. 4003
Then 4005
C(N SHG)an 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)an Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 4006
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 4010
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 4011
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 4012
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected an Extreme SuperHyperBipartite 4014

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperTotal. 4022
Then 4024

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)an Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 4025
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected an Extreme SuperHyperMultipartite 4026


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

the an Extreme SuperHyperModel (31.5), is the an Extreme SuperHyperTotal. 4042
Then, 4044
∗
C(N SHG)an Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|an Extreme Cardinality
|z 2 .
C(N SHG)an Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|an Extreme Cardinality |) choose (|VESHG:(V,E)|an Extreme Cardinality | − 1)
z2.

Proof. Let 4045
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected an Extreme SuperHyperWheel ESHW : 4046


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 4050
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 4051
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 4052
Model (31.6), is the an Extreme SuperHyperTotal. 4058

CHAPTER 22 4059
an Extreme SuperHyperConnected But 4060
As The Extensions Excerpt From Dense 4061
And Super Forms 4062
Definition 22.0.1. (Different an Extreme Types of an Extreme SuperHyperConnected). 4063

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

that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 4067
(ii) an Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 4068

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 4069
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 4070
(iii) an Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 4071

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 4072
(iv) an Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 4073

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 4074
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 4075
(v) an Extreme SuperHyperConnected if it’s either of an Extreme e-SuperHyperConnected,4076

an Extreme re-SuperHyperConnected, an Extreme v-SuperHyperConnected, and an 4077
Extreme rv-SuperHyperConnected. 4078
Definition 22.0.2. ((an Extreme) SuperHyperConnected). 4079
(i) an Extreme SuperHyperConnected if it’s either of an Extreme e-SuperHyperConnected,4082

an Extreme re-SuperHyperConnected, an Extreme v-SuperHyperConnected, and an 4083
Extreme rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 4084
207

that they form the Extreme SuperHyperConnected; 4088
(ii) a an Extreme SuperHyperConnected if it’s either of an Extreme e- 4089

SuperHyperConnected, an Extreme re-SuperHyperConnected, an Extreme v- 4090
SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for a 4091
an Extreme SuperHyperGraph N SHG : (V, E) is the maximum an Extreme cardinality 4092

SuperHyperVertices such that they form the an Extreme SuperHyperConnected; 4095
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of an 4096

Extreme e-SuperHyperConnected, an Extreme re-SuperHyperConnected, an Extreme 4097
v-SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for 4098
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 4099

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 4101
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 4102
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 4103
Extreme power is corresponded to its Extreme coefficient; 4104
(iv) a an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of an 4105

v-SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for a 4107
an Extreme SuperHyperGraph N SHG : (V, E) is the an Extreme SuperHyperPolynomial 4108

Extreme SuperHyperVertices such that they form the an Extreme SuperHyperConnected; 4112
(v) an Extreme R-SuperHyperConnected if it’s either of an Extreme e- 4114

SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for an 4116
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 4117

Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 4118
in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme 4119
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 4120
(vi) a an Extreme R-SuperHyperConnected if it’s either of an Extreme e- 4121

SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for a 4123

an Extreme SuperHyperGraph N SHG : (V, E) is the maximum an Extreme cardinality 4124
SuperHyperVertices such that they form the an Extreme SuperHyperConnected; 4127
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of an 4128

v-SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for 4130

(viii) a an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of an 4137

v-SuperHyperConnected, and an Extreme rv-SuperHyperConnected and C(N SHG) for a 4139
an Extreme SuperHyperGraph N SHG : (V, E) is the an Extreme SuperHyperPolynomial 4140

Extreme SuperHyperVertices such that they form the an Extreme SuperHyperConnected; 4144

SuperHyperConnected, is up. The an Extreme Algorithm is an Extremely straightforward. 4149

SuperHyperVertex, V3 , is excluded in every given an Extreme SuperHyperConnected. 4155
C(N SHG)an Extreme SuperHyperConnected = {E4 }.

C(N SHG)an Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)an Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)an Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.


given an Extreme SuperHyperConnected. 4163




C(N SHG)an Extreme SuperHyperConnected = {E1 , E2 , E4 }.

C(N SHG)an Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)an Extreme R-Quasi-SuperHyperConnected = {V1 , V4 }.
C(N SHG)an Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 15z 2 .


C(N SHG)an Extreme SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)an Extreme R-SuperHyperConnected SuperHyperPolynomial = z.

C(N SHG)an Extreme Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)an Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)an Extreme R-Quasi-SuperHyperConnected = {Vi+19i=0 }.
C(N SHG)Extreme SuperHyperConnected = {E12 , E13 , E14 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
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)an Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)an Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)an Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

C(N SHG)Extreme SuperHyperConnected = {E5 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
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 R-Quasi-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 2 .

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 R-SuperHyperConnected SuperHyperPolynomial = 3z 2 .



C(N SHG)Extreme R-SuperHyperConnected = {V1 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.


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)an Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)an Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 10z.



C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.

C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
= 3 × 6z 3 .

C(N SHG)an Extreme Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
C(N SHG)an Extreme Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |an −2
=z Extreme Cardinality .
C(N SHG)an Extreme R-Quasi-SuperHyperConnected
= {ViEXT ERN AL }i=1 Extreme Cardinality
.
C(N SHG)an Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |an Extreme Cardinality z ESHG:(V,E) an Extreme Cardinality
Proof. Let 4207
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |an Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |an Extreme Cardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4211
SuperHyperModel (31.1), is the SuperHyperConnected. 4214
C(N SHG)an Extreme Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
= (|EESHG:(V,E) |an Extreme Cardinality − 1)
z Extreme Cardinality .
C(N SHG)an Extreme R-Quasi-SuperHyperConnected

= {ViEXT ERN AL }i=1 Extreme Cardinality
.
C(N SHG)an Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |an Extreme Cardinality z ESHG:(V,E) an Extreme Cardinality
Proof. Let 4216
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |an Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |an Extreme Cardinality −1 .

SuperHyperModel (31.2), is the an Extreme SuperHyperConnected. 4223
C(N SHG)an Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)an Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |an Extreme Cardinality z.
C(N SHG)an Extreme R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)an Extreme R-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4225



an Extreme SuperHyperConnected. 4234
Then 4236
C(N SHG)an Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)an 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)an Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 4237
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4241
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 4242
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 4243
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected an Extreme SuperHyperBipartite 4246

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
in the an Extreme SuperHyperModel (31.4), is the an Extreme SuperHyperConnected. 4254
Then 4256
C(N SHG)an Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)an 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)an Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 4257
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected an Extreme SuperHyperMultipartite 4258


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

the an Extreme SuperHyperModel (31.5), is the an Extreme SuperHyperConnected. 4275
Then, 4277
∗
C(N SHG)an Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)an Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |an Extreme Cardinality |z.
C(N SHG)an Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)an Extreme V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4278
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected an Extreme SuperHyperWheel 4279


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4282
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4283
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4284
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4285
some representatives. The latter is straightforward. 4286
Model (31.6), is the an Extreme SuperHyperConnected. 4291

CHAPTER 23 4292
Background 4293

221














Bibliography 4500
10.33140/JMTCM.01.03.09) 4504


227
10.20944/preprints202301.0282.v1). 4537
10.20944/preprints202301.0267.v1). 4540

(doi: 10.20944/preprints202301.0265.v1). 4545
prints202301.0262.v1). 4549
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4555
prints202301.0105.v1). 4558
Preprints 2023, 2023010044 4564
10.20944/preprints202301.0043.v1). 4567

(doi: 10.20944/preprints202212.0549.v1). 4576
(doi: 10.20944/preprints202212.0500.v1). 4583
10.5281/zenodo.7871026). 4592
2023, (doi: 10.5281/zenodo.7874647). 4595

10.5281/zenodo.7857856). 4598
2023, (doi: 10.5281/zenodo.7857841). 4601

10.5281/zenodo.7853867). 4610
10.5281/zenodo.7853922). 4613
(doi: 10.5281/zenodo.7851519). 4616
(doi: 10.5281/zenodo.7851550). 4619
10.5281/zenodo.7834229). 4628
10.5281/zenodo.7834261). 4631
10.5281/zenodo.7824560). 4634

(doi: 10.5281/zenodo.7824623). 4637

2023, (doi: 10.5281/zenodo.7809365). 4648
2023, (doi: 10.5281/zenodo.7809358). 4651
10.5281/zenodo.7809219). 4654
10.5281/zenodo.7809328). 4657
2023, (doi: 10.5281/zenodo.7806767). 4660
2023, (doi: 10.5281/zenodo.7806838). 4663
10.5281/zenodo.7799902). 4672
(doi: 10.5281/zenodo.7804218). 4675
(doi: 10.5281/zenodo.7796334). 4678
10.5281/zenodo.7791952). 4684

10.5281/zenodo.7791982). 4687
10.5281/zenodo.7790026). 4690
10.5281/zenodo.7790052). 4693
2023, (doi: 10.5281/zenodo.7787066). 4696
10.5281/zenodo.7781476). 4702
10.5281/zenodo.7783082). 4705
10.5281/zenodo.7777857). 4708
10.5281/zenodo.7779286). 4711
(doi: 10.5281/zenodo.7771831). 4714
2023, (doi: 10.5281/zenodo.7772468). 4717
10.13140/RG.2.2.20913.25446). 4720
odo.7764916). 4723

10.13140/RG.2.2.11770.98247). 4726
10.13140/RG.2.2.12400.12808). 4729
2023, (doi: 10.13140/RG.2.2.22545.10089). 4732
10.13140/RG.2.2.11377.76644). 4738
10.13140/RG.2.2.23750.96329). 4741
10.13140/RG.2.2.31366.24641). 4744
10.13140/RG.2.2.34721.68960). 4747
2023, (doi: 10.13140/RG.2.2.30212.81289). 4750
10.13140/RG.2.2.24288.35842). 4756
10.13140/RG.2.2.32467.25124). 4759
10.13140/RG.2.2.31025.45925). 4762

10.13140/RG.2.2.17184.25602). 4765
10.13140/RG.2.2.23423.28327). 4768
10.13140/RG.2.2.28456.44805). 4771
10.13140/RG.2.2.23525.68320). 4774
10.13140/RG.2.2.20170.24000). 4777
10.13140/RG.2.2.36475.59683). 4780
10.13140/RG.2.2.29764.71046). 4783
2023, (doi: 10.13140/RG.2.2.18780.87683). 4786
10.13140/RG.2.2.26134.01603). 4792
10.13140/RG.2.2.27392.30721). 4795
10.13140/RG.2.2.33028.40321). 4798
10.13140/RG.2.2.21389.20966). 4801

10.13140/RG.2.2.16356.04489). 4804
10.13140/RG.2.2.21756.21129). 4807
10.13140/RG.2.2.30983.68009). 4810
10.13140/RG.2.2.28552.29445). 4813
(doi: 10.13140/RG.2.2.10936.21761). 4816
10.13140/RG.2.2.35105.89447). 4819
(doi: 10.13140/RG.2.2.30072.72960). 4822
10.13140/RG.2.2.31147.52003). 4825
10.13140/RG.2.2.32825.24163). 4828
10.13140/RG.2.2.13059.58401). 4831
10.13140/RG.2.2.11172.14720). 4834
2023, (doi: 10.13140/RG.2.2.22011.80165). 4837
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4840

2023, (doi: 10.13140/RG.2.2.10493.84962). 4843
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4846
2023, (doi: 10.13140/RG.2.2.19944.14086). 4849
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4852
(doi: 10.13140/RG.2.2.33103.76968). 4855
(doi: 10.13140/RG.2.2.23037.44003). 4858
(doi: 10.13140/RG.2.2.35646.56641). 4861
10.13140/RG.2.2.18030.48967). 4864
(doi: 10.13140/RG.2.2.13973.81121). 4867
2023, (doi: 10.13140/RG.2.2.34106.47047). 4870
2023, (doi: 10.13140/RG.2.2.31956.88961). 4876
2023, (doi: 10.13140/RG.2.2.15179.67361). 4879

10.13140/RG.2.2.21510.45125). 4882
2023, (doi: 10.13140/RG.2.2.13121.84321). 4885
10.13140/RG.2.2.11758.69441). 4888
2023, (doi: 10.13140/RG.2.2.31891.35367). 4891
10.13140/RG.2.2.19360.87048). 4894
10.13140/RG.2.2.32363.21286). 4897
10.13140/RG.2.2.23266.81602). 4900
10.13140/RG.2.2.19911.37285). 4903
10.13140/RG.2.2.11050.90569). 4906
2023, (doi: 10.13140/RG.2.2.17761.79206). 4909
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4915
(doi: 10.13140/RG.2.2.30182.50241). 4918

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4960
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4963



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

10.20944/preprints202301.0282.v1). 4984
10.20944/preprints202301.0267.v1).). 4987
(doi: 10.20944/preprints202301.0265.v1). 4992
prints202301.0262.v1). 4996


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

10.13140/RG.2.2.35061.65767). 5005

10.13140/RG.2.2.18494.15680). 5009

10.13140/RG.2.2.32530.73922). 5013

10.13140/RG.2.2.15897.70243). 5017

10.13140/RG.2.2.32530.73922). 5021

prints202301.0105.v1). 5024

10.13140/RG.2.2.23172.19849). 5031


10.13140/RG.2.2.17385.36968). 5041
Preprints 2023, 2023010044 5044
10.20944/preprints202301.0043.v1). 5047
2023, (doi: 10.13140/RG.2.2.28945.92007). 5050
10.13140/RG.2.2.35774.77123). 5056

10.13140/RG.2.2.29430.88642). 5062
(doi: 10.20944/preprints202212.0549.v1). 5068
10.13140/RG.2.2.19380.94084). 5071

(doi: 10.20944/preprints202212.0500.v1). 5082
10.13140/RG.2.2.20993.12640). 5085


10.13140/RG.2.2.29173.86244). 5100
2023 (doi: 10.5281/zenodo.7874677). 5105
(doi: 10.5281/zenodo.7857906). 5107
2023 (doi: 10.5281/zenodo.7856329). 5109

10.5281/zenodo.7854561). 5111
2023 (doi: 10.5281/zenodo.7851893). 5113

(doi: 10.5281/zenodo.7835063). 5117
(doi: 10.5281/zenodo.7826705). 5119
2023 (doi: 10.5281/zenodo.7820680). 5121
10.5281/zenodo.7812750). 5123

2023 (doi: 10.5281/zenodo.7807782). 5129
2023 (doi: 10.5281/zenodo.7804449). 5131
(doi: 10.5281/zenodo.7792307). 5135
(doi: 10.5281/zenodo.7790728). 5137
2023 (doi: 10.5281/zenodo.7787712). 5139
10.5281/zenodo.7783791). 5141
10.5281/zenodo.7780123). 5143
(doi: 10.5281/zenodo.7773119). 5145

odo.7637762). 5147
10.5281/zenodo.7766174). 5149
10.5281/zenodo.7762232). 5151
(doi: 10.5281/zenodo.7758601). 5153
10.5281/zenodo.7754661). 5155
10.5281/zenodo.7750995) . 5157
(doi: 10.5281/zenodo.7749875). 5159
10.5281/zenodo.7747236). 5161
10.5281/zenodo.7742587). 5163
(doi: 10.5281/zenodo.7738635). 5165
10.5281/zenodo.7734719). 5167
10.5281/zenodo.7730484). 5169
(doi: 10.5281/zenodo.7730469). 5171
10.5281/zenodo.7722865). 5173
odo.7713563). 5175
odo.7709116). 5177
10.5281/zenodo.7706415). 5179
10.5281/zenodo.7706063). 5181

10.5281/zenodo.7701906). 5183
odo.7700205). 5185
10.5281/zenodo.7694876). 5187
10.5281/zenodo.7679410). 5189
10.5281/zenodo.7675982). 5191
10.5281/zenodo.7672388). 5193
odo.7668648). 5195
10.5281/zenodo.7662810). 5197
10.5281/zenodo.7659162). 5199
odo.7653233). 5201
odo.7653204). 5203
odo.7653142). 5205
odo.7653117). 5207
odo.7651687). 5210
odo.7651619). 5212
odo.7651439). 5214
odo.7650729). 5216

odo.7647868). 5218
odo.7647017). 5220
odo.7644894). 5222
odo.7632923). 5225
odo.7623459). 5227
10.5281/zenodo.7606416). 5229
10.5281/zenodo.7606416). 5231
odo.7606404). 5233
10.5281/zenodo.7580018). 5235
odo.7580018). 5237
odo.7580018). 5239
odo.7579929). 5241
10.5281/zenodo.7563170). 5243
odo.7563164). 5245
odo.7563160). 5247
odo.7563160). 5249
10.5281/zenodo.7563160). 5251

10.5281/zenodo.7557063). 5253
10.5281/zenodo.7557009). 5255
10.5281/zenodo.7539484). 5257
10.5281/zenodo.7523390). 5259
10.5281/zenodo.7523390). 5261
10.5281/zenodo.7523390). 5263
odo.7574952). 5265
10.5281/zenodo.7574992). 5267
odo.7523357). 5269
10.5281/zenodo.7523357). 5271
10.5281/zenodo.7504782). 5273
10.5281/zenodo.7504782). 5275
10.5281/zenodo.7504782). 5277
10.5281/zenodo.7499395). 5279
odo.7499395). 5281
10.5281/zenodo.7499395). 5283
10.5281/zenodo.7497450). 5285
10.5281/zenodo.7497450). 5287

10.5281/zenodo.7494862). 5289
odo.7494862). 5291
10.5281/zenodo.7494862). 5293
10.5281/zenodo.7493845). 5295
odo.7493845). 5297
10.5281/zenodo.7493845). 5299
odo.7539484). 5301
odo.7523390). 5303
odo.7523357). 5305
odo.7504782). 5307
odo.7499395). 5309
odo.7497450). 5311
odo.7494862). 5313
odo.7493845). 5315
odo.7480110). 5317
odo.7378758). 5319
odo.6320305). 5321
odo.6677173). 5323

CHAPTER 24 5324
Cancer In Neutrosophic 5325
SuperHyperGraph 5326
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5327
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5328
disease is considered and as the consequences of the model, some parameters are used. The cells 5329
are under attack of this disease but the moves of the cancer in the special region are the matter 5330
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5331
treatments for this Neutrosophic disease. 5332
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5333
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5334
term Neutrosophic function. 5335
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5336
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5337
move from the cancer is identified by this research. Sometimes the move of the cancer 5338
about the moves and the effects of the cancer on that region; this event leads us to 5340
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5341
perception on what’s happened and what’s done. 5342
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5343
known and they’ve got the names, and some general Neutrosophic models. The moves 5344
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5345
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5346
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5347
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5348
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5349
Models. 5350
Some cells have been faced with some attacks from the situation which is caused by the 5351
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5352
which in that, the cells could be labelled as some groups and some groups or individuals have 5353
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5354
the embedded situations, the individuals of cells and the groups of cells could be considered 5355
249
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5356
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5357
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5358
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5359
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5360
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5361
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5362
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5363
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5364
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5365
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5366
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5367
out what’s going on this phenomenon. The special case of this disease is considered and as the 5368
consequences of the model, some parameters are used. The cells are under attack of this disease 5369
but the moves of the cancer in the special region are the matter of mind. The recognition of 5370
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5371
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5372
both bases are the background of this research. Sometimes the cancer has been happened on the 5373
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5374
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5375
in the forms of alliances’ styles with the formation of the design and the architecture are 5376
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5377
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5378
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5379
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5380
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5381
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5382
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5383
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5384
and what’s done. There are some specific models, which are well-known and they’ve got the 5385
names, and some general models. The moves and the traces of the cancer on the complex tracks 5386
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5387
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5388
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5389
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5390
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5391
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5392
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5393
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5394
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5395
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5397
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5398
based on the fixed groups of cells or the fixed groups of group of cells? 5399
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5400

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5404
Then the research has taken more motivations to define SuperHyperClasses and to find some 5405
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5406
some instances and examples to make clarifications about the framework of this research. The 5407
general results and some results about some connections are some avenues to make key point of 5408
this research, “Cancer’s Recognition”, more understandable and more clear. 5409
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5410
research on the modeling of the regions where are under the attacks of the cancer to 5411
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5412
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5413
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5414
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5415

instances and literature reviews have taken the whole way through. In this scientific research, 5416
the literature reviews have fulfilled the lines containing the notions and the results. The 5417
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5418
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5419
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5420
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5421
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5422
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5423
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5424
to figure out the background for the SuperHyperNotions. 5425

CHAPTER 25 5426
Neutrosophic 5427
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5429
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5430
2023, (doi: 10.13140/RG.2.2.34953.52320). 5431
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5432
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5433
(doi: 10.13140/RG.2.2.33275.80161). 5434
10.13140/RG.2.2.11050.90569). 5437
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5438
10.13140/RG.2.2.17761.79206). 5440
10.13140/RG.2.2.19911.37285). 5443
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5444
10.13140/RG.2.2.23266.81602). 5446
10.13140/RG.2.2.19360.87048). 5449
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5450
10.13140/RG.2.2.32363.21286). 5452
10.13140/RG.2.2.11758.69441). 5455
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5456
10.13140/RG.2.2.31891.35367). 5458
253

10.13140/RG.2.2.21510.45125). 5461
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5462
10.13140/RG.2.2.13121.84321). 5464

CHAPTER 26 5465
New Ideas In Recognition of Cancer And 5466
Neutrosophic SuperHyperGraph By 5467
Eulerian-Type-Cycle-Decomposition As 5468
Hyper Decompress On Super 5469
Decompensation 5470
255
CHAPTER 27 5471
ABSTRACT 5472
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5473

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

Cycle-Decomposition criteria holds 5478
∀Ea ∈ C : C is
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called 5479

Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 5480
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5481

SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called Neutrosophic 5482
v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 5483
∀Va ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression is called 5484

Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 5485
∀Va ∈ C : C is
257
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5486

Decomposition. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Decomposition). Assume a Neutrosophic 5490
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHy- 5491
perEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian- 5492

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5496
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5497
conseNeighborive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 5498

tices such that they form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; a Neutrosophic 5499
Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5503

SuperHyperEulerian-Type-Cycle-Decomposition; an Extreme SuperHyperEulerian-Type-Cycle-Decomposition 5507

cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5513
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 5514
that they form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; and the Extreme power is 5515
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition 5516

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPoly- 5520
nomial contains the Neutrosophic coefficients defined as the Neutrosophic number of the 5521
SuperHyperEulerian-Type-Cycle-Decomposition; and the Neutrosophic power is corresponded to its 5525
Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either 5526
of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian- 5527

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

form the Extreme SuperHyperEulerian-Type-Cycle-Decomposition; a Neutrosophic V-SuperHyperEulerian- 5533
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardin- 5537
ality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5538

an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial if it’s either of 5541
Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re-SuperHyperEulerian- 5542

defined as the Extreme number of the maximum Extreme cardinality of the Extreme Super- 5546
HyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 5547
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the Ex- 5548
treme SuperHyperEulerian-Type-Cycle-Decomposition; and the Extreme power is corresponded to its 5549
Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 5550

mial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic re- 5551
SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, 5552
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition and C(N SHG) for a Neutrosophic 5553
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 5554
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5555
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5556

and the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific 5559
research, new setting is introduced for new SuperHyperNotions, namely, a SuperHyperEulerian- 5560
Type-Cycle-Decomposition and Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. Two different 5561
types of SuperHyperDefinitions are debut for them but the research goes further and the 5562
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under research 5569
to figure out the challenges make sense about ongoing and upcoming research. The special case 5570
is up. The cells are viewed in the deemed ways. There are different types of them. Some of 5571
them are individuals and some of them are well-modeled by the group of cells. These types 5572
are all officially called “SuperHyperVertex” but the relations amid them all officially called 5573
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” 5574
are chosen and elected to research about “Cancer’s Recognition”. Thus these complex and 5575
dense SuperHyperModels open up some avenues to research on theoretical segments and 5576
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 5577

collected in the form of some questions and some problems. Assume a SuperHyperGraph. 5578
Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Decomposition is a maximal 5579
of SuperHyperVertices with a maximum cardinality such that either of the following expres- 5580
sions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 5581
are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 5582
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 5583
is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Decomposition is a 5584

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

a SuperHyperEulerian-Type-Cycle-Decomposition . Since there’s more ways to get type-results to 5591
make a SuperHyperEulerian-Type-Cycle-Decomposition more understandable. For the sake of having 5592
Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to “redefine” the notion of 5593
a “SuperHyperEulerian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 5594
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5595
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Decomposition 5596

. It’s redefined a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if the mentioned Table 5597
holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy- 5598
perEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of 5599
The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5600
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5601
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5602
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5603
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5604
on a SuperHyperEulerian-Type-Cycle-Decomposition . It’s the main. It’ll be disciplinary to have the 5605
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have 5606
all SuperHyperEulerian-Type-Cycle-Decomposition until the SuperHyperEulerian-Type-Cycle-Decomposition, 5607
then it’s officially called a “SuperHyperEulerian-Type-Cycle-Decomposition” but otherwise, it isn’t a 5608

SuperHyperEulerian-Type-Cycle-Decomposition . There are some instances about the clarifications for 5609
the main definition titled a “SuperHyperEulerian-Type-Cycle-Decomposition ”. These two examples 5610
get more scrutiny and discernment since there are characterized in the disciplinary ways of 5611
the SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Decomposition . For the sake of 5612
having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to “redefine” 5613

the notion of a “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition” and a “Neutrosophic 5614
SuperHyperEulerian-Type-Cycle-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges 5615
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the 5616
usage of the position of labels to assign to the values. Assume a Neutrosophic SuperHyper- 5617
Graph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 5618
SuperHyperEulerian-Type-Cycle-Decomposition are redefined to a “Neutrosophic SuperHyperEulerian- 5619

Type-Cycle-Decomposition” if the intended Table holds. It’s useful to define “Neutrosophic” version 5620
of SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 5621
Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition more understandable. Assume a Neutro- 5622
sophic SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 5623

Table holds. Thus SuperHyperPath, SuperHyperEulerian-Type-Cycle-Decomposition, SuperHyperStar, 5624

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 5625
SuperHyperPath”, “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition”, “Neutrosophic Su- 5626
perHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 5627
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 5628
has a “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition” where it’s the strongest [the 5629
maximum Neutrosophic value from all the SuperHyperEulerian-Type-Cycle-Decomposition amid the 5630
maximum value amid all SuperHyperVertices from a SuperHyperEulerian-Type-Cycle-Decomposition 5631
.] SuperHyperEulerian-Type-Cycle-Decomposition . A graph is a SuperHyperUniform if it’s a Supe- 5632
rHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a 5633
Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s Supe- 5634
rHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5635
with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Decomposition if it’s only one SuperVertex as 5636
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5637
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5638
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5639
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5640
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 5652
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 5653
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 5654
long cycle of the move from the cancer is identified by this research. Sometimes the move of 5655
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 5656
neutrality about the moves and the effects of the cancer on that region; this event leads us 5657
moves and the traces of the cancer on the complex tracks and between complicated groups 5661
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 5662
Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyper- 5663
Wheel). The aim is to find either the longest SuperHyperEulerian-Type-Cycle-Decomposition or the 5664
strongest SuperHyperEulerian-Type-Cycle-Decomposition in those Neutrosophic SuperHyperModels. 5665

For the longest SuperHyperEulerian-Type-Cycle-Decomposition, called SuperHyperEulerian-Type-Cycle- 5666
Decomposition, and the strongest SuperHyperEulerian-Type-Cycle-Decomposition, called Neutrosophic 5667
SuperHyperEulerian-Type-Cycle-Decomposition, some general results are introduced. Beyond that in 5668
SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not 5669

enough since it’s essential to have at least three SuperHyperEdges to form any style of a 5670
SuperHyperEulerian-Type-Cycle-Decomposition. There isn’t any formation of any SuperHyperEulerian- 5671
Type-Cycle-Decomposition but literarily, it’s the deformation of any SuperHyperEulerian-Type-Cycle- 5672
Decomposition. It, literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic 5673
SuperHyperEulerian-Type-Cycle-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHy- 5674
perGraphs theory are proposed. 5675
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Decomposition, Can- 5676
cer’s Neutrosophic Recognition 5677

CHAPTER 28 5679
Applied Notions Under The Scrutiny Of 5680
The Motivation Of This Scientific 5681
Research 5682
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5683
try to bring the motivations in the narrative ways. Some cells have been faced with some 5684
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5685
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5686
as some groups and some groups or individuals have excessive labels which all are raised from 5687
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5688
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5689
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5690
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5691
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5692
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5693
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5694
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5695
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5696
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5697
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5698
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5699
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5700
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5701
case of this disease is considered and as the consequences of the model, some parameters are used. 5702
The cells are under attack of this disease but the moves of the cancer in the special region are the 5703
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5704
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5705
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5706
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 5707
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 5709
the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Decomposition” in the themes of 5710
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 5711
263
figure out the background for the SuperHyperNotions. The recognition of the cancer in the long- 5712
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5713
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5716
well-known and they’ve got the names, and some general models. The moves and the traces of 5719
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5720
by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type-Cycle-Decomposition, SuperHyperStar, 5721
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5722
the optimal SuperHyperEulerian-Type-Cycle-Decomposition or the Neutrosophic SuperHyperEulerian- 5723
Type-Cycle-Decomposition in those Neutrosophic SuperHyperModels. Some general results are 5724

introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s 5725
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 5726
SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Decomposition. There isn’t 5727
any formation of any SuperHyperEulerian-Type-Cycle-Decomposition but literarily, it’s the deformation 5728
of any SuperHyperEulerian-Type-Cycle-Decomposition. It, literarily, deforms and it doesn’t form. 5729
amount of SuperHyperEulerian-Type-Cycle-Decomposition” of either individual of cells or the groups of cells 5731

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5732
Type-Cycle-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 5733
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5734
these messy and dense SuperHyperModels where embedded notions are illustrated? 5735
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 5736
it motivates us to define different types of “ SuperHyperEulerian-Type-Cycle-Decomposition” and “Neut- 5737
rosophic SuperHyperEulerian-Type-Cycle-Decomposition” on “SuperHyperGraph” and “Neutrosophic 5738

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5739
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5740
motivates us to get some instances and examples to make clarifications about the framework of 5741
this research. The general results and some results about some connections are some avenues to 5742
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5743
The framework of this research is as follows. In the beginning, I introduce basic definitions to 5744
clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHy- 5745
perGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth-discussed. 5746
The elementary concepts are clarified and illustrated completely and sometimes review literature 5747
are applied to make sense about what’s going to figure out about the upcoming sections. The main 5748
definitions and their clarifications alongside some results about new notions, SuperHyperEulerian- 5749
Type-Cycle-Decomposition and Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, are figured out 5750

in sections “ SuperHyperEulerian-Type-Cycle-Decomposition” and “Neutrosophic SuperHyperEulerian-Type- 5751
Cycle-Decomposition”. In the sense of tackling on getting results and in Eulerian-Type-Cycle-Decomposition 5752
to make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 5753
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 5754
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 5755
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 5756

there are some smart steps toward the common notions to extend the new notions in new 5757
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results 5758
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 5759
about the general SuperHyperRelations and as concluding and closing section of theoretical 5760
research are contained in the section “General Results”. Some general SuperHyperRelations 5761
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 5762
discussed in the sections, “General Results”, “ SuperHyperEulerian-Type-Cycle-Decomposition”, “Neut- 5763

rosophic SuperHyperEulerian-Type-Cycle-Decomposition”, “Results on SuperHyperClasses” and “Results 5764
on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done about 5765
the SuperHyperNotions to make sense about excellency of this research and going to figure 5766
out the word “best” as the description and adjective for this research as presented in section, 5767
“ SuperHyperEulerian-Type-Cycle-Decomposition”. The keyword of this research debut in the section 5768
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5769
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5770
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5771
are some scrutiny and discernment on what’s done and what’s happened in this research in 5772
the terms of “questions” and “problems” to make sense to figure out this research in featured 5773
style. The advantages and the limitations of this research alongside about what’s done in this 5774
research to make sense and to get sense about what’s figured out are included in the section, 5775
“Conclusion and Closing Remarks”. 5776

CHAPTER 29 5777
Neutrosophic Preliminaries Of This 5778
Scientific Research On the Redeemed 5779
Ways 5780
In this section, the basic material in this scientific research, is referred to [Single Valued 5781
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5782

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5783
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5784
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5785
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5786
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5787
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5788
their clarifications are addressed to Ref.[HG38]. 5789
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5790
the new ideas and their clarifications are elicited. 5791
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 [. 5792
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}.
267

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). 5793
where 5795
1, 2, . . . , n0 ); 5800
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5801
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5802

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5831
x, y, z, w ∈ [0, 1]: 5832
(i) 1 ⊗ x = x; 5833
(ii) x ⊗ y = y ⊗ x; 5834
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5835
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5836

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

where 5839

1, 2, . . . , n0 ); 5844
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5845
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5846
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5847
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5848
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5860
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5861
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5862
SuperEdge; 5868
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5871
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5872
makes the patterns and regularities. 5873
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5874
of elements of SuperHyperEdges are the same. 5875

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5876
makes to have SuperHyperUniform more understandable. 5877
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5878
Classes as follows. 5879
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5880
two given SuperHyperEdges with two exceptions; 5881
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5882
SuperHyperEdges; 5883
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5884
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5885
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5886
in common; 5887
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5888
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5889
SuperHyperEdge in common; 5890
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5891
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5892
SuperVertex. 5893
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 5894
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5895
(i) Vi , Vi+1 ∈ Ei0 ; 5896
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5897
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5898
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5899
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5900
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5901
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5902
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5903
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5905
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5906
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5907
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5908
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5909
perPath . 5910
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 5911
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5912
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5913
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5914
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5915
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5916

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 5929
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 5930
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 5931
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian-Type-Cycle- 5932

Decomposition). 5933
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression 5937

is called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 5938
∀Ea ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition if the following expres- 5939

sion is called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Decomposition criteria 5940
holds 5941
∀Ea ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5942
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition if the following expression 5943

is called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria holds 5944
∀Va ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Decomposition if the following expres- 5945

sion is called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition criteria 5946
holds 5947
∀Va ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 5948

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neutrosophic 5949

Decomposition, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Decomposition, and Neutrosophic 5951
rv-SuperHyperEulerian-Type-Cycle-Decomposition. 5952
Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Decomposition). 5953

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


(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neut- 5964

rosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5969

(iii) an Extreme SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial 5972

Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of 5978

(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 5982


of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 5988
corresponded to its Neutrosophic coefficient; 5992

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neutrosophic 5993

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

(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Decomposition if it’s either of Neut- 6001


rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 6006
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolynomial 6009


(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition SuperHyperPolyno- 6019

of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 6025

corresponded to its Neutrosophic coefficient. 6029
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Decomposition). 6030

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


136TBL3
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6034
|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 6035
(29.1), holds if S is an δ−SuperHyperDefensive; 6036
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Decomposition is a Neutrosophic kind 6037

of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition such that either of the following 6038
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6039
of s ∈ S : 6040
|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 6041
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6042
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need 6043

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6052
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Decomposition, SuperHyperStar, 6053
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6054
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6055
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6056
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6057
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type- 6058
. 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-Cycle-Decomposition more Neutrosophicly understandable. 6060

For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, there’s a need to 6061
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition”. 6062
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 6063
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 6064
values. 6065
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Cycle-Decomposition. It’s redefined a Neut- 6066
rosophic SuperHyperEulerian-Type-Cycle-Decomposition if the Table (29.3) holds. 6067

CHAPTER 30 6068
Neutrosophic SuperHyper But Eulerian-Type-Cycle-Decomposition 6069
Definition 30.0.1. (Neutrosophic event). 6072
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6073
is a probability Eulerian-Type-Cycle-Decomposition. Any Neutrosophic k-subset of A of V is called 6074
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6075
Neutrosophic event. The following expression is called Neutrosophic probability of 6076
A. 6077
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6078

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6079
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. s Neutrosophic k-events Ai , i ∈ I 6080
is called Neutrosophic s-independent if the following expression is called Neutrosophic 6081
s-independent criteria 6082
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. 6083

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

is a probability Eulerian-Type-Cycle-Decomposition. Any k-function Eulerian-Type-Cycle-Decomposition like E 6087
is called Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Decomposition 6088

like E is called Neutrosophic Variable. 6089
The notion of independent on Neutrosophic Variable is likewise. 6090
279
Definition 30.0.4. (Neutrosophic Expectation). 6091

is a probability Eulerian-Type-Cycle-Decomposition. A Neutrosophic k-Variable E has a number is called 6093
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6094
criteria 6095
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6096

is a probability Eulerian-Type-Cycle-Decomposition. A Neutrosophic number is called Neutrosophic 6098

Crossing if the following expression is called Neutrosophic Crossing criteria 6099
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). 6100
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let m and n propose special 6101
Eulerian-Type-Cycle-Decomposition. Then with m ≥ 4n, 6102
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-Cycle-Decomposition p := 4n/m, and set H := G[S]
and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6103
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6104
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6105
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let P be a SuperHyperSet of 6106
n points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6107
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6108

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 6109

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

SuperHyperPoints on the SuperHyperCircles that pass through at least three SuperHyperPoints 6125
of P. Then 6126
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 6127

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

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6138
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let Xn be a nonnegative integer- 6139
valued variable in a probability Eulerian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6140
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6141
Proof. 6142
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. A special SuperHyperGraph in 6144
Gn,p almost surely has stability number at most d2p−1 log ne. 6145
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6146
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. A special SuperHyperGraph in Gn,p 6147
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6148
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6149
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6150
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6151
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6152
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6153
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 6154
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6155

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: 6156
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6157
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 6158
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6159
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6160
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6161
Definition 30.0.12. (Neutrosophic Variance). 6162
is a probability Eulerian-Type-Cycle-Decomposition. A Neutrosophic k-Variable E has a number is 6164
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 6165
criteria 6166
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let X be a Neutrosophic Variable 6168
and let t be a positive real number. Then 6169
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let X be a Neutrosophic Variable and 6171
let t be a positive real number. Then 6172
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6173
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let Xn be a Neutrosophic 6175

Variable in a probability Eulerian-Type-Cycle-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 6176
V (Xn ) << E 2 (Xn ), then 6177
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Set X := Xn and t := |Ex(Xn )| in 6179
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6180
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6181
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 6183
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 6184
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6185
S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. As in the proof of related Theorem, the 6187
result is straightforward. 6188
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ 6190
be as defined in previous Theorem. Then either: 6191
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6192
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6193

Definition 30.0.17. (Neutrosophic Threshold). 6196

is a probability Eulerian-Type-Cycle-Decomposition. Let P be a monotone property of SuperHyperGraphs 6198
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6199
for P is a function f (n) such that: 6200
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6201
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6202
Definition 30.0.18. (Neutrosophic Balanced). 6203
is a probability Eulerian-Type-Cycle-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. 6205
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6206
SubSuperHyperGraph is called Neutrosophic Balanced. 6207
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Decomposition. Let F be a nonempty 6209
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6210
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6211
SubSuperHyperGraph. 6212
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6215
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6216
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6217
SuperHyperEulerian-Type-Cycle-Decomposition, is up. The Neutrosophic Algorithm is Neutro- 6218

sophicly straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 6219
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6220
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6221
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6222
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6223
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6224

Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 6225
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Decomposition

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

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

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

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

but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyper- 6230
Neighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 6231
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 6232
HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 6233
V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 6234

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


sophicly straightforward. 6238

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


= {{E4 , E1 , E5 , E4 }}.
= z4.




= {{V1 , V2 , {N }, {F }, V3 , {H}, V4 , V1 }}.
= z8.
6243




= {{E1 }, {E2 }, {E3 }, {E4 }}.
= 4z.
= {{Vi=15 }, {Vi=68 , V5 }, {Vi=912 , V5 }, {Vi=1315 , V5 }}.
= 2z 5 + 2z 4 .
6247


= {{Ei=110 ,Ei=2332 ,E
12 ,E22 },...}.



= az 22 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
6251


= {{Ei=110 ,E17 ,E14 ,E13 ,E15 },...}.
= z 14 .
= {{Vi ∈ VN SHG }}.


= z |VN SHG | .
6255


= {{E3 }, {E2 }, {E1 }, {E4 }}.
= 4z.
= {{Vi=13 , V12 }, {Vi=47 , V13 }, {Vi=912 , V5 }, {Vi=811 , V14 }}.
= 2z 5 + z 4 + z 3 .
6259



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

= az 13 .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
6263


= {{E1 , E6 , E2 , E7 , E3 , E4 , E5 , E1 }}.
= z |EN SHG | .
= {{Vi ∈ VN SHG }}.


= z |VN SHG | .
6267


= {E1 , E6 , E5 , E4 , E7 , E1 , . . .}.
= 2z 3 + 4z 2 + . . . .
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
6271






= {{E1 }, Ei=26 }.
= z 5 + 5z 2 .
= {{V1 , V2 , V3 , V7 , V8 }, . . .}.
= z5 + . . . .
6275


= {E1 , E6 , E5 , E4 , E2 , E3 , E7 , E10 , E9 , E1 , . . .}.
= 2z 3 + 7z 2 + . . . .



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


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




= {{Ei=15 }}.
= 5z 2 .
= {{V{Ei=15 } }}.
= 5z 2 .
6287




= {{Ei=15 }}.
5
X
= z |{Ei=15 }| .
i=1
= {{V{Ei=15 } }}.
5
|{V{E }|
X
}
= z i=15 .
i=1
6291


= {{Ei=16 }}.



6
X
= z |{Ei=16 }| .
i=1
= {{V{Ei=16 } }}.
6
|{V{E }|
X
}
= z i=16 .
i=1
6295


= {{Ei=16 }}.
6
X
= z |{Ei=16 }| .
i=1
= {{V{Ei=16 } }}.


6
|{V{E }|
X
}
= z i=16 .
i=1
6299


= {{Ei=112 }}.
= 12z.
= {{Vi ∈ VN SHG }}.
= z |VN SHG | .
6303






= {{Ei=110 }}.
10
X
= z |{Ei=110 }| .
i=1
= {{V{Ei=110 } }}.
10
|{V{E }|
X
}
= z i=110 .
i=1
6307


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

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


Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2

= {{Ei=25 }, . . .}.
5
X
= z |{Ei=25 }| + . . . .
i=2
= {{V{Ei=25 } }, . . .}.
5
|{V{E }|
X
}
= z i=25 + ....
i=2
6315
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6316
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Cycle- 6317
Decomposition if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6318
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6319
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6320
of them. 6321

Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6322

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6323
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6324
Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor 6325
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6326
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 6327
Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor to 6328

some of them but not all of them. 6329
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-Cycle-Decomposition is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Cycle- 6330
Decomposition is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6331
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6332
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6333
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6334
to Neutrosophic Eulerian-Type-Cycle-Decomposition in some cases but the maximum number of the 6335
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 6336
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6337
R-Eulerian-Type-Cycle-Decomposition. 6338
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Eulerian-Type-Cycle-Decomposition has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Eulerian-Type-Cycle-Decomposition with the least Neutrosophic 6339

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

(V, E). Then in the worst case, literally, 6342
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−Decomposition

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

lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Cycle-Decomposition is 6344
the cardinality of 6345

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

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

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

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

bound for the cardinality, of a quasi-R-Eulerian-Type-Cycle-Decomposition is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-
types but the SuperHyperStable is only up in this quasi-R-Eulerian-Type-Cycle-Decomposition. It’s
the contradiction to that fact on the generality. There are some counterexamples to deny
this statement. One of them comes from the setting of the graph titled path and cycle as the
counterexamples-classes or reversely direction star as the examples-classes, are well-known classes

in that setting and they could be considered as the examples-classes and counterexamples-classes
for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Eulerian-Type-Cycle-Decomposition decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with
the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices
are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside
each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t
matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Eulerian-Type-Cycle-Decomposition. Since at least two Neutrosophic SuperHyperVertices involve
to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic version
of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one
Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting. With these
Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic
SuperHyperEdge thus there’s at least a Neutrosophic R-Eulerian-Type-Cycle-Decomposition has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Eulerian-
Type-Cycle-Decomposition has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a
Neutrosophic R-Eulerian-Type-Cycle-Decomposition since either the Neutrosophic SuperHyperGraph is
an obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Eulerian-Type-Cycle-Decomposition” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first

Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Eulerian-Type-Cycle-Decomposition is the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet
But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that
Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

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

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common

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

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

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

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

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6346
Neutrosophic R-Eulerian-Type-Cycle-Decomposition =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6347
Neutrosophic R-Eulerian-Type-Cycle-Decomposition =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition where E ∈

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

of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Supe- 6350
rHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6351
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6352
to Neutrosophic Eulerian-Type-Cycle-Decomposition in some cases but the maximum number of the 6353
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic Su- 6354
perHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6355

R-Eulerian-Type-Cycle-Decomposition. 6356
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6357
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6358
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6359
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6360
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6361
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6362
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6363
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6364
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6365
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6366
tices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition where the Neutrosophic 6367

completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6368
embedded R-Eulerian-Type-Cycle-Decomposition. The SuperHyperNotions of embedded SuperHyperSet 6369
and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets 6370
only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is 6371
elected such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCar- 6372
dinality and they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of 6373
Neutrosophic SuperHyperVertices are included in the minimum Neutrosophic style of the em- 6374
bedded Neutrosophic R-Eulerian-Type-Cycle-Decomposition. The interior types of the Neutrosophic 6375
SuperHyperVertices are deciders. Since the Neutrosophic number of SuperHyperNeighbors 6376
are only affected by the interior Neutrosophic SuperHyperVertices. The common connections, 6377
more precise and more formal, the perfect unique connections inside the Neutrosophic Supe- 6378
rHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic 6379

R-Eulerian-Type-Cycle-Decomposition. Thus Neutrosophic exterior SuperHyperVertices could be used 6380

only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6381
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6382
embedded Neutrosophic Eulerian-Type-Cycle-Decomposition, there’s the usage of exterior Neutrosophic 6383
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 6384
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has 6385
no connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic Super- 6386
HyperVertices with one SuperHyperElement has been ignored in the exploring to lead on 6387
the optimal case implying the Neutrosophic R-Eulerian-Type-Cycle-Decomposition. The Neutrosophic 6388
R-Eulerian-Type-Cycle-Decomposition with the exclusion of the exclusion of all Neutrosophic Super- 6389
HyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic 6390
R-Eulerian-Type-Cycle-Decomposition with the inclusion of all Neutrosophic SuperHyperVertices in one 6391
Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition. To sum 6392

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6393
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilit- 6394
ies of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6395
quasi-R-Eulerian-Type-Cycle-Decomposition minus all Neutrosophic SuperHypeNeighbor to some of them 6396
but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6397
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6398

quasi-R-Eulerian-Type-Cycle-Decomposition, minus all Neutrosophic SuperHypeNeighbor to some of 6399
them but not all of them. 6400
The main definition of the Neutrosophic R-Eulerian-Type-Cycle-Decomposition has two titles. a Neutro- 6401
sophic quasi-R-Eulerian-Type-Cycle-Decomposition and its corresponded quasi-maximum Neutrosophic 6402
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6403
number, there’s a Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition with that quasi-maximum 6404

Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6405
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6406
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Eulerian- 6407
Type-Cycle-Decompositions for all Neutrosophic numbers less than its Neutrosophic corresponded 6408
maximum number. The essence of the Neutrosophic Eulerian-Type-Cycle-Decomposition ends up but this 6409
essence starts up in the terms of the Neutrosophic quasi-R-Eulerian-Type-Cycle-Decomposition, again and 6410
more in the operations of collecting all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Decompositions 6411
acted on the all possible used formations of the Neutrosophic SuperHyperGraph to achieve one 6412
Neutrosophic number. This Neutrosophic number is 6413
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Decompositions. 6414
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Cycle-Decomposition 6415

be a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Cycle- 6416
Decomposition. Then 6417
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

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

re-formalized and redefined as follows. 6419
GNeutrosophic Eulerian-Type-Cycle-Decomposition ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6420
definition for the Neutrosophic Eulerian-Type-Cycle-Decomposition. 6421
GNeutrosophic Eulerian-Type-Cycle-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- 6422
poses the upcoming expressions.
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6424
= max zNeutrosophic Number

And then, 6425


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


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

6428

6429

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6430
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic Supe- 6431
rHyperVertices such that any amount of its Neutrosophic SuperHyperVertices are incident 6432
to a Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi- 6433
Eulerian-Type-Cycle-Decomposition” but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian- 6434
Type-Cycle-Decomposition” since “Neutrosophic Quasi-Eulerian-Type-Cycle-Decomposition” happens “Neutro- 6435

sophic Eulerian-Type-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph as initial framework 6436
and background but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutro- 6437
sophic Eulerian-Type-Cycle-Decomposition” in a Neutrosophic SuperHyperGraph as initial framework 6438
and preliminarily background since there are some ambiguities about the Neutrosophic Su- 6439
perHyperCardinality arise from it. To get orderly keywords, the terms, “Neutrosophic Supe- 6440
rHyperNeighborhood”, “Neutrosophic Quasi-Eulerian-Type-Cycle-Decomposition”, and “Neutrosophic 6441

Eulerian-Type-Cycle-Decomposition” are up. 6442

Thus, let 6443
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6444
GNeutrosophic Eulerian-Type-Cycle-Decomposition be a Neutrosophic number, a Neutrosophic SuperHy- 6445
perNeighborhood and a Neutrosophic Eulerian-Type-Cycle-Decomposition and the new terms are up. 6446
GNeutrosophic Eulerian-Type-Cycle-Decomposition ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6447
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6448
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6449
And with go back to initial structure, 6450
GNeutrosophic Eulerian-Type-Cycle-Decomposition ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =



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

6452
[zNeutrosophic
Number ]Neutrosophic Class

6453

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

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

. The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Decomposition

Is an Neutrosophic R-Eulerian-Type-Cycle-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-Cycle-Decomposition is related to the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic Super-
HyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Decomposition is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Decomposition is
a Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Decomposition is up. To
sum them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Eulerian-Type-

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Decomposition. There isn’t only less than
two Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,

Thus the non-obvious Neutrosophic R-Eulerian-Type-Cycle-Decomposition,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-

, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6454
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6455
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6456
“Neutrosophic R-Eulerian-Type-Cycle-Decomposition” 6458
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6459
Neutrosophic R-Eulerian-Type-Cycle-Decomposition, 6460
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-Cycle-Decomposition amid those obvious simple Neutrosophic
type-SuperHyperSets of the Neutrosophic Eulerian-Type-Cycle-Decomposition, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

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

lower sharp bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Cycle-Decomposition is the
cardinality of
6461
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6462

interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Cycle- 6463

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

all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6470
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6471
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6472
Consider there’s a Neutrosophic R-Eulerian-Type-Cycle-Decomposition with the least cardinality, the 6473
lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6474
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6475
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6476
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6477
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Cycle-Decomposition. Since it 6478
doesn’t have 6479
6480
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6481

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6482
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6483
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6484
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian-Type- 6485
Cycle-Decomposition. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6486
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6487

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6488
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6489
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6490
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6491
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6492
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neut- 6493
rosophic R-Eulerian-Type-Cycle-Decomposition, VESHE is up. The obvious simple Neutrosophic type- 6494
SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Decomposition, VESHE , is a Neutrosophic Su- 6495
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6496
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6497
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6498
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6499
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6500
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6501
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6502
R-Eulerian-Type-Cycle-Decomposition only contains all interior Neutrosophic SuperHyperVertices and 6503
all exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6504
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6505
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6506
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6507
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6508

The SuperHyperNotion, namely, Eulerian-Type-Cycle-Decomposition, is up. There’s neither empty Supe- 6509
rHyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutro- 6510
sophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6511
the Neutrosophic Eulerian-Type-Cycle-Decomposition. The Neutrosophic SuperHyperSet of Neutrosophic 6512

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

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

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

perGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6517
6518

rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6520
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6521
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6522
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6523
non-obvious Neutrosophic Eulerian-Type-Cycle-Decomposition is up. The obvious simple Neutrosophic 6524
type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Decomposition is a Neutrosophic 6525

SuperHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6526
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6527

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- 6528
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6529
Eulerian-Type-Cycle-Decomposition is up. To sum them up, the Neutrosophic SuperHyperSet of the 6530
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6531

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

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-
perEdges[SuperHyperVertices], 6534

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

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6536
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6537
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle- 6538

Decomposition and it’s an Neutrosophic Eulerian-Type-Cycle-Decomposition. Since it’s 6539
6540
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6542
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6543
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6544

Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6545

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic ,


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- 6547
, not:

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

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- 6550
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6551
Neutrosophic type-SuperHyperSet called the 6552
“Neutrosophic Eulerian-Type-Cycle-Decomposition ” 6553
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6554
Neutrosophic ,
is only and only 6556

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

CHAPTER 31 6558
The Neutrosophic Departures on The 6559
Theoretical Results Toward Theoretical 6560
Motivations 6561
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6562
Neutrosophic SuperHyperClasses. 6563
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6564

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

|EN SHG
X |{V{E }| .
= |z i=1|EN SHG | }
i=1
Proof. Let 6565
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
323
6566
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6567

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6572
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6573
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Cycle-Decomposition. 6574
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6575

= {{Ei }i=1|EN SHG | }.
= z |EN SHG | .
= {{Vi }i=1|VN SHG | }.
= z |VN SHG | .
Proof. Let 6576
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6577
P :

Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6583
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6584
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Cycle- 6585
Decomposition. 6586

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

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

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

|EN SHG |
X |{V{E }| .
= z i=1|EN SHG | }
i=1
Proof. Let 6588
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6589
P :

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Neutrosophic Example (42.0.9) 136NSHG20a
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6590

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6595
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6596
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6597
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6598
the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 6599

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6600
Then 6601

= {{Ei , Ej }Ei ∩Ej 6=∅ }.
= z |{Ei ,Ej }Ei ∩Ej 6=∅ | .
=z N SHG N SHG .
Proof. Let 6602
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6603
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). 6604

Decomposition could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6610
P :
V1EXT ERN AL , E1 ,

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Example (42.0.11) 136NSHG21a
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Decomposition taken from a connected Neutrosophic 6612

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

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6619
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6620
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6622

Then 6623

= {{Ei , Ej }Ei ∩Ej 6=∅ }.
= z |{Ei ,Ej }Ei ∩Ej 6=∅ | .
=z N SHG N SHG .
Proof. Let 6624
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6625
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 6627


0
Decomposition could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6632
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6634
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6635
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6639
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6640
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6641
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6642

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Cycle- 6643
Decomposition. 6644
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6645
Then, 6646

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


= {{Vi }i=1|VN SHG | }.
= z |VN SHG | .
Proof. Let 6647
P :
CEN T ER, E2∗
6648
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Decomposition. Thus the 6653
notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle- 6654
Decomposition could be applied. The unique embedded SuperHyperEulerian-Type-Cycle-Decomposition 6655

proposes some longest SuperHyperEulerian-Type-Cycle-Decomposition excerpt from some representatives. 6656
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6658
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6659
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6660
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6661
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 6662

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in the Neutrosophic Example
(42.0.15) 136NSHG23a

CHAPTER 32 6663
The Surveys of Mathematical Sets On 6664
The Results But As The Initial Motivation 6665
For the SuperHyperEulerian-Type-Cycle-Decomposition, Neutrosophic SuperHyperEulerian-Type-Cycle- 6666

, and the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition, some general results
Decomposition 6667
are introduced. 6668
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition is 6669

“redefined” on the positions of the alphabets. 6670
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. Then 6671
N eutrosophic SuperHyperEulerian − T ype − Cycle − Decomposition =

{theSuperHyperEulerian − T ype − Cycle − Decompositionof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − Decomposition
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−Cycle−Decomposition. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6672
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6673
the neutrality, for i = 1, 2, 3, respectively. 6674
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6675
of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition and 6676
SuperHyperEulerian-Type-Cycle-Decomposition coincide. 6677
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6678
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6679
SuperHyperEulerian-Type-Cycle-Decomposition if and only if it’s a SuperHyperEulerian-Type-Cycle-Decomposition. 6680
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6681
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6682
SuperHyperEulerian-Type-Cycle-Decomposition if and only if it’s a longest SuperHyperEulerian-Type-Cycle- 6683
Decomposition. 6684
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6685

identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition is 6686
its SuperHyperEulerian-Type-Cycle-Decomposition and reversely. 6687
335
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 6688

Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) 6689
on the same identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle- 6690
Decomposition is its SuperHyperEulerian-Type-Cycle-Decomposition and reversely. 6691
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6692

SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its SuperHyperEulerian- 6693
Type-Cycle-Decomposition isn’t well-defined. 6694
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6695

its Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its 6696

Decomposition 6699
Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition isn’t well-defined if and only if its 6700
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6702

SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its SuperHyperEulerian-Type- 6703
Cycle-Decomposition is well-defined. 6704
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6705
its Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its 6706


Decomposition 6709
Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition is well-defined if and only if its 6710
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6712
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6713
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6714
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6715
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6716
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6717
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 6718
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6719
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6722

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

independent SuperHyperSet is 6727
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6730
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6734

Graph which is a SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath. Then V is a maximal 6735
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6739
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6740
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6741
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6743

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6744
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6748
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6749
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6750
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6752

perGraph which is a SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath. Then the number 6753
of 6754

(i) : the SuperHyperEulerian-Type-Cycle-Decomposition; 6755
(ii) : the SuperHyperEulerian-Type-Cycle-Decomposition; 6756
(iii) : the connected SuperHyperEulerian-Type-Cycle-Decomposition; 6757
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 6758
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 6759
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition. 6760
coincide. 6762

Graph which is a SuperHyperWheel. Then the number of 6764
(i) : the dual SuperHyperEulerian-Type-Cycle-Decomposition; 6765
(ii) : the dual SuperHyperEulerian-Type-Cycle-Decomposition; 6766
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Decomposition; 6767
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 6768
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition; 6769
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Decomposition. 6770
coincide. 6772
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6773

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


plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6786
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6787
SuperHyperPart is a 6788
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6792
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6793
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 6794

plete SuperHyperMultipartite. Then Then the number of 6797
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6804
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6805
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6807
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6808
(iv) : SuperHyperEulerian-Type-Cycle-Decomposition; 6812

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6815
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6816
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6817
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6818

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6826
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6827
of dual 6828
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6832

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6836
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6837

is SuperHyperEulerian-Type-Cycle-Decomposition/SuperHyperPath/SuperHyperWheel. The number is 6838
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a 6839
dual 6840
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6844
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition; 6845

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition. 6846

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


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

dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition, then ∀v ∈ V \ S, ∃x ∈ S such 6862
that 6863
(i) v ∈ Ns (x); 6864
(ii) vx ∈ E. 6865
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6866

a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Decomposition, then 6867
(i) S is SuperHyperEulerian-Type-Cycle-Decomposition set; 6868
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6869
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6870
(i) Γ ≤ O; 6871
(ii) Γs ≤ On . 6872
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6873
connected. Then 6874
(i) Γ ≤ O − 1; 6875
(ii) Γs ≤ On − Σ3i=1 σi (x). 6876
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6877


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6881
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6882
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6884
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6885
Decomposition; 6886
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6887
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6888
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6889
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Decomposition. 6891

Then 6892
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6893
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6895
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6896
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6897
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Decomposition. 6899

Then 6900
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6904
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6905
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6907
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Decomposition; 6908
(ii) Γ = 1; 6909

(iii) Γs = Σ3i=1 σi (c); 6910
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle- 6911
Decomposition. 6912
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6913
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6914
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6916
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6917
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6918
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6920
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type- 6921
Cycle-Decomposition; 6922
(ii) Γ = b n2 c + 1; 6923

b n c+1 ; 6924
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6925
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6927
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6928
Decomposition; 6929
(ii) Γ = b n2 c; 6930

bnc ; 6931
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6932
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6934

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

Type-Cycle-Decomposition for N SHF; 6937
(ii) Γ = m for N SHF : (V, E); 6938
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6939

(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6940
Cycle-Decomposition for N SHF : (V, E). 6941
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 6942

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6943
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6944
SuperHyperEulerian-Type-Cycle-Decomposition for N SHF; 6945
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6946
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 6947
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperEulerian-Type-Cycle- 6948
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6950

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6951
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6952
Decomposition for N SHF : (V, E); 6953
(ii) Γ = b n2 c for N SHF : (V, E); 6954
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 6955
S={vi }i=1
bnc
are only dual maximal SuperHyperEulerian-Type-Cycle- 6956
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6960

SuperHyperEulerian-Type-Cycle-Decomposition, then S is an s-SuperHyperDefensive SuperHyperEulerian-6961

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

SuperHyperEulerian-Type-Cycle-Decomposition, then S is an s-SuperHyperPowerful SuperHyperEulerian-6969

SuperHyperEulerian-Type-Cycle-Decomposition, then S is a dual s-SuperHyperPowerful 6972

Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6974

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

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

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

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

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

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


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

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


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1 2 c + 1, then ESHG : (V, E) is a dual 2- 7008

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

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


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

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

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


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

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

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


CHAPTER 33 7036
Neutrosophic Applications in Cancer’s 7037
Neutrosophic Recognition 7038
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7039
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7040
disease is considered and as the consequences of the model, some parameters are used. The cells 7041
are under attack of this disease but the moves of the cancer in the special region are the matter 7042
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7043
treatments for this Neutrosophic disease. 7044
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7045
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7046
term Neutrosophic function. 7047
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7048
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7049
move from the cancer is identified by this research. Sometimes the move of the cancer 7050
about the moves and the effects of the cancer on that region; this event leads us to 7052
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7053
perception on what’s happened and what’s done. 7054
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7055
known and they’ve got the names, and some general Neutrosophic models. The moves 7056
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7057
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 7058
Type-Cycle-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 7059
SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperEulerian- 7060

Type-Cycle-Decomposition or the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition in those 7061
Neutrosophic Neutrosophic SuperHyperModels. 7062
347
CHAPTER 34 7063
Case 1: The Initial Neutrosophic Steps 7064
Toward Neutrosophic 7065
SuperHyperBipartite as Neutrosophic 7066
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7068
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7069
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

349
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7070
perBipartite is obtained. 7071
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7072
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7073
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7074
(34.1), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 7075

CHAPTER 35 7076
Case 2: The Increasing Neutrosophic 7077
Steps Toward Neutrosophic 7078
SuperHyperMultipartite as 7079
Neutrosophic SuperHyperModel 7080
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7081
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7082
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7083
perMultipartite is obtained. 7084
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7085
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

351
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 7086

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7087
Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition. 7088

CHAPTER 36 7089
Wondering Open Problems But As The 7090
Directions To Forming The Motivations 7091
In what follows, some “problems” and some “questions” are proposed. 7092
The SuperHyperEulerian-Type-Cycle-Decomposition and the Neutrosophic SuperHyperEulerian-Type-Cycle- 7093
Decomposition are defined on a real-world application, titled “Cancer’s Recognitions”. 7094
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7095
recognitions? 7096
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle- 7097

and the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition?
Decomposition 7098
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7099
them? 7100
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 7101
and the Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition?
Problem 36.0.5. The SuperHyperEulerian-Type-Cycle-Decomposition and the Neutrosophic SuperHyperEulerian-

7103
do a SuperHyperModel for the Cancer’s recognitions and they’re based on 7104
SuperHyperEulerian-Type-Cycle-Decomposition, are there else? 7105
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7106
Numbers types-results? 7107
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7108
the multiple types of SuperHyperNotions? 7109
353
CHAPTER 37 7110
Conclusion and Closing Remarks 7111
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7112
research are illustrated. Some benefits and some advantages of this research are highlighted. 7113
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7114
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian- 7115
Type-Cycle-Decomposition. For that sake in the second definition, the main definition of the Neut- 7116
rosophic SuperHyperGraph is redefined on the position of the alphabets. Based on the new 7117
definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic 7118
SuperHyperEulerian-Type-Cycle-Decomposition, finds the convenient background to implement some 7119

results based on that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses 7120
are the cases of this research on the modeling of the regions where are under the attacks of 7121
the cancer to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. 7122
To formalize the instances on the SuperHyperNotion, SuperHyperEulerian-Type-Cycle-Decomposition, 7123
the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results are 7124
gathered in the section on the SuperHyperEulerian-Type-Cycle-Decomposition and the Neutrosophic 7125

SuperHyperEulerian-Type-Cycle-Decomposition. The clarifications, instances and literature reviews have 7126
taken the whole way through. In this research, the literature reviews have fulfilled the lines 7127
containing the notions and the results. The SuperHyperGraph and Neutrosophic SuperHy- 7128
perGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the 7129
background of this research. Sometimes the cancer has been happened on the region, full of 7130
cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 7131
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 7132
and strongest styles with the formation of the design and the architecture are formally called 7133
“ SuperHyperEulerian-Type-Cycle-Decomposition” in the themes of jargons and buzzwords. The prefix 7134
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 7135
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 7136
pointed out and spoken out. 7137
355
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Cycle-Decomposition
3. Neutrosophic SuperHyperEulerian-Type-Cycle-Decomposition 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7138
Neutrosophic SuperHyperDuality But As 7139
Super Forms 7141
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7142

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7146

Va ∈ Ei , Ej ; 7147
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7148

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7149
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7150

Vi , Vj ∈ Ea ; 7151
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7152

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7153
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7154

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7155
sophic rv-SuperHyperDuality. 7156
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7157

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7160

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7162
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7163
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 7164
form the Extreme SuperHyperDuality; 7166
357
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7167

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7169
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 7170
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7171
conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 7172
such that they form the Neutrosophic SuperHyperDuality; 7173
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7174
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7175

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7176
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7177
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7178
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7179
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 7181
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7183

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7185
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7186
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7187
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7188
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7191
coefficient; 7192
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7193

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7195
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 7196
form the Extreme SuperHyperDuality; 7199
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7200

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7201
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7202
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7203
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7204
such that they form the Neutrosophic SuperHyperDuality; 7206
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7207

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7208
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7209

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

Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S 7212
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7214
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7216

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7218

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7221
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7224
coefficient. 7225
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7226
the mentioned Neutrosophic Figures in every Neutrosophic items. 7227

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7229
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7230
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7231
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7232
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7233
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7234
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7235
SuperHyperDuality. 7236
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 7239
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7240
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7241
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7242
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7243

every given Neutrosophic SuperHyperDuality. 7244




C(N SHG)Neutrosophic SuperHyperDuality = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , V4 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = 15z 2 .


C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+17i=0 }.

C(N SHG)Neutrosophic SuperHyperDuality = {E15 , E16 , E17 }.

C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V3i+13i=0 , V15 }.


4 × 5 × 5z 3 .

3 × 3z 2 .



C(N SHG)Neutrosophic R-SuperHyperDuality = {V1 , Vii610=5,7,8 }.
i=4


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

C(N SHG)Neutrosophic SuperHyperDuality = {E3i+1i=03 }.

C(N SHG)Neutrosophic R-SuperHyperDuality = {V2i+1i=05 }.







C(N SHG)Neutrosophic R-SuperHyperDuality SuperHyperPolynomial
= 10 × 9 + 10 × 6 + 12 × 9 + 12 × 6z 2 .
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 7288
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. 7295
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 7297
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7304
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 7306


the Neutrosophic SuperHyperDuality. 7315
Then 7317
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 7318
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7324
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7327

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7328
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperDuality. 7336
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7337

(V, E). Then 7338

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 7339
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7340


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7344
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7345
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. 7357
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7358
Then, 7359
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 7360
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 7361


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7366
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7367
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7373

CHAPTER 39 7374
Neutrosophic SuperHyperJoin But As 7375
Super Forms 7377
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7378

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7382
Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7383
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7384

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7385
|Ej |NEUTROSOPIC CARDINALITY ; 7386
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7387

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 7390
|Vj |NEUTROSOPIC CARDINALITY ; 7391
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7392

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7393
rv-SuperHyperJoin. 7394
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7395

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

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7400
371

(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7405

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7407
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7408
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7409
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7410

form the Neutrosophic SuperHyperJoin; 7411
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7412

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7413
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7414
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7419
coefficient; 7420
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7421

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7422
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7423
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7424
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7425
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7426
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7427

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 7428
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7429
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7430

rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7432
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7437

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7439
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7440
form the Neutrosophic SuperHyperJoin; 7443

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7444

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7446
cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 7450

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7451
to its Extreme coefficient; 7452
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7453

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7455
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7456

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7457
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7458
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7461
coefficient. 7462
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7466

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7467

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7532

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7541
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 7543


the Neutrosophic SuperHyperJoin. 7552
Then 7554
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 7555
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 7561
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7563

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7574

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7576


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

Then, 7594

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

.
Proof. Let 7595
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7596


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7600
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7601
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7602
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7607

CHAPTER 40 7608
Neutrosophic SuperHyperPerfect But As 7609
Super Forms 7611
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7612

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

Va ∈ Ei , Ej ; 7617
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7618

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7624

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7625
rv-SuperHyperPerfect. 7626
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7627

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

385
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7637

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7639
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7640
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7641
form the Neutrosophic SuperHyperPerfect; 7643
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7644

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7645
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7646
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7649
tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7651
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7653

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7655
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7661
coefficient; 7662
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7663

(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7670

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7671
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7672
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7673
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7674
such that they form the Neutrosophic SuperHyperPerfect; 7676
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7677

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7679

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7682
tices such that they form the Extreme SuperHyperPerfect; and the Extreme power is 7684
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7686

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7688

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7694
coefficient. 7695

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7699

SuperHyperPerfect. 7706
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. 7714





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7765
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 7767
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7785
Then 7787
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 7788
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 7792
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7793
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7794
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7797

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperPerfect. 7806

(V, E). Then 7808

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7831


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7834
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7835
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7836
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7837
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7843

CHAPTER 41 7844
Neutrosophic SuperHyperTotal But As 7845
Super Forms 7847
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7848

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7852

Va ∈ Ei , Ej ; 7853
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7854

(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7856

Vi , Vj ∈ Ea ; 7857
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7858

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7860

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7861
rv-SuperHyperTotal. 7862
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7863

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7868
399
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7873

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7875
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7876
form the Neutrosophic SuperHyperTotal; 7879
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7880
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7881

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7882
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7887
coefficient; 7888
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7889
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7890

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7891
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7892
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7897
cient; 7898
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7899

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7901
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7906

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7908
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7909
form the Neutrosophic SuperHyperTotal; 7912
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7913

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7914
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7915


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7920
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7922

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7923
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7924
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7925

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7930
cient. 7931

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7935
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. 7950




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 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|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 7994
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 8001
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 8003
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. 8010
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 8012



the Neutrosophic SuperHyperTotal. 8021
Then 8023
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 8024
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8030
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8032
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 8043

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8050
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. 8061
Then, 8063
∗
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 8064
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8065


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8069
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8070

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8071
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8077

CHAPTER 42 8078
Neutrosophic SuperHyperConnected But 8079
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8082

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8086
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8087
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8088

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8089
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 8090
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8091

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 8092
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 8093

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8094
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 8095
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8096
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8097
rosophic rv-SuperHyperConnected. 8098
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8099

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8102
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8103
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8104
413

that they form the Extreme SuperHyperConnected; 8108
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8109

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8110
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8111
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 8112
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 8113
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 8114

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 8115
nected; 8116
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8117

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8118
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8119
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 8121
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 8122

(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8126

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8127
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8128
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8129
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8130
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8131

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 8133
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 8134
its Neutrosophic coefficient; 8135
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8136

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8139
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8140

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 8141
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8142
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8143

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 8146
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 8147
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 8148

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 8149
nected; 8150
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8151

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8154
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 8155
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 8156
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 8157

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8158
and the Extreme power is corresponded to its Extreme coefficient; 8159
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8160

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8163
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8164

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8165
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 8167
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 8168
its Neutrosophic coefficient. 8169
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8172
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8173
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8175
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8176
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8177
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8178
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8179
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. 8187


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 R-Quasi-SuperHyperConnected = {V1 , V5 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 3z 2 .
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 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z 2 .



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 SuperHyperConnected SuperHyperPolynomial = 10z.

C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.

C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
= 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
= {ViEXT ERN AL }i=1 Cardinality
.
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 8231
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. 8238
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

= {ViEXT ERN AL }i=1 Cardinality
.
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 8240
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. 8247
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 8249



the Neutrosophic SuperHyperConnected. 8258
Then 8260
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 8261
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 8266
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8267
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8270

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
SuperHyperConnected. 8279
(V, E). Then 8281
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 8282
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8283


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8287
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8288
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8289
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. 8300
Then, 8302
∗
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 8303
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8304


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8307
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8308
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8309
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8310
some representatives. The latter is straightforward. 8311
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8316

CHAPTER 43 8317
Background 8318

427














Bibliography 8525
10.33140/JMTCM.01.03.09) 8529


433
10.20944/preprints202301.0282.v1). 8562
10.20944/preprints202301.0267.v1). 8565

(doi: 10.20944/preprints202301.0265.v1). 8570
prints202301.0262.v1). 8574
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8580
prints202301.0105.v1). 8583
Preprints 2023, 2023010044 8589
10.20944/preprints202301.0043.v1). 8592

(doi: 10.20944/preprints202212.0549.v1). 8601
(doi: 10.20944/preprints202212.0500.v1). 8608
10.5281/zenodo.7871026). 8617
2023, (doi: 10.5281/zenodo.7874647). 8620

10.5281/zenodo.7857856). 8623
2023, (doi: 10.5281/zenodo.7857841). 8626

10.5281/zenodo.7853867). 8635
10.5281/zenodo.7853922). 8638
(doi: 10.5281/zenodo.7851519). 8641
(doi: 10.5281/zenodo.7851550). 8644
10.5281/zenodo.7834229). 8653
10.5281/zenodo.7834261). 8656
10.5281/zenodo.7824560). 8659

(doi: 10.5281/zenodo.7824623). 8662

2023, (doi: 10.5281/zenodo.7809365). 8673
2023, (doi: 10.5281/zenodo.7809358). 8676
10.5281/zenodo.7809219). 8679
10.5281/zenodo.7809328). 8682
2023, (doi: 10.5281/zenodo.7806767). 8685
2023, (doi: 10.5281/zenodo.7806838). 8688
10.5281/zenodo.7799902). 8697
(doi: 10.5281/zenodo.7804218). 8700
(doi: 10.5281/zenodo.7796334). 8703
10.5281/zenodo.7791952). 8709

10.5281/zenodo.7791982). 8712
10.5281/zenodo.7790026). 8715
10.5281/zenodo.7790052). 8718
2023, (doi: 10.5281/zenodo.7787066). 8721
10.5281/zenodo.7781476). 8727
10.5281/zenodo.7783082). 8730
10.5281/zenodo.7777857). 8733
10.5281/zenodo.7779286). 8736
(doi: 10.5281/zenodo.7771831). 8739
2023, (doi: 10.5281/zenodo.7772468). 8742
10.13140/RG.2.2.20913.25446). 8745
odo.7764916). 8748

10.13140/RG.2.2.11770.98247). 8751
10.13140/RG.2.2.12400.12808). 8754
2023, (doi: 10.13140/RG.2.2.22545.10089). 8757
10.13140/RG.2.2.11377.76644). 8763
10.13140/RG.2.2.23750.96329). 8766
10.13140/RG.2.2.31366.24641). 8769
10.13140/RG.2.2.34721.68960). 8772
2023, (doi: 10.13140/RG.2.2.30212.81289). 8775
10.13140/RG.2.2.24288.35842). 8781
10.13140/RG.2.2.32467.25124). 8784
10.13140/RG.2.2.31025.45925). 8787

10.13140/RG.2.2.17184.25602). 8790
10.13140/RG.2.2.23423.28327). 8793
10.13140/RG.2.2.28456.44805). 8796
10.13140/RG.2.2.23525.68320). 8799
10.13140/RG.2.2.20170.24000). 8802
10.13140/RG.2.2.36475.59683). 8805
10.13140/RG.2.2.29764.71046). 8808
2023, (doi: 10.13140/RG.2.2.18780.87683). 8811
10.13140/RG.2.2.26134.01603). 8817
10.13140/RG.2.2.27392.30721). 8820
10.13140/RG.2.2.33028.40321). 8823
10.13140/RG.2.2.21389.20966). 8826

10.13140/RG.2.2.16356.04489). 8829
10.13140/RG.2.2.21756.21129). 8832
10.13140/RG.2.2.30983.68009). 8835
10.13140/RG.2.2.28552.29445). 8838
(doi: 10.13140/RG.2.2.10936.21761). 8841
10.13140/RG.2.2.35105.89447). 8844
(doi: 10.13140/RG.2.2.30072.72960). 8847
10.13140/RG.2.2.31147.52003). 8850
10.13140/RG.2.2.32825.24163). 8853
10.13140/RG.2.2.13059.58401). 8856
10.13140/RG.2.2.11172.14720). 8859
2023, (doi: 10.13140/RG.2.2.22011.80165). 8862
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8865

2023, (doi: 10.13140/RG.2.2.10493.84962). 8868
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8871
2023, (doi: 10.13140/RG.2.2.19944.14086). 8874
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8877
(doi: 10.13140/RG.2.2.33103.76968). 8880
(doi: 10.13140/RG.2.2.23037.44003). 8883
(doi: 10.13140/RG.2.2.35646.56641). 8886
10.13140/RG.2.2.18030.48967). 8889
(doi: 10.13140/RG.2.2.13973.81121). 8892
2023, (doi: 10.13140/RG.2.2.34106.47047). 8895
2023, (doi: 10.13140/RG.2.2.31956.88961). 8901
2023, (doi: 10.13140/RG.2.2.15179.67361). 8904

10.13140/RG.2.2.21510.45125). 8907
2023, (doi: 10.13140/RG.2.2.13121.84321). 8910
10.13140/RG.2.2.11758.69441). 8913
2023, (doi: 10.13140/RG.2.2.31891.35367). 8916
10.13140/RG.2.2.19360.87048). 8919
10.13140/RG.2.2.32363.21286). 8922
10.13140/RG.2.2.23266.81602). 8925
10.13140/RG.2.2.19911.37285). 8928
10.13140/RG.2.2.11050.90569). 8931
2023, (doi: 10.13140/RG.2.2.17761.79206). 8934
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8940
(doi: 10.13140/RG.2.2.30182.50241). 8943

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8985
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8988



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

10.20944/preprints202301.0282.v1). 9009
10.20944/preprints202301.0267.v1).). 9012
(doi: 10.20944/preprints202301.0265.v1). 9017
prints202301.0262.v1). 9021


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

10.13140/RG.2.2.35061.65767). 9030

10.13140/RG.2.2.18494.15680). 9034

10.13140/RG.2.2.32530.73922). 9038

10.13140/RG.2.2.15897.70243). 9042

10.13140/RG.2.2.32530.73922). 9046

prints202301.0105.v1). 9049

10.13140/RG.2.2.23172.19849). 9056


10.13140/RG.2.2.17385.36968). 9066
Preprints 2023, 2023010044 9069
10.20944/preprints202301.0043.v1). 9072
2023, (doi: 10.13140/RG.2.2.28945.92007). 9075
10.13140/RG.2.2.35774.77123). 9081

10.13140/RG.2.2.29430.88642). 9087
(doi: 10.20944/preprints202212.0549.v1). 9093
10.13140/RG.2.2.19380.94084). 9096

(doi: 10.20944/preprints202212.0500.v1). 9107
10.13140/RG.2.2.20993.12640). 9110


10.13140/RG.2.2.29173.86244). 9125
2023 (doi: 10.5281/zenodo.7874677). 9130
(doi: 10.5281/zenodo.7857906). 9132
2023 (doi: 10.5281/zenodo.7856329). 9134

10.5281/zenodo.7854561). 9136
2023 (doi: 10.5281/zenodo.7851893). 9138

(doi: 10.5281/zenodo.7835063). 9142
(doi: 10.5281/zenodo.7826705). 9144
2023 (doi: 10.5281/zenodo.7820680). 9146
10.5281/zenodo.7812750). 9148

2023 (doi: 10.5281/zenodo.7807782). 9154
2023 (doi: 10.5281/zenodo.7804449). 9156
(doi: 10.5281/zenodo.7792307). 9160
(doi: 10.5281/zenodo.7790728). 9162
2023 (doi: 10.5281/zenodo.7787712). 9164
10.5281/zenodo.7783791). 9166
10.5281/zenodo.7780123). 9168
(doi: 10.5281/zenodo.7773119). 9170

odo.7637762). 9172
10.5281/zenodo.7766174). 9174
10.5281/zenodo.7762232). 9176
(doi: 10.5281/zenodo.7758601). 9178
10.5281/zenodo.7754661). 9180
10.5281/zenodo.7750995) . 9182
(doi: 10.5281/zenodo.7749875). 9184
10.5281/zenodo.7747236). 9186
10.5281/zenodo.7742587). 9188
(doi: 10.5281/zenodo.7738635). 9190
10.5281/zenodo.7734719). 9192
10.5281/zenodo.7730484). 9194
(doi: 10.5281/zenodo.7730469). 9196
10.5281/zenodo.7722865). 9198
odo.7713563). 9200
odo.7709116). 9202
10.5281/zenodo.7706415). 9204
10.5281/zenodo.7706063). 9206

10.5281/zenodo.7701906). 9208
odo.7700205). 9210
10.5281/zenodo.7694876). 9212
10.5281/zenodo.7679410). 9214
10.5281/zenodo.7675982). 9216
10.5281/zenodo.7672388). 9218
odo.7668648). 9220
10.5281/zenodo.7662810). 9222
10.5281/zenodo.7659162). 9224
odo.7653233). 9226
odo.7653204). 9228
odo.7653142). 9230
odo.7653117). 9232
odo.7651687). 9235
odo.7651619). 9237
odo.7651439). 9239
odo.7650729). 9241

odo.7647868). 9243
odo.7647017). 9245
odo.7644894). 9247
odo.7632923). 9250
odo.7623459). 9252
10.5281/zenodo.7606416). 9254
10.5281/zenodo.7606416). 9256
odo.7606404). 9258
10.5281/zenodo.7580018). 9260
odo.7580018). 9262
odo.7580018). 9264
odo.7579929). 9266
10.5281/zenodo.7563170). 9268
odo.7563164). 9270
odo.7563160). 9272
odo.7563160). 9274
10.5281/zenodo.7563160). 9276

10.5281/zenodo.7557063). 9278
10.5281/zenodo.7557009). 9280
10.5281/zenodo.7539484). 9282
10.5281/zenodo.7523390). 9284
10.5281/zenodo.7523390). 9286
10.5281/zenodo.7523390). 9288
odo.7574952). 9290
10.5281/zenodo.7574992). 9292
odo.7523357). 9294
10.5281/zenodo.7523357). 9296
10.5281/zenodo.7504782). 9298
10.5281/zenodo.7504782). 9300
10.5281/zenodo.7504782). 9302
10.5281/zenodo.7499395). 9304
odo.7499395). 9306
10.5281/zenodo.7499395). 9308
10.5281/zenodo.7497450). 9310
10.5281/zenodo.7497450). 9312

10.5281/zenodo.7494862). 9314
odo.7494862). 9316
10.5281/zenodo.7494862). 9318
10.5281/zenodo.7493845). 9320
odo.7493845). 9322
10.5281/zenodo.7493845). 9324
odo.7539484). 9326
odo.7523390). 9328
odo.7523357). 9330
odo.7504782). 9332
odo.7499395). 9334
odo.7497450). 9336
odo.7494862). 9338
odo.7493845). 9340
odo.7480110). 9342
odo.7378758). 9344
odo.6320305). 9346
odo.6677173). 9348

CHAPTER 44 9349
Books’ Contributions 9350
“Books’ Contributions”: | Featured Threads 9351

The following references are cited by chapters. 9352
9353
[Ref260] 9354
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 9355
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 9356
9358
[Ref261] 9359
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9360
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 9361
9363
The links to the contributions of this scientific research book are listed below. 9364
[HG260] 9365
9369
[TITLE] “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type- 9370
Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9371

9372
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9373
https://www.researchgate.net/publication/370584288 9374
9375
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9376
https://www.scribd.com/document/643447459 9377
9378
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9379
https://zenodo.org/record/7904401 9380
9381
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9382
https://www.academia.edu/101377892 9383
455
Figure 44.1: New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type-

Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7904401).
9384
[ADDRESSED CITATION] 9385
[ASSIGNED NUMBER] #260 Article 9389
[DATE] May 2023 9390

[DOI] 10.5281/zenodo.7904401 9391
[LICENSE] CC BY-NC-ND 4.0 9392
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9393
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9394
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9395
9396
[HG261] 9397
9401
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9402

Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation” 9403
9404
https://www.researchgate.net/publication/370585428 9406
9407
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9408


2023, (doi: 10.5281/zenodo.7904401).

2023, (doi: 10.5281/zenodo.7904401).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7904529).
https://www.scribd.com/document/643450679 9409
9410
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9411
https://zenodo.org/record/7904529 9412
9413
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9414
https://www.academia.edu/101378425 9415
9416
[ASSIGNED NUMBER] #261 Article 9421

[DATE] May 2023 9422
[DOI] 10.5281/zenodo.7904529 9423
[LICENSE] CC BY-NC-ND 4.0 9424
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9425
[AVAILABLE AT TWITTER’S IDS] 9426
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9427
googlebooks GooglePlay 9428
9429
[ASSIGNED NUMBER] | Book #169 9430
Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 9432


[TITLE] Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs 9434

#Latest_Updates 9435
#The_Links 9436
9440
9442
#The_Links 9443
9444
[ASSIGNED NUMBER] | Book #169 9445

9446
[TITLE] Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs 9447
9448
9452
– 9453
9454
[PUBLISHER] 9455
(Paperback): https://www.amazon.com/dp/- 9456
(Hardcover): https://www.amazon.com/dp/- 9457

(Kindle Edition): https://www.amazon.com/dp/- 9458
9459
– 9460
9461
[ISBN] 9462
(Paperback): - 9463
(Hardcover): - 9464
(Kindle Edition): CC BY-NC-ND 4.0 9465
(EBook): CC BY-NC-ND 4.0 9466
9467
– 9468
9469
[PRINT LENGTH] 9470
(Paperback): - pages 9471
(Hardcover): - pages 9472
(Kindle Edition): - pages 9473
(E-Book): - pages 9474
9475
– 9476
9477
9479

#The_Links 9480
9481
https://www.researchgate.net/publication/- 9483
9484
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9485
https://drhenrygarrett.wordpress.com/2023/07/22/ 9486
Eulerian-Type-Cycle-Decomposition-In-SuperHyperGraphs/ 9487
9488
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9489
https://www.scribd.com/document/- 9490
9491
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9492
https://www.academia.edu/- 9493
9494
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9495
https://zenodo.org/record/- 9496
9497
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9498
https://books.google.com/books/about?id=- 9499
9500
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9501
https://play.google.com/store/books/details?id=- 9502

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9503

9504
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9505
9506
https://drhenrygarrett.wordpress.com/2023/07/22/ 9507
Eulerian-Type-Cycle-Decomposition-In-SuperHyperGraphs/ 9508
9509
– 9510
9511
[POSTED BY] Dr. Henry Garrett 9512
9513
[DATE] May 007, 2023 9514

9515
[POSTED IN] 169 | Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs 9516
9517
[TAGS] 9518
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9519
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9520
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9521
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9522
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Cycle-Decomposition In Supe- 9523
rHyperGraphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, 9524
Questions, Real-World Applications, Recent Research, Recognitions, Research, scientific re- 9525
search Article, scientific research Articles, scientific research Book, scientific research Chapter, 9526
scientific research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, 9527

SuperHyperGraph Theory, SuperHyperGraphs, Eulerian-Type-Cycle-Decomposition In Su- 9528
perHyperGraphs, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 9529
Vertices. 9530
In this scientific research book, there are some scientific research chapters on “Extreme 9531
Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs” and “Neutrosophic Eulerian- 9532
Type-Cycle-Decomposition In SuperHyperGraphs” about some scientific research on Eulerian- 9533

Type-Cycle-Decomposition In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, 9534
namely, Extreme Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs and Neutro- 9535
sophic Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs. With scientific research on 9536
the basic scientific research properties, the scientific research book starts to make Extreme 9537
Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs theory and Neutrosophic Eulerian- 9538

Type-Cycle-Decomposition In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 9539
understandable. 9540

HG169b1.png
Figure 44.7: [HG169b] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyper-

Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7874677).

HG169b2.png


HG169b3.png


CHAPTER 45 9541
“SuperHyperGraph-Based Books”: | 9542
Featured Tweets 9543
“SuperHyperGraph-Based Books”: | Featured Tweets 9544
467
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 9545
CV 9546
495
9547
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
9548
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)
9549
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

9550

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

9551
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

9552
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

9553
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

9554
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

9555
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).
9556
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

9557
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

9558
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

9559
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

9560
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

9561
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

9562
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

9563
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

9564
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

9565
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

9566
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).
9567
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

9568

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

9569
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

9570

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: -
9571
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

9572
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).
9573
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
9574
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
9575
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
9576
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).
9577
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

9578
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).
9579
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”,

9580
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).
9581
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).
9582
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
9583
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).
9584

(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).
9585
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).
9586
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

9587
[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

9588
[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

9589
[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

9590
[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

9591
[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

9592
[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

9593
[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

9594
[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

9595
[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

9596
[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

9597
[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

9598
[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

9599
[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

9600
[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

9601
[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

9602
[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

9603
[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

9604
[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

9605
[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

9606
[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

9607
[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

9608
[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

9609
[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

9610
[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

9611
[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

9612
[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
9613
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

9614
[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

9615
[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

9616
[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

9617
[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

9618
[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
9619
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

9620
“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

9621
[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
9622
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

9623
[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

9624
[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

9625
[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

9626
[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

9627
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

9628
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
9629
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
9630
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

9631
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

9632
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
-
9633
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

9634
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9635
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
9636
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
9637
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

9638
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
9639
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
...
9640
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/
9641
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
9642
9643
9644
Henry Garrett
01/23/2022
9645
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
9646

Eulerian-Type-Cycle-Decomposition in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Eulerian-Type-Cycle-Decomposition in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Eulerian-Type-Cycle-

Dr. Henry Garrett

List of Tables xii

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 an Extreme Preliminaries Of This Scientific Research On the Redeemed

10 an Extreme SuperHyperEulerian-Type-Cycle-Decomposition But As The Exten-

11 The an Extreme Departures on The Theoretical Results Toward Theor-

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 an Extreme Applications in Cancer’s an Extreme Recognition 141

14 Case 1: The Initial an Extreme Steps Toward an Extreme SuperHyper-

15 Case 2: The Increasing an Extreme Steps Toward an Extreme SuperHy-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 149

18 an Extreme SuperHyperDuality But As The Extensions Excerpt From

19 an Extreme SuperHyperJoin But As The Extensions Excerpt From

20 an Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 an Extreme SuperHyperTotal But As The Extensions Excerpt From

22 an Extreme SuperHyperConnected But As The Extensions Excerpt

24 Cancer In Neutrosophic SuperHyperGraph 249

25 Neutrosophic Eulerian-Type-Cycle-Decomposition 253

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-Cycle-Decomposition But As The Ex-

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 347

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 355

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 455

45 “SuperHyperGraph-Based Books”: | Featured Tweets 467

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The an Extreme SuperHyperGraphs Associated to the an Extreme Notions of

10.11The an Extreme SuperHyperGraphs Associated to the an Extreme Notions of

11.1 a an Extreme SuperHyperPath Associated to the Notions of an Extreme

Henry Garrett · Independent Researcher · Department of Mathematics ·

11.5 a an Extreme SuperHyperMultipartite Associated to the Notions of an Extreme

14.1 a an Extreme SuperHyperBipartite Associated to the Notions of an Extreme

15.1 a an Extreme SuperHyperMultipartite Associated to the Notions of an Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.12The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

31.5 a Neutrosophic SuperHyperMultipartite 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 New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Type-

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.11“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 477

Henry Garrett · Independent Researcher · Department of Mathematics ·

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