Eulerian-Type-Cycle-Neighbor in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/370594951
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs
Book · May 2023

DOI: 10.5281/zenodo.7905287
CITATIONS
1 author:
Henry Garrett
472 PUBLICATIONS 16,211 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
On Combinatorics View project
All content following this page was uploaded by Henry Garrett on 08 May 2023.
The user has requested enhancement of the downloaded file.

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

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

Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) Super-
HyperGraph 49
7 ABSTRACT 51
8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

Graph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super
Nebulous 251
27 ABSTRACT 253
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 259

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 263
30 Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor But As The Exten-

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

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

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

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

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

Motivations 349
37 Conclusion and Closing Remarks 351
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 409
43 Background 423
Bibliography 429
44 Books’ Contributions 451
45 “SuperHyperGraph-Based Books”: | Featured Tweets 463
46 CV 491

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

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

11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.5) . . . . . . . . . . . . . 116
11.2 a Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 a Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.11) . . . . . . . . 121
11.5 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme
11.6 a Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.15) . . 124
14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 284


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


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

31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.7) 322
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.9) 323
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.11) 325
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 329
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 Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7904671). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 452
(doi: 10.5281/zenodo.7904671). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
(doi: 10.5281/zenodo.7904671). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-
Graph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7904698). . . . . . . . . . . . . . . . . . . . . . 454
44.7 [HG170b] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”.
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7905287). . . . . . . . . . . . . . . . 459


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

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

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

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

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

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 346

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

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

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

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

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

have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 59
have all Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs until the Eulerian-Type-Cycle- 60
Neighbor In SuperHyperGraphs, then it’s officially called a “Eulerian-Type-Cycle-Neighbor 61
In SuperHyperGraphs” but otherwise, it isn’t a Eulerian-Type-Cycle-Neighbor In SuperHy- 62
perGraphs . There are some instances about the clarifications for the main definition titled a 63
“Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs ”. These two examples get more scrutiny 64

and discernment since there are characterized in the disciplinary ways of the SuperHyperClass 65
based on a Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs . For the sake of having a 66
Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, there’s a need to “redefine” 67
the notion of a “Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” and a 68
“Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 69

and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 70
this procedure, there’s the usage of the position of labels to assign to the values. Assume 71
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 72
intended Table holds. And a Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs are redefined 73
to a “Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” if the intended Table 74
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 75
ways to get Neutrosophic type-results to make a Neutrosophic Eulerian-Type-Cycle-Neighbor 76
In SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 77
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 78
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, 79

SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutro- 80

sophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, 81
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutro- 82
sophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neutrosophic 83
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” where it’s the strongest [the maximum 84
Neutrosophic value from all the Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs amid 85
the maximum value amid all SuperHyperVertices from a Eulerian-Type-Cycle-Neighbor In 86

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

called Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, and the strongest Eulerian-Type- 122
Cycle-Neighbor In SuperHyperGraphs, called Neutrosophic Eulerian-Type-Cycle-Neighbor In 123
SuperHyperGraphs, some general results are introduced. Beyond that in SuperHyperStar, all 124
possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential 125

to have at least three SuperHyperEdges to form any style of a Eulerian-Type-Cycle-Neighbor 126

In SuperHyperGraphs. There isn’t any formation of any Eulerian-Type-Cycle-Neighbor In 127
SuperHyperGraphs but literarily, it’s the deformation of any Eulerian-Type-Cycle-Neighbor 128
In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. A basic familiarity with 129
SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 130
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Type-Cycle-Neighbor In SuperHy- 131
perGraphs, Cancer’s Recognition 132

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

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

|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 165
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 166
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Eulerian-Type- 167
Cycle-Neighbor In SuperHyperGraphs . Since there’s more ways to get type-results to make 168
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs more understandable. For the sake of 169
having Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, there’s a need 170

to “redefine” the notion of “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs ”. The 171

Assume a Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs . It’s redefined Neutrosophic 174
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs if the mentioned Table holds, concerning, 175
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 176
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 177
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 178
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 179
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 180
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 181
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 182
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs . It’s the main. It’ll be disciplinary 183

to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 184
need to have all Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs until the Eulerian-Type- 185
Cycle-Neighbor In SuperHyperGraphs, then it’s officially called “Eulerian-Type-Cycle-Neighbor 186
In SuperHyperGraphs” but otherwise, it isn’t Eulerian-Type-Cycle-Neighbor In SuperHy- 187
perGraphs . There are some instances about the clarifications for the main definition titled 188
“Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs ”. These two examples get more scrutiny 189

and discernment since there are characterized in the disciplinary ways of the SuperHyperClass 190
based on Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs . For the sake of having 191
Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, there’s a need to “redefine” 192
the notion of “Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” and “Neut- 193
rosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs ”. The SuperHyperVertices 194
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 195
this procedure, there’s the usage of the position of labels to assign to the values. Assume 196
a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 197
intended Table holds. And Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs are redefined 198
“Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” if the intended Table 199
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more 200
ways to get Neutrosophic type-results to make Neutrosophic Eulerian-Type-Cycle-Neighbor In 201

SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 202
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 203
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 204
ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 205
“Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”, “Neutrosophic Super- 206

HyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 207
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has 208
“Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs” where it’s the strongest 209
[the maximum Neutrosophic value from all Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs 210
amid the maximum value amid all SuperHyperVertices from a Eulerian-Type-Cycle-Neighbor 211
In SuperHyperGraphs .] Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs . A graph is 212

SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges 213
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 214
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given Super- 215
HyperEdges with two exceptions; it’s Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs if it’s 216

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

strongest Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, called Neutrosophic Eulerian- 248
Type-Cycle-Neighbor In SuperHyperGraphs, some general results are introduced. Beyond 249
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 250
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 251
of a Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs. There isn’t any formation of any 252

Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs but literarily, it’s the deformation of any 253
Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs. It, literarily, deforms and it doesn’t form. 254
A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory 255
are proposed. 256
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Eulerian-Type-Cycle-Neighbor In 257
SuperHyperGraphs, Cancer’s Neutrosophic Recognition 258

260
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 261

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

[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 286
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 287
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 288
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 289
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 290
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 291




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

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

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

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

Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 363
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 364
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 365
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 366
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 367
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 368

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

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

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

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

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

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

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

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

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

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

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

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

10.13140/RG.2.2.32530.73922). 1021

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

10.13140/RG.2.2.23172.19849). 1031

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

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

10.13140/RG.2.2.29430.88642). 1062
(doi: 10.20944/preprints202212.0549.v1). 1068
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1070
10.13140/RG.2.2.19380.94084). 1071

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

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

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

HG165b [195] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1110
10.5281/zenodo.7854561). 1111
HG164b [196] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1112
2023 (doi: 10.5281/zenodo.7851893). 1113
HG163b [197] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1114

Garrett, 2023 (doi: 10.5281/zenodo.7848019). 1115
HG162b [198] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1116
(doi: 10.5281/zenodo.7835063). 1117
HG161b [199] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1118
(doi: 10.5281/zenodo.7826705). 1119
HG160b [200] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1120
2023 (doi: 10.5281/zenodo.7820680). 1121
HG159b [201] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1122
10.5281/zenodo.7812750). 1123
HG158b [202] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1124

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

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

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

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

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

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

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

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

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

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

CHAPTER 5 1432
Extreme Eulerian-Type-Cycle-Neighbor 1433
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1434
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1435
2023, (doi: 10.13140/RG.2.2.34953.52320). 1436

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1437
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1438
(doi: 10.13140/RG.2.2.33275.80161). 1439
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1440
10.13140/RG.2.2.11050.90569). 1442
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1443
10.13140/RG.2.2.17761.79206). 1445
10.13140/RG.2.2.19911.37285). 1448
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1449
10.13140/RG.2.2.23266.81602). 1451
10.13140/RG.2.2.19360.87048). 1454
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1455
10.13140/RG.2.2.32363.21286). 1457
10.13140/RG.2.2.11758.69441). 1460
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1461
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1462
10.13140/RG.2.2.31891.35367). 1463
10.13140/RG.2.2.21510.45125). 1466
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1467
10.13140/RG.2.2.13121.84321). 1469

CHAPTER 6 1470
New Ideas On Super Nebulous By Hyper 1471
Nebbish Of Eulerian-Type-Cycle-Neighbor 1472
In Cancer’s Recognition With 1473
(Neutrosophic) SuperHyperGraph 1474
49
CHAPTER 7 1475
ABSTRACT 1476
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1477

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

criteria holds 1482
∀N (Ea ) ∈ C : C is
a SuperHyperCycle and it has
the maximum number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutro- 1483

sophic e-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1484
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 1485

SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutrosophic v- 1486
SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1487
∀N (Va ) ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutro- 1488

sophic v-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1489
∀N (Va ) ∈ C : C is
51
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 1490

SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle- 1491
Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian- 1492
Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor. ((Neutrosophic) 1493
SuperHyperEulerian-Type-Cycle-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 1494
a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 1495
Then E is called an Extreme SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 1496

e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor, Neut- 1497
rosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle- 1498
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1499
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 1500
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 1501
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type- 1502
Cycle-Neighbor; a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 1503
rosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type- 1505
Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1506
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1507
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 1508

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1509
SuperHyperEulerian-Type-Cycle-Neighbor; an Extreme SuperHyperEulerian-Type-Cycle-Neighbor SuperHy- 1510
perPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 1511
re-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and 1512
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme Super- 1513
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1514
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 1515
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1516
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1517
form the Extreme SuperHyperEulerian-Type-Cycle-Neighbor; and the Extreme power is corresponded 1518
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor SuperHyper- 1519
Polynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 1520

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHy- 1522
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1523
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1524
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1525

cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1526
such that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; and the Neutrosophic 1527
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type- 1528
Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 1529
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme SuperHy- 1531

perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1532
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1533
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1534
form the Extreme SuperHyperEulerian-Type-Cycle-Neighbor; a Neutrosophic V-SuperHyperEulerian-Type- 1535

Cycle-Neighborif it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 1536

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for a Neutrosophic Super- 1538
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1539
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1540
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1541
the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; an Extreme V-SuperHyperEulerian-Type-Cycle- 1542

Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, 1543
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle- 1544
Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme 1545
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1546
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 1548


the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1557
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 1560
introduced for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Cycle-Neighbor and Neut- 1561
rosophic SuperHyperEulerian-Type-Cycle-Neighbor. Two different types of SuperHyperDefinitions are 1562
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 1563
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1564
implemented in the whole of this research. For shining the elegancy and the significancy of this 1565
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1566
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1567
and the instances thus the clarifications are driven with different tools. The applications are 1568
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1569
Recognition” are the under research to figure out the challenges make sense about ongoing and 1570
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1575
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1576
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1577
research. It’s also officially collected in the form of some questions and some problems. Assume 1578
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Neighbor 1579

first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1583
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Neighbor is a 1584
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1585
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1586
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1587
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1588
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 1589
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 1590
a SuperHyperEulerian-Type-Cycle-Neighbor . Since there’s more ways to get type-results to make 1591
a SuperHyperEulerian-Type-Cycle-Neighbor more understandable. For the sake of having Neut- 1592
rosophic SuperHyperEulerian-Type-Cycle-Neighbor, there’s a need to “redefine” the notion of a 1593
“SuperHyperEulerian-Type-Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are 1594

assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1595
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Neighbor . 1596
It’s redefined a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if the mentioned Table holds, 1597
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1598
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1599
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1600
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1601
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 1602
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 1603
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 1604
Graph based on a SuperHyperEulerian-Type-Cycle-Neighbor . It’s the main. It’ll be disciplinary 1605
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s 1606
a need to have all SuperHyperEulerian-Type-Cycle-Neighbor until the SuperHyperEulerian-Type-Cycle- 1607
Neighbor, then it’s officially called a “SuperHyperEulerian-Type-Cycle-Neighbor” but otherwise, it isn’t 1608
a SuperHyperEulerian-Type-Cycle-Neighbor . There are some instances about the clarifications for 1609
the main definition titled a “SuperHyperEulerian-Type-Cycle-Neighbor ”. These two examples get 1610
more scrutiny and discernment since there are characterized in the disciplinary ways of the 1611
SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Neighbor . For the sake of having a 1612

Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, there’s a need to “redefine” the notion of a 1613
“Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor” and a “Neutrosophic SuperHyperEulerian-Type- 1614
Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 1615
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 1616
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 1617
SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Cycle-Neighbor 1618
are redefined to a “Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor” if the intended Table 1619
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 1620
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Type- 1621
Cycle-Neighbor more understandable. Assume a Neutrosophic SuperHyperGraph. There are 1622
some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 1623
SuperHyperEulerian-Type-Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 1624
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1625
SuperHyperEulerian-Type-Cycle-Neighbor”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 1626
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 1627

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 1628

” where it’s the strongest [the maximum Neutrosophic value from all the
SuperHyperEulerian-Type-Cycle-Neighbor amid the maximum value amid all SuperHyperVertices 1630
from a SuperHyperEulerian-Type-Cycle-Neighbor .] SuperHyperEulerian-Type-Cycle-Neighbor . A graph is a 1631
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1633
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1634
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Neighbor if it’s only one 1635
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1636
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1637
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1638
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1639
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1640
and the common and intended properties between “specific” cells and “specific group” of 1647
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 1648
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 1649
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 1650
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 1651
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 1652
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 1653
long cycle of the move from the cancer is identified by this research. Sometimes the move of 1654
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 1655
neutrality about the moves and the effects of the cancer on that region; this event leads us 1656
moves and the traces of the cancer on the complex tracks and between complicated groups 1660
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 1661
Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1662
The aim is to find either the longest SuperHyperEulerian-Type-Cycle-Neighbor or the strongest 1663
SuperHyperEulerian-Type-Cycle-Neighbor in those Neutrosophic SuperHyperModels. For the longest 1664
SuperHyperEulerian-Type-Cycle-Neighbor, called SuperHyperEulerian-Type-Cycle-Neighbor, and the strongest 1665
SuperHyperEulerian-Type-Cycle-Neighbor, called Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, 1666
some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHy- 1667
perPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at 1668
least three SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Neighbor. There 1669

isn’t any formation of any SuperHyperEulerian-Type-Cycle-Neighbor but literarily, it’s the deformation 1670
of any SuperHyperEulerian-Type-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. A basic 1671
familiarity with Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor theory, SuperHyperGraphs, 1672
and Neutrosophic SuperHyperGraphs theory are proposed. 1673

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Neighbor, Cancer’s 1674
Neutrosophic Recognition 1675

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

are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s 1723
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1724
SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Neighbor. There isn’t any 1725
formation of any SuperHyperEulerian-Type-Cycle-Neighbor but literarily, it’s the deformation of any 1726
SuperHyperEulerian-Type-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. 1727
amount of SuperHyperEulerian-Type-Cycle-Neighbor” of either individual of cells or the groups of cells 1729

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 1730
Type-Cycle-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 1731
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1732
messy and dense SuperHyperModels where embedded notions are illustrated? 1733
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1734
it motivates us to define different types of “ SuperHyperEulerian-Type-Cycle-Neighbor” and “Extreme 1735
SuperHyperEulerian-Type-Cycle-Neighbor” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1736

Then the research has taken more motivations to define SuperHyperClasses and to find some 1737
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1738
some instances and examples to make clarifications about the framework of this research. The 1739
general results and some results about some connections are some avenues to make key point of 1740
this research, “Cancer’s Recognition”, more understandable and more clear. 1741
The framework of this research is as follows. In the beginning, I introduce basic definitions 1742
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1743
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1744
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1745
review literature are applied to make sense about what’s going to figure out about the 1746
upcoming sections. The main definitions and their clarifications alongside some results 1747
about new notions, SuperHyperEulerian-Type-Cycle-Neighbor and Extreme SuperHyperEulerian-Type- 1748

Cycle-Neighbor, are figured out in sections “ SuperHyperEulerian-Type-Cycle-Neighbor” and “Extreme 1749
SuperHyperEulerian-Type-Cycle-Neighbor”. In the sense of tackling on getting results and in Eulerian- 1750
Type-Cycle-Neighbor to make sense about continuing the research, the ideas of SuperHyperUniform 1751
and Extreme SuperHyperUniform are introduced and as their consequences, corresponded 1752
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 1753
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to origin of 1754

the notions, there are some smart steps toward the common notions to extend the new notions in 1755
new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1756
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research about 1757
the general SuperHyperRelations and as concluding and closing section of theoretical research are 1758
contained in the section “General Results”. Some general SuperHyperRelations are fundamental 1759
and they are well-known as fundamental SuperHyperNotions as elicited and discussed in the 1760
sections, “General Results”, “ SuperHyperEulerian-Type-Cycle-Neighbor”, “Extreme SuperHyperEulerian- 1761

Type-Cycle-Neighbor”, “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1762
There are curious questions about what’s done about the SuperHyperNotions to make sense 1763
about excellency of this research and going to figure out the word “best” as the description 1764
and adjective for this research as presented in section, “ SuperHyperEulerian-Type-Cycle-Neighbor”. 1765
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1766
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1767
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1768
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1769
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1770
to make sense to figure out this research in featured style. The advantages and the limitations 1771
of this research alongside about what’s done in this research to make sense and to get sense 1772
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1773

CHAPTER 9 1774
Extreme Preliminaries Of This Scientific 1775
Research On the Redeemed Ways 1776
In this section, the basic material in this scientific research, is referred to [Single Valued 1777
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1778
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1779

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 1780
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 1781
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1782
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1783
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1784
their clarifications are addressed to Ref.[HG38]. 1785

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

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

Let X be a Eulerian-Type-Cycle-Neighbor of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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). 1789
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1790
where 1791
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1792
(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); 1793
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1794
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1795
1, 2, . . . , n0 ); 1796
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1797
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1798

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1805
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1806
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 1807
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1808
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1809
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1810

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

(Ref.[HG38],Definition 2.7,p.3). 1812
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1813
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1814
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1815
(i) If |Vi | = 1, then Vi is called vertex; 1816
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1817
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1818
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1819
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1820
SuperEdge; 1821
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1822
SuperHyperEdge. 1823
If we choose different types of binary operations, then we could get hugely diverse types of 1824
general forms of Neutrosophic SuperHyperGraph (NSHG). 1825
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1826

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1827
x, y, z, w ∈ [0, 1]: 1828
(i) 1 ⊗ x = x; 1829
(ii) x ⊗ y = y ⊗ x; 1830
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1831
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1832

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

where 1835

1, 2, . . . , n0 ); 1840
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1841
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1842
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1843
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1844
0


SuperEdge; 1864
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1867
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1868
makes the patterns and regularities. 1869
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1870
of elements of SuperHyperEdges are the same. 1871

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1872
makes to have SuperHyperUniform more understandable. 1873
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1874
Classes as follows. 1875
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1876
two given SuperHyperEdges with two exceptions; 1877
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1878
SuperHyperEdges; 1879
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1880
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1881
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1882
in common; 1883
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1884
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1885
SuperHyperEdge in common; 1886
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1887
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1888
SuperVertex. 1889
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 1890
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1891
(i) Vi , Vi+1 ∈ Ei0 ; 1892
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1893
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1894
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1895
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1896
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1897
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1898
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1899
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 1901
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1902
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1903
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1904
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1905
perPath . 1906
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 1907
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1908
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1909
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1910
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1911
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1912

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

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


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

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

Neighbor). 1929
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1931
or E 0 is called 1932
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 1933

called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1934
∀N (Ea ) ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 1935

called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1936
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1937
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 1938
called Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 1939
∀N (Va ) ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 1940
∀N (Va ) ∈ C : C is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1942

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 1943

e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Cycle- 1944
Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv- 1945
SuperHyperEulerian-Type-Cycle-Neighbor. 1946
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Neighbor). 1947

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

SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme SuperHyperGraph 1953
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 1954

high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 1955
form the Extreme SuperHyperEulerian-Type-Cycle-Neighbor; 1957
(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutro- 1958

sophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 1959
Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv- 1960
SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph 1961
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1962
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1963

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1964
form the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; 1965
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial if 1966

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re- 1967
SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, 1968
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme 1969
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1970
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1971
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1972

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1973
that they form the Extreme SuperHyperEulerian-Type-Cycle-Neighbor; and the Extreme power 1974
is corresponded to its Extreme coefficient; 1975
(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 1976

if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re- 1977
and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for a Neutro- 1979
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1980

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1981
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1982
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 1983
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1984
SuperHyperEulerian-Type-Cycle-Neighbor; and the Neutrosophic power is corresponded to its 1985
Neutrosophic coefficient; 1986

(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutro- 1987

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1992
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neut- 1995

rosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 1996

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1999
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2000
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2001
that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; 2002
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 2003

of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2009

(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 2013

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2019

Neutrosophic coefficient. 2023
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Neighbor). 2024

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2025
(i) an δ−SuperHyperEulerian-Type-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 2026
SuperHyperEulerian-Type-Cycle-Neighbor such that either of the following expressions hold for 2027

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
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2028
|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 2029

(29.1), holds if S is an δ−SuperHyperDefensive; 2030
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Neighbor is a Neutrosophic kind 2031

of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor such that either of the following 2032
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2033
of s ∈ S : 2034
|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 2035

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2036
For the sake of having a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, there’s a need to 2037

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2046
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Neighbor, SuperHyperStar, 2047
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2048
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2049
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2050
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2051

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Cycle- 2052

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian- 2053
Type-Cycle-Neighbor more Neutrosophicly understandable. 2054
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor”. The 2056

2059
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Type-Cycle-Neighbor. It’s redefined a Neutro- 2060

sophic SuperHyperEulerian-Type-Cycle-Neighbor if the Table (29.3) holds. 2061

CHAPTER 10 2062
Extreme SuperHyper But As The Eulerian-Type-Cycle-Neighbor 2063
Extensions Excerpt From Dense And 2064
Super Forms 2065
Definition 10.0.1. (Extreme event). 2066
Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2067
is a probability Eulerian-Type-Cycle-Neighbor. Any Extreme k-subset of A of V is called Extreme 2068
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2069
expression is called Extreme probability of A. 2070
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2071

is a probability Eulerian-Type-Cycle-Neighbor. s Extreme k-events Ai , i ∈ I is called Extreme 2073

s-independent if the following expression is called Extreme s-independent criteria 2074
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Extreme k-events of A and B is called Extreme independent. The 2075
following expression is called Extreme independent criteria 2076
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2077

is a probability Eulerian-Type-Cycle-Neighbor. Any k-function Eulerian-Type-Cycle-Neighbor like E is called 2079

Extreme k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Neighbor like E is called 2080
Extreme Variable. 2081
The notion of independent on Extreme Variable is likewise. 2082
Definition 10.0.4. (Extreme Expectation). 2083
Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2084
73
probability Eulerian-Type-Cycle-Neighbor. A Extreme k-Variable E has a number is called Extreme 2085

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

Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2088
a probability Eulerian-Type-Cycle-Neighbor. A Extreme number is called Extreme Crossing if the 2089

following expression is called Extreme Crossing criteria 2090
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2091
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let m and n propose special Eulerian-Type-Cycle- 2092
Neighbor. Then with m ≥ 4n, 2093
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Eulerian-Type-Cycle-Neighbor p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2094
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2095
Theorem 10.0.7. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2096
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let P be a SuperHyperSet of n points in the 2097
plane, and let l be the Extreme number√of SuperHyperLines in the plane passing through at least 2098
k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2099
Proof. Form a Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2100

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

Theorem 10.0.8. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2106
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let P be a SuperHyperSet of n points in 2107
the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 2108
k < 5n4/3 . 2109
Proof. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2110
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Draw a SuperHyperUnit SuperHyperCircle 2111
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2112
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2113
Now form a Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2114

SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2115
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2116
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 2117
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2118

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2119
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2120
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2121
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2122
Proposition 10.0.9. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2123
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let X be a nonnegative Extreme 2124
Variable and t a positive real number. Then 2125
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. 2126
Corollary 10.0.10. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2127
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let Xn be a nonnegative integer- 2128
valued variable in a probability Eulerian-Type-Cycle-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 2129

then P (Xn = 0) → 1 as n → ∞. 2130
Proof. 2131
Theorem 10.0.11. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2132
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. A special SuperHyperGraph in Gn,p 2133
almost surely has stability number at most d2p−1 log ne. 2134

S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. A special SuperHyperGraph in Gn,p is 2136
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2137
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2138
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2139
SuperHyperEdge of the Extreme SuperHyperGraph G. 2140
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2141
Extreme Variable for this Extreme Event. By equation, we have 2142
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 2143
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2144
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: 2145
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2146
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 2147
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2148
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 2149
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2150
Definition 10.0.12. (Extreme Variance). 2151

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

S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let X be a Extreme Variable and let 2159
t be a positive real number. Then 2160
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2161
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let Xn be a Extreme Variable in a 2163

probability Eulerian-Type-Cycle-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2164
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Set X := Xn and t := |Ex(Xn )| in 2166
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2167
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2168
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2170
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2171
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2172
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. As in the proof of related Theorem, the 2174
result is straightforward. 2175
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 2177
as defined in previous Theorem. Then either: 2178
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2179
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2180
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. The latter is straightforward. 2182
Definition 10.0.17. (Extreme Threshold). 2183
probability Eulerian-Type-Cycle-Neighbor. Let P be a monotone property of SuperHyperGraphs (one 2185
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2186
a function f (n) such that: 2187
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2188
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2189

Definition 10.0.18. (Extreme Balanced). 2190

probability Eulerian-Type-Cycle-Neighbor. Let F be a fixed Extreme SuperHyperGraph. Then there is a 2192
threshold function for the property of containing a copy of F as a Extreme SubSuperHyperGraph 2193
is called Extreme Balanced. 2194
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let F be a nonempty balanced 2196
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2197

is a threshold function for the property of containing F as a Extreme SubSuperHyperGraph. 2198
136EXM1 Example 10.0.20. Assume a Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 2201
mentioned Extreme Figures in every Extreme items. 2202
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2203
Type-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2204
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2205
E4 is a Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2206
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2207
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 2208
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2209
C(N SHG)Extreme Eulerian-Type-Cycle-Neighbor

= {E4 }.
C(N SHG)Extreme Eulerian-Type-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Extreme V-Eulerian-Type-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Extreme V-Eulerian-Type-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
2211
Type-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 2213
E3 are some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus 2214
in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 2215
namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s 2216
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme 2217
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperEulerian-Type-Cycle- 2218
Neighbor. 2219

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.3) 136NSHG1
= {E4 }.
= z3.
= {V1 , V2 , V4 }.
= z 5 + z 3 + z.
2220
Type-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straightforward. 2222

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



= {E4 , E1 , E5 }.
= 2z 5 + z 3 .
= {V3 }.
= z2.
2226

= {E1 , E2 , E3 , E4 }.
= 2z 5 + 2z 4 .
= {Vi ∈ VN SHG }.

X
= z |{Vi ∈VN SHG }| .
2229

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

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

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


X
= z |{Vi ∈VN SHG }| .
2238

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
2241
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2242
SuperHyperEulerian-Type-Cycle-Neighbor, is up. The Extreme Algorithm is Extremely straight- 2243


forward. 2244

= {E4 , E5 , E6 , E7 }.
= 4z 2 .
= {V12 , V13 , V14 }.
= 2z 5 + z 3 .
2245

forward. 2248

= {E2 , E3 , E4 , E5 }.
= z 3 + 3z 2 .


= {V4 , V5 , V6 }.
= 2z 5 + z 3 .
2249

forward. 2252

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


forward. 2256

= {E2 , E3 , E4 , E5 , E1 , E10 , E9 }.
= 2z 3 + 5z 2 .
= {V4 , V5 , V6 , V1 , V2 , V3 }.
X
= z |{Vi ∈VN SHG }| .
2257

forward. 2260

= {Ei ∈ EN SHG }.

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

forward. 2264

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

2265

forward. 2268

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

2269

forward. 2272

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


forward. 2276

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

forward. 2280

= {Ei ∈ EN SHG }.

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

forward. 2284

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

2285

forward. 2288

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V3 }.
= z5 + z3.
2289

SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.3) 95NHG1
forward. 2292

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V3 }.
= z5 + z3.
2293
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2294
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Cycle-Neighbor if for 2295

SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.3) 95NHG2
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2296
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2297
all minus all Extreme SuperHypeNeighbors to any amount of them. 2298
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2299
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2300
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2301
quasi-R-Eulerian-Type-Cycle-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not 2302
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2303
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Cycle-Neighbor, 2304
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2305
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If a

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Eulerian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Neighbor is at least 2306
the maximum Extreme number of Extreme SuperHyperVertices of the Extreme SuperHyperEdges 2307
with the maximum number of the Extreme SuperHyperEdges. In other words, the maximum 2308
number of the Extreme SuperHyperEdges contains the maximum Extreme number of Extreme 2309
SuperHyperVertices are renamed to Extreme Eulerian-Type-Cycle-Neighbor in some cases but the 2310
maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2311

Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in a Extreme 2312
R-Eulerian-Type-Cycle-Neighbor. 2313
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Eulerian-Type-Cycle-Neighbor has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Extreme type-result-R-Eulerian-Type-Cycle-Neighbor with the least Extreme cardinality, the 2314
lower sharp Extreme bound for cardinality. 2315
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2316
Then in the worst case, literally, 2317
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Eulerian−T ype−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Eulerian−T ype−Cycle−N eighborSuperHyperP olynomial = z 5 .
Is a Extreme type-result-Eulerian-Type-Cycle-Neighbor. In other words, the least cardinality, the lower 2318
sharp bound for the cardinality, of a Extreme type-result-Eulerian-Type-Cycle-Neighbor is the cardinality 2319
of 2320

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

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

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

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

if it has no Extreme SuperHyperEdge but at least two Extreme SuperHyperVertices make

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

Has the maximum Extreme cardinality such that
Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

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

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

z

and
is formalized with mathematical literatures on the Extreme R-Eulerian-Type-Cycle-Neighbor. Let

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

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices
but in a Extreme Eulerian-Type-Cycle-Neighbor, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
a Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Eulerian-Type-Cycle-Neighbor 2323
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2324
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2325
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2326
number of Extreme SuperHyperVertices are renamed to Extreme Eulerian-Type-Cycle-Neighbor in 2327

some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2328
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2329
contained in a Extreme R-Eulerian-Type-Cycle-Neighbor. 2330
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2331
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2332
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2333
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2334
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2335
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2336
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2337
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2338
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2339

Thus it forms a Extreme quasi-R-Eulerian-Type-Cycle-Neighbor where the Extreme completion of the 2340
Extreme incidence is up in that. Thus it’s, literarily, a Extreme embedded R-Eulerian-Type- 2341
Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2342
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2343
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2344
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2345
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2346
included in the minimum Extreme style of the embedded Extreme R-Eulerian-Type-Cycle-Neighbor. 2347
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2348
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2349
common connections, more precise and more formal, the perfect unique connections inside 2350
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2351
Extreme R-Eulerian-Type-Cycle-Neighbor. Thus Extreme exterior SuperHyperVertices could be used 2352

only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2353
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2354
Eulerian-Type-Cycle-Neighbor, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2355
more connections inside more than outside. Thus the title “exterior” is more relevant than 2356
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2357
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2358

has been ignored in the exploring to lead on the optimal case implying the Extreme R-Eulerian- 2359
Type-Cycle-Neighbor. The Extreme R-Eulerian-Type-Cycle-Neighbor with the exclusion of the exclusion 2360
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2361
the Extreme R-Eulerian-Type-Cycle-Neighbor with the inclusion of all Extreme SuperHyperVertices 2362
in one Extreme SuperHyperEdge, is a Extreme quasi-R-Eulerian-Type-Cycle-Neighbor. To sum them 2363
up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2364
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2365
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Eulerian-Type- 2366
Cycle-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not all of them. In 2367
other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 2368
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Eulerian-Type-Cycle-Neighbor, minus all 2369
Extreme SuperHypeNeighbor to some of them but not all of them. 2370

The main definition of the Extreme R-Eulerian-Type-Cycle-Neighbor has two titles. a Extreme quasi-R- 2371
Eulerian-Type-Cycle-Neighbor and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2372
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s a Extreme 2373
quasi-R-Eulerian-Type-Cycle-Neighbor with that quasi-maximum Extreme SuperHyperCardinality in 2374
the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2375
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2376
all the Extreme quasi-R-Eulerian-Type-Cycle-Neighbors for all Extreme numbers less than its Extreme 2377
corresponded maximum number. The essence of the Extreme Eulerian-Type-Cycle-Neighbor ends up 2378
but this essence starts up in the terms of the Extreme quasi-R-Eulerian-Type-Cycle-Neighbor, again 2379
and more in the operations of collecting all the Extreme quasi-R-Eulerian-Type-Cycle-Neighbors acted 2380
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2381
number. This Extreme number is 2382
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Neighbors. 2383
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Eulerian-Type-Cycle-Neighbor be a Extreme 2384

number, a Extreme SuperHyperSet and a Extreme Eulerian-Type-Cycle-Neighbor . Then 2385
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Eulerian-Type-Cycle-Neighbor ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Eulerian-Type-Cycle-Neighbor is re-formalized 2386
and redefined as follows. 2387
GExtreme Eulerian-Type-Cycle-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 2388
definition for the Extreme Eulerian-Type-Cycle-Neighbor. 2389
GExtreme Eulerian-Type-Cycle-Neighbor =
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Eulerian-Type- 2390
poses the upcoming expressions.
Cycle-Neighbor 2391
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2392


= max zExtreme Number

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

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


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

2396

2397


Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2398
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2399
that any amount of its Extreme SuperHyperVertices are incident to a Extreme SuperHyperEdge. 2400
It’s, literarily, another name for “Extreme Quasi-Eulerian-Type-Cycle-Neighbor” but, precisely, it’s 2401
the generalization of “Extreme Quasi-Eulerian-Type-Cycle-Neighbor” since “Extreme Quasi-Eulerian-Type- 2402
Cycle-Neighbor” happens “Extreme Eulerian-Type-Cycle-Neighbor” in a Extreme SuperHyperGraph as 2403
initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2404
“Extreme Eulerian-Type-Cycle-Neighbor” in a Extreme SuperHyperGraph as initial framework and 2405
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2406
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2407
“Extreme Quasi-Eulerian-Type-Cycle-Neighbor”, and “Extreme Eulerian-Type-Cycle-Neighbor” are up. 2408
Thus, let 2409
zExtreme Number , NExtreme SuperHyperNeighborhood and 2410

GExtreme Eulerian-Type-Cycle-Neighbor be a Extreme number, a Extreme SuperHyperNeighborhood 2411
and a Extreme Eulerian-Type-Cycle-Neighbor and the new terms are up. 2412
GExtreme Eulerian-Type-Cycle-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2413
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2414
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2415


And with go back to initial structure, 2416
GExtreme Eulerian-Type-Cycle-Neighbor ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


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

2418

2419

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

up.
The following Extreme SuperHyperSet of Extreme SuperHyperVertices is the simple Extreme
type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Neighbor.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Neighbor. The

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

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

rHyperVertices such that there’s no a Extreme SuperHyperEdge amid some Extreme SuperHy-
perVertices instead of all given by
Extreme Eulerian-Type-Cycle-Neighbor is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Eulerian-Type-Cycle-Neighbor is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Neighbor is a Extreme SuperHyperSet
includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Neighbor is up. To sum them up,
the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-

. Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Neighbor
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}

is an Extreme R-Eulerian-Type-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph

ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such
that there’s no a Extreme SuperHyperEdge for some Extreme SuperHyperVertices instead of
all given by that Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Neighbor and
it’s an Extreme Eulerian-Type-Cycle-Neighbor. Since it’s
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe-

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

, not:
Neighbor
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2420
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2421
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2422
the 2423
“Extreme R-Eulerian-Type-Cycle-Neighbor” 2424
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2425
Extreme R-Eulerian-Type-Cycle-Neighbor, 2426
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Extreme free-triangle embedded SuperHyperModel and a
Extreme on-triangle embedded SuperHyperModel but also it’s a Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Eulerian-Type-Cycle-Neighbor amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Eulerian-Type-Cycle-Neighbor, are

In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Extreme R-Eulerian-Type-Cycle-Neighbor. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a Extreme R-Eulerian-Type-Cycle-Neighbor is the cardinality of
2427
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2428
Extreme SuperHyperVertices belong to any Extreme quasi-R-Eulerian-Type-Cycle-Neighbor if for any 2429
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2430
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2431
all minus all Extreme SuperHypeNeighbors to any amount of them. 2432

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let a Extreme SuperHy- 2433
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2434
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2435
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2436
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s a Extreme 2437
R-Eulerian-Type-Cycle-Neighbor with the least cardinality, the lower sharp Extreme bound for Extreme 2438
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2439
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is a Extreme SuperHyperSet 2440
S of the Extreme SuperHyperVertices such that there’s a Extreme SuperHyperEdge to have 2441
some Extreme SuperHyperVertices uniquely but it isn’t a Extreme R-Eulerian-Type-Cycle-Neighbor. 2442
Since it doesn’t have 2443
2444
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme Supe- 2445
rHyperVertices such that there’s a Extreme SuperHyperEdge to have some SuperHyperVertices 2446
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is 2447
the maximum Extreme cardinality of a Extreme SuperHyperSet S of Extreme SuperHyper- 2448
Vertices but it isn’t a Extreme R-Eulerian-Type-Cycle-Neighbor. Since it doesn’t do the Extreme 2449
procedure such that such that there’s a Extreme SuperHyperEdge to have some Extreme 2450
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2451
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2452
a Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2453
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2454
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2455
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2456
obvious Extreme R-Eulerian-Type-Cycle-Neighbor, VESHE is up. The obvious simple Extreme type- 2457
SuperHyperSet of the Extreme R-Eulerian-Type-Cycle-Neighbor, VESHE , is a Extreme SuperHyperSet, 2458
VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2459
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2460
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2461
is the maximum Extreme SuperHyperCardinality of a Extreme SuperHyperSet S of 2462

Extreme SuperHyperVertices such that there’s a Extreme SuperHyperEdge to have some 2463
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2464
ESHG : (V, E). Any Extreme R-Eulerian-Type-Cycle-Neighbor only contains all interior Extreme 2465
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2466
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2467
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2468
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2469
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2470
The SuperHyperNotion, namely, Eulerian-Type-Cycle-Neighbor, is up. There’s neither empty Su- 2471
perHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2472
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet 2473
of the Extreme Eulerian-Type-Cycle-Neighbor. The Extreme SuperHyperSet of Extreme SuperHy- 2474
perEdges[SuperHyperVertices], 2475

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

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

ESHG : (V, E) is a Extreme type-SuperHyperSet with 2479
2480
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2482
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2483
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2484
Extreme SuperHyperSet. Thus the non-obvious Extreme Eulerian-Type-Cycle-Neighbor is up. The 2485
obvious simple Extreme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Neighbor is a 2486

Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2487
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2488

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyper- 2489
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Eulerian-Type- 2490
Cycle-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2491

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

Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2494

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

(V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that there’s 2496
no a Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that Ex- 2497
treme type-SuperHyperSet called the Extreme Eulerian-Type-Cycle-Neighbor and it’s an Extreme 2498
Eulerian-Type-Cycle-Neighbor. Since it’s 2499

2500
rHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of a 2502
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2503
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2504
intended Extreme SuperHyperSet, 2505

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

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

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

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


= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2510
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2511
SuperHyperSet called the 2512
“Extreme Eulerian-Type-Cycle-Neighbor ” 2513
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2514
Extreme ,
Eulerian-Type-Cycle-Neighbor 2515
is only and only 2516

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

CHAPTER 11 2518
The Extreme Departures on The 2519
Theoretical Results Toward Theoretical 2520
Motivations 2521
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2522
SuperHyperClasses. 2523
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2524

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

SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2527
new way to redefine as 2528
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 2529
to ViEXT ERN AL in the literatures of SuperHyperEulerian-Type-Cycle-Neighbor. The latter is 2530
straightforward. 2531
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2532
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2533
(31.1), is the SuperHyperEulerian-Type-Cycle-Neighbor. 2534
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2535

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


= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 2536
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2537
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2538

The term “EXTERNAL” implies |N (ViEXT ERN AL )|
≥ |N (Vj )| where Vj is corresponded 2540
136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2543
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2544
SuperHyperModel (31.2), is the Extreme SuperHyperEulerian-Type-Cycle-Neighbor. 2545
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2546

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

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

SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.7) 136NSHG19a
Proof. Let 2547
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2548
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2549
way to redefine as 2550


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

SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2554
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2555
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2556
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2557
Type-Cycle-Neighbor. 2558
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2559

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 2560
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
2561
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 2562
a new way to redefine as 2563

straightforward. Then there’s no at least one SuperHyperEulerian-Type-Cycle-Neighbor. Thus the 2566
notion of quasi may be up but the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle- 2567
Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2568
could have one SuperHyperVertex as the representative in the 2569
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Extreme SuperHyperBi- 2570

partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2571
SuperHyperPart SuperHyperEdges are attained in any solution 2572
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2573
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2574
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2575
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2576
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2577
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Type-Cycle-Neighbor. 2578

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

Extreme SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.11) 136NSHG21a
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2579
Then 2580

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 2581
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2582
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Extreme SuperHyper- 2583

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


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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2592
SuperHyperEdges are attained in any solution 2593
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2594
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2596
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2597
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2598
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2599
the Extreme SuperHyperEulerian-Type-Cycle-Neighbor. 2600
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2601

Then, 2602

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

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi }Vi ∈VEi ,VEj ,VE∗ .
k {Ei ,Ej ,E ∗ } ∗
k Ei ∩Ej ∩Ek 6=∅

|V ∗ |
z |VEi | + z |VEj | + z Ek .
X
=
{Vi }Vi ∈VE ,VE ,VE ∗ .
i j k {Ei ,Ej ,E ∗ }E ∩E ∩E ∗ 6=∅
k i j k
Proof. Let 2603
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2604
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Extreme SuperHyper- 2605

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

Extreme SuperHyperEulerian-Type-Cycle-Neighbor in the Extreme Example (42.0.15) 136NSHG23a
Wheel ESHW : (V, E). There’s a new way to redefine as 2606

straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Neighbor. Thus the notion 2609
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle-Neighbor 2610
could be applied. The unique embedded SuperHyperEulerian-Type-Cycle-Neighbor proposes some 2611
longest SuperHyperEulerian-Type-Cycle-Neighbor excerpt from some representatives. The latter is 2612

136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2614
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2615
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2616
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2617
Extreme SuperHyperEulerian-Type-Cycle-Neighbor. 2618

CHAPTER 12 2619
The Surveys of Mathematical Sets On 2620
The Results But As The Initial Motivation 2621
For the SuperHyperEulerian-Type-Cycle-Neighbor, Extreme SuperHyperEulerian-Type-Cycle-Neighbor, and 2622

the Extreme SuperHyperEulerian-Type-Cycle-Neighbor, some general results are introduced. 2623
Remark 12.0.1. Let remind that the Extreme SuperHyperEulerian-Type-Cycle-Neighbor is “redefined” 2624
on the positions of the alphabets. 2625
Corollary 12.0.2. Assume Extreme SuperHyperEulerian-Type-Cycle-Neighbor. Then 2626
Extreme SuperHyperEulerian − T ype − Cycle − N eighbor =

{theSuperHyperEulerian − T ype − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − N eighbor
|ExtremecardinalityamidthoseSuperHyperEulerian−T ype−Cycle−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2627
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2628
and the neutrality, for i = 1, 2, 3, respectively. 2629
Corollary 12.0.3. Assume a Extreme SuperHyperGraph on the same identical letter of the 2630
alphabet. Then the notion of Extreme SuperHyperEulerian-Type-Cycle-Neighbor and SuperHyperEulerian- 2631
Type-Cycle-Neighbor coincide. 2632
alphabet. Then a consecutive sequence of the SuperHyperVertices is a Extreme SuperHyperEulerian- 2634
Type-Cycle-Neighbor if and only if it’s a SuperHyperEulerian-Type-Cycle-Neighbor. 2635
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEulerian- 2637
Type-Cycle-Neighbor if and only if it’s a longest SuperHyperEulerian-Type-Cycle-Neighbor. 2638
Corollary 12.0.6. Assume SuperHyperClasses of a Extreme SuperHyperGraph on the same 2639
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Neighbor is its 2640
SuperHyperEulerian-Type-Cycle-Neighbor and reversely. 2641
125
Corollary 12.0.7. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Neighbor, Su- 2642

perHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2643
identical letter of the alphabet. Then its Extreme SuperHyperEulerian-Type-Cycle-Neighbor is its 2644
Corollary 12.0.8. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2646
isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-

defined. 2648
Corollary 12.0.9. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its Extreme 2649
SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Type-Cycle- 2650
Neighbor isn’t well-defined. 2651
Corollary 12.0.10. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Neighbor, 2652
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2653

Extreme SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian- 2654
Type-Cycle-Neighbor isn’t well-defined. 2655
Corollary 12.0.11. Assume a Extreme SuperHyperGraph. Then its Extreme SuperHyperEulerian- 2656
is well-defined if and only if its SuperHyperEulerian-Type-Cycle-Neighbor is well-defined.
Corollary 12.0.12. Assume SuperHyperClasses of a Extreme SuperHyperGraph. Then its 2658

Extreme SuperHyperEulerian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian- 2659
Type-Cycle-Neighbor is well-defined. 2660
Corollary 12.0.13. Assume a Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Neighbor, 2661

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2662
Extreme SuperHyperEulerian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian- 2663

Proposition 12.0.14. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then V is 2665
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2666
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2667
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2668
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2669
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2670
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2671
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be a Extreme SuperHyperGraph. Then ∅ is 2672
(i) : the SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2673
(ii) : the strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2674
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2675
(iv) : the δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2676

(v) : the strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2677
(vi) : the connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2678
Proposition 12.0.16. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then an independent 2679
SuperHyperSet is 2680
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2683
Proposition 12.0.17. Let ESHG : (V, E) be a Extreme SuperHyperUniform SuperHyperGraph 2687

which is a SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 2688
(i) : SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2689
(ii) : strong SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2690
(iii) : connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2691
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2692
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2693
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2694
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2695
Proposition 12.0.18. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is a 2696
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2697
(i) : dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2698
(ii) : strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2699
(iii) : connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2700
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2701
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2702
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2703
which is a SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath. Then the number of 2706

(i) : the SuperHyperEulerian-Type-Cycle-Neighbor; 2707
(ii) : the SuperHyperEulerian-Type-Cycle-Neighbor; 2708
(iii) : the connected SuperHyperEulerian-Type-Cycle-Neighbor; 2709
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 2710
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 2711
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor. 2712
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2713
coincide. 2714

which is a SuperHyperWheel. Then the number of 2716
(i) : the dual SuperHyperEulerian-Type-Cycle-Neighbor; 2717
(ii) : the dual SuperHyperEulerian-Type-Cycle-Neighbor; 2718
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Neighbor; 2719
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 2720
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 2721
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor. 2722
coincide. 2724

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2726
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2727
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2728
is a 2729
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2733
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2734
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2735


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2738
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2739
SuperHyperPart is a 2740
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2744
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2745
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2746

SuperHyperMultipartite. Then Then the number of 2749
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2756
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2757
Proposition 12.0.24. Let ESHG : (V, E) be a Extreme SuperHyperGraph. The number of 2759
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2760
(iv) : SuperHyperEulerian-Type-Cycle-Neighbor; 2764
(v) : strong 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2765
(vi) : connected 1-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2766

Proposition 12.0.25. Let ESHG : (V, E) be a Extreme SuperHyperGraph. Then the number is 2767
at most O(ESHG) and the Extreme number is at most On (ESHG). 2768
Proposition 12.0.26. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Su- 2769
perHyperComplete. The number is O(ESHG:(V,E))2 + 1 and the Extreme number is 2770

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

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

2 + 1)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2777
Proposition 12.0.27. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is ∅. The 2778
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2779
dual 2780
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2784
Proposition 12.0.28. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is SuperHy- 2787
perComplete. Then there’s no independent SuperHyperSet. 2788
Proposition 12.0.29. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is 2789

SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 2790
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 2791
dual 2792
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2796
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2797

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2798
Proposition 12.0.30. Let ESHG : (V, E) be a Extreme SuperHyperGraph which is Super- 2799
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2800

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2809
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2810
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2811
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2812
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2813
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 2814
(i) v ∈ Ns (x); 2815
(ii) vx ∈ E. 2816
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2817
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor, then 2818
(i) S is SuperHyperEulerian-Type-Cycle-Neighbor set; 2819
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2820
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2821
(i) Γ ≤ O; 2822
(ii) Γs ≤ On . 2823
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2824
connected. Then 2825
(i) Γ ≤ O − 1; 2826
(ii) Γs ≤ On − Σ3i=1 σi (x). 2827
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2828

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

SuperHyperEulerian-Type-Cycle-Neighbor; 2830
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2831
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2832
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2833
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2835
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2836
Neighbor; 2837
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2838
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2839
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2840
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Neighbor. Then 2842
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 2843
Type-Cycle-Neighbor; 2844
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2845
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2846
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2847
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Neighbor. Then 2849

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2853
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2854
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2856
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Neighbor; 2857
(ii) Γ = 1; 2858
(iii) Γs = Σ3i=1 σi (c); 2859

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle-Neighbor. 2860
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2861
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2862
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 2863
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2864
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2865
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2866
SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 2867
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2868
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type- 2869
Cycle-Neighbor; 2870
(ii) Γ = b n2 c + 1; 2871
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2872
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 2873
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2875
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2876
Neighbor; 2877
(ii) Γ = b n2 c; 2878

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

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 2883
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEulerian- 2884
Type-Cycle-Neighbor for N SHF; 2885
(ii) Γ = m for N SHF : (V, E); 2886
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2887
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 2888
Cycle-Neighbor for N SHF : (V, E). 2889

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

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2891
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 2892
SuperHyperEulerian-Type-Cycle-Neighbor for N SHF; 2893
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2894

b n c+1 for N SHF : (V, E); 2895
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperEulerian-Type-Cycle- 2896
Neighbor for N SHF : (V, E). 2897
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2898
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2899
bnc
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 2900
Neighbor for N SHF : (V, E); 2901
(ii) Γ = b n2 c for N SHF : (V, E); 2902

bnc for N SHF : (V, E); 2903
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Type-Cycle-Neighbor 2904
for N SHF : (V, E). 2905
following statements hold; 2907
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2908

SuperHyperEulerian-Type-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian- 2909
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2911

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

SuperHyperEulerian-Type-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian- 2917

SuperHyperEulerian-Type-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 2920
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2922
SuperHyperGraph. Then following statements hold; 2923

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

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

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

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


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

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


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

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

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

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

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


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

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

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


CHAPTER 13 2982
Extreme Applications in Cancer’s 2983
Extreme Recognition 2984
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2985
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2986
as the consequences of the model, some parameters are used. The cells are under attack of this 2987
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2988
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2989
In the following, some Extreme steps are Extreme devised on this disease. 2990
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2991
function. 2992
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2993
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2994
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2995
since there are some determinacy, indeterminacy and neutrality about the moves and the 2996
effects of the cancer on that region; this event leads us to choose another model [it’s said 2997
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2998
what’s done. 2999
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3000
they’ve got the names, and some general Extreme models. The moves and the Extreme 3001
traces of the cancer on the complex tracks and between complicated groups of cells 3002
could be fantasized by a Extreme SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Neighbor, 3003
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3004
aim is to find either the Extreme SuperHyperEulerian-Type-Cycle-Neighbor or the Extreme 3005
SuperHyperEulerian-Type-Cycle-Neighbor in those Extreme Extreme SuperHyperModels. 3006
137
CHAPTER 14 3007
Case 1: The Initial Extreme Steps 3008
Toward Extreme SuperHyperBipartite 3009
as Extreme SuperHyperModel 3010
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3011
is Extreme highlighted and Extreme featured. 3012
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3013
partite is obtained. 3014
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3015
Figure 14.1: a Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperEulerian-Type-Cycle-Neighbor 136NSHGaa21aa
139
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3019
Case 2: The Increasing Extreme Steps 3020
Toward Extreme 3021
SuperHyperMultipartite as Extreme 3022
SuperHyperModel 3023
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3024
ite is Extreme highlighted and Extreme featured. 3025
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3026
partite is obtained. 3027
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 3028
Figure 15.1: a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

141
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
ult, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMul- 3029

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

CHAPTER 16 3032
Wondering Open Problems But As The 3033
Directions To Forming The Motivations 3034
In what follows, some “problems” and some “questions” are proposed. 3035
The SuperHyperEulerian-Type-Cycle-Neighbor and the Extreme SuperHyperEulerian-Type-Cycle-Neighbor are 3036
defined on a real-world application, titled “Cancer’s Recognitions”. 3037
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3038
recognitions? 3039
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle- 3040

and the Extreme SuperHyperEulerian-Type-Cycle-Neighbor?
Neighbor 3041
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3042
them? 3043
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 3044
and the Extreme SuperHyperEulerian-Type-Cycle-Neighbor?
Problem 16.0.5. The SuperHyperEulerian-Type-Cycle-Neighbor and the Extreme SuperHyperEulerian- 3046

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperEulerian-Type-Cycle-Neighbor, are there else? 3048
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3049
Numbers types-results? 3050
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3051
the multiple types of SuperHyperNotions? 3052
143
CHAPTER 17 3053
Conclusion and Closing Remarks 3054
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3055
research are illustrated. Some benefits and some advantages of this research are highlighted. 3056
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3057
In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Cycle- 3058
Neighbor. For that sake in the second definition, the main definition of the Extreme 3059
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3060
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperEulerian- 3061
Type-Cycle-Neighbor, finds the convenient background to implement some results based on that. 3062
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3063
on the modeling of the regions where are under the attacks of the cancer to recognize this 3064
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 3065
the SuperHyperNotion, SuperHyperEulerian-Type-Cycle-Neighbor, the new SuperHyperClasses and 3066
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 3067
SuperHyperEulerian-Type-Cycle-Neighbor and the Extreme SuperHyperEulerian-Type-Cycle-Neighbor. The 3068

clarifications, instances and literature reviews have taken the whole way through. In this 3069
research, the literature reviews have fulfilled the lines containing the notions and the results. 3070
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 3071
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3072
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 3073
and the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Neighbor” in the themes of 3076
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 3077
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 3078
for this research are, figured out, pointed out and spoken out. 3079
145
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Cycle-Neighbor
3. Extreme SuperHyperEulerian-Type-Cycle-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3080
Extreme SuperHyperDuality But As The 3081
Super Forms 3083
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3084

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

Va ∈ Ei , Ej ; 3088
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3089
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3090
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3091
Vi , Vj ∈ Ea ; 3092
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3093
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3094
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3095
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3096

SuperHyperDuality. 3097
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3098

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3103
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3104
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3105
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3106
Extreme SuperHyperDuality; 3107
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3108

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3109
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3110
Extreme cardinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet 3111
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3112
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3113
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3114

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3115
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3116
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3117
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3118
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3119
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3121
coefficient; 3122
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3123

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3125
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3128
coefficient; 3131
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3132

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3134
cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 3136
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3139

SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3141
is the maximum Extreme cardinality of the Extreme SuperHyperVertices of a Extreme 3142

SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 3143
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3144
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3145

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3146
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3147


that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3152
to its Extreme coefficient; 3153
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3154

and Extreme rv-SuperHyperDuality and C(N SHG) for a Extreme SuperHyperGraph 3156
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3159
coefficient. 3162
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3165
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3166
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is a 3167
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3168
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3169
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as a Extreme 3170
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3174
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3175
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3176
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3178
perVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3179


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

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

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

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme SuperHyperDuality = {E3i+13i=0 , E3i+243i=0 }.

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

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


4 × 5 × 5z 3 .
C(N SHG)Extreme SuperHyperDuality = {E3i+13i=0 , E23 }.

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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


3 × 3z 2 .



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

(1 × 1 × 2)z.


(2 × 2 × 2)z.
C(N SHG)Extreme SuperHyperDuality = {E3i+1i=03 }.

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



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

C(N SHG)Extreme SuperHyperDuality =

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

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

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

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


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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3249
C(N SHG)Extreme Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
X
=( (min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |)choose|Pi ESHG:(V,E) |)
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality
Proof. Let 3251
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. 3255
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3256
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3257
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3258
representative in the 3259
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite ESHB : 3260

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

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3271
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3272

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

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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperDuality. 3289
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3290
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
Extreme Cardinality
|z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 3291
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Extreme Cardinality +1
ESHG:(V,E) Extreme Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperWheel ESHW : 3292

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

∃!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 3297
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3298
Extreme SuperHyperDuality. 3304

CHAPTER 19 3305
Extreme SuperHyperJoin But As The 3306
Super Forms 3308
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3309

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3320
|Vj |NEUTROSOPIC CARDINALITY ; 3321
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3322
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3323
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3324

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3328
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3329
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3330
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3331
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3332
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3333

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme car- 3335
dinality of the Extreme SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme 3336
that they form the Extreme SuperHyperJoin; 3338
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3339

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3340
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3341
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3342
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3343
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3344
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3345
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3346
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3347

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3349
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3350
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3351
of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3352
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3355


SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3359
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3360
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3361

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3363
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high Ex- 3364
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 3365
such that they form the Extreme SuperHyperJoin; 3366
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3367
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3368

is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3370
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3371
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3372

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

rv-SuperHyperJoin and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is 3377
the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3378
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3379
of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3380
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3382
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3385
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3386

SuperHyperJoin. 3392
C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some 3394
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3395
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3396
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3397
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, 3398
V3 , is excluded in every given Extreme SuperHyperJoin. 3399

is up. The Extreme Algorithm is Extremely straightforward. 3401


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

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

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperJoin = {V5 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

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

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

4 × 5 × 5z 3 .

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .




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

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

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

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

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


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

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

C(N SHG)Extreme SuperHyperJoin =

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

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

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

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


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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3469
C(N SHG)Extreme Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3471
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 3475
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3476
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3477
SuperHyperPart could have one SuperHyperVertex as the representative in the 3478
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3479

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

i

= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3490
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite ESHM : 3491


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3496
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperJoin. 3507

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

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

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

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

CHAPTER 20 3522
Extreme SuperHyperPerfect But As The 3523
Super Forms 3525
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3526

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3538
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3539

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3543
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3544
Extreme SuperHyperPerfect; 3548
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3549

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3556
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3557
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3562
coefficient; 3563
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3564

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3566
SuperHyperEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3569
coefficient; 3572
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3573

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

SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 3582

Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3585
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3586

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


that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3593
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3595

and Extreme rv-SuperHyperPerfect and C(N SHG) for a Extreme SuperHyperGraph 3597
SuperHyperVertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive 3600
coefficient. 3603
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3606
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3607
SuperHyperPerfect. 3613
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are 3615
some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in 3616
the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, 3617
no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHy- 3619
perVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3620


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

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

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

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme SuperHyperPerfect = {E3i+13i=0 , E3i+243i=0 }.

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

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


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

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

3 × 4 × 4z 3 .

3 × 2z 2 .

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


3 × 3z 2 .



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

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


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

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



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

C(N SHG)Extreme SuperHyperPerfect =

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

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

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3668
(31.1), is the SuperHyperPerfect. 3671
C(N SHG)Extreme SuperHyperPerfect =

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


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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3690
C(N SHG)Extreme Quasi-SuperHyperPerfect

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3692
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 3696
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3697
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3698
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3701

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

Then 3711

i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

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



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3716
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3717
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3718
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperPerfect. 3730
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

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


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

CHAPTER 21 3746
Extreme SuperHyperTotal But As The 3747
Super Forms 3749
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3750
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3753
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3754

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3760
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3761

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3765
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3768
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3769
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3770

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

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3775
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3776
e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3777

treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3778
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3779
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3780
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3781
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3783
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3784

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3785
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3786
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3787
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3788
perEdges of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3789
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3791
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3792

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3793
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3796
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3797
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3798

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3799
Extreme cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet 3801
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3803
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3804

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3805
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3806
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3809
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3810
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3811
coefficient; 3812
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3813

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3814
treme rv-SuperHyperTotal and C(N SHG) for a Extreme SuperHyperGraph N SHG : 3815

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3816
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3817
Vertices of a Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3818
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3820
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3823
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3824
SuperHyperTotal. 3830
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some 3832
empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. Thus in the terms 3833
of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3834
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3835
SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme SuperHyperVertex, 3836
V3 , is excluded in every given Extreme SuperHyperTotal. 3837



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

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

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme SuperHyperTotal = {Ei+19i=0 }.

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 3 .

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

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 10z 10 .

C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.

3 × 4 × 4z 3 .
C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V5 }.
C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.

C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1





4 × 3z 3 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
4 × 3z 4 .

2 × 4 × 3z 4 .

C(N SHG)Extreme R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .


C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .


C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .
C(N SHG)Extreme SuperHyperTotal =

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

Proof. Let 3881
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3885
(31.1), is the SuperHyperTotal. 3888
C(N SHG)Extreme SuperHyperTotal =

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


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

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

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

C(N SHG)Extreme SuperHyperTotal

= {Ea ∈ EPi ESHG:(V,E) ,
i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
= {VaEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3909
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3928
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 3929



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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperTotal. 3945
∗
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)| Extreme Cardinality
|z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 3947
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 3948



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

CHAPTER 22 3961
Extreme SuperHyperConnected But As 3962
The Extensions Excerpt From Dense And 3963
Super Forms 3964
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3965

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3979
SuperHyperConnected. 3980
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3981
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3984

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3998
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3999
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4000
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4001
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4002
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4003
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4004
corresponded to its Extreme coefficient; 4005
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4006

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

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

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4017
Extreme SuperHyperConnected; 4021
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4022

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 4024
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 4028

of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4029
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4030

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

contains the Extreme coefficients defined as the Extreme number of the maximum 4032
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 4033
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 4035
Extreme power is corresponded to its Extreme coefficient; 4036
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4037

SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for a 4039
cardinality of the Extreme SuperHyperVertices of a Extreme SuperHyperSet S of high 4042

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 4056
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 4057
E3 are some empty Extreme SuperHyperEdges but E4 is a Extreme SuperHyperEdge. 4058
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 4059
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 4060
there’s no Extreme SuperHyperEdge has it as a Extreme endpoint. Thus the Extreme 4061
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4062


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

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme Quasi-SuperHyperConnected = {Ei+19i=0 }.

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

C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

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

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

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4078

3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme SuperHyperConnected = {E1 , E2 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 5 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E9 , E6 }.

C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.



C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.

4 × 3z 3 .

C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
4 × 3z 4 .

2 × 4 × 3z 4 .


C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


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

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

C(N SHG)Extreme Quasi-SuperHyperConnected =

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

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

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

.
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality
Proof. Let 4115
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4132
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4134
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4143

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4144
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4151
Then 4153
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4154
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4155


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperConnected. 4172
∗
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4174
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4175

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4178
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4179
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4180
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4181
some representatives. The latter is straightforward. 4182
Extreme SuperHyperConnected. 4187

CHAPTER 23 4188
Background 4189

217














Bibliography 4396
10.33140/JMTCM.01.03.09) 4400


223
10.20944/preprints202301.0282.v1). 4433
10.20944/preprints202301.0267.v1). 4436

(doi: 10.20944/preprints202301.0265.v1). 4441
prints202301.0262.v1). 4445
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4451
prints202301.0105.v1). 4454
Preprints 2023, 2023010044 4460
10.20944/preprints202301.0043.v1). 4463

(doi: 10.20944/preprints202212.0549.v1). 4472
(doi: 10.20944/preprints202212.0500.v1). 4479
10.5281/zenodo.7871026). 4488
2023, (doi: 10.5281/zenodo.7874647). 4491

10.5281/zenodo.7857856). 4494
2023, (doi: 10.5281/zenodo.7857841). 4497

10.5281/zenodo.7853867). 4506
10.5281/zenodo.7853922). 4509
(doi: 10.5281/zenodo.7851519). 4512
(doi: 10.5281/zenodo.7851550). 4515
10.5281/zenodo.7834229). 4524
10.5281/zenodo.7834261). 4527
10.5281/zenodo.7824560). 4530

(doi: 10.5281/zenodo.7824623). 4533

2023, (doi: 10.5281/zenodo.7809365). 4544
2023, (doi: 10.5281/zenodo.7809358). 4547
10.5281/zenodo.7809219). 4550
10.5281/zenodo.7809328). 4553
2023, (doi: 10.5281/zenodo.7806767). 4556
2023, (doi: 10.5281/zenodo.7806838). 4559
10.5281/zenodo.7799902). 4568
(doi: 10.5281/zenodo.7804218). 4571
(doi: 10.5281/zenodo.7796334). 4574
10.5281/zenodo.7791952). 4580

10.5281/zenodo.7791982). 4583
10.5281/zenodo.7790026). 4586
10.5281/zenodo.7790052). 4589
2023, (doi: 10.5281/zenodo.7787066). 4592
10.5281/zenodo.7781476). 4598
10.5281/zenodo.7783082). 4601
10.5281/zenodo.7777857). 4604
10.5281/zenodo.7779286). 4607
(doi: 10.5281/zenodo.7771831). 4610
2023, (doi: 10.5281/zenodo.7772468). 4613
10.13140/RG.2.2.20913.25446). 4616
odo.7764916). 4619

10.13140/RG.2.2.11770.98247). 4622
10.13140/RG.2.2.12400.12808). 4625
2023, (doi: 10.13140/RG.2.2.22545.10089). 4628
10.13140/RG.2.2.11377.76644). 4634
10.13140/RG.2.2.23750.96329). 4637
10.13140/RG.2.2.31366.24641). 4640
10.13140/RG.2.2.34721.68960). 4643
2023, (doi: 10.13140/RG.2.2.30212.81289). 4646
10.13140/RG.2.2.24288.35842). 4652
10.13140/RG.2.2.32467.25124). 4655
10.13140/RG.2.2.31025.45925). 4658

10.13140/RG.2.2.17184.25602). 4661
10.13140/RG.2.2.23423.28327). 4664
10.13140/RG.2.2.28456.44805). 4667
10.13140/RG.2.2.23525.68320). 4670
10.13140/RG.2.2.20170.24000). 4673
10.13140/RG.2.2.36475.59683). 4676
10.13140/RG.2.2.29764.71046). 4679
2023, (doi: 10.13140/RG.2.2.18780.87683). 4682
10.13140/RG.2.2.26134.01603). 4688
10.13140/RG.2.2.27392.30721). 4691
10.13140/RG.2.2.33028.40321). 4694
10.13140/RG.2.2.21389.20966). 4697

10.13140/RG.2.2.16356.04489). 4700
10.13140/RG.2.2.21756.21129). 4703
10.13140/RG.2.2.30983.68009). 4706
10.13140/RG.2.2.28552.29445). 4709
(doi: 10.13140/RG.2.2.10936.21761). 4712
10.13140/RG.2.2.35105.89447). 4715
(doi: 10.13140/RG.2.2.30072.72960). 4718
10.13140/RG.2.2.31147.52003). 4721
10.13140/RG.2.2.32825.24163). 4724
10.13140/RG.2.2.13059.58401). 4727
10.13140/RG.2.2.11172.14720). 4730
2023, (doi: 10.13140/RG.2.2.22011.80165). 4733
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4736

2023, (doi: 10.13140/RG.2.2.10493.84962). 4739
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4742
2023, (doi: 10.13140/RG.2.2.19944.14086). 4745
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4748
(doi: 10.13140/RG.2.2.33103.76968). 4751
(doi: 10.13140/RG.2.2.23037.44003). 4754
(doi: 10.13140/RG.2.2.35646.56641). 4757
10.13140/RG.2.2.18030.48967). 4760
(doi: 10.13140/RG.2.2.13973.81121). 4763
2023, (doi: 10.13140/RG.2.2.34106.47047). 4766
2023, (doi: 10.13140/RG.2.2.31956.88961). 4772
2023, (doi: 10.13140/RG.2.2.15179.67361). 4775

10.13140/RG.2.2.21510.45125). 4778
2023, (doi: 10.13140/RG.2.2.13121.84321). 4781
10.13140/RG.2.2.11758.69441). 4784
2023, (doi: 10.13140/RG.2.2.31891.35367). 4787
10.13140/RG.2.2.19360.87048). 4790
10.13140/RG.2.2.32363.21286). 4793
10.13140/RG.2.2.23266.81602). 4796
10.13140/RG.2.2.19911.37285). 4799
10.13140/RG.2.2.11050.90569). 4802
2023, (doi: 10.13140/RG.2.2.17761.79206). 4805
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4811
(doi: 10.13140/RG.2.2.30182.50241). 4814

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 4856
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 4859



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

10.20944/preprints202301.0282.v1). 4880
10.20944/preprints202301.0267.v1).). 4883
(doi: 10.20944/preprints202301.0265.v1). 4888
prints202301.0262.v1). 4892


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

10.13140/RG.2.2.35061.65767). 4901

10.13140/RG.2.2.18494.15680). 4905

10.13140/RG.2.2.32530.73922). 4909

10.13140/RG.2.2.15897.70243). 4913

10.13140/RG.2.2.32530.73922). 4917

prints202301.0105.v1). 4920

10.13140/RG.2.2.23172.19849). 4927


10.13140/RG.2.2.17385.36968). 4937
Preprints 2023, 2023010044 4940
10.20944/preprints202301.0043.v1). 4943
2023, (doi: 10.13140/RG.2.2.28945.92007). 4946
10.13140/RG.2.2.35774.77123). 4952

10.13140/RG.2.2.29430.88642). 4958
(doi: 10.20944/preprints202212.0549.v1). 4964
10.13140/RG.2.2.19380.94084). 4967

(doi: 10.20944/preprints202212.0500.v1). 4978
10.13140/RG.2.2.20993.12640). 4981


10.13140/RG.2.2.29173.86244). 4996
2023 (doi: 10.5281/zenodo.7874677). 5001
(doi: 10.5281/zenodo.7857906). 5003
2023 (doi: 10.5281/zenodo.7856329). 5005

10.5281/zenodo.7854561). 5007
2023 (doi: 10.5281/zenodo.7851893). 5009

(doi: 10.5281/zenodo.7835063). 5013
(doi: 10.5281/zenodo.7826705). 5015
2023 (doi: 10.5281/zenodo.7820680). 5017
10.5281/zenodo.7812750). 5019

2023 (doi: 10.5281/zenodo.7807782). 5025
2023 (doi: 10.5281/zenodo.7804449). 5027
(doi: 10.5281/zenodo.7792307). 5031
(doi: 10.5281/zenodo.7790728). 5033
2023 (doi: 10.5281/zenodo.7787712). 5035
10.5281/zenodo.7783791). 5037
10.5281/zenodo.7780123). 5039
(doi: 10.5281/zenodo.7773119). 5041

odo.7637762). 5043
10.5281/zenodo.7766174). 5045
10.5281/zenodo.7762232). 5047
(doi: 10.5281/zenodo.7758601). 5049
10.5281/zenodo.7754661). 5051
10.5281/zenodo.7750995) . 5053
(doi: 10.5281/zenodo.7749875). 5055
10.5281/zenodo.7747236). 5057
10.5281/zenodo.7742587). 5059
(doi: 10.5281/zenodo.7738635). 5061
10.5281/zenodo.7734719). 5063
10.5281/zenodo.7730484). 5065
(doi: 10.5281/zenodo.7730469). 5067
10.5281/zenodo.7722865). 5069
odo.7713563). 5071
odo.7709116). 5073
10.5281/zenodo.7706415). 5075
10.5281/zenodo.7706063). 5077

10.5281/zenodo.7701906). 5079
odo.7700205). 5081
10.5281/zenodo.7694876). 5083
10.5281/zenodo.7679410). 5085
10.5281/zenodo.7675982). 5087
10.5281/zenodo.7672388). 5089
odo.7668648). 5091
10.5281/zenodo.7662810). 5093
10.5281/zenodo.7659162). 5095
odo.7653233). 5097
odo.7653204). 5099
odo.7653142). 5101
odo.7653117). 5103
odo.7651687). 5106
odo.7651619). 5108
odo.7651439). 5110
odo.7650729). 5112

odo.7647868). 5114
odo.7647017). 5116
odo.7644894). 5118
odo.7632923). 5121
odo.7623459). 5123
10.5281/zenodo.7606416). 5125
10.5281/zenodo.7606416). 5127
odo.7606404). 5129
10.5281/zenodo.7580018). 5131
odo.7580018). 5133
odo.7580018). 5135
odo.7579929). 5137
10.5281/zenodo.7563170). 5139
odo.7563164). 5141
odo.7563160). 5143
odo.7563160). 5145
10.5281/zenodo.7563160). 5147

10.5281/zenodo.7557063). 5149
10.5281/zenodo.7557009). 5151
10.5281/zenodo.7539484). 5153
10.5281/zenodo.7523390). 5155
10.5281/zenodo.7523390). 5157
10.5281/zenodo.7523390). 5159
odo.7574952). 5161
10.5281/zenodo.7574992). 5163
odo.7523357). 5165
10.5281/zenodo.7523357). 5167
10.5281/zenodo.7504782). 5169
10.5281/zenodo.7504782). 5171
10.5281/zenodo.7504782). 5173
10.5281/zenodo.7499395). 5175
odo.7499395). 5177
10.5281/zenodo.7499395). 5179
10.5281/zenodo.7497450). 5181
10.5281/zenodo.7497450). 5183

10.5281/zenodo.7494862). 5185
odo.7494862). 5187
10.5281/zenodo.7494862). 5189
10.5281/zenodo.7493845). 5191
odo.7493845). 5193
10.5281/zenodo.7493845). 5195
odo.7539484). 5197
odo.7523390). 5199
odo.7523357). 5201
odo.7504782). 5203
odo.7499395). 5205
odo.7497450). 5207
odo.7494862). 5209
odo.7493845). 5211
odo.7480110). 5213
odo.7378758). 5215
odo.6320305). 5217
odo.6677173). 5219

CHAPTER 24 5220
Cancer In Neutrosophic 5221
SuperHyperGraph 5222
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5223
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5224
disease is considered and as the consequences of the model, some parameters are used. The cells 5225
are under attack of this disease but the moves of the cancer in the special region are the matter 5226
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5227
treatments for this Neutrosophic disease. 5228
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5229
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5230
term Neutrosophic function. 5231
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5232
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5233
move from the cancer is identified by this research. Sometimes the move of the cancer 5234
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5235
about the moves and the effects of the cancer on that region; this event leads us to 5236
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5237
perception on what’s happened and what’s done. 5238
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5239
known and they’ve got the names, and some general Neutrosophic models. The moves 5240
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5241
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5242
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5243
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5244
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5245
Models. 5246
Some cells have been faced with some attacks from the situation which is caused by the 5247
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5248
which in that, the cells could be labelled as some groups and some groups or individuals have 5249
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5250
the embedded situations, the individuals of cells and the groups of cells could be considered 5251
245
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5252
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5253
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5254
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5255
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5256
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5257
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5258
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5259
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5260
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5261
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5262
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5263
out what’s going on this phenomenon. The special case of this disease is considered and as the 5264
consequences of the model, some parameters are used. The cells are under attack of this disease 5265
but the moves of the cancer in the special region are the matter of mind. The recognition of 5266
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5267
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5268
both bases are the background of this research. Sometimes the cancer has been happened on the 5269
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5270
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5271
in the forms of alliances’ styles with the formation of the design and the architecture are 5272
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5273
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5274
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5275
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5276
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5277
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5278
and the effects of the cancer on that region; this event leads us to choose another model [it’s 5279
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 5280
and what’s done. There are some specific models, which are well-known and they’ve got the 5281
names, and some general models. The moves and the traces of the cancer on the complex tracks 5282
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5283
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5284
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5285
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5286
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5287
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5288
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5289
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5290
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5291
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5293
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5294
based on the fixed groups of cells or the fixed groups of group of cells? 5295
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5296

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5300
Then the research has taken more motivations to define SuperHyperClasses and to find some 5301
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5302
some instances and examples to make clarifications about the framework of this research. The 5303
general results and some results about some connections are some avenues to make key point of 5304
this research, “Cancer’s Recognition”, more understandable and more clear. 5305
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5306
research on the modeling of the regions where are under the attacks of the cancer to 5307
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5308
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5309
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5310
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5311

instances and literature reviews have taken the whole way through. In this scientific research, 5312
the literature reviews have fulfilled the lines containing the notions and the results. The 5313
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5314
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5316
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5317
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5318
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5319
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5320
to figure out the background for the SuperHyperNotions. 5321

CHAPTER 25 5322
Neutrosophic 5323
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5325
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5326
2023, (doi: 10.13140/RG.2.2.34953.52320). 5327
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5328
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5329
(doi: 10.13140/RG.2.2.33275.80161). 5330
10.13140/RG.2.2.11050.90569). 5333
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5334
10.13140/RG.2.2.17761.79206). 5336
10.13140/RG.2.2.19911.37285). 5339
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5340
10.13140/RG.2.2.23266.81602). 5342
10.13140/RG.2.2.19360.87048). 5345
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5346
10.13140/RG.2.2.32363.21286). 5348
10.13140/RG.2.2.11758.69441). 5351
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5352
10.13140/RG.2.2.31891.35367). 5354
249

10.13140/RG.2.2.21510.45125). 5357
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5358
10.13140/RG.2.2.13121.84321). 5360

CHAPTER 26 5361
New Ideas In Recognition of Cancer And 5362
Neutrosophic SuperHyperGraph By 5363
Eulerian-Type-Cycle-Neighbor As Hyper 5364
Nebbish On Super Nebulous 5365
251
CHAPTER 27 5366
ABSTRACT 5367
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5368

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

criteria holds 5373
∀N (Ea ) ∈ C : C is
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutro- 5374

sophic e-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 5375
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 5376

SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutrosophic v- 5377
SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 5378
∀N (Va ) ∈ C : C is
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is called Neutro- 5379

sophic v-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 5380
∀N (Va ) ∈ C : C is
253
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic 5381

SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle- 5382
Neighbor, Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian- 5383
Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor. ((Neutrosophic) 5384
SuperHyperEulerian-Type-Cycle-Neighbor). Assume a Neutrosophic SuperHyperGraph (NSHG) S is 5385
a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. 5386
Then E is called an Extreme SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 5387

rosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle- 5389
Neighbor and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5390
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the 5391
Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5392
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Type- 5393
Cycle-Neighbor; a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 5394
rosophic v-SuperHyperEulerian-Type-Cycle-Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type- 5396
Cycle-Neighbor and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5397
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5398
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 5399

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5400
SuperHyperEulerian-Type-Cycle-Neighbor; an Extreme SuperHyperEulerian-Type-Cycle-Neighbor SuperHy- 5401
perPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 5402
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme Super- 5404
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5405
Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5407

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5416

power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Type- 5419
Cycle-Neighbor if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 5420
Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme SuperHy- 5422

perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5423
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5424
form the Extreme SuperHyperEulerian-Type-Cycle-Neighbor; a Neutrosophic V-SuperHyperEulerian-Type- 5426

Cycle-Neighborif it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic 5427

Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for a Neutrosophic Super- 5429
HyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5430
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5431
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5432
the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; an Extreme V-SuperHyperEulerian-Type-Cycle- 5433

Neighbor SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, 5434
Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic v-SuperHyperEulerian-Type-Cycle- 5435
Neighbor, and Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor and C(N SHG) for an Extreme 5436
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5437
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 5439


the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5448
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 5451
introduced for new SuperHyperNotions, namely, a SuperHyperEulerian-Type-Cycle-Neighbor and Neut- 5452
rosophic SuperHyperEulerian-Type-Cycle-Neighbor. Two different types of SuperHyperDefinitions are 5453
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5454
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5455
implemented in the whole of this research. For shining the elegancy and the significancy of this 5456
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5457
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5458
and the instances thus the clarifications are driven with different tools. The applications are 5459
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5460
Recognition” are the under research to figure out the challenges make sense about ongoing and 5461
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5466
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5467
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5468
research. It’s also officially collected in the form of some questions and some problems. Assume 5469
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Type-Cycle-Neighbor 5470

first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5474
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Neighbor is a 5475
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5476
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5477
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5478
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5479
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 5480
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of 5481
a SuperHyperEulerian-Type-Cycle-Neighbor . Since there’s more ways to get type-results to make 5482
a SuperHyperEulerian-Type-Cycle-Neighbor more understandable. For the sake of having Neut- 5483
rosophic SuperHyperEulerian-Type-Cycle-Neighbor, there’s a need to “redefine” the notion of a 5484
“SuperHyperEulerian-Type-Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are 5485

assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5486
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Type-Cycle-Neighbor . 5487
It’s redefined a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if the mentioned Table holds, 5488
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5489
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5490
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5491
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5492
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 5493
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 5494
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 5495
Graph based on a SuperHyperEulerian-Type-Cycle-Neighbor . It’s the main. It’ll be disciplinary 5496
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s 5497
a need to have all SuperHyperEulerian-Type-Cycle-Neighbor until the SuperHyperEulerian-Type-Cycle- 5498
Neighbor, then it’s officially called a “SuperHyperEulerian-Type-Cycle-Neighbor” but otherwise, it isn’t 5499
a SuperHyperEulerian-Type-Cycle-Neighbor . There are some instances about the clarifications for 5500
the main definition titled a “SuperHyperEulerian-Type-Cycle-Neighbor ”. These two examples get 5501
more scrutiny and discernment since there are characterized in the disciplinary ways of the 5502
SuperHyperClass based on a SuperHyperEulerian-Type-Cycle-Neighbor . For the sake of having a 5503

Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, there’s a need to “redefine” the notion of a 5504
“Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor” and a “Neutrosophic SuperHyperEulerian-Type- 5505
Cycle-Neighbor ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 5506
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to 5507
assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic 5508
SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Type-Cycle-Neighbor 5509
are redefined to a “Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor” if the intended Table 5510
holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 5511
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Type- 5512
Cycle-Neighbor more understandable. Assume a Neutrosophic SuperHyperGraph. There are 5513
some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 5514
SuperHyperEulerian-Type-Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 5515
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 5516
SuperHyperEulerian-Type-Cycle-Neighbor”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 5517
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 5518

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 5519

” where it’s the strongest [the maximum Neutrosophic value from all the
SuperHyperEulerian-Type-Cycle-Neighbor amid the maximum value amid all SuperHyperVertices 5521
from a SuperHyperEulerian-Type-Cycle-Neighbor .] SuperHyperEulerian-Type-Cycle-Neighbor . A graph is a 5522
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5524
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5525
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Type-Cycle-Neighbor if it’s only one 5526
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5527
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5528
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5529
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5530
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5531
and the common and intended properties between “specific” cells and “specific group” of 5538
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 5539
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 5540
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, the 5541
foundation will be based on the “Cancer’s Recognition” and the results and the definitions 5542
will be introduced in redeemed ways. The recognition of the cancer in the long-term function. 5543
The specific region has been assigned by the model [it’s called SuperHyperGraph] and the 5544
long cycle of the move from the cancer is identified by this research. Sometimes the move of 5545
the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and 5546
neutrality about the moves and the effects of the cancer on that region; this event leads us 5547
moves and the traces of the cancer on the complex tracks and between complicated groups 5551
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 5552
The aim is to find either the longest SuperHyperEulerian-Type-Cycle-Neighbor or the strongest 5554
SuperHyperEulerian-Type-Cycle-Neighbor in those Neutrosophic SuperHyperModels. For the longest 5555
SuperHyperEulerian-Type-Cycle-Neighbor, called SuperHyperEulerian-Type-Cycle-Neighbor, and the strongest 5556
SuperHyperEulerian-Type-Cycle-Neighbor, called Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, 5557
some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHy- 5558
perPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at 5559
least three SuperHyperEdges to form any style of a SuperHyperEulerian-Type-Cycle-Neighbor. There 5560

isn’t any formation of any SuperHyperEulerian-Type-Cycle-Neighbor but literarily, it’s the deformation 5561
of any SuperHyperEulerian-Type-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. A basic 5562
familiarity with Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor theory, SuperHyperGraphs, 5563
and Neutrosophic SuperHyperGraphs theory are proposed. 5564

Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Type-Cycle-Neighbor, Cancer’s 5565

CHAPTER 28 5568
Applied Notions Under The Scrutiny Of 5569
The Motivation Of This Scientific 5570
Research 5571
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5572
try to bring the motivations in the narrative ways. Some cells have been faced with some 5573
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5574
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5575
as some groups and some groups or individuals have excessive labels which all are raised from 5576
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5577
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5578
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5579
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5580
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5581
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5582
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5583
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5584
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5585
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5586
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5587
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5588
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5589
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5590
case of this disease is considered and as the consequences of the model, some parameters are used. 5591
The cells are under attack of this disease but the moves of the cancer in the special region are the 5592
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5593
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5594
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5595
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5597
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5598
architecture are formally called “ SuperHyperEulerian-Type-Cycle-Neighbor” in the themes of jargons 5599
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5600
259
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5601
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5605
well-known and they’ve got the names, and some general models. The moves and the traces of 5608
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5609
by a Neutrosophic SuperHyperPath (-/SuperHyperEulerian-Type-Cycle-Neighbor, SuperHyperStar, 5610
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 5611
the optimal SuperHyperEulerian-Type-Cycle-Neighbor or the Neutrosophic SuperHyperEulerian-Type- 5612
Cycle-Neighbor in those Neutrosophic SuperHyperModels. Some general results are introduced. 5613
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5614
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 5615
to form any style of a SuperHyperEulerian-Type-Cycle-Neighbor. There isn’t any formation of any 5616
SuperHyperEulerian-Type-Cycle-Neighbor but literarily, it’s the deformation of any SuperHyperEulerian- 5617
Type-Cycle-Neighbor. It, literarily, deforms and it doesn’t form. 5618
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find the 5619
“ amount of SuperHyperEulerian-Type-Cycle-Neighbor” of either individual of cells or the groups of cells 5620

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 5621
Type-Cycle-Neighbor” based on the fixed groups of cells or the fixed groups of group of cells? 5622
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5623
these messy and dense SuperHyperModels where embedded notions are illustrated? 5624
Thus it motivates us to define different types of “ SuperHyperEulerian-Type-Cycle-Neighbor” and 5626
“Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor” on “SuperHyperGraph” and “Neutrosophic 5627

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5628
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5629
motivates us to get some instances and examples to make clarifications about the framework of 5630
this research. The general results and some results about some connections are some avenues to 5631
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5632
The framework of this research is as follows. In the beginning, I introduce basic definitions 5633
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5634
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5635
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5636
review literature are applied to make sense about what’s going to figure out about the up- 5637
coming sections. The main definitions and their clarifications alongside some results about 5638
new notions, SuperHyperEulerian-Type-Cycle-Neighbor and Neutrosophic SuperHyperEulerian-Type-Cycle- 5639

Neighbor, are figured out in sections “ SuperHyperEulerian-Type-Cycle-Neighbor” and “Neutrosophic 5640
SuperHyperEulerian-Type-Cycle-Neighbor”. In the sense of tackling on getting results and in Eulerian- 5641
Type-Cycle-Neighbor to make sense about continuing the research, the ideas of SuperHyperUniform 5642
and Neutrosophic SuperHyperUniform are introduced and as their consequences, corresponded 5643
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 5644
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. As going back to origin 5645

of the notions, there are some smart steps toward the common notions to extend the new notions 5646
in new frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections 5647
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter 5648
research about the general SuperHyperRelations and as concluding and closing section of 5649
theoretical research are contained in the section “General Results”. Some general SuperHy- 5650
perRelations are fundamental and they are well-known as fundamental SuperHyperNotions as 5651
elicited and discussed in the sections, “General Results”, “ SuperHyperEulerian-Type-Cycle-Neighbor”, 5652

“Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor”, “Results on SuperHyperClasses” and “Res- 5653
ults on Neutrosophic SuperHyperClasses”. There are curious questions about what’s done 5654
about the SuperHyperNotions to make sense about excellency of this research and going to 5655
figure out the word “best” as the description and adjective for this research as presented in 5656
section, “ SuperHyperEulerian-Type-Cycle-Neighbor”. The keyword of this research debut in the section 5657
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 5658
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 5659
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 5660
are some scrutiny and discernment on what’s done and what’s happened in this research in 5661
the terms of “questions” and “problems” to make sense to figure out this research in featured 5662
style. The advantages and the limitations of this research alongside about what’s done in this 5663
research to make sense and to get sense about what’s figured out are included in the section, 5664
“Conclusion and Closing Remarks”. 5665

CHAPTER 29 5666
Neutrosophic Preliminaries Of This 5667
Scientific Research On the Redeemed 5668
Ways 5669
In this section, the basic material in this scientific research, is referred to [Single Valued 5670
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5671

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5672
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5673
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5674
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5675
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5676
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5677
their clarifications are addressed to Ref.[HG38]. 5678
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5679
the new ideas and their clarifications are elicited. 5680
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

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

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

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5720
x, y, z, w ∈ [0, 1]: 5721
(i) 1 ⊗ x = x; 5722
(ii) x ⊗ y = y ⊗ x; 5723
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5724
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5725

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

where 5728

1, 2, . . . , n0 ); 5733
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5734
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5735
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5736
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5737
0


Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 5749
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 5750
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 5751
SuperEdge; 5757
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 5760
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 5761
makes the patterns and regularities. 5762
Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5763
of elements of SuperHyperEdges are the same. 5764

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5765
makes to have SuperHyperUniform more understandable. 5766
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5767
Classes as follows. 5768
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5769
two given SuperHyperEdges with two exceptions; 5770
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5771
SuperHyperEdges; 5772
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5773
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5774
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5775
in common; 5776
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5777
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5778
SuperHyperEdge in common; 5779
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5780
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5781
SuperVertex. 5782
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 5783
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5784
(i) Vi , Vi+1 ∈ Ei0 ; 5785
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5786
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5787
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5788
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5789
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5790
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5791
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5792
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5794
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5795
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5796
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5797
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5798
perPath . 5799
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 5800
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5801
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5802
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5803
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5804
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5805

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

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


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

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

Neighbor). 5822
(i) Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 5826

called Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 5827
∀N (Ea ) ∈ C : C is
(ii) Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 5828

called Neutrosophic re-SuperHyperEulerian-Type-Cycle-Neighbor criteria holds 5829
∀N (Ea ) ∈ C : C is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5830
(iii) Neutrosophic v-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 5831
∀N (Va ) ∈ C : C is
(iv) Neutrosophic rv-SuperHyperEulerian-Type-Cycle-Neighbor if the following expression is 5833
∀N (Va ) ∈ C : C is

(v) Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutrosophic 5836

Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Type-Cycle-Neighbor). 5840

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


(ii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutro- 5851


form the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; 5858
(iii) an Extreme SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial if 5859

it’s either of Neutrosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re- 5860
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5865

(iv) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 5869



(v) an Extreme V-SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neutro- 5880

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5885
(vi) a Neutrosophic V-SuperHyperEulerian-Type-Cycle-Neighbor if it’s either of Neut- 5888

rosophic e-SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic re-SuperHyperEulerian-Type- 5889

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5892
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5893
that they form the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor; 5895
(vii) an Extreme V-SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 5896


(viii) a Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor SuperHyperPolynomial 5906


Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Type-Cycle-Neighbor). 5917

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 5918
(i) an δ−SuperHyperEulerian-Type-Cycle-Neighbor is a Neutrosophic kind of Neutrosophic 5919
SuperHyperEulerian-Type-Cycle-Neighbor such that either of the following expressions hold for 5920


136TBL3
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5921
|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 5922

(29.1), holds if S is an δ−SuperHyperDefensive; 5923
(ii) a Neutrosophic δ−SuperHyperEulerian-Type-Cycle-Neighbor is a Neutrosophic kind 5924

of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor such that either of the following 5925
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5926
of s ∈ S : 5927
|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 5928

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

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5939
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Type-Cycle-Neighbor, SuperHyperStar, 5940
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5941
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5942
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5943
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5944

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

136TBL4

136TBL1
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian-Type-Cycle- 5945

Neighbor. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperEulerian- 5946
Type-Cycle-Neighbor more Neutrosophicly understandable. 5947
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor”. The 5949

5952
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Type-Cycle-Neighbor. It’s redefined a Neutro- 5953

sophic SuperHyperEulerian-Type-Cycle-Neighbor if the Table (29.3) holds. 5954

CHAPTER 30 5955
Neutrosophic SuperHyper But Eulerian-Type-Cycle-Neighbor 5956
As The Extensions Excerpt From Dense 5957
And Super Forms 5958
Definition 30.0.1. (Neutrosophic event). 5959
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5960

S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Any Neutrosophic k-subset of A of V 5961
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5962
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5963
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5964

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5965
a probability Eulerian-Type-Cycle-Neighbor. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5966

s-independent if the following expression is called Neutrosophic s-independent criteria 5967
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. 5968
The following expression is called Neutrosophic independent criteria 5969
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 5970

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5971
is a probability Eulerian-Type-Cycle-Neighbor. Any k-function Eulerian-Type-Cycle-Neighbor like E is called 5972

Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Type-Cycle-Neighbor like E is 5973
called Neutrosophic Variable. 5974
The notion of independent on Neutrosophic Variable is likewise. 5975
Definition 30.0.4. (Neutrosophic Expectation). 5976
275
is a probability Eulerian-Type-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 5978

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5979
criteria 5980
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5981

is a probability Eulerian-Type-Cycle-Neighbor. A Neutrosophic number is called Neutrosophic 5983
Crossing if the following expression is called Neutrosophic Crossing criteria 5984
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). 5985
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let m and n propose special Eulerian- 5986
Type-Cycle-Neighbor. Then with m ≥ 4n, 5987
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-Neighbor 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: 5988
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5989
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5990
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let P be a SuperHyperSet of n 5991
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 5992
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5993
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 5994

whose SuperHyperEdge are the segments between consecutive points on the SuperHyperLines 5995
which pass through at least k + 1 points of P. This Neutrosophic SuperHyperGraph has at least 5996
kl SuperHyperEdges and Neutrosophic crossing at most l choose two. Thus either kl < 4n, in 5997
3
which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic 5998
2 3
Crossing Lemma, and again l < 32n /k . 5999

Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let P be a SuperHyperSet of n 6001
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6002
Then k < 5n4/3 . 6003
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 6004
(V, E) is a probability Eulerian-Type-Cycle-Neighbor. Draw a SuperHyperUnit SuperHyperCircle around 6005

each SuperHyperPoint of P. Let ni be the Neutrosophic number of these SuperHyperCircles 6006
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P P
passing through exactly i points of P. Then 6007
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6008
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6009
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6010
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 6011

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6012
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6013
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6014
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6015
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6016
4/3 4/3
k < 4n + n < 5n . 6017
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6018
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let X be a nonnegative Neutrosophic 6019
Variable and t a positive real number. Then 6020
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. 6021
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6022
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let Xn be a nonnegative integer- 6023
valued variable in a probability Eulerian-Type-Cycle-Neighbor (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 6024

then P (Xn = 0) → 1 as n → ∞. 6025
Proof. 6026
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. A special SuperHyperGraph in Gn,p 6028
almost surely has stability number at most d2p−1 log ne. 6029

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6030
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. A special SuperHyperGraph in Gn,p is 6031
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6032
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6033
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6034
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6035
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6036
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6037
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 6038
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6039
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: 6040
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6041
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 6042
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6043
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6044
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6045
Definition 30.0.12. (Neutrosophic Variance). 6046
is a probability Eulerian-Type-Cycle-Neighbor. A Neutrosophic k-Variable E has a number is called 6048
Neutrosophic Variance if the following expression is called Neutrosophic Variance 6049
criteria 6050
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let X be a Neutrosophic Variable 6052
and let t be a positive real number. Then 6053
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let X be a Neutrosophic Variable and let t 6055
be a positive real number. Then 6056
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6057
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let Xn be a Neutrosophic Variable 6059
in a probability Eulerian-Type-Cycle-Neighbor (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6060
then 6061
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Set X := Xn and t := |Ex(Xn )| in 6063
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6064
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6065
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6067
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6068
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6069
S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. As in the proof of related Theorem, the 6071
result is straightforward. 6072
Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let G ∈ Gn,1/2 and let f and k ∗ be 6074
as defined in previous Theorem. Then either: 6075
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6076
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6077
Definition 30.0.17. (Neutrosophic Threshold). 6080

is a probability Eulerian-Type-Cycle-Neighbor. Let P be a monotone property of SuperHyperGraphs 6082
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6083
for P is a function f (n) such that: 6084
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6085
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6086

Definition 30.0.18. (Neutrosophic Balanced). 6087

is a probability Eulerian-Type-Cycle-Neighbor. Let F be a fixed Neutrosophic SuperHyperGraph. Then 6089
there is a threshold function for the property of containing a copy of F as a Neutrosophic 6090
SubSuperHyperGraph is called Neutrosophic Balanced. 6091
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6092

(V, E). Consider S = (V, E) is a probability Eulerian-Type-Cycle-Neighbor. Let F be a nonempty 6093
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6094
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6095
SubSuperHyperGraph. 6096
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6099
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6100
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6101

SuperHyperEulerian-Type-Cycle-Neighbor, is up. The Neutrosophic Algorithm is Neutrosophicly 6102
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6103
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6104

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6105
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6106
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6107
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6108
Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6109
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Neighbor

= {E4 }.
C(N SHG)Neutrosophic Eulerian-Type-Cycle-Neighbor SuperHyperPolynomial
= z3.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Neighbor
= {V1 , V2 , V4 }.
C(N SHG)Neutrosophic V-Eulerian-Type-Cycle-Neighbor SuperHyperPolynomial
= z 5 + 2z 3 .
6110

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6113
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6114
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6115
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6116
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6117

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Type- 6118

Cycle-Neighbor. 6119

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


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



= z8 + z4 + z3.
6124


= {E4 , E1 , E5 }.
= 2z 5 + z 3 .
= {V3 }.
= z2.
6128






= {E1 , E2 , E3 , E4 }.
= 2z 5 + 2z 4 .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
6132


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



= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
6136


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




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


= {Ei ∈ EN SHG }.



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


= {E4 , E5 , E6 , E7 }.
= 4z 2 .
= {V12 , V13 , V14 }.
= 2z 5 + z 3 .


6152


= {E2 , E3 , E4 , E5 }.
= z 3 + 3z 2 .
= {V4 , V5 , V6 }.
= 2z 5 + z 3 .
6156






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


= {E2 , E3 , E4 , E5 , E1 , E10 , E9 }.
= 2z 3 + 5z 2 .
= {V4 , V5 , V6 , V1 , V2 , V3 }.



X
= z |{Vi ∈VN SHG }| .
6164


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



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




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


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



= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
6180


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






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


= {Ei ∈ EN SHG }.


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


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V3 }.


Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 95NHG1
= z5 + z3.
6196


= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {V1 , V3 }.


Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.3) 95NHG2
= z5 + z3.
6200
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6201
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Cycle- 6202
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6203
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with 6204
no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of 6205
them. 6206
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6207

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6208
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6209
Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to some 6210
of them but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6211
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6212
quasi-R-Eulerian-Type-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them but 6213
not all of them. 6214
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-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Cycle- 6215
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6216
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6217
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6218
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6219
Neutrosophic Eulerian-Type-Cycle-Neighbor in some cases but the maximum number of the Neutrosophic 6220
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6221

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

cardinality, the lower sharp Neutrosophic bound for cardinality. 6225
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6226
(V, E). Then in the worst case, literally, 6227
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Eulerian-Type-Cycle-Neighbor. In other words, the least cardinality, the 6228

lower sharp bound for the cardinality, of a Neutrosophic type-result-Eulerian-Type-Cycle-Neighbor is the 6229
cardinality of 6230

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Eulerian−T ype−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Eulerian−T ype−Cycle−N eighborSuperHyperP 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-Neighbor
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-Neighbor. In other words, the least cardinality, the lower sharp bound
for the cardinality, of a quasi-R-Eulerian-Type-Cycle-Neighbor 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-Neighbor. 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-Neighbor 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-Neighbor. 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-Neighbor
has the Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-
Eulerian-Type-Cycle-Neighbor 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-Neighbor 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-Neighbor” 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-Neighbor 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-Neighbor 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-
Neighbor. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Eulerian-Type-Cycle-Neighbor. 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-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Eulerian-Type-Cycle-Neighbor 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-Neighbor. Let

E
Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6231
Neutrosophic R-Eulerian-Type-Cycle-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6232
Neutrosophic R-Eulerian-Type-Cycle-Neighbor =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor 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-Neighbor, 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-
Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Eulerian-Type-Cycle- 6233
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6234
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6235
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6236

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6237
rosophic Eulerian-Type-Cycle-Neighbor in some cases but the maximum number of the Neutrosophic 6238
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6239
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Eulerian-Type-Cycle- 6240
Neighbor. 6241
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6242
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6243

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6244
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6245
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6246
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6247
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6248
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6249
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s 6250
at least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyper- 6251
Vertices. Thus it forms a Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor where the Neutrosophic 6252
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6253
embedded R-Eulerian-Type-Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and 6254
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6255
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6256
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6257
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6258
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neutro- 6259
sophic R-Eulerian-Type-Cycle-Neighbor. The interior types of the Neutrosophic SuperHyperVertices 6260
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6261
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6262
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6263
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Eulerian-Type-Cycle- 6264
Neighbor. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6265
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6266
SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6267

Eulerian-Type-Cycle-Neighbor, there’s the usage of exterior Neutrosophic SuperHyperVertices since 6268
they’ve more connections inside more than outside. Thus the title “exterior” is more relevant 6269
than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, 6270
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyper- 6271
Element has been ignored in the exploring to lead on the optimal case implying the Neutrosophic 6272
R-Eulerian-Type-Cycle-Neighbor. The Neutrosophic R-Eulerian-Type-Cycle-Neighbor with the exclusion of the 6273
exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6274
other terms, the Neutrosophic R-Eulerian-Type-Cycle-Neighbor with the inclusion of all Neutrosophic 6275
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Eulerian- 6276
Type-Cycle-Neighbor. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6277
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the 6278
maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any 6279
given Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor 6280
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6281
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6282

an Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor 6283

to some of them but not all of them. 6284
The main definition of the Neutrosophic R-Eulerian-Type-Cycle-Neighbor has two titles. a Neut- 6285
rosophic quasi-R-Eulerian-Type-Cycle-Neighbor and its corresponded quasi-maximum Neutrosophic 6286
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6287
number, there’s a Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor with that quasi-maximum Neut- 6288
rosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHyper- 6289

Graph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic quasi- 6290
SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Eulerian-Type- 6291
Cycle-Neighbors for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6292
number. The essence of the Neutrosophic Eulerian-Type-Cycle-Neighbor ends up but this essence starts 6293
up in the terms of the Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbor, again and more in the 6294
operations of collecting all the Neutrosophic quasi-R-Eulerian-Type-Cycle-Neighbors acted on the all 6295
possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6296
number. This Neutrosophic number is 6297
considered as the equivalence class for all corresponded quasi-R-Eulerian-Type-Cycle-Neighbors. 6298
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Eulerian-Type-Cycle-Neighbor be a 6299
Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Eulerian-Type-Cycle- 6300
Neighbor. Then 6301
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Eulerian-Type-Cycle-Neighbor ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Eulerian-Type-Cycle-Neighbor is re- 6302
formalized and redefined as follows. 6303
GNeutrosophic Eulerian-Type-Cycle-Neighbor ∈ ∪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 6304
definition for the Neutrosophic Eulerian-Type-Cycle-Neighbor. 6305
GNeutrosophic Eulerian-Type-Cycle-Neighbor =
{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- 6306
poses the upcoming expressions.
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6308
= max zNeutrosophic Number

And then, 6309

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


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


6312

6313

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic Supe- 6314
rHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHyperVer- 6315
tices such that any amount of its Neutrosophic SuperHyperVertices are incident to a Neutrosophic 6316
SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Eulerian-Type-Cycle-Neighbor” 6317
but, precisely, it’s the generalization of “Neutrosophic Quasi-Eulerian-Type-Cycle-Neighbor” since 6318
“Neutrosophic Quasi-Eulerian-Type-Cycle-Neighbor” happens “Neutrosophic Eulerian-Type-Cycle-Neighbor” in 6319
a Neutrosophic SuperHyperGraph as initial framework and background but “Neutrosophic 6320
SuperHyperNeighborhood” may not happens “Neutrosophic Eulerian-Type-Cycle-Neighbor” in a Neut- 6321
rosophic SuperHyperGraph as initial framework and preliminarily background since there are 6322
some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. To get orderly 6323
keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic Quasi-Eulerian- 6324
Type-Cycle-Neighbor”, and “Neutrosophic Eulerian-Type-Cycle-Neighbor” are up. 6325
Thus, let 6326
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6327

GNeutrosophic Eulerian-Type-Cycle-Neighbor be a Neutrosophic number, a Neutrosophic SuperHyper- 6328
Neighborhood and a Neutrosophic Eulerian-Type-Cycle-Neighbor and the new terms are up. 6329
GNeutrosophic Eulerian-Type-Cycle-Neighbor ∈ ∪zNeutrosophic Number

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

6331
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6332
And with go back to initial structure, 6333
GNeutrosophic Eulerian-Type-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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

6335


6336

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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Eulerian-Type-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyper-

Graph 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-Neighbor is related to the Neutrosophic SuperHyperSet of the
Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Neighbor is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Neighbor 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-Neighbor 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 SuperHyperVertices,
Cycle-Neighbor
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Eulerian-Type-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices
instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-
Type-Cycle-Neighbor and it’s an Neutrosophic Eulerian-Type-Cycle-Neighbor. 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-Neighbor. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Eulerian-Type-Cycle-Neighbor,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Eulerian-
, not:
Type-Cycle-Neighbor
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6337
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6338
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6339
type-SuperHyperSet called the 6340
“Neutrosophic R-Eulerian-Type-Cycle-Neighbor” 6341

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6342
Neutrosophic R-Eulerian-Type-Cycle-Neighbor, 6343
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-Neighbor amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Eulerian-Type-Cycle-Neighbor, 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-Neighbor. In other words, the least cardinality, the lower

sharp bound for the cardinality, of a Neutrosophic R-Eulerian-Type-Cycle-Neighbor is the cardinality of
6344
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6345
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Eulerian-Type-Cycle- 6346
Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some 6347
interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6348
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6349
amount of them. 6350
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6351
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6352
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6353
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6354
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6355
Consider there’s a Neutrosophic R-Eulerian-Type-Cycle-Neighbor with the least cardinality, the lower 6356
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6357
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6358
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6359
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6360
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Eulerian-Type-Cycle-Neighbor. Since it 6361
doesn’t have 6362
6363

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

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6365
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6366
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6367
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Eulerian- 6368
Type-Cycle-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6369
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6370

are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6371
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6372
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6373
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6374
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6375
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6376
Neutrosophic R-Eulerian-Type-Cycle-Neighbor, VESHE is up. The obvious simple Neutrosophic type- 6377
SuperHyperSet of the Neutrosophic R-Eulerian-Type-Cycle-Neighbor, VESHE , is a Neutrosophic Super- 6378
HyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6379
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6380
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6381
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6382

a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6383
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6384
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6385
R-Eulerian-Type-Cycle-Neighbor only contains all interior Neutrosophic SuperHyperVertices and all 6386
exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6387
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6388
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6389
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6390
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6391
The SuperHyperNotion, namely, Eulerian-Type-Cycle-Neighbor, is up. There’s neither empty SuperHy- 6392
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6393
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6394

the Neutrosophic Eulerian-Type-Cycle-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic 6395
SuperHyperEdges[SuperHyperVertices], 6396

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

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Eulerian-Type-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyper- 6399

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6400
6401
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6403
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6404
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6405
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6406
non-obvious Neutrosophic Eulerian-Type-Cycle-Neighbor is up. The obvious simple Neutrosophic type- 6407
SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Neighbor is a Neutrosophic SuperHyperSet 6408
includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic SuperHyperSet of 6409
the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6410

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- 6411
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6412
Eulerian-Type-Cycle-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutro- 6413
sophic SuperHyperEdges[SuperHyperVertices], 6414

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- 6415

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6420
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Eulerian-Type-Cycle-Neighbor 6421
and it’s an Neutrosophic Eulerian-Type-Cycle-Neighbor. Since it’s 6422
6423
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6425

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

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic Eulerian-Type-Cycle-Neighbor , 6429

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- 6430
, not:
Cycle-Neighbor 6431

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

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- 6433
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6434
Neutrosophic type-SuperHyperSet called the 6435
“Neutrosophic Eulerian-Type-Cycle-Neighbor ” 6436
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6437
Neutrosophic ,
is only and only 6439

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


= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6440

CHAPTER 31 6441
The Neutrosophic Departures on The 6442
Theoretical Results Toward Theoretical 6443
Motivations 6444
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6445
Neutrosophic SuperHyperClasses. 6446
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6447

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

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

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6455
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6456
SuperHyperModel (31.1), is the SuperHyperEulerian-Type-Cycle-Neighbor. 6457
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6458

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


= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 6459
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6460
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6461

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6466
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6467
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6468
6469

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

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

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 6471
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6472
P :
E1 , V1EXT ERN AL ,

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

Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example (42.0.9) 136NSHG20a
E2 , CEN T ER
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6473

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6478
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6479
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6480
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6481
the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6482

Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6483
Then 6484

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 6485
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6486
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). 6487


Neighbor could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6493
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Neutrosophic Supe- 6495

rHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6496
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6497
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6499
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6500
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6501
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6502

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

Then 6506

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi ∈ VN SHG }.
X
= z |{Vi ∈VN SHG }| .
Proof. Let 6507
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6508
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Neutrosophic SuperHy- 6509

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

0
Neighbor could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6515
P :
V1EXT ERN AL , E1 ,

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

V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6517
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6518
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6522
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6523
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6524
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6525

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Type-Cycle- 6526
Neighbor. 6527
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6528

Then, 6529

= {Ei ∈ EN SHG }.
X
= z |{Ei ∈EN SHG }| .
= {Vi }Vi ∈VEi ,VEj ,VE∗ .
k {Ei ,Ej ,E ∗ } ∗
k Ei ∩Ej ∩Ek 6=∅

|V ∗ |
z |VEi | + z |VEj | + z Ek .
X
=
{Vi }Vi ∈VE ,VE ,VE ∗ .
i j k {Ei ,Ej ,E ∗ }E ∩E ∩E ∗ 6=∅
k i j k
Proof. Let 6530
P :
CEN T ER, E2∗
6531
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Type-Cycle-Neighbor taken from a connected Neutrosophic SuperHy- 6532

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

straightforward. Then there’s at least one SuperHyperEulerian-Type-Cycle-Neighbor. Thus the notion 6536
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Type-Cycle-Neighbor 6537
could be applied. The unique embedded SuperHyperEulerian-Type-Cycle-Neighbor proposes some 6538

longest SuperHyperEulerian-Type-Cycle-Neighbor excerpt from some representatives. The latter is 6539
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6541
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6542
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6543

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6544
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6545

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in the Neutrosophic Example
(42.0.15) 136NSHG23a

CHAPTER 32 6546
The Surveys of Mathematical Sets On 6547
The Results But As The Initial Motivation 6548
For the SuperHyperEulerian-Type-Cycle-Neighbor, Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, 6549

and the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor, some general results are introduced. 6550
6551
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor is 6552

“redefined” on the positions of the alphabets. 6553
Corollary 32.0.2. Assume Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. Then 6554
N eutrosophic SuperHyperEulerian − T ype − Cycle − N eighbor =

{theSuperHyperEulerian − T ype − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperEulerian − T ype − Cycle − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperEulerian−T ype−Cycle−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6555
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6556
the neutrality, for i = 1, 2, 3, respectively. 6557
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6558
of the alphabet. Then the notion of Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor and 6559

SuperHyperEulerian-Type-Cycle-Neighbor coincide. 6560
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6561
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6562

SuperHyperEulerian-Type-Cycle-Neighbor if and only if it’s a SuperHyperEulerian-Type-Cycle-Neighbor. 6563
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6564
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperEulerian- 6565
Type-Cycle-Neighbor if and only if it’s a longest SuperHyperEulerian-Type-Cycle-Neighbor. 6566
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6567

identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor is its 6568
331
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle-Neighbor, 6570

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6571
identical letter of the alphabet. Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor is its 6572
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6574

SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperEulerian-Type- 6575
Cycle-Neighbor isn’t well-defined. 6576
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6577

its Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined if and only if its 6578
SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined. 6579
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 6580

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Neighbor 6581
Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined if and only if its 6582
SuperHyperEulerian-Type-Cycle-Neighbor isn’t well-defined. 6583
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6584

SuperHyperEulerian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian-Type-Cycle- 6585
Neighbor is well-defined. 6586
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6587
Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperEulerian- 6588

Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Type-Cycle- 6590
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).

Neighbor 6591
Then its Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor is well-defined if and only if its 6592
SuperHyperEulerian-Type-Cycle-Neighbor is well-defined. 6593
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6594
(i) : the dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6595
(ii) : the strong dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6596
(iii) : the connected dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6597
(iv) : the δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6598
(v) : the strong δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6599
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 6600
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6601
(iii) : the connected defensive SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6604

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

independent SuperHyperSet is 6609
(iii) : the connected SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6612
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6616

Graph which is a SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 6617
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6621
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6622
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6623
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6625
SuperHyperUniform SuperHyperWheel. Then V is a maximal 6626
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6630
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6631
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6632
Graph which is a SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath. Then the number of 6635

(i) : the SuperHyperEulerian-Type-Cycle-Neighbor; 6636
(ii) : the SuperHyperEulerian-Type-Cycle-Neighbor; 6637
(iii) : the connected SuperHyperEulerian-Type-Cycle-Neighbor; 6638
(iv) : the O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 6639
(v) : the strong O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 6640
(vi) : the connected O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor. 6641
coincide. 6643

Graph which is a SuperHyperWheel. Then the number of 6645
(i) : the dual SuperHyperEulerian-Type-Cycle-Neighbor; 6646
(ii) : the dual SuperHyperEulerian-Type-Cycle-Neighbor; 6647
(iii) : the dual connected SuperHyperEulerian-Type-Cycle-Neighbor; 6648
(iv) : the dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 6649
(v) : the strong dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor; 6650
(vi) : the connected dual O(ESHG)-SuperHyperEulerian-Type-Cycle-Neighbor. 6651
coincide. 6653
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6654

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6666
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6667
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6668
SuperHyperPart is a 6669
(iv) : δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6673
(v) : strong δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6674
(vi) : connected δ-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 6675
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6677

plete SuperHyperMultipartite. Then Then the number of 6678
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6685
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6686
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6688
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6689
(iv) : SuperHyperEulerian-Type-Cycle-Neighbor; 6693

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6696
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6697
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6698
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6699

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6707
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6708
of dual 6709
(iv) : 0-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6713

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6717
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6718

is SuperHyperEulerian-Type-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 6719
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of 6720
a dual 6721
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6725
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor; 6726

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor. 6727
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number 6729
is O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), 6730
t>
2
in the setting of a dual 6731


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

dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 6743
(i) v ∈ Ns (x); 6744
(ii) vx ∈ E. 6745
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6746

a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle-Neighbor, then 6747
(i) S is SuperHyperEulerian-Type-Cycle-Neighbor set; 6748
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6749
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6750
(i) Γ ≤ O; 6751
(ii) Γs ≤ On . 6752
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6753
connected. Then 6754
(i) Γ ≤ O − 1; 6755
(ii) Γs ≤ On − Σ3i=1 σi (x). 6756
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6757


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6761
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6762
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6764
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6765
Neighbor; 6766
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6767
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6768
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6769
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperEulerian-Type-Cycle-Neighbor. Then 6771
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperEulerian- 6772
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6774
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6775
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6776
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperEulerian-Type-Cycle-Neighbor. Then 6778

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6782
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6783
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6785
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperEulerian-Type-Cycle-Neighbor; 6786
(ii) Γ = 1; 6787
(iii) Γs = Σ3i=1 σi (c); 6788

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperEulerian-Type-Cycle-Neighbor. 6789
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6790
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6791
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6793
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6794
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6795
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6797
b n c+1
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type- 6798
Cycle-Neighbor; 6799
(ii) Γ = b n2 c + 1; 6800

b n c+1 ; 6801
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperEulerian- 6802
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6804
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6805
Neighbor; 6806
(ii) Γ = b n2 c; 6807

bnc ; 6808
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6809
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6811

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6812
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperEulerian- 6813
Type-Cycle-Neighbor for N SHF; 6814
(ii) Γ = m for N SHF : (V, E); 6815
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6816
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperEulerian-Type- 6817
Cycle-Neighbor for N SHF : (V, E). 6818

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6820
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6821
SuperHyperEulerian-Type-Cycle-Neighbor for N SHF; 6822
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6823

b n c+1 for N SHF : (V, E); 6824
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperEulerian-Type-Cycle- 6825
Neighbor for N SHF : (V, E). 6826
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6827
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6828
bnc
2
is a dual SuperHyperDefensive SuperHyperEulerian-Type-Cycle- 6829
Neighbor for N SHF : (V, E); 6830
(ii) Γ = b n2 c for N SHF : (V, E); 6831

bnc for N SHF : (V, E); 6832
S={vi }i=1
bnc
2
are only dual maximal SuperHyperEulerian-Type-Cycle-Neighbor 6833
for N SHF : (V, E). 6834
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6837

SuperHyperEulerian-Type-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperEulerian- 6838

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

SuperHyperEulerian-Type-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperEulerian- 6846

SuperHyperEulerian-Type-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful SuperHyperEulerian- 6849
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6851

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

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

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

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


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

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


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

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

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

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

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


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

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

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


CHAPTER 33 6911
Neutrosophic Applications in Cancer’s 6912
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6914
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6915
disease is considered and as the consequences of the model, some parameters are used. The cells 6916
are under attack of this disease but the moves of the cancer in the special region are the matter 6917
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6918
treatments for this Neutrosophic disease. 6919
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6920
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6921
term Neutrosophic function. 6922
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6923
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6924
move from the cancer is identified by this research. Sometimes the move of the cancer 6925
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6926
about the moves and the effects of the cancer on that region; this event leads us to 6927
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6928
perception on what’s happened and what’s done. 6929
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6930
known and they’ve got the names, and some general Neutrosophic models. The moves 6931
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 6932
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperEulerian- 6933
Type-Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Supe- 6934
rHyperWheel). The aim is to find either the Neutrosophic SuperHyperEulerian-Type-Cycle- 6935

Neighbor or the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor in those Neutrosophic 6936
Neutrosophic SuperHyperModels. 6937
343
CHAPTER 34 6938
Case 1: The Initial Neutrosophic Steps 6939
Toward Neutrosophic 6940
SuperHyperBipartite as Neutrosophic 6941
SuperHyperModel 6942
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6943
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6944
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6945
perBipartite is obtained. 6946
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6947
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6948
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6949
(34.1), is the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6950

CHAPTER 35 6951
Case 2: The Increasing Neutrosophic 6952
Steps Toward Neutrosophic 6953
SuperHyperMultipartite as 6954
Neutrosophic SuperHyperModel 6955
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6956
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6957
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6958
perMultipartite is obtained. 6959
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6960
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

347
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6961

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6962
Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 6963

CHAPTER 36 6964
Wondering Open Problems But As The 6965
Directions To Forming The Motivations 6966
In what follows, some “problems” and some “questions” are proposed. 6967
The SuperHyperEulerian-Type-Cycle-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Cycle- 6968
Neighbor are defined on a real-world application, titled “Cancer’s Recognitions”. 6969
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6970
recognitions? 6971
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperEulerian-Type-Cycle- 6972

and the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor?
Neighbor 6973
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6974
them? 6975
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperEulerian- 6976
and the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor?
Problem 36.0.5. The SuperHyperEulerian-Type-Cycle-Neighbor and the Neutrosophic SuperHyperEulerian- 6978

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperEulerian-Type-Cycle-Neighbor, are there else? 6980
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6981
Numbers types-results? 6982
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6983
the multiple types of SuperHyperNotions? 6984
349
CHAPTER 37 6985
Conclusion and Closing Remarks 6986
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6987
research are illustrated. Some benefits and some advantages of this research are highlighted. 6988
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 6989
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperEulerian-Type-Cycle- 6990
Neighbor. For that sake in the second definition, the main definition of the Neutrosophic Super- 6991
HyperGraph is redefined on the position of the alphabets. Based on the new definition for the 6992
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperEulerian- 6993
Type-Cycle-Neighbor, finds the convenient background to implement some results based on that. 6994
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 6995
research on the modeling of the regions where are under the attacks of the cancer to recognize 6996
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 6997
on the SuperHyperNotion, SuperHyperEulerian-Type-Cycle-Neighbor, the new SuperHyperClasses and 6998
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 6999
SuperHyperEulerian-Type-Cycle-Neighbor and the Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor. 7000

The clarifications, instances and literature reviews have taken the whole way through. In this 7001
research, the literature reviews have fulfilled the lines containing the notions and the results. 7002
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7003
and the architecture are formally called “ SuperHyperEulerian-Type-Cycle-Neighbor” in the themes of 7008
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7009
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7010
for this research are, figured out, pointed out and spoken out. 7011
351
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperEulerian-Type-Cycle-Neighbor
3. Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7012
Neutrosophic SuperHyperDuality But As 7013
Super Forms 7015
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7016

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7020

Va ∈ Ei , Ej ; 7021
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7022

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7023
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7024

Vi , Vj ∈ Ea ; 7025
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7026

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7027
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7028

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7029
sophic rv-SuperHyperDuality. 7030
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7031

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7034

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7036
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7037
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7038
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7039
353
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7041

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7043
form the Neutrosophic SuperHyperDuality; 7047
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7048
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7049

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7050
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7051
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7052
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7053
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7055
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7057

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7059
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7060
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7065
coefficient; 7066
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7067

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7069
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7070
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7071
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7072
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7074

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7075
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7076
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7077
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7078
that they form the Neutrosophic SuperHyperDuality; 7080
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7081

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7082
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7083

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7085
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 7086
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7088
power is corresponded to its Extreme coefficient; 7089
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7090

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7092

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7098
coefficient. 7099
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7100
the mentioned Neutrosophic Figures in every Neutrosophic items. 7101

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7103
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7104
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7105
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7106
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7107
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7108
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7109
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 7113
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7114
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7115
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7116
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7117

every given Neutrosophic SuperHyperDuality. 7118




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7178
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 7180


the Neutrosophic SuperHyperDuality. 7189
Then 7191
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 7192
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7198
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7201

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7202
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7211

(V, E). Then 7212

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 7213
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7214


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7218
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7219
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. 7231
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7232
Then, 7233
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 7234
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 7235


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7240
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7241
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7247

CHAPTER 39 7248
Neutrosophic SuperHyperJoin But As 7249
Super Forms 7251
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7252

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7256
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7258

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7259
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7261

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7263

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7266

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7267
rv-SuperHyperJoin. 7268
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7269

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

367

Extreme SuperHyperJoin; 7278
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7279

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7281
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7282
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7283
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7284
Neutrosophic SuperHyperJoin; 7285
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7286

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7287
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7288
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7293
coefficient; 7294
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7295

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7296
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7297
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7298
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7299
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7300
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7301

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

Extreme SuperHyperJoin; 7310
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7311

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7313
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7314
Neutrosophic SuperHyperJoin; 7317

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7318

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7320

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7325
its Extreme coefficient; 7326
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7327

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7329
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7330

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7331
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7332
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7335
coefficient. 7336
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7340

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7341

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7406

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7415
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 7417


the Neutrosophic SuperHyperJoin. 7426
Then 7428
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 7429
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 7435
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7437

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


(V, E). Then 7448

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7450


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

Then, 7468

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

.
Proof. Let 7469
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7470


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7474
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7475
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7476
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7481

CHAPTER 40 7482
Neutrosophic SuperHyperPerfect But As 7483
Super Forms 7485
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7486

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

Va ∈ Ei , Ej ; 7491
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7492

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7498

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7499
rv-SuperHyperPerfect. 7500
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7501

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7506
381
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7511

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7513
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7514
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7515
form the Neutrosophic SuperHyperPerfect; 7517
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7518

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7519
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7520
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7523
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7527

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7529
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7535
coefficient; 7536
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7537

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7545
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7546
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7547
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7548
that they form the Neutrosophic SuperHyperPerfect; 7550
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7551

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7553

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7556
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7560

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7562

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7568
coefficient. 7569

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7573

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7639
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 7641
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7659
Then 7661
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 7662
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 7666
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7667
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7668
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7671

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

(V, E). Then 7682

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7705


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7708
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7709
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7710
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7711
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7717

CHAPTER 41 7718
Neutrosophic SuperHyperTotal But As 7719
Super Forms 7721
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7722

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

Va ∈ Ei , Ej ; 7727
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7728

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7729
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7730

Vi , Vj ∈ Ea ; 7731
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7732

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7734

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7735
rv-SuperHyperTotal. 7736
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7737

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7742
Extreme SuperHyperTotal; 7746
395
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7747

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7749
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7750
Neutrosophic SuperHyperTotal; 7753
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7754
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7755

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7756
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7761
coefficient; 7762
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7763
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7764

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7765
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7767
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7768
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7769
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7770
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7771
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7772

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7774
Extreme SuperHyperTotal; 7778
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7779

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7781
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7782
Neutrosophic SuperHyperTotal; 7785
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7786

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7787
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7788

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7793
its Extreme coefficient; 7794
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7795
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7796

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7797
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7799
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7800
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7801
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7802
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7803

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7807

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




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

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


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

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

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .




3 × 4 × 4z 3 .


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.


3 × 4 × 4z 3 .

C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.



C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1









4 × 3z 3 .


4 × 3z 4 .


2 × 4 × 3z 4 .



C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .


C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
= |(|V | − 1)z 2 .

C(N SHG)Neutrosophic SuperHyperTotal = {E1 , E2 }.

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {V1 , V2 }.


C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .

C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
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 7866
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 7873
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 7875
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. 7882
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 7884


the Neutrosophic SuperHyperTotal. 7893
Then 7895
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 7896
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7902
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7904

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 7915

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 7917


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7922
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. 7933
Then, 7935
∗
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 7936
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7937


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7941
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7942
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7943
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7949

CHAPTER 42 7950
Neutrosophic SuperHyperConnected But 7951
As The Extensions Excerpt From Dense 7952
And Super Forms 7953
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7954

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7958
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7959
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7960

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7961
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7962
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7963

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7964
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7965

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7966
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7967
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7968
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7969
rosophic rv-SuperHyperConnected. 7970
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7971

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7974
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7975
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7976
409
form the Extreme SuperHyperConnected; 7980
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7981

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7982
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7983
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 7984
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 7985
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 7986

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 7987
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7988
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7989

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7990
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7991
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 7992
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 7993
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7997

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7998
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7999
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8000
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8001
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8002
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8003

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8004
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8005
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8007

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8009
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8010
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8011
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8012
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8013
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8014

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8016
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8017
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8018
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8019
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8020

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8021

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8024
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8025
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 8026

and the Extreme power is corresponded to its Extreme coefficient; 8029
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8030

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8033
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8034
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8035
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8036

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8037
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8038
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8042
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8043
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8045
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8046

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8047
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8048
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8049
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. 8057


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

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

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+19i=0 }.


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

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

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1


C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.



4 × 3z 3 .

4 × 3z 4 .


2 × 4 × 3z 4 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


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

= 3 × 6z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic −2
=z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 8101
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. 8108
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

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

.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 8110
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. 8117
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 8119



the Neutrosophic SuperHyperConnected. 8128
Then 8130
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 8131
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 8136
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8137
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8140

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8151
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 8152
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8153


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8157
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8158
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8159
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. 8170
Then, 8172
∗
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 8173
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8174


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8177
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8178
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8179
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8180
some representatives. The latter is straightforward. 8181
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8186

CHAPTER 43 8187
Background 8188

423














Bibliography 8395
10.33140/JMTCM.01.03.09) 8399


429
10.20944/preprints202301.0282.v1). 8432
10.20944/preprints202301.0267.v1). 8435

(doi: 10.20944/preprints202301.0265.v1). 8440
prints202301.0262.v1). 8444
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8450
prints202301.0105.v1). 8453
Preprints 2023, 2023010044 8459
10.20944/preprints202301.0043.v1). 8462

(doi: 10.20944/preprints202212.0549.v1). 8471
(doi: 10.20944/preprints202212.0500.v1). 8478
10.5281/zenodo.7871026). 8487
2023, (doi: 10.5281/zenodo.7874647). 8490

10.5281/zenodo.7857856). 8493
2023, (doi: 10.5281/zenodo.7857841). 8496

10.5281/zenodo.7853867). 8505
10.5281/zenodo.7853922). 8508
(doi: 10.5281/zenodo.7851519). 8511
(doi: 10.5281/zenodo.7851550). 8514
10.5281/zenodo.7834229). 8523
10.5281/zenodo.7834261). 8526
10.5281/zenodo.7824560). 8529

(doi: 10.5281/zenodo.7824623). 8532

2023, (doi: 10.5281/zenodo.7809365). 8543
2023, (doi: 10.5281/zenodo.7809358). 8546
10.5281/zenodo.7809219). 8549
10.5281/zenodo.7809328). 8552
2023, (doi: 10.5281/zenodo.7806767). 8555
2023, (doi: 10.5281/zenodo.7806838). 8558
10.5281/zenodo.7799902). 8567
(doi: 10.5281/zenodo.7804218). 8570
(doi: 10.5281/zenodo.7796334). 8573
10.5281/zenodo.7791952). 8579

10.5281/zenodo.7791982). 8582
10.5281/zenodo.7790026). 8585
10.5281/zenodo.7790052). 8588
2023, (doi: 10.5281/zenodo.7787066). 8591
10.5281/zenodo.7781476). 8597
10.5281/zenodo.7783082). 8600
10.5281/zenodo.7777857). 8603
10.5281/zenodo.7779286). 8606
(doi: 10.5281/zenodo.7771831). 8609
2023, (doi: 10.5281/zenodo.7772468). 8612
10.13140/RG.2.2.20913.25446). 8615
odo.7764916). 8618

10.13140/RG.2.2.11770.98247). 8621
10.13140/RG.2.2.12400.12808). 8624
2023, (doi: 10.13140/RG.2.2.22545.10089). 8627
10.13140/RG.2.2.11377.76644). 8633
10.13140/RG.2.2.23750.96329). 8636
10.13140/RG.2.2.31366.24641). 8639
10.13140/RG.2.2.34721.68960). 8642
2023, (doi: 10.13140/RG.2.2.30212.81289). 8645
10.13140/RG.2.2.24288.35842). 8651
10.13140/RG.2.2.32467.25124). 8654
10.13140/RG.2.2.31025.45925). 8657

10.13140/RG.2.2.17184.25602). 8660
10.13140/RG.2.2.23423.28327). 8663
10.13140/RG.2.2.28456.44805). 8666
10.13140/RG.2.2.23525.68320). 8669
10.13140/RG.2.2.20170.24000). 8672
10.13140/RG.2.2.36475.59683). 8675
10.13140/RG.2.2.29764.71046). 8678
2023, (doi: 10.13140/RG.2.2.18780.87683). 8681
10.13140/RG.2.2.26134.01603). 8687
10.13140/RG.2.2.27392.30721). 8690
10.13140/RG.2.2.33028.40321). 8693
10.13140/RG.2.2.21389.20966). 8696

10.13140/RG.2.2.16356.04489). 8699
10.13140/RG.2.2.21756.21129). 8702
10.13140/RG.2.2.30983.68009). 8705
10.13140/RG.2.2.28552.29445). 8708
(doi: 10.13140/RG.2.2.10936.21761). 8711
10.13140/RG.2.2.35105.89447). 8714
(doi: 10.13140/RG.2.2.30072.72960). 8717
10.13140/RG.2.2.31147.52003). 8720
10.13140/RG.2.2.32825.24163). 8723
10.13140/RG.2.2.13059.58401). 8726
10.13140/RG.2.2.11172.14720). 8729
2023, (doi: 10.13140/RG.2.2.22011.80165). 8732
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8735

2023, (doi: 10.13140/RG.2.2.10493.84962). 8738
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8741
2023, (doi: 10.13140/RG.2.2.19944.14086). 8744
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8747
(doi: 10.13140/RG.2.2.33103.76968). 8750
(doi: 10.13140/RG.2.2.23037.44003). 8753
(doi: 10.13140/RG.2.2.35646.56641). 8756
10.13140/RG.2.2.18030.48967). 8759
(doi: 10.13140/RG.2.2.13973.81121). 8762
2023, (doi: 10.13140/RG.2.2.34106.47047). 8765
2023, (doi: 10.13140/RG.2.2.31956.88961). 8771
2023, (doi: 10.13140/RG.2.2.15179.67361). 8774

10.13140/RG.2.2.21510.45125). 8777
2023, (doi: 10.13140/RG.2.2.13121.84321). 8780
10.13140/RG.2.2.11758.69441). 8783
2023, (doi: 10.13140/RG.2.2.31891.35367). 8786
10.13140/RG.2.2.19360.87048). 8789
10.13140/RG.2.2.32363.21286). 8792
10.13140/RG.2.2.23266.81602). 8795
10.13140/RG.2.2.19911.37285). 8798
10.13140/RG.2.2.11050.90569). 8801
2023, (doi: 10.13140/RG.2.2.17761.79206). 8804
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 8810
(doi: 10.13140/RG.2.2.30182.50241). 8813

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 8855
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 8858



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

10.20944/preprints202301.0282.v1). 8879
10.20944/preprints202301.0267.v1).). 8882
(doi: 10.20944/preprints202301.0265.v1). 8887
prints202301.0262.v1). 8891


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

10.13140/RG.2.2.35061.65767). 8900

10.13140/RG.2.2.18494.15680). 8904

10.13140/RG.2.2.32530.73922). 8908

10.13140/RG.2.2.15897.70243). 8912

10.13140/RG.2.2.32530.73922). 8916

prints202301.0105.v1). 8919

10.13140/RG.2.2.23172.19849). 8926


10.13140/RG.2.2.17385.36968). 8936
Preprints 2023, 2023010044 8939
10.20944/preprints202301.0043.v1). 8942
2023, (doi: 10.13140/RG.2.2.28945.92007). 8945
10.13140/RG.2.2.35774.77123). 8951

10.13140/RG.2.2.29430.88642). 8957
(doi: 10.20944/preprints202212.0549.v1). 8963
10.13140/RG.2.2.19380.94084). 8966

(doi: 10.20944/preprints202212.0500.v1). 8977
10.13140/RG.2.2.20993.12640). 8980


10.13140/RG.2.2.29173.86244). 8995
2023 (doi: 10.5281/zenodo.7874677). 9000
(doi: 10.5281/zenodo.7857906). 9002
2023 (doi: 10.5281/zenodo.7856329). 9004

10.5281/zenodo.7854561). 9006
2023 (doi: 10.5281/zenodo.7851893). 9008

(doi: 10.5281/zenodo.7835063). 9012
(doi: 10.5281/zenodo.7826705). 9014
2023 (doi: 10.5281/zenodo.7820680). 9016
10.5281/zenodo.7812750). 9018

2023 (doi: 10.5281/zenodo.7807782). 9024
2023 (doi: 10.5281/zenodo.7804449). 9026
(doi: 10.5281/zenodo.7792307). 9030
(doi: 10.5281/zenodo.7790728). 9032
2023 (doi: 10.5281/zenodo.7787712). 9034
10.5281/zenodo.7783791). 9036
10.5281/zenodo.7780123). 9038
(doi: 10.5281/zenodo.7773119). 9040

odo.7637762). 9042
10.5281/zenodo.7766174). 9044
10.5281/zenodo.7762232). 9046
(doi: 10.5281/zenodo.7758601). 9048
10.5281/zenodo.7754661). 9050
10.5281/zenodo.7750995) . 9052
(doi: 10.5281/zenodo.7749875). 9054
10.5281/zenodo.7747236). 9056
10.5281/zenodo.7742587). 9058
(doi: 10.5281/zenodo.7738635). 9060
10.5281/zenodo.7734719). 9062
10.5281/zenodo.7730484). 9064
(doi: 10.5281/zenodo.7730469). 9066
10.5281/zenodo.7722865). 9068
odo.7713563). 9070
odo.7709116). 9072
10.5281/zenodo.7706415). 9074
10.5281/zenodo.7706063). 9076

10.5281/zenodo.7701906). 9078
odo.7700205). 9080
10.5281/zenodo.7694876). 9082
10.5281/zenodo.7679410). 9084
10.5281/zenodo.7675982). 9086
10.5281/zenodo.7672388). 9088
odo.7668648). 9090
10.5281/zenodo.7662810). 9092
10.5281/zenodo.7659162). 9094
odo.7653233). 9096
odo.7653204). 9098
odo.7653142). 9100
odo.7653117). 9102
odo.7651687). 9105
odo.7651619). 9107
odo.7651439). 9109
odo.7650729). 9111

odo.7647868). 9113
odo.7647017). 9115
odo.7644894). 9117
odo.7632923). 9120
odo.7623459). 9122
10.5281/zenodo.7606416). 9124
10.5281/zenodo.7606416). 9126
odo.7606404). 9128
10.5281/zenodo.7580018). 9130
odo.7580018). 9132
odo.7580018). 9134
odo.7579929). 9136
10.5281/zenodo.7563170). 9138
odo.7563164). 9140
odo.7563160). 9142
odo.7563160). 9144
10.5281/zenodo.7563160). 9146

10.5281/zenodo.7557063). 9148
10.5281/zenodo.7557009). 9150
10.5281/zenodo.7539484). 9152
10.5281/zenodo.7523390). 9154
10.5281/zenodo.7523390). 9156
10.5281/zenodo.7523390). 9158
odo.7574952). 9160
10.5281/zenodo.7574992). 9162
odo.7523357). 9164
10.5281/zenodo.7523357). 9166
10.5281/zenodo.7504782). 9168
10.5281/zenodo.7504782). 9170
10.5281/zenodo.7504782). 9172
10.5281/zenodo.7499395). 9174
odo.7499395). 9176
10.5281/zenodo.7499395). 9178
10.5281/zenodo.7497450). 9180
10.5281/zenodo.7497450). 9182

10.5281/zenodo.7494862). 9184
odo.7494862). 9186
10.5281/zenodo.7494862). 9188
10.5281/zenodo.7493845). 9190
odo.7493845). 9192
10.5281/zenodo.7493845). 9194
odo.7539484). 9196
odo.7523390). 9198
odo.7523357). 9200
odo.7504782). 9202
odo.7499395). 9204
odo.7497450). 9206
odo.7494862). 9208
odo.7493845). 9210
odo.7480110). 9212
odo.7378758). 9214
odo.6320305). 9216
odo.6677173). 9218

CHAPTER 44 9219
Books’ Contributions 9220
“Books’ Contributions”: | Featured Threads 9221

The following references are cited by chapters. 9222
9223
[Ref262] 9224
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle- 9225
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9226
10.5281/zenodo.7904671). 9227
9228
[Ref263] 9229
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9230
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 9231
10.5281/zenodo.7904698). 9232
9233
The links to the contributions of this scientific research book are listed below. 9234
[HG262] 9235
10.5281/zenodo.7904671). 9238
9239
[TITLE] “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-Neighbor 9240
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9241

9242
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9243
https://www.researchgate.net/publication/370590784 9244
9245
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9246
https://www.scribd.com/document/643464457 9247
9248
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9249
https://zenodo.org/record/7904671 9250
9251
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9252
https://www.academia.edu/101381234 9253
451
Figure 44.1: New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7904671).
9254
[ADDRESSED CITATION] 9255
10.5281/zenodo.7904671). 9258
[ASSIGNED NUMBER] #260 Article 9259
[DATE] May 2023 9260

[DOI] 10.5281/zenodo.7904671 9261
[LICENSE] CC BY-NC-ND 4.0 9262
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9263
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9264
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9265
9266
[HG263] 9267
10.5281/zenodo.7904698). 9270
9271
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9272

Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous” 9273
9274
https://www.researchgate.net/publication/370590976 9276
9277
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9278


10.5281/zenodo.7904671).

10.5281/zenodo.7904671).

Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”,
Zenodo 2023, (doi: 10.5281/zenodo.7904698).
https://www.scribd.com/document/643466515 9279
9280
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9281
9283
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9284
https://www.academia.edu/101382795 9285
9286
10.5281/zenodo.7904698). 9290
[ASSIGNED NUMBER] #263 Article 9291

[DATE] May 2023 9292
[DOI] 10.5281/zenodo.7904698 9293
[LICENSE] CC BY-NC-ND 4.0 9294
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9295
[AVAILABLE AT TWITTER’S IDS] 9296
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9297
googlebooks GooglePlay 9298
9299
[ASSIGNED NUMBER] | Book #170 9300
Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 9302
2023 (doi: 10.5281/zenodo.7905287). 9303


[TITLE] Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs 9304

#Latest_Updates 9305
#The_Links 9306
9310
9312
#The_Links 9313
9314
[ASSIGNED NUMBER] | Book #170 9315

9316
[TITLE] Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs 9317
9318
9322
– 9323
9324
[PUBLISHER] 9325
(Paperback): https://www.amazon.com/dp/- 9326
(Hardcover): https://www.amazon.com/dp/- 9327

(Kindle Edition): https://www.amazon.com/dp/- 9328
9329
– 9330
9331
[ISBN] 9332
(Paperback): - 9333
(Hardcover): - 9334
(Kindle Edition): CC BY-NC-ND 4.0 9335
(EBook): CC BY-NC-ND 4.0 9336
9337
– 9338
9339
[PRINT LENGTH] 9340
(Paperback): - pages 9341
(Hardcover): - pages 9342
(Kindle Edition): - pages 9343
(E-Book): - pages 9344
9345
– 9346
9347
9349

#The_Links 9350
9351
https://www.researchgate.net/publication/- 9353
9354
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9355
https://drhenrygarrett.wordpress.com/2023/07/22/ 9356
Eulerian-Type-Cycle-Neighbor-In-SuperHyperGraphs/ 9357
9358
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9359
https://www.scribd.com/document/- 9360
9361
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9362
https://www.academia.edu/- 9363
9364
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9365
9367
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9368
https://books.google.com/books/about?id=- 9369
9370
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9371
https://play.google.com/store/books/details?id=- 9372

[TITLE] Eulerian-Type-Cycle-Cut In SuperHyperGraphs (Published Version) 9373

9374
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9375
9376
https://drhenrygarrett.wordpress.com/2023/07/22/ 9377
Eulerian-Type-Cycle-Neighbor-In-SuperHyperGraphs/ 9378
9379
– 9380
9381
[POSTED BY] Dr. Henry Garrett 9382
9383
[DATE] May 007, 2023 9384

9385
[POSTED IN] 170 | Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs 9386
9387
[TAGS] 9388
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9389
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9390
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9391
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9392
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyper- 9393
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9394
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9395
scientific research Articles, scientific research Book, scientific research Chapter, scientific 9396
research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, Super- 9397

HyperGraph Theory, SuperHyperGraphs, Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs, 9398
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9399
In this scientific research book, there are some scientific research chapters on “Extreme Eulerian- 9400
Type-Cycle-Neighbor In SuperHyperGraphs” and “Neutrosophic Eulerian-Type-Cycle-Neighbor 9401
In SuperHyperGraphs” about some scientific research on Eulerian-Type-Cycle-Neighbor In 9402
SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Type- 9403

Cycle-Neighbor In SuperHyperGraphs and Neutrosophic Eulerian-Type-Cycle-Neighbor In 9404
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9405
scientific research book starts to make Extreme Eulerian-Type-Cycle-Neighbor In SuperHyper- 9406
Graphs theory and Neutrosophic Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs theory 9407
more (Extremely/Neutrosophicly) understandable. 9408

HG170b1.png
Figure 44.7: [HG170b] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7905287).

HG170b2.png


HG170b3.png


CHAPTER 45 9409
“SuperHyperGraph-Based Books”: | 9410
Featured Tweets 9411
“SuperHyperGraph-Based Books”: | Featured Tweets 9412
463
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 9413
CV 9414
491
9415
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
9416
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)
9417
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-

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

9418

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

9419
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

9420
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”,
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

9421
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

9422
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

9423
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).
9424
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

9425
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

9426
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

9427
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

9428
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

9429
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

9430
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

9431
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

9432
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

9433
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

9434
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).
9435
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

9436

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

9437
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

9438

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: -
9439
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

9440
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).
9441
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
9442
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
9443
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
9444
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).
9445
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

9446
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).
9447
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”,

9448
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).
9449
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).
9450
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
9451
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).
9452

(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).
9453
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).
9454
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

9455
[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

9456
[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

9457
[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

9458
[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

9459
[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

9460
[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

9461
[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

9462
[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

9463
[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

9464
[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

9465
[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

9466
[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

9467
[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

9468
[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

9469
[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

9470
[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

9471
[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

9472
[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

9473
[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

9474
[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

9475
[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

9476
[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

9477
[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

9478
[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

9479
[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

9480
[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
9481
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

9482
[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

9483
[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

9484
[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

9485
[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

9486
[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
9487
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

9488
“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

9489
[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
9490
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

9491
[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

9492
[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

9493
[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

9494
[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

9495
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

9496
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
9497
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
9498
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

9499
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

9500
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
-
9501
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

9502
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9503
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
9504
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
9505
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

9506
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
9507
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
...
9508
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/
9509
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
9510
9511
9512
Henry Garrett
01/23/2022
9513
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
9514
View publication stats

Eulerian-Type-Cycle-Neighbor 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-Neighbor in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · May 2023

472 PUBLICATIONS 16,211 CITATIONS

Featured Articles View project

On Combinatorics View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEulerian-Type-Cycle-Neighbor But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Type-Cycle-Neighbor 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperEulerian-Type-Cycle-Neighbor But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 343

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 351

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 451

45 “SuperHyperGraph-Based Books”: | Featured Tweets 463

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 a Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 a Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 a Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-Neighbor

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.8 [HG170b] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”.

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