Eulerian-Path-Decomposition in SuperHyperGraphs

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

DOI: 10.5281/zenodo.7820680
CITATIONS
1 author:
Henry Garrett
442 PUBLICATIONS 11,781 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Neutrosophic Graphs View project
On Algebraic Structures and Algebraic Hyperstructures View project
All content following this page was uploaded by Henry Garrett on 12 April 2023.
The user has requested enhancement of the downloaded file.

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

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

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

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

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

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

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

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

Scientific Research 259

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

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

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

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

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

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

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

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

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

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

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

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

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

SuperHyperEulerian-Path-Decomposition in the Example (42.0.5) . . . . . . . . . . . . . . 116
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.7) . . . . . . . . . 118
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.9) . . . . . . . . . 119
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Path-Decomposition in the Example (42.0.11) . . . . . . . . 121
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperEulerian-Path-Decomposition in the Example (42.0.13) . . . . . . . . . . . . . 123
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.15) . . . 124
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperHamiltonian-Type-Cycle-Neighbor . . . . . . . . . . . . . . . . . . . . . . . . . . 139
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

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


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
(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) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(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

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

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

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

Of Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7819579). . . . . . . . . . 450
44.4 Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic Super-
HyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On Super
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7819531). . . . . . . . . . . 452
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 458

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 459

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

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

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

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

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

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

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

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

SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Path- 4
Decomposition In SuperHyperGraphs and Neutrosophic Eulerian-Path-Decomposition In 5
SuperHyperGraphs. With scientific research on the basic scientific research properties, the 6
scientific research book starts to make Extreme Eulerian-Path-Decomposition In SuperHyper- 7
Graphs theory and Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs and Neutrosophic 12
Eulerian-Path-Decomposition In SuperHyperGraphs . Two different types of SuperHyperDefini- 13
tions 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-Path-Decomposition 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-Path-Decomposition In Super- 36
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 37
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 38
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 39
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 40
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 41
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Eulerian-Path- 42
Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make 43
a Eulerian-Path-Decomposition In SuperHyperGraphs more understandable. For the sake 44
of having Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs, there’s a need 45
to “redefine” the notion of a “Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs . It’s redefined a Neutrosophic 49
Eulerian-Path-Decomposition 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 57
a Eulerian-Path-Decomposition In SuperHyperGraphs . It’s the main. It’ll be disciplinary 58

to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 59
need to have all Eulerian-Path-Decomposition In SuperHyperGraphs until the Eulerian-Path- 60
Decomposition In SuperHyperGraphs, then it’s officially called a “Eulerian-Path-Decomposition 61
In SuperHyperGraphs” but otherwise, it isn’t a Eulerian-Path-Decomposition In SuperHyper- 62
Graphs . There are some instances about the clarifications for the main definition titled a 63
“Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs . For the sake of having a 66
Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs, there’s a need to “redefine” 67
the notion of a “Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs” and a 68
“Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs are redefined 73
to a “Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In 76
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 77
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 78
Eulerian-Path-Decomposition In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 79

ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 80

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

In SuperHyperGraphs .] Eulerian-Path-Decomposition 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-Path-Decomposition 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 and 111
the effects of the cancer on that region; this event leads us to choose another model [it’s said to be 112
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 113
done. There are some specific models, which are well-known and they’ve got the names, and 114
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 115
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 116
SuperHyperPath(-/Eulerian-Path-Decomposition In SuperHyperGraphs, SuperHyperStar, 117
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 118
the longest Eulerian-Path-Decomposition In SuperHyperGraphs or the strongest Eulerian-Path- 119
Decomposition In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 120
Eulerian-Path-Decomposition In SuperHyperGraphs, called Eulerian-Path-Decomposition In 121

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

to form any style of a Eulerian-Path-Decomposition In SuperHyperGraphs. There isn’t any 126

formation of any Eulerian-Path-Decomposition In SuperHyperGraphs but literarily, it’s the 127
deformation of any Eulerian-Path-Decomposition In SuperHyperGraphs. It, literarily, deforms 128
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 129
SuperHyperGraph theory are proposed. 130
Keywords: SuperHyperGraph, (Neutrosophic) Eulerian-Path-Decomposition In SuperHyper- 131
Graphs, 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-Path-Decomposition 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
Path-Decomposition In SuperHyperGraphs” is a maximal Eulerian-Path-Decomposition In 155
SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of the 156
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-Path-Decomposition In 160
SuperHyperGraphs” is a maximal Neutrosophic Eulerian-Path-Decomposition 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-Path- 167
Decomposition In SuperHyperGraphs . Since there’s more ways to get type-results to make 168
Eulerian-Path-Decomposition In SuperHyperGraphs more understandable. For the sake of 169
having Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs, there’s a need 170

to “redefine” the notion of “Eulerian-Path-Decomposition In SuperHyperGraphs ”. The 171

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 172
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 173
the values. Assume a Eulerian-Path-Decomposition In SuperHyperGraphs . It’s redefined 174
Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs if the mentioned Table holds, 175
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 176
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 177
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 178
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 179
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The 180
Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural 181
examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyper- 182
Graph based on Eulerian-Path-Decomposition In SuperHyperGraphs . It’s the main. It’ll 183

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

scrutiny and discernment since there are characterized in the disciplinary ways of the Super- 190
HyperClass based on Eulerian-Path-Decomposition In SuperHyperGraphs . For the sake of 191
having Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs, there’s a need to 192
“redefine” the notion of “Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs” and 193
“Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs are redefined 198
“Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In 201

SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 202
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 203
Eulerian-Path-Decomposition In SuperHyperGraphs, SuperHyperStar, SuperHyperBipart- 204
ite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 205
“Neutrosophic Eulerian-Path-Decomposition 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-Path-Decomposition In SuperHyperGraphs” where it’s the strongest 209
[the maximum Neutrosophic value from all Eulerian-Path-Decomposition In SuperHyperGraphs 210
amid the maximum value amid all SuperHyperVertices from a Eulerian-Path-Decomposition 211
In SuperHyperGraphs .] Eulerian-Path-Decomposition 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-Path-Decomposition 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 228
cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some 229
degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel 230
which in this case the SuperHyperModel is called “Neutrosophic”. In the future research, 231
the foundation will be based on the “Cancer’s Neutrosophic Recognition” and the results 232
and the definitions will be introduced in redeemed ways. The Neutrosophic recognition of 233
the cancer in the long-term function. The specific region has been assigned by the model 234
[it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified 235
by this research. Sometimes the move of the cancer hasn’t be easily identified since there 236
are some determinacy, indeterminacy and neutrality about the moves and the effects of the 237
cancer on that region; this event leads us to choose another model [it’s said to be Neutro- 238
sophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 239
done. There are some specific models, which are well-known and they’ve got the names, and 240
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 241
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 242
SuperHyperPath(-/Eulerian-Path-Decomposition In SuperHyperGraphs, SuperHyperStar, 243
the longest Eulerian-Path-Decomposition In SuperHyperGraphs or the strongest Eulerian-Path- 245
Decomposition In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For the longest 246
Eulerian-Path-Decomposition In SuperHyperGraphs, called Eulerian-Path-Decomposition In 247

SuperHyperGraphs, and the strongest Eulerian-Path-Decomposition In SuperHyperGraphs, 248
called Neutrosophic Eulerian-Path-Decomposition In SuperHyperGraphs, some general results 249
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 250
to form any style of a Eulerian-Path-Decomposition In SuperHyperGraphs. There isn’t any 252

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

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

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

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 358
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 359
Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 360
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 361
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling 362

of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlli- 363
ances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 364
SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) Super- 365
HyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 366
(Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyper- 367
Girth on SuperHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of 368

Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees 369
and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs 370
Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), 371
“SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And 372

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

Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded Regions 386
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs 387
With (Neutrosophic) SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different 388
Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in 389
Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” 390
in Ref. [HG30] by Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHy- 391
perStable To SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” 392
in Ref. [HG31] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 393
ViewPoints” in Ref. [HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable 395
on Cancer’s Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” 396
in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in 397

the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 398
Recognition And Beyond” in Ref. [HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 399
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. 400
[HG35] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 401
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyper- 402
Graphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutrosophic Notions Concerning 403
SuperHyperDominating and Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. 404
[HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study 405
Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 406
SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett (2022), and [HG4; HG5; HG6; 407
HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; 408
HG19; HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; 409
HG95; HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; 411

HG239; HG240; HG241; HG242; HG243], there are some endeavors to formalize the basic 424
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 425

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

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

HG241; HG242; HG243] alongside scientific research books at [HG60b; HG61b; HG62b; 473

HG158b; HG159b; HG160b]. Two popular scientific research books in Scribd in the 485
terms of high readers, 4216 and 5214 respectively, on neutrosophic science is on [HG32b; 486
HG44b]. 487

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

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

HG19 [20] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 560
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 561
(doi: 10.20944/preprints202212.0549.v1). 562
HG20 [21] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 563
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 564
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 565
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 566
HG21 [22] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 567
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 568
(doi: 10.20944/preprints202212.0500.v1). 569
HG22 [23] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 570
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 571
HG23 [24] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 573
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 574
HG243 [25] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 576
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 577
Zenodo 2023, (doi: 10.5281/zenodo.7819531). 578
HG242 [26] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 579
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 580
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 583
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 585
2023, (doi: 10.5281/zenodo.7809365). 586
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 588
2023, (doi: 10.5281/zenodo.7809358). 589
HG238 [30] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 590
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 591
10.5281/zenodo.7809219). 592
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 594
10.5281/zenodo.7809328). 595

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 597
2023, (doi: 10.5281/zenodo.7806767). 598
HG235 [33] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 599
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 600
2023, (doi: 10.5281/zenodo.7806838). 601
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompens- 603
ation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 604
HG233 [35] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 605
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 606
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 607
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, 609
(doi: 10.5281/zenodo.7799902). 610
HG231 [37] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 611
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 612
2023, (doi: 10.5281/zenodo.7804218). 613
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 615
(doi: 10.5281/zenodo.7796334). 616
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 618
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 621
10.5281/zenodo.7791952). 622
HG225 [41] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 623
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 624
(doi: 10.5281/zenodo.7791982). 625
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 627
10.5281/zenodo.7790026). 628
HG223 [43] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian- 629
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 630
2023, (doi: 10.5281/zenodo.7790052). 631
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 633
2023, (doi: 10.5281/zenodo.7787066). 634

Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyper- 636
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 637
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 639
10.5281/zenodo.7781476). 640
HG219 [47] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 641
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 642
10.5281/zenodo.7783082). 643
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 645
10.5281/zenodo.7777857). 646
HG217 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 647
10.5281/zenodo.7779286). 649
HG215 [50] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 650
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 651
(doi: 10.5281/zenodo.7771831). 652
HG214 [51] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 653
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 654
2023, (doi: 10.5281/zenodo.7772468). 655
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 657
10.13140/RG.2.2.20913.25446). 658
HG212 [53] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 659
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 660
10.5281/zenodo.7764916). 661
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 663
10.13140/RG.2.2.11770.98247). 664
HG210 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 665
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 666
10.13140/RG.2.2.12400.12808). 667
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 669
2023, (doi: 10.13140/RG.2.2.22545.10089). 670
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 672
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 673

HG207 [58] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 674
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 675
10.13140/RG.2.2.11377.76644). 676
HG206 [59] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 677
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 678
10.13140/RG.2.2.23750.96329). 679
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 681
10.13140/RG.2.2.31366.24641). 682
HG204 [61] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 683
10.13140/RG.2.2.34721.68960). 685
Graph By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, 687
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 690
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 693
10.13140/RG.2.2.24288.35842). 694
HG200 [65] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 695
10.13140/RG.2.2.32467.25124). 697
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 699
10.13140/RG.2.2.31025.45925). 700
HG198 [67] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 701
10.13140/RG.2.2.17184.25602). 703
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 705
10.13140/RG.2.2.23423.28327). 706
HG196 [69] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 707
10.13140/RG.2.2.28456.44805). 709
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 711
10.13140/RG.2.2.23525.68320). 712

HG194 [71] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 713
10.13140/RG.2.2.20170.24000). 715
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 717
10.13140/RG.2.2.36475.59683). 718
HG192 [73] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 719
10.13140/RG.2.2.29764.71046). 721
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 723
2023, (doi: 10.13140/RG.2.2.18780.87683). 724
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 726
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 729
10.13140/RG.2.2.26134.01603). 730
HG188 [77] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 731
10.13140/RG.2.2.27392.30721). 733
HG187 [78] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 734
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 735
10.13140/RG.2.2.33028.40321). 736
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 738
10.13140/RG.2.2.21389.20966). 739
HG185 [80] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 740
10.13140/RG.2.2.16356.04489). 742
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 744
10.13140/RG.2.2.21756.21129). 745
HG183 [82] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In Can- 746
cer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 747
10.13140/RG.2.2.30983.68009). 748
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 750
10.13140/RG.2.2.28552.29445). 751

HG181 [84] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge- 752
Connectivity In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Re- 753
searchGate 2023, (doi: 10.13140/RG.2.2.10936.21761). 754
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 756
10.13140/RG.2.2.35105.89447). 757
HG179 [86] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 758
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 759
(doi: 10.13140/RG.2.2.30072.72960). 760
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 762
10.13140/RG.2.2.31147.52003). 763
HG177 [88] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 764
10.13140/RG.2.2.32825.24163). 766
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 768
10.13140/RG.2.2.13059.58401). 769
HG175 [90] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 770
10.13140/RG.2.2.11172.14720). 772
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 774
2023, (doi: 10.13140/RG.2.2.22011.80165). 775
HG173 [92] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 776
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 777
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 778
Graph By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, 780
HG171 [94] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 782
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 784
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 786
2023, (doi: 10.13140/RG.2.2.19944.14086). 787
HG169 [96] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 788
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 790

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 792
(doi: 10.13140/RG.2.2.33103.76968). 793
HG167 [98] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK- 794
Number In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 795
2023, (doi: 10.13140/RG.2.2.23037.44003). 796
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 798
(doi: 10.13140/RG.2.2.35646.56641). 799
HG165 [100] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder 800
(doi: 10.13140/RG.2.2.18030.48967). 802
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 804
(doi: 10.13140/RG.2.2.13973.81121). 805
HG163 [102] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 806
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 807
2023, (doi: 10.13140/RG.2.2.34106.47047). 808
HG162 [103] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 809
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 810
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 813
2023, (doi: 10.13140/RG.2.2.31956.88961). 814
HG160 [105] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 815
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 816
2023, (doi: 10.13140/RG.2.2.15179.67361). 817
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 819
10.13140/RG.2.2.21510.45125). 820
HG158 [107] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDomin- 821
ating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 822
2023, (doi: 10.13140/RG.2.2.13121.84321). 823
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 825
10.13140/RG.2.2.11758.69441). 826
HG156 [109] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 827
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 828
2023, (doi: 10.13140/RG.2.2.31891.35367). 829

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

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

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

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

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 907
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 908
HG128 [136] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 910
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic 911
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 912
HG127 [137] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 913
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 914
2023,(doi: 10.13140/RG.2.2.36745.93289). 915
HG126 [138] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 916

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

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

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

Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 929
2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 930
HG122 [142] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 931
prints202301.0262.v1). 934
HG121 [143] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 935
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 936

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

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

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

HG25 [146] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 944
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 945
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 946
10.13140/RG.2.2.18494.15680). 947
HG26 [147] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 948
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 949
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 950
10.13140/RG.2.2.32530.73922). 951
HG27 [148] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 952
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 953
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 954
10.13140/RG.2.2.15897.70243). 955

10.13140/RG.2.2.32530.73922). 959
prints202301.0105.v1). 962
HG28 [151] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 963
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 964
HG29 [152] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 966
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 967
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 968
10.13140/RG.2.2.23172.19849). 969

HG30 [155] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 976
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 977
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 978
10.13140/RG.2.2.17385.36968). 979
HG107 [156] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction 980
To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And 981
Beyond”, Preprints 2023, 2023010044 982

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

2023, (doi: 10.13140/RG.2.2.28945.92007). 988
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 993
10.13140/RG.2.2.35774.77123). 994
HG35 [162] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 998
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 999

10.13140/RG.2.2.29430.88642). 1000
(doi: 10.20944/preprints202212.0549.v1). 1006
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1008
10.13140/RG.2.2.19380.94084). 1009


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

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

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

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

Classes”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966). 1035
HG37 [174] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1036
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1037
10.13140/RG.2.2.29173.86244). 1038
HG38 [175] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1039
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1040
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1041
HG160b [176] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1042
2023 (doi: 10.5281/zenodo.7820680). 1043
HG159b [177] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1044
10.5281/zenodo.7812750). 1045
HG158b [178] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1046

Garrett, 2023 (doi: 10.5281/zenodo.7812142). 1047
HG157b [179] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1048

Henry Garrett, 2023 (doi: 10.5281/zenodo.7810394). 1049
HG156b [180] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1050
2023 (doi: 10.5281/zenodo.7807782). 1051
HG155b [181] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1052
2023 (doi: 10.5281/zenodo.7804449). 1053
HG154b [182] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1054

HG153b [183] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1056
(doi: 10.5281/zenodo.7792307). 1057

HG152b [184] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1058
(doi: 10.5281/zenodo.7790728). 1059
HG151b [185] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1060
2023 (doi: 10.5281/zenodo.7787712). 1061
HG150b [186] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1062
10.5281/zenodo.7783791). 1063
HG149b [187] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1064
10.5281/zenodo.7780123). 1065
HG148b [188] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1066
(doi: 10.5281/zenodo.7773119). 1067
HG147b [189] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1068
odo.7637762). 1069
HG146b [190] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1070
10.5281/zenodo.7766174). 1071
HG145b [191] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1072
10.5281/zenodo.7762232). 1073
HG144b [192] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1074
(doi: 10.5281/zenodo.7758601). 1075
HG143b [193] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1076
10.5281/zenodo.7754661). 1077
HG142b [194] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1078
10.5281/zenodo.7750995) . 1079
HG141b [195] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1080
(doi: 10.5281/zenodo.7749875). 1081
HG140b [196] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1082
10.5281/zenodo.7747236). 1083
HG139b [197] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1084
10.5281/zenodo.7742587). 1085
HG138b [198] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1086
(doi: 10.5281/zenodo.7738635). 1087
HG137b [199] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1088
10.5281/zenodo.7734719). 1089
HG136b [200] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1090
10.5281/zenodo.7730484). 1091
HG135b [201] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1092
(doi: 10.5281/zenodo.7730469). 1093

HG134b [202] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1094
10.5281/zenodo.7722865). 1095
HG133b [203] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1096
odo.7713563). 1097
odo.7709116). 1099
HG131b [205] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1100
10.5281/zenodo.7706415). 1101
HG130b [206] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1102
(doi: 10.5281/zenodo.7706063). 1103
HG129b [207] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1104
(doi: 10.5281/zenodo.7701906). 1105
HG128b [208] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1106
odo.7700205). 1107
HG127b [209] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1108
10.5281/zenodo.7694876). 1109
HG126b [210] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1110
10.5281/zenodo.7679410). 1111
HG125b [211] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1112
10.5281/zenodo.7675982). 1113
HG124b [212] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1114
10.5281/zenodo.7672388). 1115
HG123b [213] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1116
odo.7668648). 1117
HG122b [214] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1118
10.5281/zenodo.7662810). 1119
HG121b [215] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1120
10.5281/zenodo.7659162). 1121
HG120b [216] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1122
odo.7653233). 1123
HG119b [217] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1124
odo.7653204). 1125
HG118b [218] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1126
odo.7653142). 1127
HG117b [219] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1128
odo.7653117). 1129

HG116b [220] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1130
odo.7653089). 1131
HG115b [221] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1132
odo.7651687). 1133
HG114b [222] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1134
odo.7651619). 1135
HG113b [223] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1136
odo.7651439). 1137
HG112b [224] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1138
odo.7650729). 1139
HG111b [225] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1140
odo.7647868). 1141
HG110b [226] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1142
odo.7647017). 1143
HG109b [227] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1144
odo.7644894). 1145
HG108b [228] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1146
odo.7641880). 1147
HG107b [229] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1148
odo.7632923). 1149
HG106b [230] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1150
odo.7623459). 1151
HG105b [231] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1152
10.5281/zenodo.7606416). 1153
HG104b [232] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1154
10.5281/zenodo.7606416). 1155
HG103b [233] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1156
odo.7606404). 1157
HG102b [234] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1158
10.5281/zenodo.7580018). 1159
HG101b [235] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1160
odo.7580018). 1161
odo.7580018). 1163
odo.7579929). 1165

HG98b [238] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1166
10.5281/zenodo.7563170). 1167
HG97b [239] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1168
odo.7563164). 1169
HG96b [240] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1170
odo.7563160). 1171
odo.7563160). 1173
HG94b [242] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1174
10.5281/zenodo.7563160). 1175
HG93b [243] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1176
10.5281/zenodo.7557063). 1177
HG92b [244] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1178
10.5281/zenodo.7557009). 1179
HG91b [245] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1180
10.5281/zenodo.7539484). 1181
HG90b [246] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1182
10.5281/zenodo.7523390). 1183
HG89b [247] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1184
10.5281/zenodo.7523390). 1185
HG88b [248] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1186
10.5281/zenodo.7523390). 1187
HG87b [249] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1188
odo.7574952). 1189
HG86b [250] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.7574992). 1191
odo.7523357). 1193
HG84b [252] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1194
10.5281/zenodo.7523357). 1195
HG83b [253] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1196
10.5281/zenodo.7504782). 1197
HG82b [254] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1198
10.5281/zenodo.7504782). 1199
HG81b [255] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1200
10.5281/zenodo.7504782). 1201

HG80b [256] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1202
10.5281/zenodo.7499395). 1203
HG79b [257] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1204
odo.7499395). 1205
HG78b [258] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1206
10.5281/zenodo.7499395). 1207
HG77b [259] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1208
10.5281/zenodo.7497450). 1209
HG76b [260] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7497450). 1211
HG75b [261] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1212
10.5281/zenodo.7494862). 1213
HG74b [262] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1214
odo.7494862). 1215
HG73b [263] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1216
10.5281/zenodo.7494862). 1217
HG72b [264] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1218
10.5281/zenodo.7493845). 1219
HG71b [265] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1220
10.5281/zenodo.7493845). 1221
HG70b [266] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1222
10.5281/zenodo.7493845). 1223
HG69b [267] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1224
odo.7539484). 1225
HG68b [268] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1226
odo.7523390). 1227
HG67b [269] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1228
odo.7523357). 1229
HG66b [270] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1230
odo.7504782). 1231
HG65b [271] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1232
odo.7499395). 1233
HG64b [272] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1234
odo.7497450). 1235
HG63b [273] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1236
odo.7494862). 1237

HG62b [274] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1238
odo.7493845). 1239
HG61b [275] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1240
odo.7480110). 1241
HG60b [276] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1242
odo.7378758). 1243
HG32b [277] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1244
odo.6320305). 1245
HG44b [278] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1246
odo.6677173). 1247

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

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

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

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

CHAPTER 5 1356
Extreme Eulerian-Path-Decomposition 1357
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1358
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1359
2023, (doi: 10.13140/RG.2.2.34953.52320). 1360

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1361
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1362
(doi: 10.13140/RG.2.2.33275.80161). 1363
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1364
10.13140/RG.2.2.11050.90569). 1366
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1367
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1368
10.13140/RG.2.2.17761.79206). 1369
10.13140/RG.2.2.19911.37285). 1372
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1373
10.13140/RG.2.2.23266.81602). 1375
10.13140/RG.2.2.19360.87048). 1378
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1379
10.13140/RG.2.2.32363.21286). 1381
10.13140/RG.2.2.11758.69441). 1384
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1385
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1386
10.13140/RG.2.2.31891.35367). 1387
10.13140/RG.2.2.21510.45125). 1390
47
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1391
10.13140/RG.2.2.13121.84321). 1393

CHAPTER 6 1394
New Ideas On Super Decompensation By 1395
Hyper Decompress Of 1396
Eulerian-Path-Decomposition In Cancer’s 1397
Recognition With (Neutrosophic) 1398
SuperHyperGraph 1399
49
CHAPTER 7 1400
ABSTRACT 1401
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 1402

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

criteria holds 1407
∀E 0 ∈ P : P is
a SuperHyperPath and it has
the all number of SuperHyperEdges;
Neutrosophic re-SuperHyperEulerian-Path-Decomposition if the following expression is called Neutro- 1408

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

SuperHyperEulerian-Path-Decomposition if the following expression is called Neutrosophic v- 1411
SuperHyperEulerian-Path-Decomposition criteria holds 1412
∀V 0 ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Path-Decomposition if the following expression is called Neutro- 1413

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

SuperHyperEulerian-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian- 1416
Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v- 1417
SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition. 1418
((Neutrosophic) SuperHyperEulerian-Path-Decomposition). Assume a Neutrosophic SuperHy- 1419
perGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 1420
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian-Path- 1421

Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic 1422
re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and 1423
Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme SuperHyper- 1424
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1425
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 1426
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1427
form the Extreme SuperHyperEulerian-Path-Decomposition; a Neutrosophic SuperHyperEulerian-Path- 1428
Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re- 1429
SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neut- 1430
rosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyper- 1431
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 1432
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1433

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 1434
Neutrosophic SuperHyperEulerian-Path-Decomposition; an Extreme SuperHyperEulerian-Path-Decomposition 1435
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, 1436
Neutrosophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path- 1437
Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an 1438
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1439

the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1440
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 1441
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1442
form the Extreme SuperHyperEulerian-Path-Decomposition; and the Extreme power is corresponded 1443
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyper- 1444
Polynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic 1445

Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 1447
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1448
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 1449
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 1450

ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1451
such that they form the Neutrosophic SuperHyperEulerian-Path-Decomposition; and the Neutrosophic 1452
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Path- 1453
Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme SuperHy- 1456

perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1457
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 1458
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1459
they form the Extreme SuperHyperEulerian-Path-Decomposition; a Neutrosophic V-SuperHyperEulerian- 1460

Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutro- 1461

sophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, 1462
and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic 1463
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 1464
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1465
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHy- 1466
perVertices such that they form the Neutrosophic SuperHyperEulerian-Path-Decomposition; an 1467

Extreme V-SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if it’s either of Neutro- 1468
sophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path-Decomposition, 1469
Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path- 1470
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 1471
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 1472
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 1473

SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges 1474
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Path- 1475
Decomposition; and the Extreme power is corresponded to its Extreme coefficient; a Neut- 1476
rosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if it’s either of Neutro- 1477
Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian- 1479

Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 1480
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 1481
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 1482
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 1483
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1484
the Neutrosophic SuperHyperEulerian-Path-Decomposition; and the Neutrosophic power is corres- 1485

ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 1486
for new SuperHyperNotions, namely, a SuperHyperEulerian-Path-Decomposition and Neutrosophic 1487
SuperHyperEulerian-Path-Decomposition. Two different types of SuperHyperDefinitions are debut 1488
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 1489
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1490
implemented in the whole of this research. For shining the elegancy and the significancy of this 1491
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1492
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1493
and the instances thus the clarifications are driven with different tools. The applications are 1494
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1495
Recognition” are the under research to figure out the challenges make sense about ongoing and 1496
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 1501
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 1502
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 1503
research. It’s also officially collected in the form of some questions and some problems. Assume 1504
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Path-Decomposition 1505


first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1509
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Path-Decomposition is a 1510
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1511
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1512
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1513

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1514
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 1515
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version 1516
of a SuperHyperEulerian-Path-Decomposition . Since there’s more ways to get type-results to 1517
make a SuperHyperEulerian-Path-Decomposition more understandable. For the sake of having 1518
Neutrosophic SuperHyperEulerian-Path-Decomposition, there’s a need to “redefine” the notion of a 1519

“SuperHyperEulerian-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are 1520
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1521
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Path-Decomposition 1522
. It’s redefined a Neutrosophic SuperHyperEulerian-Path-Decomposition if the mentioned Table 1523
holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and Super- 1524
HyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The 1525
Values of The Vertices & The Number of Position in Alphabet”, “The Values of The Super- 1526
Vertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 1527
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Ver- 1528
tices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 1529
get structural examples and instances, I’m going to introduce the next SuperHyperClass 1530
of SuperHyperGraph based on a SuperHyperEulerian-Path-Decomposition . It’s the main. It’ll be 1531

disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 1532
there’s a need to have all SuperHyperEulerian-Path-Decomposition until the SuperHyperEulerian-Path- 1533
Decomposition, then it’s officially called a “SuperHyperEulerian-Path-Decomposition” but otherwise, it 1534
isn’t a SuperHyperEulerian-Path-Decomposition . There are some instances about the clarifications 1535
for the main definition titled a “SuperHyperEulerian-Path-Decomposition ”. These two examples 1536
get more scrutiny and discernment since there are characterized in the disciplinary ways of 1537
the SuperHyperClass based on a SuperHyperEulerian-Path-Decomposition . For the sake of having 1538
a Neutrosophic SuperHyperEulerian-Path-Decomposition, there’s a need to “redefine” the notion of 1539
a “Neutrosophic SuperHyperEulerian-Path-Decomposition” and a “Neutrosophic SuperHyperEulerian- 1540
Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1541
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 1542
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 1543
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Path- 1544
Decomposition are redefined to a “Neutrosophic SuperHyperEulerian-Path-Decomposition” if the intended 1545
Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 1546
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Path- 1547
Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There are 1548

some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 1549
SuperHyperEulerian-Path-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 1550
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 1551
SuperHyperEulerian-Path-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 1552

perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 1553

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 1554
Path-Decomposition” where it’s the strongest [the maximum Neutrosophic value from all the 1555
SuperHyperEulerian-Path-Decomposition amid the maximum value amid all SuperHyperVertices 1556
from a SuperHyperEulerian-Path-Decomposition .] SuperHyperEulerian-Path-Decomposition . A graph is a 1557
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1559
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1560
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Path-Decomposition if it’s only one 1561
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 1562
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 1563
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 1564
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1565
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1566

identified since there are some determinacy, indeterminacy and neutrality about the moves 1581
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1582
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1583

and what’s done. There are some specific models, which are well-known and they’ve got the 1584
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1585
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 1586
Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Path-Decomposition, SuperHyperStar, Super- 1587
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1588

longest SuperHyperEulerian-Path-Decomposition or the strongest SuperHyperEulerian-Path-Decomposition 1589
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Path-Decomposition, 1590
called SuperHyperEulerian-Path-Decomposition, and the strongest SuperHyperEulerian-Path-Decomposition, 1591
called Neutrosophic SuperHyperEulerian-Path-Decomposition, some general results are introduced. 1592
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 1593
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 1594
of a SuperHyperEulerian-Path-Decomposition. There isn’t any formation of any SuperHyperEulerian- 1595
Path-Decomposition but literarily, it’s the deformation of any SuperHyperEulerian-Path-Decomposition. It, 1596
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian- 1597
Path-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1598

proposed. 1599
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Decomposition, Cancer’s 1600
Neutrosophic Recognition 1601


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

based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperEulerian- 1656
Path-Decomposition” based on the fixed groups of cells or the fixed groups of group of cells? 1657
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1658
messy and dense SuperHyperModels where embedded notions are illustrated? 1659
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1660
it motivates us to define different types of “ SuperHyperEulerian-Path-Decomposition” and “Extreme 1661
SuperHyperEulerian-Path-Decomposition” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1662

Then the research has taken more motivations to define SuperHyperClasses and to find some 1663
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1664
some instances and examples to make clarifications about the framework of this research. The 1665
general results and some results about some connections are some avenues to make key point of 1666
this research, “Cancer’s Recognition”, more understandable and more clear. 1667
The framework of this research is as follows. In the beginning, I introduce basic definitions 1668
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1669
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1670
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1671
review literature are applied to make sense about what’s going to figure out about the upcoming 1672
sections. The main definitions and their clarifications alongside some results about new 1673
notions, SuperHyperEulerian-Path-Decomposition and Extreme SuperHyperEulerian-Path-Decomposition, are 1674

figured out in sections “ SuperHyperEulerian-Path-Decomposition” and “Extreme SuperHyperEulerian- 1675
Path-Decomposition”. In the sense of tackling on getting results and in Eulerian-Path-Decomposition to 1676
make sense about continuing the research, the ideas of SuperHyperUniform and Extreme 1677
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 1678
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 1679
and “Results on Extreme SuperHyperClasses”. As going back to origin of the notions, 1680

there are some smart steps toward the common notions to extend the new notions in new 1681
frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results on 1682
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research about 1683
the general SuperHyperRelations and as concluding and closing section of theoretical research are 1684
contained in the section “General Results”. Some general SuperHyperRelations are fundamental 1685
and they are well-known as fundamental SuperHyperNotions as elicited and discussed in the 1686
sections, “General Results”, “ SuperHyperEulerian-Path-Decomposition”, “Extreme SuperHyperEulerian- 1687

Path-Decomposition”, “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1688
There are curious questions about what’s done about the SuperHyperNotions to make sense 1689
about excellency of this research and going to figure out the word “best” as the description 1690
and adjective for this research as presented in section, “ SuperHyperEulerian-Path-Decomposition”. 1691
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1692
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1693
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1694
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1695
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1696
to make sense to figure out this research in featured style. The advantages and the limitations 1697
of this research alongside about what’s done in this research to make sense and to get sense 1698
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1699

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

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

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

Let X be a Eulerian-Path-Decomposition of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}

+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 1714
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Eulerian-Path-Decomposition of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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). 1715
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1716
where 1717
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1718
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 1719
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1720
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1721
1, 2, . . . , n0 ); 1722
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1723
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1724

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1725
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1726
0
(ix) and the following conditions hold:

TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,
and FV0 (Ei0 ) ≤ min[FV 0 (Vi ), FV 0 (Vj )]Vi ,Vj ∈Ei0
where i0 = 1, 2, . . . , n0 . 1727
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1728
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1729
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1730

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

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

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

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

TA (x), IA (x), FA (x) >, x ∈ X} (with respect to t-norm Tnorm ):
TA (X) = Tnorm [TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = Tnorm [IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = Tnorm [FA (vi ), FA (vj )]vi ,vj ∈X .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 9.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 1759

where 1761

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


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

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1798
makes to have SuperHyperUniform more understandable. 1799
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1800
Classes as follows. 1801
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1802
two given SuperHyperEdges with two exceptions; 1803
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1804
SuperHyperEdges; 1805
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1806
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1807
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1808
in common; 1809
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1810
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1811
SuperHyperEdge in common; 1812
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1813
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1814
SuperVertex. 1815
Definition 9.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 1816
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1817
(i) Vi , Vi+1 ∈ Ei0 ; 1818
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1819
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1820
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1821
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1822
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1823
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1824
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1825
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) V1 to Neutrosophic
SuperHyperVertex (NSHV) Vs is sequence of Neutrosophic SuperHyperVertices (NSHV) and
Neutrosophic SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 1827
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 1828
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 1829
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 1830
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 1831
perPath . 1832
Definition 9.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 1833
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 1834
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 1835
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 1836
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 1837
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 1838

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

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


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

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

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

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

called Neutrosophic re-SuperHyperEulerian-Path-Decomposition criteria holds 1862
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 1863
(iii) Neutrosophic v-SuperHyperEulerian-Path-Decomposition if the following expression is 1864
called Neutrosophic v-SuperHyperEulerian-Path-Decomposition criteria holds 1865
∀V 0 ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Path-Decomposition if the following expression is 1866
∀V 0 ∈ P : P is
and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 1868

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

sophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path- 1870
Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv- 1871
SuperHyperEulerian-Path-Decomposition. 1872
Definition 9.0.19. ((Neutrosophic) SuperHyperEulerian-Path-Decomposition). 1873

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

SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme SuperHyperGraph 1879
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 1880

of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive 1881
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1882
that they form the Extreme SuperHyperEulerian-Path-Decomposition; 1883
(ii) a Neutrosophic SuperHyperEulerian-Path-Decomposition if it’s either of Neutro- 1884

SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph 1887
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Su- 1888
perHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1889

conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1890
such that they form the Neutrosophic SuperHyperEulerian-Path-Decomposition; 1891
(iii) an Extreme SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if 1892

it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re- 1893
SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, 1894
and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme 1895
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 1896
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1897
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 1898

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1899
such that they form the Extreme SuperHyperEulerian-Path-Decomposition; and the Extreme 1900
power is corresponded to its Extreme coefficient; 1901
(iv) a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 1902

if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re- 1903
and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutro- 1905
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 1906

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 1907
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 1908
SuperHyperSet S of high Neutrosophic cardinality conseNeighborive Neutrosophic Super- 1909
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1910
SuperHyperEulerian-Path-Decomposition; and the Neutrosophic power is corresponded to its 1911
Neutrosophic coefficient; 1912

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

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

(vi) a Neutrosophic V-SuperHyperEulerian-Path-Decomposition if it’s either of Neut- 1921

rosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path- 1922

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 1925
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 1926
(vii) an Extreme V-SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 1929

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

(viii) a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 1939

SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1943
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1944
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1945

Neutrosophic coefficient. 1949
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Path-Decomposition). 1950

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

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 : 1954
|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 1955
(29.1), holds if S is an δ−SuperHyperDefensive; 1956
(ii) a Neutrosophic δ−SuperHyperEulerian-Path-Decomposition is a Neutrosophic kind 1957

of Neutrosophic SuperHyperEulerian-Path-Decomposition such that either of the following 1958
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 1959
of s ∈ S : 1960
|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 1961
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1962
For the sake of having a Neutrosophic SuperHyperEulerian-Path-Decomposition, there’s a need to 1963

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 1972
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Path-Decomposition, SuperHyperStar, 1973
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 1974
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 1975
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 1976
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 1977
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian- 1978
. Since there’s more ways to get type-results to make a Neutrosophic

Path-Decomposition 1979

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

136TBL4

136TBL1
SuperHyperEulerian-Path-Decomposition more Neutrosophicly understandable. 1980

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Path-Decomposition”. The 1982
1985
136DEF1 Definition 9.0.23. Assume a SuperHyperEulerian-Path-Decomposition. It’s redefined a Neutrosophic 1986
SuperHyperEulerian-Path-Decomposition if the Table (29.3) holds. 1987

CHAPTER 10 1988
Extreme SuperHyper But As The Eulerian-Path-Decomposition 1989
Extensions Excerpt From Dense And 1990
Super Forms 1991
Definition 10.0.1. (Extreme event). 1992
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 1993
is a probability Eulerian-Path-Decomposition. Any Extreme k-subset of A of V is called Extreme 1994
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 1995
expression is called Extreme probability of A. 1996
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 1997

is a probability Eulerian-Path-Decomposition. s Extreme k-events Ai , i ∈ I is called Extreme 1999

s-independent if the following expression is called Extreme s-independent criteria 2000
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 2001
following expression is called Extreme independent criteria 2002
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2003

is a probability Eulerian-Path-Decomposition. Any k-function Eulerian-Path-Decomposition like E is called 2005

Extreme k-Variable. If k = 2, then any 2-function Eulerian-Path-Decomposition like E is called 2006
Extreme Variable. 2007
The notion of independent on Extreme Variable is likewise. 2008
Definition 10.0.4. (Extreme Expectation). 2009
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2010
73
a probability Eulerian-Path-Decomposition. an Extreme k-Variable E has a number is called Extreme 2011

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

a probability Eulerian-Path-Decomposition. an Extreme number is called Extreme Crossing if the 2015

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

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

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

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

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

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

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

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

S = (V, E) is a probability Eulerian-Path-Decomposition. Let X be an Extreme Variable and let t be 2085
a positive real number. Then 2086
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2087
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let Xn be an Extreme Variable in a 2089

probability Eulerian-Path-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), then 2090
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Path-Decomposition. Set X := Xn and t := |Ex(Xn )| in 2092
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2093
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2094
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2096
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 2097
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2098
S = (V, E) is a probability Eulerian-Path-Decomposition. As in the proof of related Theorem, the 2100
result is straightforward. 2101
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ be 2103
as defined in previous Theorem. Then either: 2104
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2105
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2106
S = (V, E) is a probability Eulerian-Path-Decomposition. The latter is straightforward. 2108
Definition 10.0.17. (Extreme Threshold). 2109
a probability Eulerian-Path-Decomposition. Let P be a monotone property of SuperHyperGraphs (one 2111
which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for P is 2112
a function f (n) such that: 2113
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2114
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2115

Definition 10.0.18. (Extreme Balanced). 2116

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

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2124
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2127
the mentioned Extreme Figures in every Extreme items. 2128
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperEulerian- 2129
Path-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2130
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2131
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2132
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2133
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2134
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2135
Extreme SuperHyperEulerian-Path-Decomposition. 2136
C(N SHG)Extreme Eulerian-Path-Decomposition

= {{E4 }}.
C(N SHG)Extreme Eulerian-Path-Decomposition SuperHyperPolynomial
= z.
C(N SHG)Extreme V-Eulerian-Path-Decomposition
= {{V1 , V2 , V4 }}.
C(N SHG)Extreme V-Eulerian-Path-Decomposition SuperHyperPolynomial
= z3.
2137
Path-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 2139
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 2140

Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 2141
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means 2142
that there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the 2143
Extreme SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperEulerian- 2144
Path-Decomposition. 2145

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.3) 136NSHG1
= {{E4 }}.
= z.
= {{V1 , V2 , V4 }}.
= z3.
2146
Path-Decomposition, is up. The Extreme Algorithm is Extremely straightforward. 2148

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



= {{E4 , E5 , E1 , E2 }}.
= z4.
= {{Vi ∈ VN SHG }}.
= z |Vi ∈VN SHG | .
2152

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

= z0.
2155

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

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

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

= z0.
2164

= {{}}.
= z0.
= {{}}.
= z0.
2167
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme 2168

SuperHyperEulerian-Path-Decomposition, is up. The Extreme Algorithm is Extremely straight- 2169
forward. 2170


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

forward. 2174

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

= z0.
2175

forward. 2178

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

forward. 2182

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

forward. 2186

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


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

forward. 2190

= {{E1 , E2 , E3 , E4 , E5 }}.
= z5.
= {{Vi ∈ VN SHG }}.
2191


forward. 2194

= {{E1 , E2 , E3 , E4 , E5 }}.
= z5.
= {{Vi ∈ VN SHG }}.
2195



forward. 2198

= {{E1 , E2 , E3 , E4 , E5 , E6 }}.
= z6.
= {{Vi ∈ VN SHG }}.
2199

forward. 2202

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


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

forward. 2206

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

= z0.
2207

forward. 2210

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

forward. 2214

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

forward. 2218

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

SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.3) 95NHG1
= z4.
= {{Vi ∈ VN SHG }}.
2219
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2220
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor 2221
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2222
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2223
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2224
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2225
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2226

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

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Hamiltonian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Neighbor 2232
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2233
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2234
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2235
of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Neighbor in some cases 2236
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2237
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2238
R-Hamiltonian-Type-Cycle-Neighbor. 2239
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Hamiltonian-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 an Extreme type-result-R-Hamiltonian-Type-Cycle-Neighbor with the least Extreme cardinality, 2240

the lower sharp Extreme bound for cardinality. 2241
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2242
Then in the worst case, literally, 2243
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−N eighbor

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

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−Hamiltonian−T ype−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−Hamiltonian−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-Hamiltonian-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 an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet

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

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Hamiltonian-Type-Cycle-Neighbor. In other words, the least cardinality, the lower sharp

bound for the cardinality, of a quasi-R-Hamiltonian-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-Hamiltonian-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-Hamiltonian-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-Hamiltonian-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 an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus there’s
at least an Extreme R-Hamiltonian-Type-Cycle-Neighbor has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Hamiltonian-Type-Cycle-Neighbor has the Extreme cardinality
at least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Hamiltonian-Type-Cycle-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 an Extreme
contradiction with the term “Extreme R-Hamiltonian-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-Hamiltonian-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 an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that

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

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-Hamiltonian-Type-Cycle-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 an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the
Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no Extreme
SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices have
the eligibles to be contained in an Extreme R-Hamiltonian-Type-Cycle-Neighbor. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Hamiltonian-Type-Cycle-Neighbor.
Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Hamiltonian-Type-Cycle-Neighbor is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Hamiltonian-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-Hamiltonian-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, 2247
Extreme R-Hamiltonian-Type-Cycle-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2248
Extreme R-Hamiltonian-Type-Cycle-Neighbor =
Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but
in an Extreme Hamiltonian-Type-Cycle-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
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Hamiltonian-Type-Cycle-Neighbor 2249
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2250
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2251
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2252
number of Extreme SuperHyperVertices are renamed to Extreme Hamiltonian-Type-Cycle-Neighbor in 2253
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2254
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2255
contained in an Extreme R-Hamiltonian-Type-Cycle-Neighbor. 2256

The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Ex- 2257
treme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2258
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme Super- 2259
HyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2260
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2261
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2262
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2263
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2264
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyper- 2265
Vertices. Thus it forms an Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor where the Extreme 2266
completion of the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embed- 2267
ded R-Hamiltonian-Type-Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet and 2268

quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2269
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 2270
those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2271
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2272
included in the minimum Extreme style of the embedded Extreme R-Hamiltonian-Type-Cycle-Neighbor. 2273
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2274
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2275
common connections, more precise and more formal, the perfect unique connections inside 2276
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2277
Extreme R-Hamiltonian-Type-Cycle-Neighbor. Thus Extreme exterior SuperHyperVertices could be 2278
used only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the 2279
interior Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded 2280
Extreme Hamiltonian-Type-Cycle-Neighbor, there’s the usage of exterior Extreme SuperHyperVertices 2281

since they’ve more connections inside more than outside. Thus the title “exterior” is more relev- 2282
ant than the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, 2283
the Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2284
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Hamiltonian- 2285
Type-Cycle-Neighbor. The Extreme R-Hamiltonian-Type-Cycle-Neighbor with the exclusion of the exclusion 2286
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2287
the Extreme R-Hamiltonian-Type-Cycle-Neighbor with the inclusion of all Extreme SuperHyperVertices 2288
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor. To sum 2289
them up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2290
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2291
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Hamiltonian- 2292
Type-Cycle-Neighbor minus all Extreme SuperHypeNeighbor to some of them but not all of them. In 2293
other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 2294
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor, minus 2295
all Extreme SuperHypeNeighbor to some of them but not all of them. 2296
The main definition of the Extreme R-Hamiltonian-Type-Cycle-Neighbor has two titles. an Ex- 2297
treme quasi-R-Hamiltonian-Type-Cycle-Neighbor and its corresponded quasi-maximum Extreme R- 2298
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2299
there’s an Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor with that quasi-maximum Extreme Su- 2300
perHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2301
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us 2302
to take the collection of all the Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbors for all Extreme 2303
numbers less than its Extreme corresponded maximum number. The essence of the Extreme 2304
Hamiltonian-Type-Cycle-Neighbor ends up but this essence starts up in the terms of the Extreme quasi- 2305
R-Hamiltonian-Type-Cycle-Neighbor, again and more in the operations of collecting all the Extreme 2306
quasi-R-Hamiltonian-Type-Cycle-Neighbors acted on the all possible used formations of the Extreme 2307
SuperHyperGraph to achieve one Extreme number. This Extreme number is 2308
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Neighbors. Let 2309
zExtreme Number , SExtreme SuperHyperSet and GExtreme Hamiltonian-Type-Cycle-Neighbor be an Extreme 2310

number, an Extreme SuperHyperSet and an Extreme Hamiltonian-Type-Cycle-Neighbor. Then 2311
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

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

|SExtreme SuperHyperSet |Extreme Cardinality

= zExtreme Number }.
As its consequences, the formal definition of the Extreme Hamiltonian-Type-Cycle-Neighbor is re- 2312
formalized and redefined as follows. 2313
GExtreme Hamiltonian-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 2314
definition for the Extreme Hamiltonian-Type-Cycle-Neighbor. 2315
GExtreme Hamiltonian-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 Hamiltonian- 2316
poses the upcoming expressions.
Type-Cycle-Neighbor 2317
{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2318
= max zExtreme Number

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

And then, 2319

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


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

2322

2323

Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2324
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2325
such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Super- 2326
HyperEdge. It’s, literarily, another name for “Extreme Quasi-Hamiltonian-Type-Cycle-Neighbor” but, 2327
precisely, it’s the generalization of “Extreme Quasi-Hamiltonian-Type-Cycle-Neighbor” since “Extreme 2328

Quasi-Hamiltonian-Type-Cycle-Neighbor” happens “Extreme Hamiltonian-Type-Cycle-Neighbor” in an Extreme 2329

SuperHyperGraph as initial framework and background but “Extreme SuperHyperNeighbor- 2330
hood” may not happens “Extreme Hamiltonian-Type-Cycle-Neighbor” in an Extreme SuperHyperGraph 2331
as initial framework and preliminarily background since there are some ambiguities about 2332
the Extreme SuperHyperCardinality arise from it. To get orderly keywords, the terms, “Ex- 2333
treme SuperHyperNeighborhood”, “Extreme Quasi-Hamiltonian-Type-Cycle-Neighbor”, and “Extreme 2334
Hamiltonian-Type-Cycle-Neighbor” are up. 2335

Thus, let 2336
zExtreme Number , NExtreme SuperHyperNeighborhood and 2337
GExtreme Hamiltonian-Type-Cycle-Neighbor be an Extreme number, an Extreme SuperHyperNeighbor- 2338
hood and an Extreme Hamiltonian-Type-Cycle-Neighbor and the new terms are up. 2339
GExtreme Hamiltonian-Type-Cycle-Neighbor ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality
2340
{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2341
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2342

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


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

2345

2346

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

The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Neighbor. The

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

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

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

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

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

Neighbor, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2347
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2348
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2349
the 2350
“Extreme R-Hamiltonian-Type-Cycle-Neighbor” 2351
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2352
Extreme R-Hamiltonian-Type-Cycle-Neighbor, 2353
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

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

sharp bound for the cardinality, of an Extreme R-Hamiltonian-Type-Cycle-Neighbor is the cardinality of
2354
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2355
Extreme SuperHyperVertices belong to any Extreme quasi-R-Hamiltonian-Type-Cycle-Neighbor if for 2356
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2357
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2358
all minus all Extreme SuperHypeNeighbors to any amount of them. 2359
Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2360
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2361
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2362
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2363
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2364
R-Hamiltonian-Type-Cycle-Neighbor with the least cardinality, the lower sharp Extreme bound for 2365
Extreme cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2366
Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme 2367
SuperHyperSet S of the Extreme SuperHyperVertices such that there’s an Extreme Supe- 2368
rHyperEdge to have some Extreme SuperHyperVertices uniquely but it isn’t an Extreme 2369
R-Hamiltonian-Type-Cycle-Neighbor. Since it doesn’t have 2370
2371
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2372
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2373
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2374
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Supe- 2375
rHyperVertices but it isn’t an Extreme R-Hamiltonian-Type-Cycle-Neighbor. Since it doesn’t do 2376
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2377
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2378
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2379
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2380
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2381
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2382
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2383

Thus the obvious Extreme R-Hamiltonian-Type-Cycle-Neighbor, VESHE is up. The obvious simple Ex- 2384
treme type-SuperHyperSet of the Extreme R-Hamiltonian-Type-Cycle-Neighbor, VESHE , is an Extreme 2385
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2386
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2387
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2388
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2389

S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2390
some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2391
ESHG : (V, E). Any Extreme R-Hamiltonian-Type-Cycle-Neighbor only contains all interior Extreme 2392
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2393
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2394
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2395

SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2396
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2397
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Neighbor, is up. There’s neither empty 2398
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2399
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2400
the Extreme Hamiltonian-Type-Cycle-Neighbor. The Extreme SuperHyperSet of Extreme SuperHy- 2401
perEdges[SuperHyperVertices], 2402

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

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2406
2407
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2408
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2409
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2410
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2411
Extreme SuperHyperSet. Thus the non-obvious Extreme Hamiltonian-Type-Cycle-Neighbor is up. The 2412
obvious simple Extreme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Neighbor is 2413

an Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2414
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2415

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

= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2416
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Hamiltonian-Type- 2417
Cycle-Neighbor is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2418

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 Hamiltonian- 2420
.
Type-Cycle-NeighborSince the Extreme SuperHyperSet of the Extreme SuperHy- 2421

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Hamiltonian-Type-Cycle-Neighbor C(ESHG) for an Extreme SuperHyperGraph 2423
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2424
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2425
that Extreme type-SuperHyperSet called the Extreme Hamiltonian-Type-Cycle-Neighbor and it’s an 2426
Extreme Hamiltonian-Type-Cycle-Neighbor. Since it’s 2427
2428
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2429
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2430
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2431
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2432
intended Extreme SuperHyperSet, 2433

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

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 Hamiltonian-Type-Cycle- 2435
Neighbor, not: 2436

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

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 2438
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2439
SuperHyperSet called the 2440
“Extreme Hamiltonian-Type-Cycle-Neighbor ” 2441
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2442
Extreme Hamiltonian-Type-Cycle-Neighbor , 2443
is only and only 2444

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

CHAPTER 11 2446
The Extreme Departures on The 2447
Theoretical Results Toward Theoretical 2448
Motivations 2449
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2450
SuperHyperClasses. 2451
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2452

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

SuperHyperEulerian-Path-Decomposition in the Example (42.0.5) 136NSHG18a
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2455
new way to redefine as 2456
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 2457
to ViEXT ERN AL in the literatures of SuperHyperEulerian-Path-Decomposition. The latter is 2458
straightforward. 2459
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2460
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2461
(31.1), is the SuperHyperEulerian-Path-Decomposition. 2462
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2463

= {{}}.
= z0.

= {{}}.
= z0.
Proof. Let 2464
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2465
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 2466

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

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

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

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


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

SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.9) 136NSHG20a
136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2482
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2483
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2484
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperEulerian- 2485
Path-Decomposition. 2486
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2487

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 2488
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
2489
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 2490
a new way to redefine as 2491

straightforward. Then there’s no at least one SuperHyperEulerian-Path-Decomposition. Thus the notion 2494
of quasi may be up but the SuperHyperNotions based on SuperHyperEulerian-Path-Decomposition 2495
could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 2496
one SuperHyperVertex as the representative in the 2497
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Extreme SuperHyperBi- 2498
partite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2499
SuperHyperPart SuperHyperEdges are attained in any solution 2500
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2501
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2502
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2503
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2504
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2505
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperEulerian-Path-Decomposition. 2506

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

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

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 2509
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

2510
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Extreme SuperHyper- 2511

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

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

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2520
SuperHyperEdges are attained in any solution 2521
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2522
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2524
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2525
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2526
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2527
the Extreme SuperHyperEulerian-Path-Decomposition. 2528
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 2529

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

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 2530
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗
2531
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Extreme SuperHyper- 2532
Wheel ESHW : (V, E). There’s a new way to redefine as 2533


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

Extreme SuperHyperEulerian-Path-Decomposition in the Extreme Example (42.0.15) 136NSHG23a
straightforward. Then there’s at least one SuperHyperEulerian-Path-Decomposition. Thus the notion 2536
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Path-Decomposition 2537
could be applied. The unique embedded SuperHyperEulerian-Path-Decomposition proposes some 2538
longest SuperHyperEulerian-Path-Decomposition excerpt from some representatives. The latter is 2539
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2541
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2542
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2543
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2544
Extreme SuperHyperEulerian-Path-Decomposition. 2545

CHAPTER 12 2546
The Surveys of Mathematical Sets On 2547
The Results But As The Initial Motivation 2548
For the SuperHyperHamiltonian-Type-Cycle-Neighbor, Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor, 2549

and the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor, some general results are introduced. 2550
Remark 12.0.1. Let remind that the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor is “redefined” 2551
on the positions of the alphabets. 2552
Corollary 12.0.2. Assume Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor. Then 2553
Extreme SuperHyperHamiltonian − T ype − Cycle − N eighbor =

{theSuperHyperHamiltonian − T ype − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − N eighbor
|ExtremecardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−N eighbor. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2554
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2555

and the neutrality, for i = 1, 2, 3, respectively. 2556
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the alpha- 2557
bet. Then the notion of Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor and SuperHyperHamiltonian- 2558
Type-Cycle-Neighbor coincide. 2559
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of 2560
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is an Extreme 2561
SuperHyperHamiltonian-Type-Cycle-Neighbor if and only if it’s a SuperHyperHamiltonian-Type-Cycle-Neighbor. 2562
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of 2563
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 2564
SuperHyperHamiltonian-Type-Cycle-Neighbor if and only if it’s a longest SuperHyperHamiltonian-Type-Cycle- 2565
Neighbor. 2566
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2567

identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor is its 2568
SuperHyperHamiltonian-Type-Cycle-Neighbor and reversely. 2569
125
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Neighbor, 2570

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2571
identical letter of the alphabet. Then its Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor is its 2572
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian- 2574
isn’t well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t
well-defined. 2576
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then 2577

its Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined if and only if its 2578
SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined. 2579
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 2580

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Neighbor 2581
Then its Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined if and only if its 2582
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperHamiltonian-2584

is well-defined if and only if its SuperHyperHamiltonian-Type-Cycle-Neighbor is well- 2585
Type-Cycle-Neighbor
defined. 2586
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its Ex- 2587
treme SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian- 2588

Type-Cycle-Neighbor is well-defined. 2589
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Neighbor, 2590
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Ex- 2591

treme SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian- 2592
Type-Cycle-Neighbor is well-defined. 2593
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2594
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2595
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2596
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2597
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2598
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2599
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2600
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2601
(i) : the SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2602
(ii) : the strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2603
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2604
(iv) : the δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2605

(v) : the strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2606
(vi) : the connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2607
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2608

independent SuperHyperSet is 2609
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2612
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2616

which is a SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 2617
(i) : SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2618
(ii) : strong SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2619
(iii) : connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2620
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2621
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2622
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2623
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2624
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2625
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2626
(i) : dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2627
(ii) : strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2628
(iii) : connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2629
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2630
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2631
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2632
which is a SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath. Then the number of 2635

(i) : the SuperHyperHamiltonian-Type-Cycle-Neighbor; 2636
(ii) : the SuperHyperHamiltonian-Type-Cycle-Neighbor; 2637
(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Neighbor; 2638
(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 2639
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 2640
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor. 2641
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2642
coincide. 2643

which is a SuperHyperWheel. Then the number of 2645
(i) : the dual SuperHyperHamiltonian-Type-Cycle-Neighbor; 2646
(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Neighbor; 2647
(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Neighbor; 2648
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 2649
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 2650
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor. 2651
coincide. 2653

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2655
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2656
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2657
is a 2658
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2662
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2663
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2664


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2667
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2668
SuperHyperPart is a 2669
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2673
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2674
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2675

SuperHyperMultipartite. Then Then the number of 2678
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2685
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2686
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2688
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2689
(iv) : SuperHyperHamiltonian-Type-Cycle-Neighbor; 2693
(v) : strong 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2694
(vi) : connected 1-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2695

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2696
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2697
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2698
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2699

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

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

2 + 1)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2706
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2707
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2708
dual 2709
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2713
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2716
perComplete. Then there’s no independent SuperHyperSet. 2717
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2718

SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 2719
O(ESHG : (V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a 2720
dual 2721
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2725
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2726

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2727
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2728
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2729

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2738
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2739
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2740
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2741
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2742
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such that 2743
(i) v ∈ Ns (x); 2744
(ii) vx ∈ E. 2745
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2746
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor, then 2747
(i) S is SuperHyperHamiltonian-Type-Cycle-Neighbor set; 2748
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2749
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2750
(i) Γ ≤ O; 2751
(ii) Γs ≤ On . 2752
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2753
connected. Then 2754
(i) Γ ≤ O − 1; 2755
(ii) Γs ≤ On − Σ3i=1 σi (x). 2756
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2757

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

SuperHyperHamiltonian-Type-Cycle-Neighbor; 2759
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2760
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2761
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2762
SuperHyperHamiltonian-Type-Cycle-Neighbor. 2763
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2764
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 2765
Neighbor; 2766
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2767
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2768
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2769
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Neighbor. Then 2771
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 2772

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

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2782
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2783
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2785
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Neighbor; 2786
(ii) Γ = 1; 2787
(iii) Γs = Σ3i=1 σi (c); 2788

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle-Neighbor. 2789
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2790
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2791
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 2792
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2793
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2794
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2795
SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 2796
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2797
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 2798
(ii) Γ = b n2 c + 1; 2800
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2801
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 2802
Type-Cycle-Neighbor. 2803
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2804
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2805
Cycle-Neighbor; 2806
(ii) Γ = b n2 c; 2807

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

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

Type-Cycle-Neighbor for N SHF; 2814
(ii) Γ = m for N SHF : (V, E); 2815
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2816
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 2817
Type-Cycle-Neighbor for N SHF : (V, E). 2818

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

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

b n c+1 for N SHF : (V, E); 2824
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 2825
Neighbor for N SHF : (V, E). 2826
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2827
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2828
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 2829
Cycle-Neighbor for N SHF : (V, E); 2830
(ii) Γ = b n2 c for N SHF : (V, E); 2831

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

SuperHyperHamiltonian-Type-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
2838
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 2840

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

SuperHyperHamiltonian-Type-Cycle-Neighbor, then 2846
S is an s-SuperHyperPowerful SuperHyperHamiltonian-Type-Cycle-Neighbor; 2847

SuperHyperHamiltonian-Type-Cycle-Neighbor, then 2849
S is a dual s-SuperHyperPowerful SuperHyperHamiltonian-Type-Cycle-Neighbor. 2850
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 2851
SuperHyperGraph. Then following statements hold; 2852

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

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

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

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


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

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


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

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

SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Neighbor. Then following statements 2892

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

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

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

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


SuperHyperGraph which is SuperHyperHamiltonian-Type-Cycle-Neighbor. Then following statements 2903
hold; 2904
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 2905

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


CHAPTER 13 2913
Extreme Applications in Cancer’s 2914
Extreme Recognition 2915
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 2916
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 2917
as the consequences of the model, some parameters are used. The cells are under attack of this 2918
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 2919
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 2920
In the following, some Extreme steps are Extreme devised on this disease. 2921
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 2922
function. 2923
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 2924
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 2925
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 2926
since there are some determinacy, indeterminacy and neutrality about the moves and the 2927
effects of the cancer on that region; this event leads us to choose another model [it’s said 2928
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 2929
what’s done. 2930
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 2931
they’ve got the names, and some general Extreme models. The moves and the Extreme 2932
traces of the cancer on the complex tracks and between complicated groups of cells could 2933
be fantasized by an Extreme SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle-Neighbor, 2934
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 2935
aim is to find either the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor or the Extreme 2936
SuperHyperHamiltonian-Type-Cycle-Neighbor in those Extreme Extreme SuperHyperModels. 2937
137
CHAPTER 14 2938
Case 1: The Initial Extreme Steps 2939
Toward Extreme SuperHyperBipartite 2940
as Extreme SuperHyperModel 2941
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 2942
is Extreme highlighted and Extreme featured. 2943
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 2944
partite is obtained. 2945
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 2946
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

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

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

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

CHAPTER 15 2950
Case 2: The Increasing Extreme Steps 2951
Toward Extreme 2952
SuperHyperMultipartite as Extreme 2953
SuperHyperModel 2954
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 2955
ite is Extreme highlighted and Extreme featured. 2956
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 2957
partite is obtained. 2958
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous res- 2959
Figure 15.1: an 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- 2960

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

CHAPTER 16 2963
Wondering Open Problems But As The 2964
Directions To Forming The Motivations 2965
In what follows, some “problems” and some “questions” are proposed. 2966
The SuperHyperHamiltonian-Type-Cycle-Neighbor and the Extreme SuperHyperHamiltonian-Type-Cycle- 2967
Neighbor are defined on a real-world application, titled “Cancer’s Recognitions”. 2968
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 2969
recognitions? 2970
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle- 2971

and the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor?
Neighbor 2972
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 2973
them? 2974
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 2975
and the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor?
Problem 16.0.5. The SuperHyperHamiltonian-Type-Cycle-Neighbor and the Extreme SuperHyperHamiltonian- 2977

do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperHamiltonian-Type-Cycle-Neighbor, are there else? 2979
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 2980
Numbers types-results? 2981
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 2982
the multiple types of SuperHyperNotions? 2983
143
CHAPTER 17 2984
Conclusion and Closing Remarks 2985
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 2986
research are illustrated. Some benefits and some advantages of this research are highlighted. 2987
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 2988
In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian-Type- 2989
Cycle-Neighbor. For that sake in the second definition, the main definition of the Extreme 2990
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition for 2991
the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperHamiltonian- 2992
Type-Cycle-Neighbor, finds the convenient background to implement some results based on that. 2993
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 2994
on the modeling of the regions where are under the attacks of the cancer to recognize this 2995
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 2996
the SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Neighbor, the new SuperHyperClasses and 2997
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 2998
SuperHyperHamiltonian-Type-Cycle-Neighbor and the Extreme SuperHyperHamiltonian-Type-Cycle-Neighbor. 2999

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

CHAPTER 18 3011
Extreme SuperHyperDuality But As The 3012
Super Forms 3014
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3015

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

Va ∈ Ei , Ej ; 3019
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3020
Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 3021
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3022
Vi , Vj ∈ Ea ; 3023
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3024
Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 3025
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3026
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3027

SuperHyperDuality. 3028
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3029

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3034
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3035
cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme sequence 3036
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3037
Extreme SuperHyperDuality; 3038
147
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3039

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3040
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3041
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 3042
of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3043
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3044
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3045

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3046
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3047
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3048
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3049
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeigh- 3050
borive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3051
the Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3052
coefficient; 3053
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3054

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

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

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

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

cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVer- 3082

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3090
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3091
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3092
to its Extreme coefficient. 3093
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3094
mentioned Extreme Figures in every Extreme items. 3095
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3096
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3097
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3098
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3099
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3100
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 3101
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 3102
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3104
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3105
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3106
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3108
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3109
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3110


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

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3180
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 3182
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. 3186
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3187
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3188
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3189
representative in the 3190
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 : 3191

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3203

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3207
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3208
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. 3220
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 3222
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 : 3223

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

∃!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 3228
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3229
Extreme SuperHyperDuality. 3235

CHAPTER 19 3236
Extreme SuperHyperJoin But As The 3237
Super Forms 3239
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3240

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 3251
|Vj |NEUTROSOPIC CARDINALITY ; 3252
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3253
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3254
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3255

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3259
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3260
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3261
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3262
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3263
161
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3264

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3271
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3272
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3273
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3274
of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive Extreme 3275
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3276
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3277
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3278

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

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

Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3290
SuperHyperJoin; 3292
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3293

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of 3296
high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme 3297
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3298
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3299
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3300

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3303

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

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

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

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

is up. The Extreme Algorithm is Extremely straightforward. 3333


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3454
Extreme SuperHyperPerfect But As The 3455
Super Forms 3457
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3458

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3470
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3471

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3475
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3476
Extreme SuperHyperPerfect; 3480
175
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3481

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3488
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3489
the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3494
coefficient; 3495
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3496

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3532
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3533
that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3534
to its Extreme coefficient. 3535
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3538
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3539
SuperHyperPerfect. 3545
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3547
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3548
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3552


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

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

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

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

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



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

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

Then 3643

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



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

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

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


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

CHAPTER 21 3678
Extreme SuperHyperTotal But As The 3679
Super Forms 3681
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3682
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3685
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3686

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3692
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3693

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3697
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3699
SuperHyperEdges in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges 3700
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3701
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3702

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

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

e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3709
treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3710
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3711
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3712
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3713
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3714
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme coeffi- 3715
cient; 3716
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3717

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3718
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3720
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3721
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3722

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

and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3728
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 3729
the Extreme SuperHyperVertices in the conseNeighborive Extreme sequence of Extreme 3730
SuperHyperTotal; 3732
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3733

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3740
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3741
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality con- 3744
seNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 3745
they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to its 3746
Extreme coefficient; 3747

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3749
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3751
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3752
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality conseNeighborive 3753
cient. 3756
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3759
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3760
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3761
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3762
SuperHyperTotal. 3766
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3768
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3769
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3770
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3771
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3772

V3 , is excluded in every given Extreme SuperHyperTotal. 3773



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3821
(31.1), is the SuperHyperTotal. 3824
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 3826
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. 3833
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 3835
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 3897
Extreme SuperHyperConnected But As 3898
The Extensions Excerpt From Dense And 3899
Super Forms 3900
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 3901

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 3915
SuperHyperConnected. 3916
Definition 22.0.2. ((Extreme) SuperHyperConnected). 3917
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 3920

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 3934
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 3935
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 3936
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 3937
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 3938
Extreme cardinality conseNeighborive Extreme SuperHyperEdges and Extreme SuperHy- 3939
perVertices such that they form the Extreme SuperHyperConnected; and the Extreme 3940
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 3942


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

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

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

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

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

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

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

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

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

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 3993
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3994
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 3998


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

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

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 4042
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. 4046
(31.1), is the SuperHyperConnected. 4049
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 4051
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. 4058
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 4060



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4079

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4114
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4115
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4116
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4117
some representatives. The latter is straightforward. 4118
Extreme SuperHyperConnected. 4123

CHAPTER 23 4124
Background 4125
217











in Scribd. 4285


HG44b]. 4319

Bibliography 4320
10.33140/JMTCM.01.03.09) 4327
223
10.20944/preprints202301.0282.v1). 4355
10.20944/preprints202301.0267.v1). 4358

(doi: 10.20944/preprints202301.0265.v1). 4363
prints202301.0262.v1). 4367
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4373
prints202301.0105.v1). 4376
Preprints 2023, 2023010044 4382
10.20944/preprints202301.0043.v1). 4385

(doi: 10.20944/preprints202212.0549.v1). 4394
(doi: 10.20944/preprints202212.0500.v1). 4401
2023, (doi: 10.5281/zenodo.7809365). 4418
2023, (doi: 10.5281/zenodo.7809358). 4421
10.5281/zenodo.7809219). 4424
10.5281/zenodo.7809328). 4427

2023, (doi: 10.5281/zenodo.7806767). 4430
2023, (doi: 10.5281/zenodo.7806838). 4433
(doi: 10.5281/zenodo.7799902). 4442
2023, (doi: 10.5281/zenodo.7804218). 4445
(doi: 10.5281/zenodo.7796334). 4448
10.5281/zenodo.7791952). 4454
(doi: 10.5281/zenodo.7791982). 4457
10.5281/zenodo.7790026). 4460
2023, (doi: 10.5281/zenodo.7790052). 4463
2023, (doi: 10.5281/zenodo.7787066). 4466

10.5281/zenodo.7781476). 4472
10.5281/zenodo.7783082). 4475
10.5281/zenodo.7777857). 4478
10.5281/zenodo.7779286). 4481
(doi: 10.5281/zenodo.7771831). 4484
2023, (doi: 10.5281/zenodo.7772468). 4487
10.13140/RG.2.2.20913.25446). 4490
10.5281/zenodo.7764916). 4493
10.13140/RG.2.2.11770.98247). 4496
10.13140/RG.2.2.12400.12808). 4499
2023, (doi: 10.13140/RG.2.2.22545.10089). 4502

10.13140/RG.2.2.11377.76644). 4508
10.13140/RG.2.2.23750.96329). 4511
10.13140/RG.2.2.31366.24641). 4514
10.13140/RG.2.2.34721.68960). 4517
10.13140/RG.2.2.24288.35842). 4526
10.13140/RG.2.2.32467.25124). 4529
10.13140/RG.2.2.31025.45925). 4532
10.13140/RG.2.2.17184.25602). 4535
10.13140/RG.2.2.23423.28327). 4538
10.13140/RG.2.2.28456.44805). 4541
10.13140/RG.2.2.23525.68320). 4544

10.13140/RG.2.2.20170.24000). 4547
10.13140/RG.2.2.36475.59683). 4550
10.13140/RG.2.2.29764.71046). 4553
2023, (doi: 10.13140/RG.2.2.18780.87683). 4556
10.13140/RG.2.2.26134.01603). 4562
10.13140/RG.2.2.27392.30721). 4565
10.13140/RG.2.2.33028.40321). 4568
10.13140/RG.2.2.21389.20966). 4571
10.13140/RG.2.2.16356.04489). 4574
10.13140/RG.2.2.21756.21129). 4577
10.13140/RG.2.2.30983.68009). 4580
10.13140/RG.2.2.28552.29445). 4583

10.13140/RG.2.2.35105.89447). 4589
(doi: 10.13140/RG.2.2.30072.72960). 4592
10.13140/RG.2.2.31147.52003). 4595
10.13140/RG.2.2.32825.24163). 4598
10.13140/RG.2.2.13059.58401). 4601
10.13140/RG.2.2.11172.14720). 4604
2023, (doi: 10.13140/RG.2.2.22011.80165). 4607
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4610
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4616
2023, (doi: 10.13140/RG.2.2.19944.14086). 4619
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4622

(doi: 10.13140/RG.2.2.33103.76968). 4625
2023, (doi: 10.13140/RG.2.2.23037.44003). 4628
(doi: 10.13140/RG.2.2.35646.56641). 4631
(doi: 10.13140/RG.2.2.18030.48967). 4634
(doi: 10.13140/RG.2.2.13973.81121). 4637
2023, (doi: 10.13140/RG.2.2.34106.47047). 4640
2023, (doi: 10.13140/RG.2.2.31956.88961). 4646
2023, (doi: 10.13140/RG.2.2.15179.67361). 4649
10.13140/RG.2.2.21510.45125). 4652
2023, (doi: 10.13140/RG.2.2.13121.84321). 4655
10.13140/RG.2.2.11758.69441). 4658
2023, (doi: 10.13140/RG.2.2.31891.35367). 4661

10.13140/RG.2.2.19360.87048). 4664
2023, (doi: 10.13140/RG.2.2.32363.21286). 4667
(doi: 10.13140/RG.2.2.23266.81602). 4670
10.13140/RG.2.2.19911.37285). 4673
10.13140/RG.2.2.11050.90569). 4676
(doi: 10.13140/RG.2.2.30182.50241). 4688

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

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


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


10.20944/preprints202301.0282.v1). 4754

10.20944/preprints202301.0267.v1).). 4757

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 4762
prints202301.0262.v1). 4766


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

10.13140/RG.2.2.35061.65767). 4775

10.13140/RG.2.2.18494.15680). 4779
10.13140/RG.2.2.32530.73922). 4783
10.13140/RG.2.2.15897.70243). 4787

10.13140/RG.2.2.32530.73922). 4791
prints202301.0105.v1). 4794
10.13140/RG.2.2.23172.19849). 4801

10.13140/RG.2.2.17385.36968). 4811

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

2023, (doi: 10.13140/RG.2.2.28945.92007). 4820
10.13140/RG.2.2.35774.77123). 4826

10.13140/RG.2.2.29430.88642). 4832
(doi: 10.20944/preprints202212.0549.v1). 4838
10.13140/RG.2.2.19380.94084). 4841


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

10.13140/RG.2.2.20993.12640). 4855



10.13140/RG.2.2.29173.86244). 4870
2023 (doi: 10.5281/zenodo.7820680). 4875
10.5281/zenodo.7812750). 4877


2023 (doi: 10.5281/zenodo.7807782). 4883
2023 (doi: 10.5281/zenodo.7804449). 4885

(doi: 10.5281/zenodo.7792307). 4889

(doi: 10.5281/zenodo.7790728). 4891
2023 (doi: 10.5281/zenodo.7787712). 4893
10.5281/zenodo.7783791). 4895
10.5281/zenodo.7780123). 4897
(doi: 10.5281/zenodo.7773119). 4899
odo.7637762). 4901
10.5281/zenodo.7766174). 4903
10.5281/zenodo.7762232). 4905
(doi: 10.5281/zenodo.7758601). 4907
10.5281/zenodo.7754661). 4909
10.5281/zenodo.7750995) . 4911
(doi: 10.5281/zenodo.7749875). 4913
10.5281/zenodo.7747236). 4915
10.5281/zenodo.7742587). 4917
(doi: 10.5281/zenodo.7738635). 4919
10.5281/zenodo.7734719). 4921
10.5281/zenodo.7730484). 4923
(doi: 10.5281/zenodo.7730469). 4925

10.5281/zenodo.7722865). 4927
odo.7713563). 4929
odo.7709116). 4931
10.5281/zenodo.7706415). 4933
(doi: 10.5281/zenodo.7706063). 4935
(doi: 10.5281/zenodo.7701906). 4937
odo.7700205). 4939
10.5281/zenodo.7694876). 4941
10.5281/zenodo.7679410). 4943
10.5281/zenodo.7675982). 4945
10.5281/zenodo.7672388). 4947
odo.7668648). 4949
10.5281/zenodo.7662810). 4951
10.5281/zenodo.7659162). 4953
odo.7653233). 4955
odo.7653204). 4957
odo.7653142). 4959
odo.7653117). 4961

odo.7653089). 4963
odo.7651687). 4965
odo.7651619). 4967
odo.7651439). 4969
odo.7650729). 4971
odo.7647868). 4973
odo.7647017). 4975
odo.7644894). 4977
odo.7641880). 4979
odo.7632923). 4981
odo.7623459). 4983
10.5281/zenodo.7606416). 4985
10.5281/zenodo.7606416). 4987
odo.7606404). 4989
10.5281/zenodo.7580018). 4991
odo.7580018). 4993
odo.7580018). 4995
odo.7579929). 4997

10.5281/zenodo.7563170). 4999
odo.7563164). 5001
odo.7563160). 5003
odo.7563160). 5005
10.5281/zenodo.7563160). 5007
10.5281/zenodo.7557063). 5009
10.5281/zenodo.7557009). 5011
10.5281/zenodo.7539484). 5013
10.5281/zenodo.7523390). 5015
10.5281/zenodo.7523390). 5017
10.5281/zenodo.7523390). 5019
odo.7574952). 5021
10.5281/zenodo.7574992). 5023
odo.7523357). 5025
10.5281/zenodo.7523357). 5027
10.5281/zenodo.7504782). 5029
10.5281/zenodo.7504782). 5031
10.5281/zenodo.7504782). 5033

10.5281/zenodo.7499395). 5035
odo.7499395). 5037
10.5281/zenodo.7499395). 5039
10.5281/zenodo.7497450). 5041
10.5281/zenodo.7497450). 5043
10.5281/zenodo.7494862). 5045
odo.7494862). 5047
10.5281/zenodo.7494862). 5049
10.5281/zenodo.7493845). 5051
10.5281/zenodo.7493845). 5053
10.5281/zenodo.7493845). 5055
odo.7539484). 5057
odo.7523390). 5059
odo.7523357). 5061
odo.7504782). 5063
odo.7499395). 5065
odo.7497450). 5067
odo.7494862). 5069

odo.7493845). 5071
odo.7480110). 5073
odo.7378758). 5075
odo.6320305). 5077
odo.6677173). 5079

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

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5160
Then the research has taken more motivations to define SuperHyperClasses and to find some 5161
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5162
some instances and examples to make clarifications about the framework of this research. The 5163
general results and some results about some connections are some avenues to make key point of 5164
this research, “Cancer’s Recognition”, more understandable and more clear. 5165
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5166
research on the modeling of the regions where are under the attacks of the cancer to 5167
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5168
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5169
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5170
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5171

instances and literature reviews have taken the whole way through. In this scientific research, 5172
the literature reviews have fulfilled the lines containing the notions and the results. The 5173
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5174
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5175
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5176
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5177
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5178
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5179
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5180
to figure out the background for the SuperHyperNotions. 5181

CHAPTER 25 5182
Neutrosophic 5183
Eulerian-Path-Decomposition 5184
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5185
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5186
2023, (doi: 10.13140/RG.2.2.34953.52320). 5187
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5188
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5189
(doi: 10.13140/RG.2.2.33275.80161). 5190
10.13140/RG.2.2.11050.90569). 5193
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5194
10.13140/RG.2.2.17761.79206). 5196
10.13140/RG.2.2.19911.37285). 5199
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5200
10.13140/RG.2.2.23266.81602). 5202
10.13140/RG.2.2.19360.87048). 5205
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5206
10.13140/RG.2.2.32363.21286). 5208
10.13140/RG.2.2.11758.69441). 5211
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5212
10.13140/RG.2.2.31891.35367). 5214
249

10.13140/RG.2.2.21510.45125). 5217
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5218
10.13140/RG.2.2.13121.84321). 5220

CHAPTER 26 5221
New Ideas In Recognition of Cancer And 5222
Neutrosophic SuperHyperGraph By 5223
Eulerian-Path-Decomposition As Hyper 5224
Decompress On Super Decompensation 5225
251
CHAPTER 27 5226
ABSTRACT 5227
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperEulerian- 5228

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

criteria holds 5233
∀E 0 ∈ P : P is
Neutrosophic re-SuperHyperEulerian-Path-Decomposition if the following expression is called Neutro- 5234

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

SuperHyperEulerian-Path-Decomposition if the following expression is called Neutrosophic v- 5237
SuperHyperEulerian-Path-Decomposition criteria holds 5238
∀V 0 ∈ P : P is
Neutrosophic rv-SuperHyperEulerian-Path-Decomposition if the following expression is called Neutro- 5239

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

SuperHyperEulerian-Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian- 5242
Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v- 5243
SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition. 5244
((Neutrosophic) SuperHyperEulerian-Path-Decomposition). Assume a Neutrosophic SuperHy- 5245
perGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5246
(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperEulerian-Path- 5247

Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme SuperHyper- 5250
Graph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S 5251
of high Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 5252
form the Extreme SuperHyperEulerian-Path-Decomposition; a Neutrosophic SuperHyperEulerian-Path- 5254
Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re- 5255
SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neut- 5256
rosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyper- 5257
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 5258
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5259

Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 5260
Neutrosophic SuperHyperEulerian-Path-Decomposition; an Extreme SuperHyperEulerian-Path-Decomposition 5261
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, 5262
Neutrosophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path- 5263
Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an 5264
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5265

the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5266
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality 5267
conseNeighborive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5268
form the Extreme SuperHyperEulerian-Path-Decomposition; and the Extreme power is corresponded 5269
to its Extreme coefficient; a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyper- 5270
Polynomial if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic 5271

Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutrosophic SuperHy- 5273
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5274
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 5275
Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardin- 5276

ality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5277
such that they form the Neutrosophic SuperHyperEulerian-Path-Decomposition; and the Neutrosophic 5278
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperEulerian-Path- 5279
Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for an Extreme SuperHy- 5282

perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5283
S of high Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive 5284
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5285
they form the Extreme SuperHyperEulerian-Path-Decomposition; a Neutrosophic V-SuperHyperEulerian- 5286

Path-Decomposition if it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutro- 5287

sophic re-SuperHyperEulerian-Path-Decomposition, Neutrosophic v-SuperHyperEulerian-Path-Decomposition, 5288
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 5290
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5291
cardinality conseNeighborive Neutrosophic SuperHyperEdges and Neutrosophic SuperHy- 5292
perVertices such that they form the Neutrosophic SuperHyperEulerian-Path-Decomposition; an 5293

Extreme V-SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if it’s either of Neutro- 5294
Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian-Path- 5296
Decomposition and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme 5297
SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme number 5298
of the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 5299

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperEulerian-Path- 5301
Decomposition; and the Extreme power is corresponded to its Extreme coefficient; a Neut- 5302
rosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if it’s either of Neutro- 5303
Neutrosophic v-SuperHyperEulerian-Path-Decomposition, and Neutrosophic rv-SuperHyperEulerian- 5305

Path-Decomposition and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the 5306
Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 5307
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyper- 5308
Vertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 5309
the Neutrosophic SuperHyperEulerian-Path-Decomposition; and the Neutrosophic power is corres- 5311

ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced 5312
for new SuperHyperNotions, namely, a SuperHyperEulerian-Path-Decomposition and Neutrosophic 5313
SuperHyperEulerian-Path-Decomposition. Two different types of SuperHyperDefinitions are debut 5314
for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 5315
SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5316
implemented in the whole of this research. For shining the elegancy and the significancy of this 5317
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5318
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5319
and the instances thus the clarifications are driven with different tools. The applications are 5320
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5321
Recognition” are the under research to figure out the challenges make sense about ongoing and 5322
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recogni- 5327
tion”. Thus these complex and dense SuperHyperModels open up some avenues to research 5328
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 5329
research. It’s also officially collected in the form of some questions and some problems. Assume 5330
a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperEulerian-Path-Decomposition 5331


first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5335
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperEulerian-Path-Decomposition is a 5336
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5337
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5338
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5339

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5340
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is 5341
a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version 5342
of a SuperHyperEulerian-Path-Decomposition . Since there’s more ways to get type-results to 5343
make a SuperHyperEulerian-Path-Decomposition more understandable. For the sake of having 5344
Neutrosophic SuperHyperEulerian-Path-Decomposition, there’s a need to “redefine” the notion of a 5345

“SuperHyperEulerian-Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are 5346
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 5347
of the position of labels to assign to the values. Assume a SuperHyperEulerian-Path-Decomposition 5348
. It’s redefined a Neutrosophic SuperHyperEulerian-Path-Decomposition if the mentioned Table 5349
holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and Super- 5350
HyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The 5351
Values of The Vertices & The Number of Position in Alphabet”, “The Values of The Super- 5352
Vertices&The maximum Values of Its Vertices”, “The Values of The Edges&The maximum 5353
Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of Its Ver- 5354
tices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. To 5355
get structural examples and instances, I’m going to introduce the next SuperHyperClass 5356
of SuperHyperGraph based on a SuperHyperEulerian-Path-Decomposition . It’s the main. It’ll be 5357

disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If 5358
there’s a need to have all SuperHyperEulerian-Path-Decomposition until the SuperHyperEulerian-Path- 5359
Decomposition, then it’s officially called a “SuperHyperEulerian-Path-Decomposition” but otherwise, it 5360
isn’t a SuperHyperEulerian-Path-Decomposition . There are some instances about the clarifications 5361
for the main definition titled a “SuperHyperEulerian-Path-Decomposition ”. These two examples 5362
get more scrutiny and discernment since there are characterized in the disciplinary ways of 5363
the SuperHyperClass based on a SuperHyperEulerian-Path-Decomposition . For the sake of having 5364
a Neutrosophic SuperHyperEulerian-Path-Decomposition, there’s a need to “redefine” the notion of 5365
a “Neutrosophic SuperHyperEulerian-Path-Decomposition” and a “Neutrosophic SuperHyperEulerian- 5366
Path-Decomposition ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5367
labels from the letters of the alphabets. In this procedure, there’s the usage of the position 5368
of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined 5369
“Neutrosophic SuperHyperGraph” if the intended Table holds. And a SuperHyperEulerian-Path- 5370
Decomposition are redefined to a “Neutrosophic SuperHyperEulerian-Path-Decomposition” if the intended 5371
Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s 5372
more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperEulerian-Path- 5373
Decomposition more understandable. Assume a Neutrosophic SuperHyperGraph. There are 5374

some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 5375
SuperHyperEulerian-Path-Decomposition, SuperHyperStar, SuperHyperBipartite, SuperHyperMul- 5376
tiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic 5377
SuperHyperEulerian-Path-Decomposition”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 5378

perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 5379

if the intended Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperEulerian- 5380
Path-Decomposition” where it’s the strongest [the maximum Neutrosophic value from all the 5381
SuperHyperEulerian-Path-Decomposition amid the maximum value amid all SuperHyperVertices 5382
from a SuperHyperEulerian-Path-Decomposition .] SuperHyperEulerian-Path-Decomposition . A graph is a 5383
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5385
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5386
SuperHyperEdges with two exceptions; it’s SuperHyperEulerian-Path-Decomposition if it’s only one 5387
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one 5388
SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one 5389
SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming 5390
two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5391
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5392

identified since there are some determinacy, indeterminacy and neutrality about the moves 5407

names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5411
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 5412
Neutrosophic SuperHyperPath(-/SuperHyperEulerian-Path-Decomposition, SuperHyperStar, Super- 5413
HyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 5414

longest SuperHyperEulerian-Path-Decomposition or the strongest SuperHyperEulerian-Path-Decomposition 5415
in those Neutrosophic SuperHyperModels. For the longest SuperHyperEulerian-Path-Decomposition, 5416
called SuperHyperEulerian-Path-Decomposition, and the strongest SuperHyperEulerian-Path-Decomposition, 5417
called Neutrosophic SuperHyperEulerian-Path-Decomposition, some general results are introduced. 5418
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 5419
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 5420
of a SuperHyperEulerian-Path-Decomposition. There isn’t any formation of any SuperHyperEulerian- 5421
Path-Decomposition but literarily, it’s the deformation of any SuperHyperEulerian-Path-Decomposition. It, 5422
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperEulerian- 5423
Path-Decomposition theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5424

proposed. 5425
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEulerian-Path-Decomposition, Cancer’s 5426


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

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

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5489
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5490
motivates us to get some instances and examples to make clarifications about the framework of 5491
this research. The general results and some results about some connections are some avenues to 5492
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5493
The framework of this research is as follows. In the beginning, I introduce basic definitions to 5494
clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about SuperHy- 5495
perGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth-discussed. 5496
The elementary concepts are clarified and illustrated completely and sometimes review literature 5497
are applied to make sense about what’s going to figure out about the upcoming sections. The main 5498
definitions and their clarifications alongside some results about new notions, SuperHyperEulerian- 5499
Path-Decomposition and Neutrosophic SuperHyperEulerian-Path-Decomposition, are figured out in sections 5500

“ SuperHyperEulerian-Path-Decomposition” and “Neutrosophic SuperHyperEulerian-Path-Decomposition”. In 5501
the sense of tackling on getting results and in Eulerian-Path-Decomposition to make sense about con- 5502
tinuing the research, the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are 5503
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 5504
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5505
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5506

the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5507
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results 5508
on Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRela- 5509
tions and as concluding and closing section of theoretical research are contained in the section 5510
“General Results”. Some general SuperHyperRelations are fundamental and they are well-known 5511
as fundamental SuperHyperNotions as elicited and discussed in the sections, “General Res- 5512
ults”, “ SuperHyperEulerian-Path-Decomposition”, “Neutrosophic SuperHyperEulerian-Path-Decomposition”, 5513

“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are 5514
curious questions about what’s done about the SuperHyperNotions to make sense about excel- 5515
lency of this research and going to figure out the word “best” as the description and adjective 5516
for this research as presented in section, “ SuperHyperEulerian-Path-Decomposition”. The keyword of 5517
this research debut in the section “Applications in Cancer’s Recognition” with two cases and 5518
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 5519
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 5520
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 5521
happened in this research in the terms of “questions” and “problems” to make sense to figure 5522
out this research in featured style. The advantages and the limitations of this research alongside 5523
about what’s done in this research to make sense and to get sense about what’s figured out are 5524
included in the section, “Conclusion and Closing Remarks”. 5525

CHAPTER 29 5526
Neutrosophic Preliminaries Of This 5527
Scientific Research On the Redeemed 5528
Ways 5529
In this section, the basic material in this scientific research, is referred to [Single Valued 5530
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 5531

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 5532
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), 5533
[t-norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHy- 5534
perGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 5535
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 5536
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 5537
their clarifications are addressed to Ref.[HG38]. 5538
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5539
the new ideas and their clarifications are elicited. 5540
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

Let X be a Eulerian-Path-Decomposition of points (objects) with generic elements in X denoted by x;
then the Neutrosophic set A (NS A) is an object having the form
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}
+
where the functions T, I, F : X →]− 0, 1 [ define respectively the a truth-membership
function, an indeterminacy-membership function, and a falsity-membership function
of the element x ∈ X to the set A with the condition
−
0 ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .
+
The functions TA (x), IA (x) and FA (x) are real standard or nonstandard subsets of ]− 0, 1 [. 5541
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG38],Definition 2.2,p.2).

Let X be a Eulerian-Path-Decomposition of points (objects) with generic elements in X denoted by x. A
single valued Neutrosophic set A (SVNS A) is characterized by truth-membership function
TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function FA (x).
For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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). 5542
where 5544
1, 2, . . . , n0 ); 5549
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5550
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5551

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5580
x, y, z, w ∈ [0, 1]: 5581
(i) 1 ⊗ x = x; 5582
(ii) x ⊗ y = y ⊗ x; 5583
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5584
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5585

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

where 5588

1, 2, . . . , n0 ); 5593
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5594
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5595
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5596
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5597
0


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

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

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

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. 5654
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5655
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5656
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5657
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5658
perPath . 5659
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 5660
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5661
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5662
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5663
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5664
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5665

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

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


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

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

Decomposition). 5682
(i) Neutrosophic e-SuperHyperEulerian-Path-Decomposition if the following expression is 5686

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

called Neutrosophic re-SuperHyperEulerian-Path-Decomposition criteria holds 5689
∀E 0 ∈ P : P is
and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 5690
(iii) Neutrosophic v-SuperHyperEulerian-Path-Decomposition if the following expression is 5691
∀V 0 ∈ P : P is
(iv) Neutrosophic rv-SuperHyperEulerian-Path-Decomposition if the following expression is 5693
∀V 0 ∈ P : P is

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

Definition 29.0.19. ((Neutrosophic) SuperHyperEulerian-Path-Decomposition). 5700

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


(ii) a Neutrosophic SuperHyperEulerian-Path-Decomposition if it’s either of Neutro- 5711


(iii) an Extreme SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial if 5719

it’s either of Neutrosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re- 5720
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 5725

(iv) a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 5729

and Neutrosophic rv-SuperHyperEulerian-Path-Decomposition and C(N SHG) for a Neutro- 5732

Neutrosophic coefficient; 5739

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

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

(vi) a Neutrosophic V-SuperHyperEulerian-Path-Decomposition if it’s either of Neut- 5748

rosophic e-SuperHyperEulerian-Path-Decomposition, Neutrosophic re-SuperHyperEulerian-Path- 5749

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 5752
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 5753
(vii) an Extreme V-SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 5756


(viii) a Neutrosophic SuperHyperEulerian-Path-Decomposition SuperHyperPolynomial 5766


Neutrosophic coefficient. 5776
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperEulerian-Path-Decomposition). 5777

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


136TBL3
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 5781
|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 5782
(29.1), holds if S is an δ−SuperHyperDefensive; 5783
(ii) a Neutrosophic δ−SuperHyperEulerian-Path-Decomposition is a Neutrosophic kind 5784

of Neutrosophic SuperHyperEulerian-Path-Decomposition such that either of the following 5785
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 5786
of s ∈ S : 5787
|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 5788
the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 5789

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

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 5799
Thus Neutrosophic SuperHyperPath , SuperHyperEulerian-Path-Decomposition, SuperHyperStar, 5800
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 5801
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 5802
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 5803
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 5804
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperEulerian- 5805
. Since there’s more ways to get type-results to make a Neutrosophic

Path-Decomposition 5806

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

136TBL4

136TBL1
SuperHyperEulerian-Path-Decomposition more Neutrosophicly understandable. 5807

“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperEulerian-Path-Decomposition”. The 5809
5812
136DEF1 Definition 29.0.23. Assume a SuperHyperEulerian-Path-Decomposition. It’s redefined a Neutro- 5813
sophic SuperHyperEulerian-Path-Decomposition if the Table (29.3) holds. 5814

CHAPTER 30 5815
Neutrosophic SuperHyper But Eulerian-Path-Decomposition 5816
As The Extensions Excerpt From Dense 5817
And Super Forms 5818
Definition 30.0.1. (Neutrosophic event). 5819
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5820

S = (V, E) is a probability Eulerian-Path-Decomposition. Any Neutrosophic k-subset of A of V 5821
is called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 5822
Neutrosophic event. The following expression is called Neutrosophic probability of A. 5823
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 5824

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5825
a probability Eulerian-Path-Decomposition. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 5826

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

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 5831
is a probability Eulerian-Path-Decomposition. Any k-function Eulerian-Path-Decomposition like E is called 5832

Neutrosophic k-Variable. If k = 2, then any 2-function Eulerian-Path-Decomposition like E is 5833
called Neutrosophic Variable. 5834
The notion of independent on Neutrosophic Variable is likewise. 5835
Definition 30.0.4. (Neutrosophic Expectation). 5836
275
is a probability Eulerian-Path-Decomposition. A Neutrosophic k-Variable E has a number is called 5838

Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 5839
criteria 5840
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 5841

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 5842
a probability Eulerian-Path-Decomposition. A Neutrosophic number is called Neutrosophic Crossing 5843
if the following expression is called Neutrosophic Crossing criteria 5844
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). 5845
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let m and n propose special Eulerian- 5846
Path-Decomposition. Then with m ≥ 4n, 5847
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-Path-Decomposition p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
2
Now E(X) = pn, E(Y ) = p 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: 5848
pm − 3n n 1 3 2
cr(G) ≥ = 3 = 64 m n .
p3 (4n/m)
5849
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5850
in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane passing 5852
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 5853
Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet 5854

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

in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. Then 5862
k < 5n4/3 . 5863
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 5864
(V, E) is a probability Eulerian-Path-Decomposition. Draw a SuperHyperUnit SuperHyperCircle around 5865

each SuperHyperPoint of P. Let ni be the Neutrosophic number of thesePSuperHyperCircles 5866
i = 0n−1 ni = n and k = 12 i = 0n−1 ini . Now
P
passing through exactly i points of P. Then 5867
form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 5868
SuperHyperEdges are the SuperHyperArcs between conseNeighborive SuperHyperPoints on the 5869
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 5870
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 5871

SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 5872
so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 5873
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 5874
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 5875
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 5876
4/3 4/3
k < 4n + n < 5n . 5877
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5878
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let X be a nonnegative Neutrosophic 5879
Variable and t a positive real number. Then 5880
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. 5881
Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 5882
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let Xn be a nonnegative integer- 5883
valued variable in a probability Eulerian-Path-Decomposition (Vn , En ), n ≥ 1. If E(Xn ) → 0 as n → ∞, 5884

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

Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 5890
S = (V, E) is a probability Eulerian-Path-Decomposition. A special SuperHyperGraph in Gn,p is 5891
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 5892
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 5893
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 5894
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 5895
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 5896
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 5897
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 5898
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 5899
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: 5900
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 5901
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 5902
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 5903
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 5904
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 5905
Definition 30.0.12. (Neutrosophic Variance). 5906
is a probability Eulerian-Path-Decomposition. A Neutrosophic k-Variable E has a number is called 5908
Neutrosophic Variance if the following expression is called Neutrosophic Variance 5909
criteria 5910
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let X be a Neutrosophic Variable 5912
and let t be a positive real number. Then 5913
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Eulerian-Path-Decomposition. Let X be a Neutrosophic Variable and let t 5915
be a positive real number. Then 5916
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
5917
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let Xn be a Neutrosophic Variable 5919
in a probability Eulerian-Path-Decomposition (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 5920
then 5921
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Eulerian-Path-Decomposition. Set X := Xn and t := |Ex(Xn )| in 5923
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 5924
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 5925
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 5927
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 5928
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 5929
S = (V, E) is a probability Eulerian-Path-Decomposition. As in the proof of related Theorem, the 5931
result is straightforward. 5932
Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let G ∈ Gn,1/2 and let f and k ∗ be 5934
as defined in previous Theorem. Then either: 5935
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 5936
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 5937
Definition 30.0.17. (Neutrosophic Threshold). 5940

is a probability Eulerian-Path-Decomposition. Let P be a monotone property of SuperHyperGraphs 5942
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 5943
for P is a function f (n) such that: 5944
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 5945
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 5946

Definition 30.0.18. (Neutrosophic Balanced). 5947

is a probability Eulerian-Path-Decomposition. Let F be a fixed Neutrosophic SuperHyperGraph. Then 5949
there is a threshold function for the property of containing a copy of F as a Neutrosophic 5950
SubSuperHyperGraph is called Neutrosophic Balanced. 5951
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 5952

(V, E). Consider S = (V, E) is a probability Eulerian-Path-Decomposition. Let F be a nonempty 5953
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 5954
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 5955
SubSuperHyperGraph. 5956
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 5959
in the mentioned Neutrosophic Figures in every Neutrosophic items. 5960
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 5961

SuperHyperEulerian-Path-Decomposition, is up. The Neutrosophic Algorithm is Neutrosophicly 5962
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 5963
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 5964

Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 5965
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 5966
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 5967
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 5968
Neutrosophic SuperHyperEulerian-Path-Decomposition. 5969
C(N SHG)Neutrosophic Eulerian-Path-Decomposition

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 5973
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 5974
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 5975
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 5976
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 5977

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

Neutrosophic SuperHyperEulerian-Path-Decomposition in the Neutrosophic Example (42.0.3) 136NSHG1
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperEulerian-Path- 5978

Decomposition. 5979

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


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



= z3.
5984


= {{E4 , E5 , E1 , E2 }}.
= z4.
= {{Vi ∈ VN SHG }}.
5988






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


= {{}}.
= z0.



= {{}}.
= z0.
5996


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




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


= {{}}.


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


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







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


= {{}}.


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


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




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


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


= z5.
= {{Vi ∈ VN SHG }}.
6032


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


= z5.
= {{Vi ∈ VN SHG }}.
6036


= {{E1 , E2 , E3 , E4 , E5 , E6 }}.
= z6.
= {{Vi ∈ VN SHG }}.
6040







= {{E1 , E2 , E3 , E4 , E5 , E6 }}.
= z6.
= {{Vi ∈ VN SHG }}.
6044


= {{}}.



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


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


= z0.
6052


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


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

= {{E2 , E3 , E4 , E5 }}.
= z4.
= {{Vi ∈ VN SHG }}.
6060
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6061
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type- 6062


Neutrosophic SuperHyperEulerian-Path-Decomposition in the Neutrosophic Example (42.0.3) 95NHG2
if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex,

Cycle-Neighbor 6063
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6064
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6065
of them. 6066
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6067
(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6068
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6069
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to 6070
some of them but not all of them. In other words, there’s only an unique Neutrosophic 6071
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 6072
Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to 6073
some of them but not all of them. 6074
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle- 6075
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6076
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6077
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6078
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6079

to Neutrosophic Hamiltonian-Type-Cycle-Neighbor in some cases but the maximum number of the 6080
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic 6081
SuperHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6082
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Hamiltonian-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-Hamiltonian-Type-Cycle-Neighbor with the least Neutrosophic 6084

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

(V, E). Then in the worst case, literally, 6087
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−N eighbor

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−N eighborSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−Hamiltonian−T ype−Cycle−N eighbor = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−N eighborSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Hamiltonian-Type-Cycle-Neighbor. In other words, the least cardinality, the 6088

lower sharp bound for the cardinality, of a Neutrosophic type-result-Hamiltonian-Type-Cycle-Neighbor is 6089
the cardinality of 6090

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

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

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6091
Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor =
E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6092
Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor =
Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Hamiltonian-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 Hamiltonian-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-Hamiltonian-Type-Cycle-Neighbor is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Hamiltonian-Type-Cycle- 6093
Neighbor is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6094

the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Super- 6095
HyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6096
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6097
to Neutrosophic Hamiltonian-Type-Cycle-Neighbor in some cases but the maximum number of the 6098
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic Su- 6099
perHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6100
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6102
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6103
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6104
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6105
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6106
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6107
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6108
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6109
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6110
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6111
tices. Thus it forms a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor where the Neutrosophic 6112
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6113
embedded R-Hamiltonian-Type-Cycle-Neighbor. The SuperHyperNotions of embedded SuperHyperSet 6114
and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets 6115
only don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is 6116
elected such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCar- 6117
dinality and they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of 6118
Neutrosophic SuperHyperVertices are included in the minimum Neutrosophic style of the 6119
embedded Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor. The interior types of the Neutrosophic 6120
SuperHyperVertices are deciders. Since the Neutrosophic number of SuperHyperNeighbors 6121
are only affected by the interior Neutrosophic SuperHyperVertices. The common connections, 6122
more precise and more formal, the perfect unique connections inside the Neutrosophic Supe- 6123
rHyperSet for any distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic 6124
R-Hamiltonian-Type-Cycle-Neighbor. Thus Neutrosophic exterior SuperHyperVertices could be used 6125

only in one Neutrosophic SuperHyperEdge and in Neutrosophic SuperHyperRelation with 6126
the interior Neutrosophic SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the 6127
embedded Neutrosophic Hamiltonian-Type-Cycle-Neighbor, there’s the usage of exterior Neutrosophic 6128
SuperHyperVertices since they’ve more connections inside more than outside. Thus the title 6129
“exterior” is more relevant than the title “interior”. One Neutrosophic SuperHyperVertex has 6130
no connection, inside. Thus, the Neutrosophic SuperHyperSet of the Neutrosophic Super- 6131
HyperVertices with one SuperHyperElement has been ignored in the exploring to lead on 6132
the optimal case implying the Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor. The Neutrosophic 6133
R-Hamiltonian-Type-Cycle-Neighbor with the exclusion of the exclusion of all Neutrosophic SuperHy- 6134
perVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutrosophic 6135
R-Hamiltonian-Type-Cycle-Neighbor with the inclusion of all Neutrosophic SuperHyperVertices in one 6136

Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor. To sum 6137
them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6138
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6139
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6140

quasi-R-Hamiltonian-Type-Cycle-Neighbor minus all Neutrosophic SuperHypeNeighbor to some of them 6141

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6142
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6143
quasi-R-Hamiltonian-Type-Cycle-Neighbor, minus all Neutrosophic SuperHypeNeighbor to some of them 6144
but not all of them. 6145
The main definition of the Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor has two titles. a Neutro- 6146
sophic quasi-R-Hamiltonian-Type-Cycle-Neighbor and its corresponded quasi-maximum Neutrosophic 6147

R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6148
number, there’s a Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor with that quasi-maximum 6149
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6150
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6151
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Hamiltonian- 6152
Type-Cycle-Neighbors for all Neutrosophic numbers less than its Neutrosophic corresponded maximum 6153
number. The essence of the Neutrosophic Hamiltonian-Type-Cycle-Neighbor ends up but this essence 6154
starts up in the terms of the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbor, again and more in 6155
the operations of collecting all the Neutrosophic quasi-R-Hamiltonian-Type-Cycle-Neighbors acted on the 6156
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6157
number. This Neutrosophic number is 6158
considered as the equivalence class for all corresponded quasi-R-Hamiltonian-Type-Cycle-Neighbors. Let 6159
zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Hamiltonian-Type-Cycle-Neighbor be a 6160
Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Hamiltonian-Type-Cycle- 6161
Neighbor. Then 6162
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

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

re-formalized and redefined as follows. 6164
GNeutrosophic Hamiltonian-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 6165
definition for the Neutrosophic Hamiltonian-Type-Cycle-Neighbor. 6166
GNeutrosophic Hamiltonian-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 6167
poses the upcoming expressions.
Hamiltonian-Type-Cycle-Neighbor 6168
{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6169
= max zNeutrosophic Number

And then, 6170

To get more visions in the closer look-up, there’s an overall overlook. 6171
GNeutrosophic Hamiltonian-Type-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =



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

6173
[zNeutrosophic
Number ]Neutrosophic Class

6174

Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic Supe- 6175
rHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHyperVer- 6176
tices such that any amount of its Neutrosophic SuperHyperVertices are incident to a Neutrosophic 6177
SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Hamiltonian-Type-Cycle- 6178

Neighbor” but, precisely, it’s the generalization of “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Neighbor” 6179
since “Neutrosophic Quasi-Hamiltonian-Type-Cycle-Neighbor” happens “Neutrosophic Hamiltonian-Type- 6180
Cycle-Neighbor” in a Neutrosophic SuperHyperGraph as initial framework and background but 6181
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Hamiltonian-Type-Cycle- 6182
Neighbor” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6183
since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6184
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6185
Quasi-Hamiltonian-Type-Cycle-Neighbor”, and “Neutrosophic Hamiltonian-Type-Cycle-Neighbor” are up. 6186
Thus, let 6187
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6188
GNeutrosophic Hamiltonian-Type-Cycle-Neighbor be a Neutrosophic number, a Neutrosophic SuperHyper- 6189
Neighborhood and a Neutrosophic Hamiltonian-Type-Cycle-Neighbor and the new terms are up. 6190
GNeutrosophic Hamiltonian-Type-Cycle-Neighbor ∈ ∪zNeutrosophic Number

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

|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality

6191
{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6192
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6193
And with go back to initial structure, 6194
GNeutrosophic Hamiltonian-Type-Cycle-Neighbor ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


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


6196

6197

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

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

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

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by

Neutrosophic Hamiltonian-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 Hamiltonian-Type-Cycle-Neighbor is up. The
obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-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-Hamiltonian-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-Hamiltonian-

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

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

, not:
Type-Cycle-Neighbor

Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6198
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6199
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6200
type-SuperHyperSet called the 6201
“Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor” 6202
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6203
Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor, 6204
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Hamiltonian-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-Hamiltonian-Type-Cycle-Neighbor. In other words, the least cardinality, the lower

sharp bound for the cardinality, of a Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor is the cardinality
of
6205
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6206
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Hamiltonian-Type- 6207
Cycle-Neighbor if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6208
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6209

bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6210
amount of them. 6211
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6212
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6213
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6214
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6215

exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6216

Consider there’s a Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor with the least cardinality, the 6217
lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6218
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6219
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6220
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6221
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor. Since it 6222

doesn’t have 6223
6224
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6225
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6226
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6227
rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6228

SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Hamiltonian- 6229
Type-Cycle-Neighbor. Since it doesn’t do the Neutrosophic procedure such that such that there’s a 6230
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6231
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6232
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6233
titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6234

Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6235
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyper- 6236
Set, VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6237
Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor, VESHE is up. The obvious simple Neutrosophic type- 6238
SuperHyperSet of the Neutrosophic R-Hamiltonian-Type-Cycle-Neighbor, VESHE , is a Neutrosophic Su- 6239
perHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind 6240
of Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6241
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6242
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6243
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s 6244
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. 6245
Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic 6246
R-Hamiltonian-Type-Cycle-Neighbor only contains all interior Neutrosophic SuperHyperVertices and 6247
all exterior Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge 6248
where there’s any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all 6249
Neutrosophic SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHy- 6250
peNeighbors to some of them not all of them but everything is possible about Neutrosophic 6251
SuperHyperNeighborhoods and Neutrosophic SuperHyperNeighbors out. 6252
The SuperHyperNotion, namely, Hamiltonian-Type-Cycle-Neighbor, is up. There’s neither empty Super- 6253
HyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutro- 6254
sophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6255
the Neutrosophic Hamiltonian-Type-Cycle-Neighbor. The Neutrosophic SuperHyperSet of Neutrosophic 6256
SuperHyperEdges[SuperHyperVertices], 6257

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

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−N eighbor = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−Hamiltonian−T ype−Cycle−N eighborSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Hamiltonian-Type-Cycle-Neighbor. 6258
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6259

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Hamiltonian-Type-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHy- 6260
perGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6261
6262
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6264
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6265
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6266
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6267
non-obvious Neutrosophic Hamiltonian-Type-Cycle-Neighbor is up. The obvious simple Neutrosophic 6268

type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle-Neighbor is a Neutrosophic Su- 6269
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6270
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6271

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- 6272
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6273
Hamiltonian-Type-Cycle-Neighbor is up. To sum them up, the Neutrosophic SuperHyperSet of the 6274
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6275

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 Hamiltonian- 6276

. 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 Hamiltonian-Type-Cycle-Neighbor C(ESHG) for an Neutrosophic SuperHyperGraph 6279

ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6280
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6281
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Hamiltonian-Type-Cycle- 6282
Neighbor and it’s an Neutrosophic Hamiltonian-Type-Cycle-Neighbor. Since it’s 6283
6284
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6286
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6287
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6288
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6289

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

Thus the non-obvious Neutrosophic Hamiltonian-Type-Cycle-Neighbor , 6290

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 Hamiltonian-Type- 6291
Cycle-Neighbor, not: 6292

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

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- 6294
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6295
Neutrosophic type-SuperHyperSet called the 6296
“Neutrosophic Hamiltonian-Type-Cycle-Neighbor ” 6297
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6298
Neutrosophic Hamiltonian-Type-Cycle-Neighbor , 6299

is only and only 6300

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

CHAPTER 31 6302
The Neutrosophic Departures on The 6303
Theoretical Results Toward Theoretical 6304
Motivations 6305
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6306
Neutrosophic SuperHyperClasses. 6307
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6308

= {{Ei ∈ EN SHG }}.
= z |Ei ∈EN SHG | .
= {{Vi ∈ VN SHG }}.
Proof. Let 6309
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6310
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). 6311

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

= {{}}.
= z0.

= {{}}.
= z0.
Proof. Let 6320
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6321
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). 6322

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6327
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6328
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperEulerian-Path-Decomposition. 6329
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6330

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

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

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


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

Neutrosophic SuperHyperEulerian-Path-Decomposition in the Neutrosophic Example (42.0.9) 136NSHG20a
136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6338
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6339
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6340
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6341
the Neutrosophic SuperHyperEulerian-Path-Decomposition. 6342
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6343
Then 6344

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 6345
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6346
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). 6347

could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could have 6353
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Neutrosophic SuperHyper- 6355
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic- 6356
of-SuperHyperPart SuperHyperEdges are attained in any solution 6357
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6359
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6360
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6361
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6362
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6363

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Path-Decomposition in the Example (42.0.11) 136NSHG21a
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6365
Then 6366

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 6367
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG

6368
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Neutrosophic SuperHy- 6369

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

could be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 6375
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6377
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6378
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6382
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6383
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6384
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6385
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperEulerian-Path- 6386
Decomposition. 6387
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 6388
Then, 6389

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

= {{}}.
= z0.
= {{}}.
= z0.
Proof. Let 6390
P :
CEN T ER, E2∗
6391
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
is a longest SuperHyperEulerian-Path-Decomposition taken from a connected Neutrosophic SuperHy- 6392
perWheel ESHW : (V, E). There’s a new way to redefine as 6393


Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperEulerian-Path-Decomposition in the Neutrosophic Example
(42.0.15) 136NSHG23a

straightforward. Then there’s at least one SuperHyperEulerian-Path-Decomposition. Thus the notion 6396
of quasi isn’t up and the SuperHyperNotions based on SuperHyperEulerian-Path-Decomposition 6397
could be applied. The unique embedded SuperHyperEulerian-Path-Decomposition proposes some 6398
longest SuperHyperEulerian-Path-Decomposition excerpt from some representatives. The latter is 6399
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6401
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6402
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6403

tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6404
SuperHyperModel (31.6), is the Neutrosophic SuperHyperEulerian-Path-Decomposition. 6405

CHAPTER 32 6406
The Surveys of Mathematical Sets On 6407
The Results But As The Initial Motivation 6408
For the SuperHyperHamiltonian-Type-Cycle-Neighbor, Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6409

Neighbor, and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor, some general results are 6410
introduced. 6411
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor is 6412

“redefined” on the positions of the alphabets. 6413
Corollary 32.0.2. Assume Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor. Then 6414
N eutrosophic SuperHyperHamiltonian − T ype − Cycle − N eighbor =

{theSuperHyperHamiltonian − T ype − Cycle − N eighborof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperHamiltonian − T ype − Cycle − N eighbor
|N eutrosophiccardinalityamidthoseSuperHyperHamiltonian−T ype−Cycle−N eighbor. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6415
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6416
the neutrality, for i = 1, 2, 3, respectively. 6417
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6418
of the alphabet. Then the notion of Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor and 6419
SuperHyperHamiltonian-Type-Cycle-Neighbor coincide. 6420
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6421
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a Neutrosophic 6422
SuperHyperHamiltonian-Type-Cycle-Neighbor if and only if it’s a SuperHyperHamiltonian-Type-Cycle-Neighbor. 6423
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6424
the alphabet. Then a conseNeighborive sequence of the SuperHyperVertices is a strongest 6425
SuperHyperHamiltonian-Type-Cycle-Neighbor if and only if it’s a longest SuperHyperHamiltonian-Type-Cycle- 6426
Neighbor. 6427
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6428

identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor is its 6429
329
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperHamiltonian-Type-Cycle- 6431

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the
Neighbor 6432
same identical letter of the alphabet. Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor 6433
is its SuperHyperHamiltonian-Type-Cycle-Neighbor and reversely. 6434
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6435

SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined if and only if its SuperHyperHamiltonian-Type- 6436
Cycle-Neighbor isn’t well-defined. 6437
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6438

its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined if and only if its 6439

Neighbor 6442
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor isn’t well-defined if and only if its 6443
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic 6445

SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined if and only if its SuperHyperHamiltonian-Type- 6446
Cycle-Neighbor is well-defined. 6447
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6448
its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined if and only if its 6449

SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined. 6450

Neighbor 6452
Then its Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined if and only if its 6453
SuperHyperHamiltonian-Type-Cycle-Neighbor is well-defined. 6454
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6455
(i) : the dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6456
(ii) : the strong dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6457
(iii) : the connected dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6458
(iv) : the δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6459
(v) : the strong δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6460
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 6461
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6462
(iii) : the connected defensive SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6465

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6469

independent SuperHyperSet is 6470
(iii) : the connected SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6473
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6477

Graph which is a SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath. Then V is a maximal 6478
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6482
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6483
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6484
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6486

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6487
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6491
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6492
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6493
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6495

perGraph which is a SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath. Then the number 6496
of 6497

(i) : the SuperHyperHamiltonian-Type-Cycle-Neighbor; 6498
(ii) : the SuperHyperHamiltonian-Type-Cycle-Neighbor; 6499
(iii) : the connected SuperHyperHamiltonian-Type-Cycle-Neighbor; 6500
(iv) : the O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 6501
(v) : the strong O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 6502
(vi) : the connected O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor. 6503
coincide. 6505

Graph which is a SuperHyperWheel. Then the number of 6507
(i) : the dual SuperHyperHamiltonian-Type-Cycle-Neighbor; 6508
(ii) : the dual SuperHyperHamiltonian-Type-Cycle-Neighbor; 6509
(iii) : the dual connected SuperHyperHamiltonian-Type-Cycle-Neighbor; 6510
(iv) : the dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 6511
(v) : the strong dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor; 6512
(vi) : the connected dual O(ESHG)-SuperHyperHamiltonian-Type-Cycle-Neighbor. 6513
coincide. 6515
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6516

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6517
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6518
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6519
SuperHyperVertices is a 6520
O(ESHG)
O(ESHG)
O(ESHG)


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6528
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6529
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6530
SuperHyperPart is a 6531
(iv) : δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6535
(v) : strong δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6536
(vi) : connected δ-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 6537
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6539

plete SuperHyperMultipartite. Then Then the number of 6540
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 6547
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 6548
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 6550
connected component is |V − S| if there’s a SuperHyperSet which is a dual 6551
(iv) : SuperHyperHamiltonian-Type-Cycle-Neighbor; 6555

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6558
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6559
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6560
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6561

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 6562
t>
2


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6569
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6570
of dual 6571
(iv) : 0-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6575

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6579
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which 6580

is SuperHyperHamiltonian-Type-Cycle-Neighbor/SuperHyperPath/SuperHyperWheel. The number is 6581
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of 6582
a dual 6583
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6587
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor; 6588

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor. 6589

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


Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6600
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6601
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6602
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6603
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6604

a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor, then ∀v ∈ V \ S, ∃x ∈ S such 6605
that 6606
(i) v ∈ Ns (x); 6607
(ii) vx ∈ E. 6608
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6609

a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle-Neighbor, then 6610
(i) S is SuperHyperHamiltonian-Type-Cycle-Neighbor set; 6611
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6612
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6613
(i) Γ ≤ O; 6614
(ii) Γs ≤ On . 6615
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6616
connected. Then 6617
(i) Γ ≤ O − 1; 6618
(ii) Γs ≤ On − Σ3i=1 σi (x). 6619
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6620


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6624
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6625
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6627
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperHamiltonian-Type-Cycle- 6628
Neighbor; 6629
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6630
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6631
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6632
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperHamiltonian-Type-Cycle-Neighbor. Then 6634
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6635

(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6637
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6638
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6639
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperHamiltonian-Type-Cycle-Neighbor. Then 6641

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6645
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6646
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6648
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperHamiltonian-Type-Cycle-Neighbor; 6649
(ii) Γ = 1; 6650
(iii) Γs = Σ3i=1 σi (c); 6651

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperHamiltonian-Type-Cycle-Neighbor. 6652
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6653
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6654
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6656
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6657
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6658
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6660
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperHamiltonian- 6661
(ii) Γ = b n2 c + 1; 6663

b n c+1 ; 6664
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperHamiltonian- 6665
Type-Cycle-Neighbor. 6666
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6667
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6668
Cycle-Neighbor; 6669
(ii) Γ = b n2 c; 6670

bnc ; 6671
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive 6672
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 6674

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6675
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperHamiltonian- 6676

Type-Cycle-Neighbor for N SHF; 6677
(ii) Γ = m for N SHF : (V, E); 6678
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 6679
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperHamiltonian- 6680
Type-Cycle-Neighbor for N SHF : (V, E). 6681

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

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6683
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive 6684
SuperHyperHamiltonian-Type-Cycle-Neighbor for N SHF; 6685
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 6686
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 6687
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperHamiltonian-Type-Cycle- 6688
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 6690
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6691
bnc
(i) the SuperHyperSet S = {vi }i=1 2
is a dual SuperHyperDefensive SuperHyperHamiltonian-Type- 6692
Cycle-Neighbor for N SHF : (V, E); 6693
(ii) Γ = b n2 c for N SHF : (V, E); 6694
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 6695
S={vi }i=1
bnc
2
are only dual maximal SuperHyperHamiltonian-Type-Cycle- 6696
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 6700

SuperHyperHamiltonian-Type-Cycle-Neighbor, then S is an s-SuperHyperDefensive SuperHyperHamiltonian-
6701

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

SuperHyperHamiltonian-Type-Cycle-Neighbor, then S is an s-SuperHyperPowerful SuperHyperHamiltonian-
6709

SuperHyperHamiltonian-Type-Cycle-Neighbor, then S is a dual s-SuperHyperPowerful 6712
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 6714

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

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

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

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


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

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


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

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

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

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

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


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

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

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


CHAPTER 33 6774
Neutrosophic Applications in Cancer’s 6775
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 6777
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 6778
disease is considered and as the consequences of the model, some parameters are used. The cells 6779
are under attack of this disease but the moves of the cancer in the special region are the matter 6780
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 6781
treatments for this Neutrosophic disease. 6782
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 6783
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 6784
term Neutrosophic function. 6785
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 6786
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 6787
move from the cancer is identified by this research. Sometimes the move of the cancer 6788
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 6789
about the moves and the effects of the cancer on that region; this event leads us to 6790
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6791
perception on what’s happened and what’s done. 6792
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 6793
known and they’ve got the names, and some general Neutrosophic models. The 6794
moves and the Neutrosophic traces of the cancer on the complex tracks and between 6795
complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath(- 6796
/SuperHyperHamiltonian-Type-Cycle-Neighbor, SuperHyperStar, SuperHyperBipartite, Super- 6797
HyperMultipartite, SuperHyperWheel). The aim is to find either the Neutrosophic 6798

SuperHyperHamiltonian-Type-Cycle-Neighbor or the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6799
Neighbor in those Neutrosophic Neutrosophic SuperHyperModels. 6800
341
CHAPTER 34 6801
Case 1: The Initial Neutrosophic Steps 6802
Toward Neutrosophic 6803
SuperHyperBipartite as Neutrosophic 6804
SuperHyperModel 6805
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 6806
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 6807
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

343
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 6808
perBipartite is obtained. 6809
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6810
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 6811
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 6812
(34.1), is the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor. 6813

CHAPTER 35 6814
Case 2: The Increasing Neutrosophic 6815
Steps Toward Neutrosophic 6816
SuperHyperMultipartite as 6817
Neutrosophic SuperHyperModel 6818
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 6819
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 6820
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 6821
perMultipartite is obtained. 6822
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 6823
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

345
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 6824

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 6825
Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor. 6826

CHAPTER 36 6827
Wondering Open Problems But As The 6828
Directions To Forming The Motivations 6829
In what follows, some “problems” and some “questions” are proposed. 6830
The SuperHyperHamiltonian-Type-Cycle-Neighbor and the Neutrosophic SuperHyperHamiltonian-Type-Cycle- 6831
Neighbor are defined on a real-world application, titled “Cancer’s Recognitions”. 6832
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 6833
recognitions? 6834
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperHamiltonian-Type-Cycle- 6835

and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor?
Neighbor 6836
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 6837
them? 6838
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperHamiltonian- 6839
and the Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor?
Problem 36.0.5. The SuperHyperHamiltonian-Type-Cycle-Neighbor and the Neutrosophic SuperHyperHamiltonian-

6841
do a SuperHyperModel for the Cancer’s recognitions and they’re based on 6842
Type-Cycle-Neighbor
SuperHyperHamiltonian-Type-Cycle-Neighbor, are there else? 6843
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 6844
Numbers types-results? 6845
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 6846
the multiple types of SuperHyperNotions? 6847
347
CHAPTER 37 6848
Conclusion and Closing Remarks 6849
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 6850
research are illustrated. Some benefits and some advantages of this research are highlighted. 6851
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 6852
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperHamiltonian- 6853
Type-Cycle-Neighbor. For that sake in the second definition, the main definition of the Neutro- 6854
sophic SuperHyperGraph is redefined on the position of the alphabets. Based on the new 6855
definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic 6856
SuperHyperHamiltonian-Type-Cycle-Neighbor, finds the convenient background to implement some 6857

results based on that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses 6858
are the cases of this research on the modeling of the regions where are under the attacks of 6859
the cancer to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. 6860
To formalize the instances on the SuperHyperNotion, SuperHyperHamiltonian-Type-Cycle-Neighbor, 6861
the new SuperHyperClasses and SuperHyperClasses, are introduced. Some general results 6862
are gathered in the section on the SuperHyperHamiltonian-Type-Cycle-Neighbor and the Neutrosophic 6863
SuperHyperHamiltonian-Type-Cycle-Neighbor. The clarifications, instances and literature reviews have 6864
taken the whole way through. In this research, the literature reviews have fulfilled the lines 6865
containing the notions and the results. The SuperHyperGraph and Neutrosophic SuperHy- 6866
perGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are the 6867
background of this research. Sometimes the cancer has been happened on the region, full of 6868
cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 6869
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 6870
and strongest styles with the formation of the design and the architecture are formally called 6871
“ SuperHyperHamiltonian-Type-Cycle-Neighbor” in the themes of jargons and buzzwords. The prefix 6872
“SuperHyper” refers to the theme of the embedded styles to figure out the background for the 6873
SuperHyperNotions. In the Table (37.1), benefits and avenues for this research are, figured out, 6874
pointed out and spoken out. 6875
349
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperHamiltonian-Type-Cycle-Neighbor
3. Neutrosophic SuperHyperHamiltonian-Type-Cycle-Neighbor 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 6876
Neutrosophic SuperHyperDuality But As 6877
Super Forms 6879
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 6880

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6884

Va ∈ Ei , Ej ; 6885
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 6886

Va ∈ Ei , Ej and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 6887
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6888

Vi , Vj ∈ Ea ; 6889
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 6890

Vi , Vj ∈ Ea and |Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 6891
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6892

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 6893
sophic rv-SuperHyperDuality. 6894
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 6895

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6898

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6900
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6901
Extreme cardinality of the Extreme SuperHyperEdges in the conseNeighborive Extreme 6902
form the Extreme SuperHyperDuality; 6904
351
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6905

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 6907
such that they form the Neutrosophic SuperHyperDuality; 6911
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6912
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 6913

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 6914
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 6915
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 6916
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6917
tices such that they form the Extreme SuperHyperDuality; and the Extreme power is 6919
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6921

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6923
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 6924
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6929
coefficient; 6930
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 6931

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 6933
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high 6934
Extreme cardinality of the Extreme SuperHyperVertices in the conseNeighborive Extreme 6935
form the Extreme SuperHyperDuality; 6937
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 6938

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,6939
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 6940
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 6941
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6942
such that they form the Neutrosophic SuperHyperDuality; 6944
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 6945

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 6946
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 6947

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

contains the Extreme coefficients defined as the Extreme number of the maximum 6949
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 6952
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 6954

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 6956

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 6959
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 6962
coefficient. 6963
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 6964
the mentioned Neutrosophic Figures in every Neutrosophic items. 6965

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 6967
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 6968
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 6969
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 6970
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 6971
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6972
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6973
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 6977
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 6978
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 6979
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 6980
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 6981

every given Neutrosophic SuperHyperDuality. 6982




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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7042
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 7044


the Neutrosophic SuperHyperDuality. 7053
Then 7055
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 7056
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7062
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7065

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7066
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7075

(V, E). Then 7076

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 7077
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7078


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7082
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7083
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. 7095
Then, 7097
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 7098
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 7099


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7104
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7105
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7111

CHAPTER 39 7112
Neutrosophic SuperHyperJoin But As 7113
Super Forms 7115
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7116

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7120
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7122

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 7123
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7125

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7127

(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7130

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7131
rv-SuperHyperJoin. 7132
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7133

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

365

Extreme SuperHyperJoin; 7142
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7143

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7145
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7146
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7147
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7148

form the Neutrosophic SuperHyperJoin; 7149
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7150

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7151
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7152
the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7157
coefficient; 7158
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7159

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7160
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7161
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7163
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7164
S of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7165

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

Extreme SuperHyperJoin; 7174
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7175

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7177
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7178
form the Neutrosophic SuperHyperJoin; 7181

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7182

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7184

such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded 7189
to its Extreme coefficient; 7190
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7191

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7193

SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7199
coefficient. 7200
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7204

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7205

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7270

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7279
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 7281


the Neutrosophic SuperHyperJoin. 7290
Then 7292
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 7293
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 7299
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7301

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


(V, E). Then 7312

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7314


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

Then, 7332

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

.
Proof. Let 7333
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7334


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7338
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7339
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7340
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7345

CHAPTER 40 7346
Neutrosophic SuperHyperPerfect But As 7347
Super Forms 7349
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7350

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

Va ∈ Ei , Ej ; 7355
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such 7356

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

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

(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7362

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7363
rv-SuperHyperPerfect. 7364
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7365

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7370
379
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7375

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7377
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7378
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality conseNeighborive 7379
form the Neutrosophic SuperHyperPerfect; 7381
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7382

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7383
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7384
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7387
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7391

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7393
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7399
coefficient; 7400
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7401

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7409
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7410
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7411
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7412
such that they form the Neutrosophic SuperHyperPerfect; 7414
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7415

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7417

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7420
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7424

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7426

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7432
coefficient. 7433

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7437

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7503
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 7505
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7523
Then 7525
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 7526
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 7530
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7531
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7532
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7535

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

(V, E). Then 7546

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7569


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7572
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7573
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7574
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7575
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7581

CHAPTER 41 7582
Neutrosophic SuperHyperTotal But As 7583
Super Forms 7585
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7586

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

Va ∈ Ei , Ej ; 7591
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7592

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7593
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7594

Vi , Vj ∈ Ea ; 7595
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7596

(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7598

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7599
rv-SuperHyperTotal. 7600
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7601

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7606
Extreme SuperHyperTotal; 7610
393
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7611

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7613
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of 7614
form the Neutrosophic SuperHyperTotal; 7617
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7618
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7619

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7620
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7625
coefficient; 7626
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7627
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7628

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7629
SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7635
cient; 7636
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7637

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7639
Extreme SuperHyperTotal; 7643
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7644

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7646
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 7647
form the Neutrosophic SuperHyperTotal; 7650
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7651

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7652
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7653


tices such that they form the Extreme SuperHyperTotal; and the Extreme power is 7658
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7660

Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7661
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7662

SuperHyperTotal; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 7668
cient. 7669

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7673
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. 7688




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

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


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

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

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





3 × 4 × 4z 3 .


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.


3 × 4 × 4z 3 .

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



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









4 × 3z 3 .

4 × 3z 4 .



2 × 4 × 3z 4 .

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


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

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {V1 , V2 }.


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

C(N SHG)Neutrosophic SuperHyperTotal =

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

SuperHyperModel (31.1), is the SuperHyperTotal. 7739
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 7741
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. 7748
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 7750



the Neutrosophic SuperHyperTotal. 7759
Then 7761
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 7762
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2


based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 7768
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 7770
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

(V, E). Then 7781

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


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 7788
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. 7799
Then, 7801
∗
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 7802
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 7803


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 7807
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 7808

proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 7809
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 7815

CHAPTER 42 7816
Neutrosophic SuperHyperConnected But 7817
As The Extensions Excerpt From Dense 7818
And Super Forms 7819
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 7820

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 7824
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 7825
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 7826

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 7827
|Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 7828
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 7829

that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; 7830
(iv) Neutrosophic rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ 7831

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 7832
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; 7833
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7834
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7835
rosophic rv-SuperHyperConnected. 7836
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 7837

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

7840
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 7841
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 7842
407

that they form the Extreme SuperHyperConnected; 7846
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 7847

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 7848
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 7849
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7850
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S 7851
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7852

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7853
nected; 7854
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 7855

rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 7856
v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 7857
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 7858
contains the Extreme coefficients defined as the Extreme number of the maximum Ex- 7859
treme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 7860

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 7862
Extreme power is corresponded to its Extreme coefficient; 7863
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7864

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 7865
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 7866
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7867
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7868
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7869

the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7872
its Neutrosophic coefficient; 7873
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 7874

for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 7877
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 7878

Vertices in the conseNeighborive Extreme sequence of Extreme SuperHyperEdges and 7879
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7880
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 7881

for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 7884
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 7885
of high Neutrosophic cardinality conseNeighborive Neutrosophic SuperHyperEdges and 7886

Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperCon- 7887
nected; 7888
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 7889

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 7892
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of the 7893
maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme Super- 7894
HyperSet S of high Extreme cardinality conseNeighborive Extreme SuperHyperEdges and 7895

Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 7896
and the Extreme power is corresponded to its Extreme coefficient; 7897
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 7898

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 7901
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 7902

number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 7903
the Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to 7906
its Neutrosophic coefficient. 7907
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 7910
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7911
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 7913
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 7914
The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 7915
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 7916
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 7917
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. 7925


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 7969
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. 7976
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 7978
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. 7985
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 7987



the Neutrosophic SuperHyperConnected. 7996
Then 7998
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 7999
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 8004
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8005
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8008

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8019
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 8020
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8021


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8025
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8026
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8027
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. 8038
Then, 8040
∗
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 8041
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8042


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8045
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8046
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8047
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8048
some representatives. The latter is straightforward. 8049
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8054

CHAPTER 43 8055
Background 8056
421











in Scribd. 8216


HG44b]. 8250

Bibliography 8251
10.33140/JMTCM.01.03.09) 8258
427
10.20944/preprints202301.0282.v1). 8286
10.20944/preprints202301.0267.v1). 8289

(doi: 10.20944/preprints202301.0265.v1). 8294
prints202301.0262.v1). 8298
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8304
prints202301.0105.v1). 8307
Preprints 2023, 2023010044 8313
10.20944/preprints202301.0043.v1). 8316

(doi: 10.20944/preprints202212.0549.v1). 8325
(doi: 10.20944/preprints202212.0500.v1). 8332
2023, (doi: 10.5281/zenodo.7809365). 8349
2023, (doi: 10.5281/zenodo.7809358). 8352
10.5281/zenodo.7809219). 8355
10.5281/zenodo.7809328). 8358

2023, (doi: 10.5281/zenodo.7806767). 8361
2023, (doi: 10.5281/zenodo.7806838). 8364
(doi: 10.5281/zenodo.7799902). 8373
2023, (doi: 10.5281/zenodo.7804218). 8376
(doi: 10.5281/zenodo.7796334). 8379
10.5281/zenodo.7791952). 8385
(doi: 10.5281/zenodo.7791982). 8388
10.5281/zenodo.7790026). 8391
2023, (doi: 10.5281/zenodo.7790052). 8394
2023, (doi: 10.5281/zenodo.7787066). 8397

10.5281/zenodo.7781476). 8403
10.5281/zenodo.7783082). 8406
10.5281/zenodo.7777857). 8409
10.5281/zenodo.7779286). 8412
(doi: 10.5281/zenodo.7771831). 8415
2023, (doi: 10.5281/zenodo.7772468). 8418
10.13140/RG.2.2.20913.25446). 8421
10.5281/zenodo.7764916). 8424
10.13140/RG.2.2.11770.98247). 8427
10.13140/RG.2.2.12400.12808). 8430
2023, (doi: 10.13140/RG.2.2.22545.10089). 8433

10.13140/RG.2.2.11377.76644). 8439
10.13140/RG.2.2.23750.96329). 8442
10.13140/RG.2.2.31366.24641). 8445
10.13140/RG.2.2.34721.68960). 8448
10.13140/RG.2.2.24288.35842). 8457
10.13140/RG.2.2.32467.25124). 8460
10.13140/RG.2.2.31025.45925). 8463
10.13140/RG.2.2.17184.25602). 8466
10.13140/RG.2.2.23423.28327). 8469
10.13140/RG.2.2.28456.44805). 8472
10.13140/RG.2.2.23525.68320). 8475

10.13140/RG.2.2.20170.24000). 8478
10.13140/RG.2.2.36475.59683). 8481
10.13140/RG.2.2.29764.71046). 8484
2023, (doi: 10.13140/RG.2.2.18780.87683). 8487
10.13140/RG.2.2.26134.01603). 8493
10.13140/RG.2.2.27392.30721). 8496
10.13140/RG.2.2.33028.40321). 8499
10.13140/RG.2.2.21389.20966). 8502
10.13140/RG.2.2.16356.04489). 8505
10.13140/RG.2.2.21756.21129). 8508
10.13140/RG.2.2.30983.68009). 8511
10.13140/RG.2.2.28552.29445). 8514

10.13140/RG.2.2.35105.89447). 8520
(doi: 10.13140/RG.2.2.30072.72960). 8523
10.13140/RG.2.2.31147.52003). 8526
10.13140/RG.2.2.32825.24163). 8529
10.13140/RG.2.2.13059.58401). 8532
10.13140/RG.2.2.11172.14720). 8535
2023, (doi: 10.13140/RG.2.2.22011.80165). 8538
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8541
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8547
2023, (doi: 10.13140/RG.2.2.19944.14086). 8550
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 8553

(doi: 10.13140/RG.2.2.33103.76968). 8556
2023, (doi: 10.13140/RG.2.2.23037.44003). 8559
(doi: 10.13140/RG.2.2.35646.56641). 8562
(doi: 10.13140/RG.2.2.18030.48967). 8565
(doi: 10.13140/RG.2.2.13973.81121). 8568
2023, (doi: 10.13140/RG.2.2.34106.47047). 8571
2023, (doi: 10.13140/RG.2.2.31956.88961). 8577
2023, (doi: 10.13140/RG.2.2.15179.67361). 8580
10.13140/RG.2.2.21510.45125). 8583
2023, (doi: 10.13140/RG.2.2.13121.84321). 8586
10.13140/RG.2.2.11758.69441). 8589
2023, (doi: 10.13140/RG.2.2.31891.35367). 8592

10.13140/RG.2.2.19360.87048). 8595
2023, (doi: 10.13140/RG.2.2.32363.21286). 8598
(doi: 10.13140/RG.2.2.23266.81602). 8601
10.13140/RG.2.2.19911.37285). 8604
10.13140/RG.2.2.11050.90569). 8607
(doi: 10.13140/RG.2.2.30182.50241). 8619

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

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


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


10.20944/preprints202301.0282.v1). 8685

10.20944/preprints202301.0267.v1).). 8688

2023, 2023010265 (doi: 10.20944/preprints202301.0265.v1). 8693
prints202301.0262.v1). 8697


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

10.13140/RG.2.2.35061.65767). 8706

10.13140/RG.2.2.18494.15680). 8710
10.13140/RG.2.2.32530.73922). 8714
10.13140/RG.2.2.15897.70243). 8718

10.13140/RG.2.2.32530.73922). 8722
prints202301.0105.v1). 8725
10.13140/RG.2.2.23172.19849). 8732

10.13140/RG.2.2.17385.36968). 8742

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

2023, (doi: 10.13140/RG.2.2.28945.92007). 8751
10.13140/RG.2.2.35774.77123). 8757

10.13140/RG.2.2.29430.88642). 8763
(doi: 10.20944/preprints202212.0549.v1). 8769
10.13140/RG.2.2.19380.94084). 8772


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

10.13140/RG.2.2.20993.12640). 8786



10.13140/RG.2.2.29173.86244). 8801
2023 (doi: 10.5281/zenodo.7820680). 8806
10.5281/zenodo.7812750). 8808


2023 (doi: 10.5281/zenodo.7807782). 8814
2023 (doi: 10.5281/zenodo.7804449). 8816

(doi: 10.5281/zenodo.7792307). 8820

(doi: 10.5281/zenodo.7790728). 8822
2023 (doi: 10.5281/zenodo.7787712). 8824
10.5281/zenodo.7783791). 8826
10.5281/zenodo.7780123). 8828
(doi: 10.5281/zenodo.7773119). 8830
odo.7637762). 8832
10.5281/zenodo.7766174). 8834
10.5281/zenodo.7762232). 8836
(doi: 10.5281/zenodo.7758601). 8838
10.5281/zenodo.7754661). 8840
10.5281/zenodo.7750995) . 8842
(doi: 10.5281/zenodo.7749875). 8844
10.5281/zenodo.7747236). 8846
10.5281/zenodo.7742587). 8848
(doi: 10.5281/zenodo.7738635). 8850
10.5281/zenodo.7734719). 8852
10.5281/zenodo.7730484). 8854
(doi: 10.5281/zenodo.7730469). 8856

10.5281/zenodo.7722865). 8858
odo.7713563). 8860
odo.7709116). 8862
10.5281/zenodo.7706415). 8864
(doi: 10.5281/zenodo.7706063). 8866
(doi: 10.5281/zenodo.7701906). 8868
odo.7700205). 8870
10.5281/zenodo.7694876). 8872
10.5281/zenodo.7679410). 8874
10.5281/zenodo.7675982). 8876
10.5281/zenodo.7672388). 8878
odo.7668648). 8880
10.5281/zenodo.7662810). 8882
10.5281/zenodo.7659162). 8884
odo.7653233). 8886
odo.7653204). 8888
odo.7653142). 8890
odo.7653117). 8892

odo.7653089). 8894
odo.7651687). 8896
odo.7651619). 8898
odo.7651439). 8900
odo.7650729). 8902
odo.7647868). 8904
odo.7647017). 8906
odo.7644894). 8908
odo.7641880). 8910
odo.7632923). 8912
odo.7623459). 8914
10.5281/zenodo.7606416). 8916
10.5281/zenodo.7606416). 8918
odo.7606404). 8920
10.5281/zenodo.7580018). 8922
odo.7580018). 8924
odo.7580018). 8926
odo.7579929). 8928

10.5281/zenodo.7563170). 8930
odo.7563164). 8932
odo.7563160). 8934
odo.7563160). 8936
10.5281/zenodo.7563160). 8938
10.5281/zenodo.7557063). 8940
10.5281/zenodo.7557009). 8942
10.5281/zenodo.7539484). 8944
10.5281/zenodo.7523390). 8946
10.5281/zenodo.7523390). 8948
10.5281/zenodo.7523390). 8950
odo.7574952). 8952
10.5281/zenodo.7574992). 8954
odo.7523357). 8956
10.5281/zenodo.7523357). 8958
10.5281/zenodo.7504782). 8960
10.5281/zenodo.7504782). 8962
10.5281/zenodo.7504782). 8964

10.5281/zenodo.7499395). 8966
odo.7499395). 8968
10.5281/zenodo.7499395). 8970
10.5281/zenodo.7497450). 8972
10.5281/zenodo.7497450). 8974
10.5281/zenodo.7494862). 8976
odo.7494862). 8978
10.5281/zenodo.7494862). 8980
10.5281/zenodo.7493845). 8982
10.5281/zenodo.7493845). 8984
10.5281/zenodo.7493845). 8986
odo.7539484). 8988
odo.7523390). 8990
odo.7523357). 8992
odo.7504782). 8994
odo.7499395). 8996
odo.7497450). 8998
odo.7494862). 9000

odo.7493845). 9002
odo.7480110). 9004
odo.7378758). 9006
odo.6320305). 9008
odo.6677173). 9010

CHAPTER 44 9011
Books’ Contributions 9012
“Books’ Contributions”: | Featured Threads 9013

The following references are cited by chapters. 9014
9015
[Ref242] 9016
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Path- 9017
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 9018
(doi: 10.5281/zenodo.7819579). 9019
9020
[Ref243] 9021
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9022
Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 9023
(doi: 10.5281/zenodo.7819531). 9024
9025
The links to the contributions of this scientific research book are listed below. 9026
[HG242] 9027
(doi: 10.5281/zenodo.7819579). 9030
9031
[TITLE] “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-Path- 9032
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph” 9033

9034
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9035
https://www.researchgate.net/publication/369943967 9036
9037
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9038
https://www.scribd.com/document/637637760 9039
9040
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9041
https://zenodo.org/record/7819579 9042
9043
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9044
https://www.academia.edu/100062693 9045
449
Figure 44.1: 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).
9046
[ADDRESSED CITATION] 9047
(doi: 10.5281/zenodo.7819579). 9050
[ASSIGNED NUMBER] #242 Article 9051
[DATE] April 2023 9052

[DOI] 10.5281/zenodo.7819579 9053
[LICENSE] CC BY-NC-ND 4.0 9054
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9055
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9056
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9057
9058
[HG243] 9059
(doi: 10.5281/zenodo.7819531). 9062
9063
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9064

Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation” 9065
9066
https://www.researchgate.net/publication/369943811 9068
9069
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9070


Figure 44.4: Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHy-
perGraph By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”,
https://www.scribd.com/document/637634566 9071
9072
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9073
9075
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9076
https://www.academia.edu/100061928 9077
9078
(doi: 10.5281/zenodo.7819531). 9082
[ASSIGNED NUMBER] #243 Article 9083

[DATE] April 2023 9084
[DOI] 10.5281/zenodo.7819531 9085
[LICENSE] CC BY-NC-ND 4.0 9086
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9087
[AVAILABLE AT TWITTER’S IDS] 9088
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9089
googlebooks GooglePlay 9090
9091
[ASSIGNED NUMBER] | Book #160 9092
Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 9094
2023 (doi: 10.5281/zenodo.7820680). 9095


[TITLE] Eulerian-Path-Cut In SuperHyperGraphs 9096

#Latest_Updates 9097
#The_Links 9098
9102
9104
#The_Links 9105
9106
[ASSIGNED NUMBER] | Book #160 9107

9108
[TITLE] Eulerian-Path-Cut In SuperHyperGraphs 9109
9110
9114
– 9115
9116
[PUBLISHER] 9117
(Paperback): https://www.amazon.com/dp/- 9118
(Hardcover): https://www.amazon.com/dp/- 9119

(Kindle Edition): https://www.amazon.com/dp/- 9120
9121
– 9122
9123
[ISBN] 9124
(Paperback): - 9125
(Hardcover): - 9126
(Kindle Edition): CC BY-NC-ND 4.0 9127
(EBook): CC BY-NC-ND 4.0 9128
9129
– 9130
9131
[PRINT LENGTH] 9132
(Paperback): - pages 9133
(Hardcover): - pages 9134
(Kindle Edition): - pages 9135
(E-Book): - pages 9136
9137
– 9138
9139
9141

#The_Links 9142
9143
https://www.researchgate.net/publication/- 9145
9146
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9147
https://drhenrygarrett.wordpress.com/2023/04/22/ 9148
Eulerian-Path-Cut-In-SuperHyperGraphs/ 9149
9150
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9151
https://www.scribd.com/document/- 9152
9153
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9154
https://www.academia.edu/- 9155
9156
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9157
9159
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9160
https://books.google.com/books/about?id=- 9161
9162
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9163
https://play.google.com/store/books/details?id=- 9164

[TITLE] Eulerian-Path-Cut In SuperHyperGraphs (Published Version) 9165

9166
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9167
9168
https://drhenrygarrett.wordpress.com/2023/04/22/ 9169
Eulerian-Path-Cut-In-SuperHyperGraphs/ 9170
9171
– 9172
9173
[POSTED BY] Dr. Henry Garrett 9174
9175
[DATE] April 012, 2023 9176

9177
[POSTED IN] 160 | Eulerian-Path-Cut In SuperHyperGraphs 9178
9179
[TAGS] 9180
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9181
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9182
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9183
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9184
neutrosophic SuperHyperGraphs, Neutrosophic Eulerian-Path-Cut In SuperHyperGraphs, Open 9185
Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, Real-World 9186
Applications, Recent Research, Recognitions, Research, scientific research Article, scientific re- 9187
search Articles, scientific research Book, scientific research Chapter, scientific research Chapters, 9188
Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, 9189

SuperHyperGraphs, Eulerian-Path-Cut In SuperHyperGraphs, SuperHyperModeling, SuperHy- 9190
perVertices, Theoretical Research, Vertex, Vertices. 9191
In this scientific research book, there are some scientific research chapters on “Extreme 9192
Eulerian-Path-Cut In SuperHyperGraphs” and “Neutrosophic Eulerian-Path-Cut In SuperHy- 9193
perGraphs” about some scientific research on Eulerian-Path-Cut In SuperHyperGraphs by two 9194
(Extreme/Neutrosophic) notions, namely, Extreme Eulerian-Path-Cut In SuperHyperGraphs 9195

and Neutrosophic Eulerian-Path-Cut In SuperHyperGraphs. With scientific research on 9196
the basic scientific research properties, the scientific research book starts to make Extreme 9197
Eulerian-Path-Cut In SuperHyperGraphs theory and Neutrosophic Eulerian-Path-Cut In 9198
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9199

CHAPTER 45 9200
“SuperHyperGraph-Based Books”: | 9201
Featured Tweets 9202
“SuperHyperGraph-Based Books”: | Featured Tweets 9203
457
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 45.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 46 9204
CV 9205
485
9206
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett @gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG: https://www.sciencepublishinggroup.com/journal/index?journalid=303; PDF:
https://drhenrygarrett.files.wordpress.com/2023/02/certificate_for_reviewer-2.pdf
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM

9207
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)
9208
Publications: Articles
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
@ResearchGate: https://www.researchgate.net/publication/369456588
@Scribd: https://www.scribd.com/document/633165164
@ZENODO_ORG: https://zenodo.org/record/7763661
@academia: https://www.academia.edu/98987491
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7764916).
@Scribd: https://www.scribd.com/document/-
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript

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

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript

9210
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor
10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In

10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

9211
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript

9212
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In
10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

9213
By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In

10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

9214
SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript

9215
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity
10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In

10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

9216
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript

9217
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-
2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder

10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

9218
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension

10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
9219
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

9220

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript

9221
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of
Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s

Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript

9222
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph
separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript

9223
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
9224
2023 129 Manuscript
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
9225
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
9226
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s

Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
9227
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 Article105 (JMTCM) Article
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper Classes”,
J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 10.33140/JMTCM.01.03.09).
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
9228
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
9229
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript
Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

9230
2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

9231
2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

9232
2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
9233
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
9234
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
9235
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).
9236

(doi: 10.13140/RG.2.2.34040.16648).

(doi: 10.13140/RG.2.2.19464.96007).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
9237
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
9238
Publications: Books
2023 147 | SuperHyperDuality Amazon
[ADDRESSED CITATION]
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
@academia:https://www.academia.edu/96858234
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
(Kindle Edition): CC BY-NC-ND 4.0
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

9239
[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

9240
[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

9241
[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

9242
[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

9243
[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

9244
[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

9245
[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

9246
[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

9247
[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

9248
[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

9249
[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

9250
[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

9251
[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

9252
[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

9253
[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

9254
[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

9255
[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

9256
[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

9257
[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
9258
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

9259
[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

9260
[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

9261
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
@ZENODOO RG : https : //zenodo.org/record/7563160
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

9262
[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

9263
[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
9264
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

9265
“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

9266
[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
9267
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

9268
[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

9269
[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

9270
[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

9271
[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

9272
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

9273
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
9274
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
9275
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

9276
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

9277
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
-
9278
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

9279
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9280
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
9281
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
9282
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

9283
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
9284
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
...
9285
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/
9286
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
9287
View publication stats

Eulerian-Path-Decomposition in SuperHyperGraphs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Eulerian-Path-Decomposition in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Book · April 2023

442 PUBLICATIONS 11,781 CITATIONS

Neutrosophic Graphs View project

On Algebraic Structures and Algebraic Hyperstructures View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 43

6 New Ideas On Super Decompensation By Hyper Decompress Of

8 Applied Notions Under The Scrutiny Of The Motivation Of This

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 61

10 Extreme SuperHyperEulerian-Path-Decomposition But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 137

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 145

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 245

25 Neutrosophic Eulerian-Path-Decomposition 249

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperEulerian-Path-Decomposition But As The Extensions

31 The Neutrosophic Departures on The Theoretical Results Toward

32 The Surveys of Mathematical Sets On The Results But As The Initial

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 341

34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 349

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 449

45 “SuperHyperGraph-Based Books”: | Featured Tweets 457

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

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

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 459