New Ideas On Super Reflections by Hyper Rotations of Path SuperHyperColoring in Cancer's Neutrosophic Recognition and Neutrosophic SuperHyperGraph

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/368451019
New Ideas On Super Reﬂections By Hyper Rotations Of Path SuperHyperColoring

In Cancer's Neutrosophic Recognition and Neutrosophic SuperHyperGraph
Preprint · February 2023

DOI: 10.13140/RG.2.2.33459.30243
CITATIONS
1 author:
Henry Garrett
293 PUBLICATIONS 3,029 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Algebraic Structures and Algebraic Hyperstructures View project
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
All content following this page was uploaded by Henry Garrett on 11 February 2023.
The user has requested enhancement of the downloaded file.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
New Ideas On Super Reflections By Hyper Rotations Of 2
Path SuperHyperColoring In Cancer’s Neutrosophic 3
Recognition and Neutrosophic SuperHyperGraph 4
Henry Garrett · Independent Researcher · Department of Mathematics · 6
DrHenryGarrett@gmail.com · Manhattan, NY, USA 7
ABSTRACT 8
In this research, (Different Neutrosophic Types of Neutrosophic Path 9
SuperHyperColoring). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an 10
ordered pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } 11
and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-Path 12
SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such that Va ∈ Ei , Ej ; Neutrosophic 13
re-Path SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such that Ei = Ej ; Neutrosophic 14
v-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such that Vi , Vj ∈ Ea ; Neutrosophic 15
rv-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such that Vi = Vj ; Neutrosophic 16
Path SuperHyperColoring if it’s either of Neutrosophic e-Path SuperHyperColoring, 17
Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, 18
and Neutrosophic rv-Path SuperHyperColoring. ((Neutrosophic) Path 19
SuperHyperColoring). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an 20
ordered pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) 21
E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme Path SuperHyperColoring if it’s 22
either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 23
SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, and Neutrosophic 24
rv-Path SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 25
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 26
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 27
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 28
form the Extreme Path SuperHyperColoring; a Neutrosophic Path SuperHyperColoring 29
if it’s either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 30
rv-Path SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 32
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 33
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 34
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 35
that they form the Neutrosophic Path SuperHyperColoring; an Extreme Path 36
SuperHyperColoring SuperHyperPolynomial if it’s either of Neutrosophic e-Path 37
SuperHyperColoring, Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path 38
SuperHyperColoring, and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for 39
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 40
contains the Extreme coefficients defined as the Extreme number of the maximum 41
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S 42
of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 43
SuperHyperVertices such that they form the Extreme Path SuperHyperColoring; and 44
the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic Path 45
SuperHyperColoring SuperHyperPolynomial if it’s either of Neutrosophic e-Path 46
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 49
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 50
Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 51
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 52
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 53
that they form the Neutrosophic Path SuperHyperColoring; and the Neutrosophic 54
power is corresponded to its Neutrosophic coefficient; an Extreme R-Path 55
SuperHyperColoring if it’s either of Neutrosophic e-Path SuperHyperColoring, 56
and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for an Extreme 58
SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 59
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 60
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 61
SuperHyperVertices such that they form the Extreme Path SuperHyperColoring; a 62
Neutrosophic R-Path SuperHyperColoring if it’s either of Neutrosophic e-Path 63
a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic 66
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 67
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 68
Neutrosophic SuperHyperVertices such that they form the Neutrosophic Path 69
SuperHyperColoring; an Extreme R-Path SuperHyperColoring SuperHyperPolynomial 70
if it’s either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 71
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 74
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 75
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 76
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 77
such that they form the Extreme Path SuperHyperColoring; and the Extreme power is 78
corresponded to its Extreme coefficient; a Neutrosophic Path SuperHyperColoring 79
SuperHyperPolynomial if it’s either of Neutrosophic e-Path SuperHyperColoring, 80
and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for a Neutrosophic 82
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 83
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 84
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 85
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 86
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 87
Neutrosophic Path SuperHyperColoring; and the Neutrosophic power is corresponded to 88
its Neutrosophic coefficient. In this research, new setting is introduced for new 89
SuperHyperNotions, namely, a Path SuperHyperColoring and Neutrosophic Path 90
SuperHyperColoring. Two different types of SuperHyperDefinitions are debut for them 91
but the research goes further and the SuperHyperNotion, SuperHyperUniform, and 92
SuperHyperClass based on that are well-defined and well-reviewed. The literature 93
review is implemented in the whole of this research. For shining the elegancy and the 94
significancy of this research, the comparison between this SuperHyperNotion with other 95
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 96
are followed by the examples and the instances thus the clarifications are driven with 97
different tools. The applications are figured out to make sense about the theoretical 98
aspect of this ongoing research. The “Cancer’s Recognition” are the under research to 99
figure out the challenges make sense about ongoing and upcoming research. The special 100
case is up. The cells are viewed in the deemed ways. There are different types of them. 101
Some of them are individuals and some of them are well-modeled by the group of cells. 102
These types are all officially called “SuperHyperVertex” but the relations amid them all 103
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 104
“Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 105
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 106
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are 107
posed to pursue this research. It’s also officially collected in the form of some questions 108
and some problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then 109
δ−Path SuperHyperColoring is a maximal of SuperHyperVertices with a maximum 110
cardinality such that either of the following expressions hold for the (Neutrosophic) 111
cardinalities of SuperHyperNeighbors of s ∈ S : there are 112
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 113
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 114
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−Path SuperHyperColoring is a 115
maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 116
cardinality such that either of the following expressions hold for the Neutrosophic 117
cardinalities of SuperHyperNeighbors of s ∈ S there are: 118
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 119
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, 120
holds if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds 121
if S is a Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” 122
version of a Path SuperHyperColoring . Since there’s more ways to get type-results to 123
make a Path SuperHyperColoring more understandable. For the sake of having 124
Neutrosophic Path SuperHyperColoring, there’s a need to “redefine” the notion of a 125
“Path SuperHyperColoring ”. The SuperHyperVertices and the SuperHyperEdges are 126
assigned by the labels from the letters of the alphabets. In this procedure, there’s the 127
usage of the position of labels to assign to the values. Assume a Path 128
SuperHyperColoring . It’s redefined a Neutrosophic Path SuperHyperColoring if the 129
mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 130
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” 131
with the key points, “The Values of The Vertices & The Number of Position in 132
Alphabet”, “The Values of The SuperVertices&The maximum Values of Its Vertices”, 133
“The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 134
HyperEdges&The maximum Values of Its Vertices”, “The Values of The 135
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 136
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph 137
based on a Path SuperHyperColoring . It’s the main. It’ll be disciplinary to have the 138
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 139
have all Path SuperHyperColoring until the Path SuperHyperColoring, then it’s 140
officially called a “Path SuperHyperColoring” but otherwise, it isn’t a Path 141
SuperHyperColoring . There are some instances about the clarifications for the main 142
definition titled a “Path SuperHyperColoring ”. These two examples get more scrutiny 143
and discernment since there are characterized in the disciplinary ways of the 144
SuperHyperClass based on a Path SuperHyperColoring . For the sake of having a 145
Neutrosophic Path SuperHyperColoring, there’s a need to “redefine” the notion of a 146
“Neutrosophic Path SuperHyperColoring” and a “Neutrosophic Path 147
SuperHyperColoring ”. The SuperHyperVertices and the SuperHyperEdges are assigned 148
by the labels from the letters of the alphabets. In this procedure, there’s the usage of 149
the position of labels to assign to the values. Assume a Neutrosophic SuperHyperGraph. 150
It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. And a 151
Path SuperHyperColoring are redefined to a “Neutrosophic Path SuperHyperColoring” 152
if the intended Table holds. It’s useful to define “Neutrosophic” version of 153
SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a 154
Neutrosophic Path SuperHyperColoring more understandable. Assume a Neutrosophic 155
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended 156
Table holds. Thus SuperHyperPath, Path SuperHyperColoring, SuperHyperStar, 157
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, 158
are “Neutrosophic SuperHyperPath”, “Neutrosophic Path SuperHyperColoring”, 159
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic 160
SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 161
holds. A SuperHyperGraph has a “Neutrosophic Path SuperHyperColoring” where it’s 162
the strongest [the maximum Neutrosophic value from all the Path SuperHyperColoring 163
amid the maximum value amid all SuperHyperVertices from a Path 164
SuperHyperColoring .] Path SuperHyperColoring . A graph is a SuperHyperUniform if 165
it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 166
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as 167
follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 168
SuperHyperEdges with two exceptions; it’s Path SuperHyperColoring if it’s only one 169
SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 170
only one SuperVertex as intersection amid all SuperHyperEdges; it’s 171
SuperHyperBipartite it’s only one SuperVertex as intersection amid two given 172
SuperHyperEdges and these SuperVertices, forming two separate sets, has no 173
SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 174
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi 175
separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only 176
one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 177
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel 178
proposes the specific designs and the specific architectures. The SuperHyperModel is 179
officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this 180
SuperHyperModel, The “specific” cells and “specific group” of cells are 181
SuperHyperModeled as “SuperHyperVertices” and the common and intended properties 182
between “specific” cells and “specific group” of cells are SuperHyperModeled as 183
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, 184
indeterminacy, and neutrality to have more precise SuperHyperModel which in this case 185
the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation 186
will be based on the “Cancer’s Recognition” and the results and the definitions will be 187
introduced in redeemed ways. The recognition of the cancer in the long-term function. 188
The specific region has been assigned by the model [it’s called SuperHyperGraph] and 189
the long cycle of the move from the cancer is identified by this research. Sometimes the 190
move of the cancer hasn’t be easily identified since there are some determinacy, 191
indeterminacy and neutrality about the moves and the effects of the cancer on that 192
region; this event leads us to choose another model [it’s said to be Neutrosophic 193
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. 194
There are some specific models, which are well-known and they’ve got the names, and 195
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer 196
on the complex tracks and between complicated groups of cells could be fantasized by a 197
Neutrosophic SuperHyperPath(-/Path SuperHyperColoring, SuperHyperStar, 198
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 199
either the longest Path SuperHyperColoring or the strongest Path SuperHyperColoring 200
in those Neutrosophic SuperHyperModels. For the longest Path SuperHyperColoring, 201
called Path SuperHyperColoring, and the strongest Path SuperHyperColoring, called 202
Neutrosophic Path SuperHyperColoring, some general results are introduced. Beyond 203
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 204
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form 205
any style of a Path SuperHyperColoring. There isn’t any formation of any Path 206
SuperHyperColoring but literarily, it’s the deformation of any Path 207
SuperHyperColoring. It, literarily, deforms and it doesn’t form. A basic familiarity 208
with Neutrosophic Path SuperHyperColoring theory, SuperHyperGraphs, and 209
Neutrosophic SuperHyperGraphs theory are proposed. 210
Keywords: Neutrosophic SuperHyperGraph, (Neutrosophic) Path 211
SuperHyperColoring, Cancer’s Neutrosophic Recognition 212
AMS Subject Classification: 05C17, 05C22, 05E45 213
1 Background 214
There are some scientific researches covering the topic of this research. In what follows, 215
there are some discussion and literature reviews about them date back on January 22, 216
2023. 217
First article is titled “properties of SuperHyperGraph and neutrosophic 218
SuperHyperGraph” in Ref. [1] by Henry Garrett (2022). It’s first step toward the 219
research on neutrosophic SuperHyperGraphs. This research article is published on the 220
journal “Neutrosophic Sets and Systems” in issue 49 and the pages 531-561. In this 221
research article, different types of notions like dominating, resolving, coloring, 222
Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, 223
zero forcing number, zero forcing neutrosophic- number, independent number, 224
independent neutrosophic-number, clique number, clique neutrosophic-number, 225
matching number, matching neutrosophic-number, girth, neutrosophic girth, 226
1-zero-forcing number, 1-zero- forcing neutrosophic-number, failed 1-zero-forcing 227
number, failed 1-zero-forcing neutrosophic-number, global- offensive alliance, t-offensive 228
alliance, t-defensive alliance, t-powerful alliance, and global-powerful alliance are defined 229
in SuperHyperGraph and neutrosophic SuperHyperGraph. Some Classes of 230
SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 231
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. 232
Thus this research article has concentrated on the vast notions and introducing the 233
majority of notions. 234
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and 235
neutrosophic degree alongside chromatic numbers in the setting of some classes related 236
to neutrosophic hypergraphs” in Ref. [2] by Henry Garrett (2022). In this research 237
article, a novel approach is implemented on SuperHyperGraph and neutrosophic 238
SuperHyperGraph based on general forms without using neutrosophic classes of 239
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 240
entitled “Journal of Current Trends in Computer Science Research (JCTCSR)” with 241
abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 06-14. 242
The research article studies deeply with choosing neutrosophic hypergraphs instead of 243
neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results 244
based on initial background. 245
The seminal paper and groundbreaking article is titled “Super Hyper Dominating 246
and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions 247
in Game Theory and Neutrosophic Super Hyper Classes” in Ref. [3] by Henry Garrett 248
(2022). In this research article, a novel approach is implemented on SuperHyperGraph 249
and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and 250
using neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s 251
published in prestigious and fancy journal is entitled “Journal of Mathematical 252
Techniques and Computational Mathematics(JMTCM)” with abbreviation “J Math 253
Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research 254
article studies deeply with choosing directly neutrosophic SuperHyperGraph and 255
SuperHyperGraph. It’s the breakthrough toward independent results based on initial 256
background and fundamental SuperHyperNumbers. 257
In some articles are titled “0039 — Closing Numbers and Super-Closing Numbers as 258
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 259
(Neutrosophic)n-SuperHyperGraph” in Ref. [4] by Henry Garrett (2022), “0049 — 260
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [5] by Henry Garrett 261
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 262
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 263
in Ref. [6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 264
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 265
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [7] by 266
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 267
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [8] by Henry Garrett (2022), 268
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 269
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 270
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 271
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [9] by Henry 272
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 273
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 274
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [10] by Henry Garrett (2022), 275
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 276
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 277
Ref. [11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 278
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 279
SuperHyperGraphs” in Ref. [12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 280
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 281
in Ref. [13] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs 282
To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 283
Recognitions In Special ViewPoints” in Ref. [14] by Henry Garrett (2022), 284
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 285
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” 286
in Ref. [15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s 287
Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in 288
Ref. [16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 289
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 290
Special ViewPoints” in Ref. [12] by Henry Garrett (2022), “Basic Notions on 291
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in 292
Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [17] by Henry 293
Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 294
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 295
in Ref. [18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s 296
Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 297
Ref. [19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With 298
SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 299
(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of 300
Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [20] by 301
Henry Garrett (2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic 302
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” in Ref. [21] by 303
Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees on 304
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in 305
Cancer’s Treatments” in Ref. [22] by Henry Garrett (2022), “SuperHyperDominating 306
and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 307
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [23] by Henry Garrett 308
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 309
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [24] by Henry 310
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 311
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 312
Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [25] by Henry 313
Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures on the 314
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 315
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [26] by Henry 316
Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 317
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s 318
Recognition called Neutrosophic SuperHyperGraphs” in Ref. [27] by Henry Garrett 319
(2023), “Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition 320
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in 321
Ref. [28] by Henry Garrett (2023), “Demonstrating Complete Connections in Every 322
Embedded Regions and Sub-Regions in the Terms of Cancer’s Recognition and 323
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 324
Ref. [29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic 325
Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 326
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [30] by 327
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 328
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in 329
Ref. [31] by Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To 330
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 331
Special ViewPoints” in Ref. [32] by Henry Garrett (2023), “(Neutrosophic) 332
SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 333
(Neutrosophic) SuperHyperGraphs” in Ref. [33] by Henry Garrett (2023), 334
“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 335
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” 336
in Ref. [34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in 337
Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [35] by Henry 338
Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And 339
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 340
SuperHyperGraphs” in Ref. [36] by Henry Garrett (2022), “Basic Neutrosophic Notions 341
Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 342
SuperHyperGraph” in Ref. [37] by Henry Garrett (2022), “Initial Material of 343
Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 344
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in 345
Ref. [38] by Henry Garrett (2022), there are some endeavors to formalize the basic 346
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph. 347
Some scientific studies and scientific researches about neutrosophic graphs, are 348
proposed as book in Ref. [39] by Henry Garrett (2022) which is indexed by Google 349
Scholar and has more than 3230 readers in Scribd. It’s titled “Beyond Neutrosophic 350
Graphs” and published by Ohio: E-publishing: Educational Publisher 1091 West 1st 351
Ave Grandview Heights, Ohio 43212 United State. This research book covers different 352
types of notions and settings in neutrosophic graph theory and neutrosophic 353
SuperHyperGraph theory. 354
Also, some scientific studies and scientific researches about neutrosophic graphs, are 355
proposed as book in Ref. [40] by Henry Garrett (2022) which is indexed by Google 356
Scholar and has more than 4117 readers in Scribd. It’s titled “Neutrosophic Duality” 357
and published by Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell 358
Ave Ste 950 Miami, Florida 33131 United States. This research book presents different 359
types of notions SuperHyperResolving and SuperHyperDominating in the setting of 360
duality in neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This 361
research book has scrutiny on the complement of the intended set and the intended set, 362
simultaneously. It’s smart to consider a set but acting on its complement that what’s 363
done in this research book which is popular in the terms of high readers in Scribd. 364
See the seminal scientific researches [1–3]. The formalization of the notions on the 365
framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed 366
SuperHyperClique theory, and (Neutrosophic) SuperHyperGraphs theory at [4–38]. 367
Two popular scientific research books in Scribd in the terms of high readers, 3230 and 368
4117 respectively, on neutrosophic science is on [39, 40]. 369
2 Applied Notions Under The Scrutiny Of The 370
Motivation Of This Research 371
In this research, there are some ideas in the featured frameworks of motivations. I try 372
to bring the motivations in the narrative ways. Some cells have been faced with some 373
attacks from the situation which is caused by the cancer’s attacks. In this case, there 374
are some embedded analysis on the ongoing situations which in that, the cells could be 375
labelled as some groups and some groups or individuals have excessive labels which all 376
are raised from the behaviors to overcome the cancer’s attacks. In the embedded 377
situations, the individuals of cells and the groups of cells could be considered as “new 378
groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 379
proper analysis on this messy story. I’ve found the SuperHyperModels which are 380
officially called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this 381
SuperHyperModel, the cells and the groups of cells are defined as “SuperHyperVertices” 382
and the relations between the individuals of cells and the groups of cells are defined as 383
“SuperHyperEdges”. Thus it’s another motivation for us to do research on this 384
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get 385
worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 386
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy 387
and neutrality, for any object based on vague forms, namely, incomplete data, imprecise 388
data, and uncertain analysis. The latter model could be considered on the previous 389
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 390
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is 391
going to figure out what’s going on this phenomenon. The special case of this disease is 392
considered and as the consequences of the model, some parameters are used. The cells 393
are under attack of this disease but the moves of the cancer in the special region are the 394
matter of mind. The recognition of the cancer could help to find some treatments for 395
this disease. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 396
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background 397
of this research. Sometimes the cancer has been happened on the region, full of cells, 398
groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 399
some SuperHyperNotions based on the connectivities of the moves of the cancer in the 400
forms of alliances’ styles with the formation of the design and the architecture are 401
formally called “ Path SuperHyperColoring” in the themes of jargons and buzzwords. 402
The prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 403
background for the SuperHyperNotions. The recognition of the cancer in the long-term 404
function. The specific region has been assigned by the model [it’s called 405
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this 406
research. Sometimes the move of the cancer hasn’t be easily identified since there are 407
some determinacy, indeterminacy and neutrality about the moves and the effects of the 408
cancer on that region; this event leads us to choose another model [it’s said to be 409
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and 410
what’s done. There are some specific models, which are well-known and they’ve got the 411
names, and some general models. The moves and the traces of the cancer on the 412
complex tracks and between complicated groups of cells could be fantasized by a 413
Neutrosophic SuperHyperPath (-/Path SuperHyperColoring, SuperHyperStar, 414
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 415
either the optimal Path SuperHyperColoring or the Neutrosophic Path 416
SuperHyperColoring in those Neutrosophic SuperHyperModels. Some general results are 417
introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath 418
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least 419
three SuperHyperEdges to form any style of a Path SuperHyperColoring. There isn’t 420
any formation of any Path SuperHyperColoring but literarily, it’s the deformation of 421
any Path SuperHyperColoring. It, literarily, deforms and it doesn’t form. 422
Question 2.1. How to define the SuperHyperNotions and to do research on them to 423
find the “ amount of Path SuperHyperColoring” of either individual of cells or the 424
groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount 425
of Path SuperHyperColoring” based on the fixed groups of cells or the fixed groups of 426
group of cells? 427
Question 2.2. What are the best descriptions for the “Cancer’s Recognition” in terms 428
of these messy and dense SuperHyperModels where embedded notions are illustrated? 429
It’s motivation to find notions to use in this dense model is titled 430
“SuperHyperGraphs”. Thus it motivates us to define different types of “ Path 431
SuperHyperColoring” and “Neutrosophic Path SuperHyperColoring” on 432
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the research has 433
taken more motivations to define SuperHyperClasses and to find some connections amid 434
this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 435
instances and examples to make clarifications about the framework of this research. The 436
general results and some results about some connections are some avenues to make key 437
point of this research, “Cancer’s Recognition”, more understandable and more clear. 438
The framework of this research is as follows. In the beginning, I introduce basic 439
definitions to clarify about preliminaries. In the subsection “Preliminaries”, initial 440
definitions about SuperHyperGraphs and Neutrosophic SuperHyperGraph are 441
deeply-introduced and in-depth-discussed. The elementary concepts are clarified and 442
illustrated completely and sometimes review literature are applied to make sense about 443
what’s going to figure out about the upcoming sections. The main definitions and their 444
clarifications alongside some results about new notions, Path SuperHyperColoring and 445
Neutrosophic Path SuperHyperColoring, are figured out in sections “ Path 446
SuperHyperColoring” and “Neutrosophic Path SuperHyperColoring”. In the sense of 447
tackling on getting results and in order to make sense about continuing the research, the 448
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 449
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 450
done in this section, titled “Results on SuperHyperClasses” and “Results on 451
Neutrosophic SuperHyperClasses”. As going back to origin of the notions, there are 452
some smart steps toward the common notions to extend the new notions in new 453
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections 454
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The 455
starter research about the general SuperHyperRelations and as concluding and closing 456
section of theoretical research are contained in the section “General Results”. Some 457
general SuperHyperRelations are fundamental and they are well-known as fundamental 458
SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ Path 459
SuperHyperColoring”, “Neutrosophic Path SuperHyperColoring”, “Results on 460
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are 461
curious questions about what’s done about the SuperHyperNotions to make sense about 462
excellency of this research and going to figure out the word “best” as the description 463
and adjective for this research as presented in section, “ Path SuperHyperColoring”. 464
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 465
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite 466
as SuperHyperModel” and “Case 2: The Increasing Steps Toward 467
SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 468
are some scrutiny and discernment on what’s done and what’s happened in this research 469
in the terms of “questions” and “problems” to make sense to figure out this research in 470
featured style. The advantages and the limitations of this research alongside about 471
what’s done in this research to make sense and to get sense about what’s figured out are 472
included in the section, “Conclusion and Closing Remarks”. 473
3 Preliminaries Of This Research On the Redeemed 474
Ways 475
In this section, the basic material in this research, is referred to [Single Valued 476
Neutrosophic Set](Ref. [38],Definition 2.2,p.2), [Neutrosophic Set](Ref. [38],Definition 477
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref. [38],Definition 2.5,p.2), 478
[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [38],Definition 479
2.7,p.3), [t-norm](Ref. [38], Definition 2.7, p.3), and [Characterization of the 480
Neutrosophic SuperHyperGraph (NSHG)](Ref. [38],Definition 2.7,p.3), [Neutrosophic 481
Strength of the Neutrosophic SuperHyperPaths] (Ref. [38],Definition 5.3,p.7), and 482
[Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)] 483
(Ref. [38],Definition 5.4,p.7). Also, the new ideas and their clarifications are addressed 484
to Ref. [38]. 485
In this subsection, the basic material which is used in this research, is presented. 486
Also, the new ideas and their clarifications are elicited. 487
Definition 3.1 (Neutrosophic Set). (Ref. [38],Definition 2.1,p.1). 488
Let X be a space 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 489
+
]− 0, 1 [. 490
Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [38],Definition 2.2,p.2). 491
Let X be a space 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}.
Definition 3.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 3.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 3.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref. [38],Definition 492
2.5,p.2). 493
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an 494
ordered pair S = (V, E), where 495
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 496
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 497
1, 2, . . . , n); 498
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 499
V; 500
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 501
1, 2, . . . , n0 ); 502
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 503
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 504
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 505
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 506
(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 . 507
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 508
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 509
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 510
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 511
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 512
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 513
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 514
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 515
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 516
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 517
Definition 3.6 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 518
(Ref. [38],Definition 2.7,p.3). 519
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). 520
The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 521
SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 522
could be characterized as follow-up items. 523
(i) If |Vi | = 1, then Vi is called vertex; 524
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 525
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 526
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 527
HyperEdge; 528
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 529
SuperEdge; 530
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 531
SuperHyperEdge. 532
If we choose different types of binary operations, then we could get hugely diverse 533
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 534
Definition 3.7 (t-norm). (Ref. [38], Definition 2.7, p.3). 535
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 536
for x, y, z, w ∈ [0, 1]: 537
(i) 1 ⊗ x = x; 538
(ii) x ⊗ y = y ⊗ x; 539
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 540
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 541
Definition 3.8. 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} (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 .
Definition 3.9. 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 3.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 542
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an 543
ordered pair S = (V, E), where 544
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 545
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 546
1, 2, . . . , n); 547
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 548
V; 549
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 550
1, 2, . . . , n0 ); 551
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 552
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 553
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 554
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ).
0 555
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 556
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 557
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 558
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 559
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 560
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 561
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 562
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 563
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 564
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 565
Definition 3.11 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 566
The Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic 569
SuperHyperVertices (NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) 570
(i) If |Vi | = 1, then Vi is called vertex; 572
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 573
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 574
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 575
HyperEdge; 576
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 577
SuperEdge; 578
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 579
SuperHyperEdge. 580
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 581
some restrictions and conditions on SuperHyperGraph. The special case of this 582
SuperHyperGraph makes the patterns and regularities. 583
Definition 3.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 584
number of elements of SuperHyperEdges are the same. 585
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 586
introduced. It makes to have SuperHyperUniform more understandable. 587
Definition 3.13. Assume a Neutrosophic SuperHyperGraph. There are some 588
SuperHyperClasses as follows. 589
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 590
intersection amid two given SuperHyperEdges with two exceptions; 591
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 592
given SuperHyperEdges; 593
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 594
SuperHyperEdges; 595
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 596
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 597
no SuperHyperEdge in common; 598
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 599
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 600
has no SuperHyperEdge in common; 601
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 602
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 603
common SuperVertex. 604
Definition 3.14. Let an ordered 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 605
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 606
of following conditions hold: 607
(i) Vi , Vi+1 ∈ Ei0 ; 608
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 609
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 610
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 611
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 612
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 613
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 614
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 615
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 616
0 0
Vi , Vi+1 ∈ Ei0 . 617
Definition 3.15. (Characterization of the Neutrosophic SuperHyperPaths). 618
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 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 ,
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 620
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 621
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 622
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 623
SuperHyperPath . 624
Definition 3.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 625
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 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 ,
have 627
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 628
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 629
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 630
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 631
Definition 3.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 632
(NSHE)). (Ref. [38],Definition 5.4,p.7). 633
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is 635
called 636
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 637
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 638
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 639
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 640
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 641
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 643
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 644
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 646
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 647
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 648
where 1 ≤ i, j ≤ s. 649
Definition 3.18. (Different Neutrosophic Types of Neutrosophic Path 650
SuperHyperColoring). 651
Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and 653
E 0 = {E1 , E2 , . . . , Ez } Then either V 0 or E 0 is called 654
(i) Neutrosophic e-Path SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such 655
that Va ∈ Ei , Ej ; 656
(ii) Neutrosophic re-Path SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such 657
that Ei = Ej ; 658
(iii) Neutrosophic v-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such that 659
Vi , Vj ∈ Ea ; 660
(iv) Neutrosophic rv-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such 661
that Vi = Vj ; 662
(v) Neutrosophic Path SuperHyperColoring if it’s either of Neutrosophic 663
e-Path SuperHyperColoring, Neutrosophic re-Path SuperHyperColoring, 664
Neutrosophic v-Path SuperHyperColoring, and Neutrosophic rv-Path 665
SuperHyperColoring. 666
Definition 3.19. ((Neutrosophic) Path SuperHyperColoring). 667
Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is 669
called 670
(i) an Extreme Path SuperHyperColoring if it’s either of Neutrosophic e-Path 671
SuperHyperColoring, Neutrosophic re-Path SuperHyperColoring, Neutrosophic 672
v-Path SuperHyperColoring, and Neutrosophic rv-Path SuperHyperColoring and 673
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 674
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 675
of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 676
SuperHyperEdges and Extreme SuperHyperVertices such that they form the 677
Extreme Path SuperHyperColoring; 678
(ii) a Neutrosophic Path SuperHyperColoring if it’s either of Neutrosophic 679
SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 682
SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 684
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 685
SuperHyperVertices such that they form the Neutrosophic Path 686
SuperHyperColoring; 687
(iii) an Extreme Path SuperHyperColoring SuperHyperPolynomial if it’s 688
coefficients defined as the Extreme number of the maximum Extreme cardinality 693
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 694
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 695
SuperHyperVertices such that they form the Extreme Path SuperHyperColoring; 696
and the Extreme power is corresponded to its Extreme coefficient; 697
(iv) a Neutrosophic Path SuperHyperColoring SuperHyperPolynomial if 698
it’s either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 699
rv-Path SuperHyperColoring and C(N SHG) for a Neutrosophic 701
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 702
contains the Neutrosophic coefficients defined as the Neutrosophic number of the 703
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 704
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 705
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 706
they form the Neutrosophic Path SuperHyperColoring; and the Neutrosophic 707
power is corresponded to its Neutrosophic coefficient; 708
(v) an Extreme R-Path SuperHyperColoring if it’s either of Neutrosophic 709
SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 712
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 713
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices 714
in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 715
(vi) a Neutrosophic R-Path SuperHyperColoring if it’s either of Neutrosophic 717
SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 720
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 722
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 723
SuperHyperVertices such that they form the Neutrosophic Path 724
(vii) an Extreme R-Path SuperHyperColoring SuperHyperPolynomial if it’s 726
coefficients defined as the Extreme number of the maximum Extreme cardinality 731
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 732
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 733
and the Extreme power is corresponded to its Extreme coefficient; 735
(viii) a Neutrosophic Path SuperHyperColoring SuperHyperPolynomial if 736
it’s either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 737
rv-Path SuperHyperColoring and C(N SHG) for a Neutrosophic 739
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 740
contains the Neutrosophic coefficients defined as the Neutrosophic number of the 741
maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 742
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 743
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 744
they form the Neutrosophic Path SuperHyperColoring; and the Neutrosophic 745
power is corresponded to its Neutrosophic coefficient. 746
Definition 3.20. ((Neutrosophic/Neutrosophic)δ−Path SuperHyperColoring). 747
Then 749
(i) an δ−Path SuperHyperColoring is a Neutrosophic kind of Neutrosophic Path 750
SuperHyperColoring such that either of the following expressions hold for the 751
Table 1. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.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
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 752
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ;

|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ.
The Expression (3.1), holds if S is an δ−SuperHyperOffensive. And the 753
Expression (3.1), holds if S is an δ−SuperHyperDefensive; 754
(ii) a Neutrosophic δ−Path SuperHyperColoring is a Neutrosophic kind of 755
Neutrosophic Path SuperHyperColoring such that either of the following 756
Neutrosophic expressions hold for the Neutrosophic cardinalities of 757
SuperHyperNeighbors of s ∈ S : 758
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ;

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ.
The Expression (3.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. 759
And the Expression (3.1), holds if S is a Neutrosophic 760
δ−SuperHyperDefensive. 761
For the sake of having a Neutrosophic Path SuperHyperColoring, there’s a need to 762
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 763
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. 764
In this procedure, there’s the usage of the position of labels to assign to the values. 765
Definition 3.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 766
pair S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) 767
holds. 768
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 769
more ways to get Neutrosophic type-results to make a Neutrosophic more 770
understandable. 771
Definition 3.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered 772
pair S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 773
holds. Thus Neutrosophic SuperHyperPath , Path SuperHyperColoring, 774
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 775
SuperHyperWheel, are Neutrosophic SuperHyperPath , Neutrosophic Path 776
SuperHyperColoring, Neutrosophic SuperHyperStar, Neutrosophic 777
SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 778
Neutrosophic SuperHyperWheel if the Table (2) holds. 779
It’s useful to define a “Neutrosophic” version of a Neutrosophic Path 780
SuperHyperColoring. Since there’s more ways to get type-results to make a 781
Neutrosophic Path SuperHyperColoring more Neutrosophicly understandable. 782

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

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.23)
For the sake of having a Neutrosophic Path SuperHyperColoring, there’s a need to 783
“redefine” the Neutrosophic notion of “Neutrosophic Path SuperHyperColoring”. The 784
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the 785
letters of the alphabets. In this procedure, there’s the usage of the position of labels to 786
assign to the values. 787
Definition 3.23. Assume a Path SuperHyperColoring. It’s redefined a Neutrosophic 788
Path SuperHyperColoring if the Table (3) holds. 789
4 Neutrosophic Path SuperHyperColoring But As 790
The Extensions Excerpt From Dense And Super 791
Forms 792
Example 4.1. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 793
S = (V, E) in the Figure (1), and the Figure (2), 794
• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 795
Path SuperHyperColoring, is up. The Neutrosophic Algorithm is Neutrosophicly 796
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but 797
E2 is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic 798
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, 799
there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 800
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 801
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the 802
Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 803
Path SuperHyperColoring. 804
C(N SHG)Neutrosophic Path SuperHyperColoring = {E4 , E2 }.

C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring = {}.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 0.
805
Figure 1. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic Path SuperHyperColoring in the Neutrosophic Example (4.1)
straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 808
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 809
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 810
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 811
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus 812
the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 813
Path SuperHyperColoring. 814
C(N SHG)Neutrosophic Path SuperHyperColoring = {E4 }.

C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = 3z.
C(N SHG)Neutrosophic R-Path SuperHyperColoring = {E4 }.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 2z.
815
straightforward. 818
C(N SHG)Neutrosophic Path SuperHyperColoring = {E4 }.

C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = 3z.
C(N SHG)Neutrosophic R-Path SuperHyperColoring = {E4 }.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 2z.
819



C(N SHG)Neutrosophic Path SuperHyperColoring =

{E4 , E3 , E5 , E1 , E2 }.
C(N SHG)Neutrosophic R-Path SuperHyperColoring =
{E4 , E3 , E5 , E1 , E2 }.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 2z 5 .
823

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {E1 , E3 }.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 15 × 14z 2 .
827
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }21

i6=11 .
C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = s0 z 21 .

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }21
i6=11 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = sz 21 .
831



C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }i6=16,17 .

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }i6=16,17 .
835
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }i=1,2,3 .

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }i=1,2,3 .
839
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei , E22 , E23 }10

i=1 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei , E22 , E23 }10
i=1 .
843


Figure 10. The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic

Notions of Neutrosophic Path SuperHyperColoring in the Neutrosophic Example (4.1)
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }i6=3 .

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }i6=3 .
847
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }i6=7 .

C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }i6=7 .
851

855




i=1 .
C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = 6!z 10 .
i=1 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 6!z 10 .
859

863
C(N SHG)Neutrosophic Path SuperHyperColoring = {Ei }5i=1 .

C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = z 5 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring = {Ei }5i=1 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = z 5 .
867




C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial
= 4 × 6 × 4 × 7z 5 .
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial
= 4 × 6 × 4 × 7z 5 .
871

= 8 × 4 × 6 × 4 × 7z 5 .
= 8 × 4 × 6 × 4 × 7z 5 .
875


= 6 × 3 × 3 × 6 × 4 × 7z 5 .
= 6 × 3 × 3 × 6 × 4 × 7z 5 .
879

i=1 .
=4×6×4×3×5×
5×3×7×3×5×
5 × 3z 12 .
i=1 .
=4×6×4×3×5×
5×3×7×3×5×
5 × 3z 12 .
883




C(N SHG)Neutrosophic Path SuperHyperColoring SuperHyperPolynomial = 0.
C(N SHG)Neutrosophic R-Path SuperHyperColoring SuperHyperPolynomial = 90sz 3 .
887

891



= 4 × 3 × 5z 6 .
= 4 × 3 × 5z 6 z 6 .
895
5 The Departures on The Theoretical Results 896
Toward Theoretical Motivations 897
The previous Neutrosophic approaches apply on the upcoming Neutrosophic results on 898
Neutrosophic SuperHyperClasses. 899
Proposition 5.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). 900
Then 901

|E |
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
= z |EESHG:(V,E) |Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-Path SuperHyperColoring
|E | +1
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality +1 .
Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Path SuperHyperColoring in the Example (5.2)
Proof. Let 902
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
E|EESHG:(V,E) |Neutrosophic Cardinality , V|E ESHG:(V,E) |Neutrosophic Cardinality +1
be a longest path taken from a connected Neutrosophic SuperHyperPath 903
ESHP : (V, E). There’s a new way to redefine as 904
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 |ViEXT ERN AL | ≥ |Vj | where Vj is corresponded to 905
ViEXT ERN AL in the literatures of Path SuperHyperColoring. The latter is 906
Example 5.2. In the Figure (23), the connected Neutrosophic SuperHyperPath 908
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 909
Neutrosophic SuperHyperModel (23), is the Path SuperHyperColoring. 910
Proposition 5.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 911
Then 912

|E |
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
= |EESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality .
|E | +1
{ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
= (|EESHG:(V,E) |Neutrosophic Cardinality + 1) ×
Y
|V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality +1 .
Proof. Let 913
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
be a longest path taken a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 914
There’s a new way to redefine as 915

Example 5.4. In the Figure (24), the connected Neutrosophic SuperHyperCycle 919
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 920
SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is the Neutrosophic Path 921
Proposition 5.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). 923
Then 924
C(N SHG)Neutrosophic Quasi-Path SuperHyperColoring

= {Ei , Ej ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic Quasi-Path SuperHyperColoring SuperHyperPolynomial
X
=s |Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality z2 .
Ei ∈EESHG:(V,E) −{Ej :|Ej |=s}
C(N SHG)Neutrosophic R-Quasi-Path SuperHyperColoring

= {ViEXT ERN AL , VjEXT ERN AL , CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-Path SuperHyperColoring SuperHyperPolynomial
X
= (|V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality − s) × sz 3 .
V EXT ERN AL ESHG:(V,E)
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

Proof. Let 925
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). 926
There’s a new way to redefine as 927

Example 5.6. In the Figure (25), the connected Neutrosophic SuperHyperStar 931
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 932
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 933
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 934
the Neutrosophic SuperHyperModel (25), is the Neutrosophic Path SuperHyperColoring. 935
936
Proposition 5.7. Assume a connected Neutrosophic SuperHyperBipartite 937
Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of

Neutrosophic Path SuperHyperColoring in the Neutrosophic Example (5.6)
ESHB : (V, E). Then 938

= {Ei ∈ EPi ESHG:(V,E) , Ej ∈ EPj ESHG:(V,E) , i 6= j}.
X
= −l +
Pi ∈PESHG:(V,E)
ESHG:(V,E)
|Pi |Neutrosophic Cardinality |Ei | Ei ∼ VPi |Neutrosophic Cardinality
|PESHG:(V,E) |Neutrosophic
z Cardinality
.
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vj
EXT ERN AL
∈ VPEXT
j
ERN AL
ESHG:(V,E) , i 6= j}.

X
=
EXT ERN AL |
|VESHG:(V,E) Neutrosophic Cardinality
ESHG:(V,E)
|ViEXT ERN AL +VjEXT ERN AL |Neutrosophic Cardinality | EXT ERN AL
Vi,j ∈V EXT ERN AL
, i6=j
Pi,j ESHG:(V,E)
z .
Proof. Let 939
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest path taken from a connected Neutrosophic SuperHyperBipartite 940
ESHB : (V, E). There’s a new way to redefine as 941

straightforward. Then there’s at least one Path SuperHyperColoring. Thus the notion 944
of quasi isn’t up and the SuperHyperNotions based on Path SuperHyperColoring could 945
be applied. There are only two SuperHyperParts. Thus every SuperHyperPart could 946
have one SuperHyperVertex as the representative in the 947
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest Path SuperHyperColoring taken from a connected Neutrosophic 948
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only 949
minimum-Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any 950
solution 951
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
The latter is straightforward. 952
Example 5.8. In the Neutrosophic Figure (26), the connected Neutrosophic 953
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 954
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 955
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 956
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 957
SuperHyperModel (26), is the Neutrosophic Path SuperHyperColoring. 958
Proposition 5.9. Assume a connected Neutrosophic SuperHyperMultipartite 959
Figure 26. a Neutrosophic SuperHyperBipartite Neutrosophic Associated to the

Neutrosophic Notions of Neutrosophic Path SuperHyperColoring in the Example (5.8)
ESHM : (V, E). Then 960

= {Ei ∈ EPi ESHG:(V,E) , Ej ∈ EPj ESHG:(V,E) , i 6= j}.
X
= −l +
Pi ∈PESHG:(V,E)
ESHG:(V,E)
|PESHG:(V,E) |Neutrosophic
z Cardinality
.
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vj
EXT ERN AL
∈ VPEXT
j
ERN AL
ESHG:(V,E) , i 6= j}.

X
=
EXT ERN AL |
|VESHG:(V,E) Neutrosophic Cardinality
ESHG:(V,E)
|ViEXT ERN AL +VjEXT ERN AL |Neutrosophic Cardinality | EXT ERN AL
Vi,j ∈V EXT ERN AL
, i6=j
Pi,j ESHG:(V,E)
z .
Proof. Let 961
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperMultipartite ESHM : (V, E). There’s a new way to redefine as 963

be applied. There are only z 0 SuperHyperParts. Thus every SuperHyperPart could have 968
one SuperHyperVertex as the representative in the 969
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). Thus only some 970
SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 971
SuperHyperEdges are attained in any solution 972
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
The latter is straightforward. 973
Example 5.10. In the Figure (27), the connected Neutrosophic 974
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 975
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 976
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 977
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 978
is the Neutrosophic Path SuperHyperColoring. 979
Proposition 5.11. Assume a connected Neutrosophic SuperHyperWheel 980
ESHW : (V, E). Then, 981

|E ∗ |Neutrosophic
= Ej CEN T ER ∈ EESHG:(V,E) ∪ {Ei∗ }i=1ESHG:(V,E)
CEN T ER Cardinality
.
∗
∗
= (1 + |EESHG:(V,E) |Neutrosophic Cardinality )z |EESHG:(V,E) |Neutrosophic Cardinality .
|E ∗ |Neutrosophic Cardinality +1
{ViEXT ERN AL }i=1ESHG:(V,E) .
∗
= (|EESHG:(V,E) |Neutrosophic Cardinality + 1) ×
Y ∗
|V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality +1 .
Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic Path SuperHyperColoring in the Example (5.10)
Proof. Let 982
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 984

be applied. The unique embedded Path SuperHyperColoring proposes some longest 989
Path SuperHyperColoring excerpt from some representatives. The latter is 990
Example 5.12. In the Neutrosophic Figure (28), the connected Neutrosophic 992
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 993
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 994
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 995
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is the Neutrosophic Path 996
Figure 28. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutro-

sophic Notions of Neutrosophic Path SuperHyperColoring in the Neutrosophic Example
(5.12)
6 The Surveys of Mathematical Sets On The 998
Results But As The Initial Motivation 999
For the Path SuperHyperColoring, extreme Path SuperHyperColoring, and the 1000
neutrosophic Path SuperHyperColoring, some general results are introduced. 1001
Remark 6.1. Let remind that the neutrosophic Path SuperHyperColoring is “redefined” 1002
on the positions of the alphabets. 1003
Corollary 6.2. Assume extreme Path SuperHyperColoring. Then 1004
N eutrosophic P athSuperHyperColoring =
{theP athSuperHyperColoringof theSuperHyperV ertices |
max |SuperHyperOf f ensive
P athSuperHyperColoring
|neutrosophiccardinalityamidthoseP athSuperHyperColoring. }
plus one extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 1005
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the 1006
indeterminacy and the neutrality, for i = 1, 2, 3, respectively. 1007
Corollary 6.3. Assume a neutrosophic SuperHyperGraph on the same identical letter 1008
of the alphabet. Then the notion of neutrosophic Path SuperHyperColoring and Path 1009
SuperHyperColoring coincide. 1010
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a 1012
neutrosophic Path SuperHyperColoring if and only if it’s a Path SuperHyperColoring. 1013
of the alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest 1015
Path SuperHyperColoring if and only if it’s a longest Path SuperHyperColoring. 1016
Corollary 6.6. Assume SuperHyperClasses of a neutrosophic SuperHyperGraph on the 1017
same identical letter of the alphabet. Then its neutrosophic Path SuperHyperColoring is 1018
its Path SuperHyperColoring and reversely. 1019
Corollary 6.7. Assume a neutrosophic SuperHyperPath(-/Path SuperHyperColoring, 1020
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 1021
the same identical letter of the alphabet. Then its neutrosophic Path 1022
SuperHyperColoring is its Path SuperHyperColoring and reversely. 1023
Corollary 6.8. Assume a neutrosophic SuperHyperGraph. Then its neutrosophic Path 1024
SuperHyperColoring isn’t well-defined if and only if its Path SuperHyperColoring isn’t 1025
well-defined. 1026
Corollary 6.9. Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. Then 1027
its neutrosophic Path SuperHyperColoring isn’t well-defined if and only if its Path 1028
SuperHyperColoring isn’t well-defined. 1029
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1031
Then its neutrosophic Path SuperHyperColoring isn’t well-defined if and only if its Path 1032
SuperHyperColoring isn’t well-defined. 1033
Corollary 6.11. Assume a neutrosophic SuperHyperGraph. Then its neutrosophic 1034
Path SuperHyperColoring is well-defined if and only if its Path SuperHyperColoring is 1035
well-defined. 1036
Corollary 6.12. Assume SuperHyperClasses of a neutrosophic SuperHyperGraph. 1037
Then its neutrosophic Path SuperHyperColoring is well-defined if and only if its Path 1038
SuperHyperColoring is well-defined. 1039
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1041
Then its neutrosophic Path SuperHyperColoring is well-defined if and only if its Path 1042
SuperHyperColoring is well-defined. 1043
Proposition 6.14. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph. Then V 1044
is 1045
(i) : the dual SuperHyperDefensive Path SuperHyperColoring; 1046
(ii) : the strong dual SuperHyperDefensive Path SuperHyperColoring; 1047
(iii) : the connected dual SuperHyperDefensive Path SuperHyperColoring; 1048
(iv) : the δ-dual SuperHyperDefensive Path SuperHyperColoring; 1049
(v) : the strong δ-dual SuperHyperDefensive Path SuperHyperColoring; 1050
(vi) : the connected δ-dual SuperHyperDefensive Path SuperHyperColoring. 1051
Proposition 6.15. Let N T G : (V, E, σ, µ) be a neutrosophic SuperHyperGraph. Then 1052
∅ is 1053
(i) : the SuperHyperDefensive Path SuperHyperColoring; 1054
(ii) : the strong SuperHyperDefensive Path SuperHyperColoring; 1055
(iii) : the connected defensive SuperHyperDefensive Path SuperHyperColoring; 1056
(iv) : the δ-SuperHyperDefensive Path SuperHyperColoring; 1057
(v) : the strong δ-SuperHyperDefensive Path SuperHyperColoring; 1058
(vi) : the connected δ-SuperHyperDefensive Path SuperHyperColoring. 1059
Proposition 6.16. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph. Then an 1060
independent SuperHyperSet is 1061
(i) : the SuperHyperDefensive Path SuperHyperColoring; 1062
(ii) : the strong SuperHyperDefensive Path SuperHyperColoring; 1063
(iii) : the connected SuperHyperDefensive Path SuperHyperColoring; 1064
(iv) : the δ-SuperHyperDefensive Path SuperHyperColoring; 1065
(v) : the strong δ-SuperHyperDefensive Path SuperHyperColoring; 1066
(vi) : the connected δ-SuperHyperDefensive Path SuperHyperColoring. 1067
Proposition 6.17. Let ESHG : (V, E) be a neutrosophic SuperHyperUniform 1068
SuperHyperGraph which is a Path SuperHyperColoring/SuperHyperPath. Then V is a 1069
maximal 1070
(i) : SuperHyperDefensive Path SuperHyperColoring; 1071
(ii) : strong SuperHyperDefensive Path SuperHyperColoring; 1072
(iii) : connected SuperHyperDefensive Path SuperHyperColoring; 1073
(iv) : O(ESHG)-SuperHyperDefensive Path SuperHyperColoring; 1074
(v) : strong O(ESHG)-SuperHyperDefensive Path SuperHyperColoring; 1075
(vi) : connected O(ESHG)-SuperHyperDefensive Path SuperHyperColoring; 1076
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1077
Proposition 6.18. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph which is a 1078
SuperHyperUniform SuperHyperWheel. Then V is a maximal 1079
(i) : dual SuperHyperDefensive Path SuperHyperColoring; 1080
(ii) : strong dual SuperHyperDefensive Path SuperHyperColoring; 1081
(iii) : connected dual SuperHyperDefensive Path SuperHyperColoring; 1082
(iv) : O(ESHG)-dual SuperHyperDefensive Path SuperHyperColoring; 1083
(v) : strong O(ESHG)-dual SuperHyperDefensive Path SuperHyperColoring; 1084
(vi) : connected O(ESHG)-dual SuperHyperDefensive Path SuperHyperColoring; 1085
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1086
SuperHyperGraph which is a Path SuperHyperColoring/SuperHyperPath. Then the 1088
number of 1089
(i) : the Path SuperHyperColoring; 1090
(ii) : the Path SuperHyperColoring; 1091
(iii) : the connected Path SuperHyperColoring; 1092
(iv) : the O(ESHG)-Path SuperHyperColoring; 1093
(v) : the strong O(ESHG)-Path SuperHyperColoring; 1094
(vi) : the connected O(ESHG)-Path SuperHyperColoring. 1095
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1096
SuperHyperVertices coincide. 1097
SuperHyperGraph which is a SuperHyperWheel. Then the number of 1099
(i) : the dual Path SuperHyperColoring; 1100
(ii) : the dual Path SuperHyperColoring; 1101
(iii) : the dual connected Path SuperHyperColoring; 1102
(iv) : the dual O(ESHG)-Path SuperHyperColoring; 1103
(v) : the strong dual O(ESHG)-Path SuperHyperColoring; 1104
(vi) : the connected dual O(ESHG)-Path SuperHyperColoring. 1105
is one and it’s only V. Where the exterior SuperHyperVertices and the interior 1106
SuperHyperGraph which is a SuperHyperStar/SuperHyperComplete 1109
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1110
SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying r with the 1111
number of all the SuperHyperEdges plus one of all the SuperHyperVertices is a 1112
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring; 1116
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring; 1117
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring. 1118
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then a 1121
SuperHyperSet contains the half of multiplying r with the number of all the 1122
SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1123
is a 1124
(iv) : δ-SuperHyperDefensive Path SuperHyperColoring; 1128
(v) : strong δ-SuperHyperDefensive Path SuperHyperColoring; 1129
(vi) : connected δ-SuperHyperDefensive Path SuperHyperColoring. 1130
SuperHyperBipartite/SuperHyperComplete SuperHyperMultipartite. Then Then the 1133
number of 1134
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring; 1138
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring; 1139
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive Path SuperHyperColoring. 1140
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 1141
multiplying r with the number of all the SuperHyperEdges plus one of all the 1142
SuperHyperVertices. Where the exterior SuperHyperVertices and the interior 1143
Proposition 6.24. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph. The 1145
number of connected component is |V − S| if there’s a SuperHyperSet which is a dual 1146
(iv) : Path SuperHyperColoring; 1150
(v) : strong 1-SuperHyperDefensive Path SuperHyperColoring; 1151
(vi) : connected 1-SuperHyperDefensive Path SuperHyperColoring. 1152
Proposition 6.25. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph. Then the 1153
number is at most O(ESHG) and the neutrosophic number is at most On (ESHG). 1154
Proposition 6.26. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph which is 1155
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the neutrosophic number is 1156
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1157
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive Path SuperHyperColoring; 1161
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive Path SuperHyperColoring. 1163
Proposition 6.27. Let ESHG : (V, E) be a neutrosophic SuperHyperGraph which is ∅. 1164
The number is 0 and the neutrosophic number is 0, for an independent SuperHyperSet in 1165
the setting of dual 1166
(iv) : 0-SuperHyperDefensive Path SuperHyperColoring; 1170
(v) : strong 0-SuperHyperDefensive Path SuperHyperColoring; 1171
(vi) : connected 0-SuperHyperDefensive Path SuperHyperColoring. 1172
SuperHyperComplete. Then there’s no independent SuperHyperSet. 1174
Path SuperHyperColoring/SuperHyperPath/SuperHyperWheel. The number is 1176
O(ESHG : (V, E)) and the neutrosophic number is On (ESHG : (V, E)), in the setting 1177
of a dual 1178
(iv) : O(ESHG : (V, E))-SuperHyperDefensive Path SuperHyperColoring; 1182
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive Path SuperHyperColoring; 1183
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive Path SuperHyperColoring. 1184
SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The 1186
number is O(ESHG:(V,E))
2 + 1 and the neutrosophic number is 1187
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of a dual 1188
t>
2
(iv) : ( O(ESHG:(V,E))
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive Path SuperHyperColoring. 1194
Proposition 6.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1195
neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the 1196
result is obtained for the individuals. Then the results also hold for the 1197
SuperHyperFamily N SHF : (V, E) of these specific SuperHyperClasses of the 1198
neutrosophic SuperHyperGraphs. 1199
Proposition 6.32. Let ESHG : (V, E) be a strong neutrosophic SuperHyperGraph. If 1200
S is a dual SuperHyperDefensive Path SuperHyperColoring, then ∀v ∈ V \ S, ∃x ∈ S 1201
such that 1202
(i) v ∈ Ns (x); 1203
(ii) vx ∈ E. 1204
Proposition 6.33. Let ESHG : (V, E) be a strong neutrosophic SuperHyperGraph. If 1205
S is a dual SuperHyperDefensive Path SuperHyperColoring, then 1206
(i) S is SuperHyperDominating set; 1207
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1208
Proposition 6.34. Let ESHG : (V, E) be a strong neutrosophic SuperHyperGraph. 1209
Then 1210
(i) Γ ≤ O; 1211
(ii) Γs ≤ On . 1212
Proposition 6.35. Let ESHG : (V, E) be a strong neutrosophic SuperHyperGraph 1213
which is connected. Then 1214
(i) Γ ≤ O − 1; 1215
(ii) Γs ≤ On − Σ3i=1 σi (x). 1216
Proposition 6.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1217
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive Path 1218
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1220
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1221
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only 1222
a dual Path SuperHyperColoring. 1223
Proposition 6.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1224
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive Path 1225
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and 1227
{v1 , v3 , · · · .vn−1 }; 1228
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1229
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only 1230
dual Path SuperHyperColoring. 1231
Proposition 6.38. Let ESHG : (V, E) be an even Path SuperHyperColoring. Then 1232
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive Path 1233
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and 1235
{v1 , v3 , · · · , vn−1 }; 1236
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1237
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only 1238
Proposition 6.39. Let ESHG : (V, E) be an odd Path SuperHyperColoring. Then 1240
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive Path 1241
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1243
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1244
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only 1245
Proposition 6.40. Let ESHG : (V, E) be SuperHyperStar. Then 1247
(i) the SuperHyperSet S = {c} is a dual maximal Path SuperHyperColoring; 1248
(ii) Γ = 1; 1249
(iii) Γs = Σ3i=1 σi (c); 1250
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual Path SuperHyperColoring. 1251
Proposition 6.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1252
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual 1253
maximal SuperHyperDefensive Path SuperHyperColoring; 1254
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1255
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1256
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual 1257
maximal SuperHyperDefensive Path SuperHyperColoring. 1258
Proposition 6.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1259
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive Path 1260
(ii) Γ = b n2 c + 1; 1262
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 1263
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive Path 1264
Proposition 6.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1266
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive Path 1267
(ii) Γ = b n2 c; 1269

bnc ; 1270
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual maximal SuperHyperDefensive Path 1271
Proposition 6.44. Let N SHF : (V, E) be a m-SuperHyperFamily of neutrosophic 1273
SuperHyperStars with common neutrosophic SuperHyperVertex SuperHyperSet. Then 1274
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive Path 1275
SuperHyperColoring for N SHF; 1276
(ii) Γ = m for N SHF : (V, E); 1277
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1278
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual Path 1279
SuperHyperColoring for N SHF : (V, E). 1280
Proposition 6.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd 1281
SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex 1282
SuperHyperSet. Then 1283
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual maximal SuperHyperDefensive Path 1284
SuperHyperColoring for N SHF; 1285
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1286
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 1287
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal Path 1288
SuperHyperColoring for N SHF : (V, E). 1289
Proposition 6.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even 1290
SuperHyperComplete SuperHyperGraphs with common neutrosophic SuperHyperVertex 1291
SuperHyperSet. Then 1292
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive Path 1293
SuperHyperColoring for N SHF : (V, E); 1294
(ii) Γ = b n2 c for N SHF : (V, E); 1295

bnc for N SHF : (V, E); 1296
S={vi }i=1
bnc
(iv) the SuperHyperSets S = {vi }i=1
2
are only dual maximal Path SuperHyperColoring 1297
for N SHF : (V, E). 1298
Then following statements hold; 1300
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an 1301
t-SuperHyperDefensive Path SuperHyperColoring, then S is an 1302
s-SuperHyperDefensive Path SuperHyperColoring; 1303
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1304
t-SuperHyperDefensive Path SuperHyperColoring, then S is a dual 1305
s-SuperHyperDefensive Path SuperHyperColoring. 1306
Then following statements hold; 1308
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an 1309
t-SuperHyperDefensive Path SuperHyperColoring, then S is an 1310
s-SuperHyperPowerful Path SuperHyperColoring; 1311
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual 1312
t-SuperHyperDefensive Path SuperHyperColoring, then S is a dual 1313
s-SuperHyperPowerful Path SuperHyperColoring. 1314
Proposition 6.49. Let ESHG : (V, E) be a[an] 1315
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following 1316
statements hold; 1317
(i) if ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1, then ESHG : (V, E) is an 1318
2-SuperHyperDefensive Path SuperHyperColoring; 1319
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1, then ESHG : (V, E) is a dual 1320
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an r-SuperHyperDefensive 1322
Path SuperHyperColoring; 1323
(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual 1324
r-SuperHyperDefensive Path SuperHyperColoring. 1325
Proposition 6.50. Let ESHG : (V, E) is a[an] 1326
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph. Then following 1327
statements hold; 1328
(i) ∀a ∈ S, |Ns (a) ∩ S| < b 2r c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1329
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b 2r c + 1 if ESHG : (V, E) is a dual 1331
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an r-SuperHyperDefensive Path 1333
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 1335
r-SuperHyperDefensive Path SuperHyperColoring. 1336
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a 1338
SuperHyperComplete. Then following statements hold; 1339
(i) ∀a ∈ S, |Ns (a) ∩ S| < b O−1

2 c + 1 if ESHG : (V, E) is an 2-SuperHyperDefensive 1340
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1 if ESHG : (V, E) is a dual 1342
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 1344
(O − 1)-SuperHyperDefensive Path SuperHyperColoring. 1347
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is a 1349
SuperHyperComplete. Then following statements hold; 1350
(i) if ∀a ∈ S, |Ns (a) ∩ S| <b O−1

2 c
+ 1, then ESHG : (V, E) is an 1351
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > b O−1

2 c + 1, then ESHG : (V, E) is a dual 1353
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is 1355
(O − 1)-SuperHyperDefensive Path SuperHyperColoring; 1356
(O − 1)-SuperHyperDefensive Path SuperHyperColoring. 1358
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is Path 1360
SuperHyperColoring. Then following statements hold; 1361
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive Path 1362
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1364
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive Path 1366
2-SuperHyperDefensive Path SuperHyperColoring. 1369
[r-]SuperHyperUniform-strong-neutrosophic SuperHyperGraph which is Path 1371
SuperHyperColoring. Then following statements hold; 1372
(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1373
(ii) if ∀a ∈ V \ S, |Ns (a) ∩ S| > 2, then ESHG : (V, E) is a dual 1375
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an 2-SuperHyperDefensive 1377
2-SuperHyperDefensive Path SuperHyperColoring. 1380
7 Neutrosophic Applications in Cancer’s 1381
Neutrosophic Recognition 1382
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure 1383
out what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of 1384
this Neutrosophic disease is considered and as the consequences of the model, some 1385
parameters are used. The cells are under attack of this disease but the moves of the 1386
cancer in the special region are the matter of mind. The Neutrosophic recognition of the 1387
cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 1388
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 1389
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 1390
the long-term Neutrosophic function. 1391
Step 2. (Neutrosophic Issue) The specific region has been assigned by the 1392
Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 1393
Neutrosophic cycle of the move from the cancer is identified by this research. 1394
Sometimes the move of the cancer hasn’t be easily identified since there are some 1395
determinacy, indeterminacy and neutrality about the moves and the effects of the 1396
cancer on that region; this event leads us to choose another model [it’s said to be 1397
Neutrosophic SuperHyperGraph] to have convenient perception on what’s 1398
happened and what’s done. 1399
Figure 29. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-

sophic Path SuperHyperColoring
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, 1400
which are well-known and they’ve got the names, and some general Neutrosophic 1401
models. The moves and the Neutrosophic traces of the cancer on the complex 1402
tracks and between complicated groups of cells could be fantasized by a 1403
Neutrosophic SuperHyperPath(-/Path SuperHyperColoring, SuperHyperStar, 1404
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 1405
find either the Neutrosophic Path SuperHyperColoring or the Neutrosophic Path 1406
SuperHyperColoring in those Neutrosophic Neutrosophic SuperHyperModels. 1407
8 Case 1: The Initial Neutrosophic Steps 1408
Toward Neutrosophic SuperHyperBipartite as 1409
Neutrosophic SuperHyperModel 1410
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29), the 1411
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 1412
featured. 1413
By using the Neutrosophic Figure (29) and the Table (4), the Neutrosophic 1414
SuperHyperBipartite is obtained. 1415
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1416
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 1417
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 1418
Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperBipartite
Figure 30. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic Path SuperHyperColoring
9 Case 2: The Increasing Neutrosophic Steps 1420
Toward Neutrosophic SuperHyperMultipartite as 1421
Neutrosophic SuperHyperModel 1422
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (30), the 1423
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 1424
Neutrosophic featured. 1425
By using the Neutrosophic Figure (30) and the Table (5), the Neutrosophic 1426
SuperHyperMultipartite is obtained. 1427
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 1428
previous result, of the Neutrosophic SuperHyperVertices of the connected 1429
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 1430
Table 5. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperMultipartite
10 Wondering Open Problems But As The 1432
Directions To Forming The Motivations 1433
In what follows, some “problems” and some “questions” are proposed. 1434
The Path SuperHyperColoring and the Neutrosophic Path SuperHyperColoring are 1435
defined on a real-world application, titled “Cancer’s Recognitions”. 1436
Question 10.1. Which the else SuperHyperModels could be defined based on Cancer’s 1437
recognitions? 1438
Question 10.2. Are there some SuperHyperNotions related to Path 1439
SuperHyperColoring and the Neutrosophic Path SuperHyperColoring? 1440
Question 10.3. Are there some Algorithms to be defined on the SuperHyperModels to 1441
compute them? 1442
Question 10.4. Which the SuperHyperNotions are related to beyond the Path 1443
SuperHyperColoring and the Neutrosophic Path SuperHyperColoring? 1444
Problem 10.5. The Path SuperHyperColoring and the Neutrosophic Path 1445
SuperHyperColoring do a SuperHyperModel for the Cancer’s recognitions and they’re 1446
based on Path SuperHyperColoring, are there else? 1447
Problem 10.6. Which the fundamental SuperHyperNumbers are related to these 1448
SuperHyperNumbers types-results? 1449
Problem 10.7. What’s the independent research based on Cancer’s recognitions 1450
concerning the multiple types of SuperHyperNotions? 1451
11 Conclusion and Closing Remarks 1452
In this section, concluding remarks and closing remarks are represented. The drawbacks 1453
of this research are illustrated. Some benefits and some advantages of this research are 1454
highlighted. 1455
This research uses some approaches to make Neutrosophic SuperHyperGraphs more 1456
understandable. In this endeavor, two SuperHyperNotions are defined on the Path 1457
SuperHyperColoring. For that sake in the second definition, the main definition of the 1458
Neutrosophic SuperHyperGraph is redefined on the position of the alphabets. Based on 1459
the new definition for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, 1460
Neutrosophic Path SuperHyperColoring, finds the convenient background to implement 1461
some results based on that. Some SuperHyperClasses and some Neutrosophic 1462
SuperHyperClasses are the cases of this research on the modeling of the regions where 1463
are under the attacks of the cancer to recognize this disease as it’s mentioned on the 1464
title “Cancer’s Recognitions”. To formalize the instances on the SuperHyperNotion, 1465
Path SuperHyperColoring, the new SuperHyperClasses and SuperHyperClasses, are 1466
introduced. Some general results are gathered in the section on the Path 1467
SuperHyperColoring and the Neutrosophic Path SuperHyperColoring. The 1468
clarifications, instances and literature reviews have taken the whole way through. In 1469
this research, the literature reviews have fulfilled the lines containing the notions and 1470
the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 1471
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background 1472
of this research. Sometimes the cancer has been happened on the region, full of cells, 1473
groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 1474
some SuperHyperNotions based on the connectivities of the moves of the cancer in the 1475
longest and strongest styles with the formation of the design and the architecture are 1476
formally called “ Path SuperHyperColoring” in the themes of jargons and buzzwords. 1477
The prefix “SuperHyper” refers to the theme of the embedded styles to figure out the 1478
background for the SuperHyperNotions. In the Table (6), benefits and avenues for this
Table 6. An Overlook On This Research And Beyond

Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. Path SuperHyperColoring
3. Neutrosophic Path SuperHyperColoring 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies
1479
research are, figured out, pointed out and spoken out. 1480
References 1481
1. Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic 1482
SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 1483
10.5281/zenodo.6456413). 1484
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). 1485
(https://digitalrepository.unm.edu/nss journal/vol49/iss1/34). 1486
2. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 1487
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 1488
Hypergraphs”, J Curr Trends Comp Sci Res 1(1) (2022) 06-14. 1489
3. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 1490
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 1491
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 1492
(2022) 242-263. 1493
4. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 1494
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 1495
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 1496
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 1497
Research, https://doi.org/10.5281/zenodo.6319942. 1498
https://oa.mg/work/10.5281/zenodo.6319942 1499
5. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 1500
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 1501
2022. CERN European Organization for Nuclear Research, 1502
https://doi.org/10.13140/rg.2.2.35241.26724. 1503
https://oa.mg/work/10.13140/rg.2.2.35241.26724 1504
6. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 1505
Confrontation under Cancer’s Recognition as the Model in The Setting of 1506
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 1507
10.20944/preprints202301.0308.v1). 1508
7. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 1509
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1510
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1511
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1512
8. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 1513
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 1514
2023010267 (doi: 10.20944/preprints202301.0267.v1). 1515
9. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1516
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1517
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1518
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1519
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1520
10.20944/preprints202301.0265.v1). 1521
10. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 1522
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1523
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1524
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1525
11. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1526
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1527
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1528
10.20944/preprints202301.0240.v1). 1529
12. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1530
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1531
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1532
10.20944/preprints202301.0224.v1). 1533
13. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 1534
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1535
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1536
14. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 1537
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 1538
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 1539
10.20944/preprints202301.0088.v1). 1540
15. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 1541
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 1542
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1543
16. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 1544
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1545
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1546
17. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 1547
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 1548
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 1549
10.20944/preprints202301.0105.v1). 1550
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 1552
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 1553
10.20944/preprints202301.0088.v1). 1554
19. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1555
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1556
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1557
20. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1558
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 1559
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 1560
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1561
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1562
21. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 1563
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 1564
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1565
22. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1566
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1567
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1568
10.20944/preprints202212.0324.v1). 1569
23. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 1570
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 1571
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1572
10.20944/preprints202211.0576.v1). 1573
24. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 1574
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 1575
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 1576
25. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 1577
The Cancer’s Extreme Recognition With Different Types of Extreme 1578
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 1579
ResearchGate 2023, (doi: 10.13140/RG.2.2.18494.15680). 1580
26. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1581
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1582
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1583
2023, (doi: 10.13140/RG.2.2.32530.73922). 1584
27. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 1585
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 1586
SuperHyperClique on Cancer’s Recognition called Neutrosophic 1587
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 1588
28. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 1589
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 1590
29. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 1592
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 1593
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 1594
ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849). 1595
30. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 1596
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 1597
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 1598
(doi: 10.13140/RG.2.2.17385.36968). 1599
31. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 1600
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 1601
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1604
Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 1605
33. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 1606
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1607
2023, (doi: 10.13140/RG.2.2.35774.77123). 1608
34. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 1609
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 1610
Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 1611
10.13140/RG.2.2.36141.77287). 1612
35. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 1613
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1614
10.13140/RG.2.2.29430.88642). 1615
36. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 1616
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 1617
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1618
10.13140/RG.2.2.11369.16487). 1619
37. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 1620
and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 1621
2022 (doi: 10.13140/RG.2.2.29173.86244). 1622
38. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 1623
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 1624
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 1625
10.13140/RG.2.2.25385.88160). 1626
39. Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: 1627
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 1628
United States. ISBN: 979-1-59973-725-6 1629
(http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 1630
40. Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL 1631
KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 1632
33131 United States. ISBN: 978-1-59973-743-0 1633
(http://fs.unm.edu/NeutrosophicDuality.pdf). 1634
View publication stats

New Ideas On Super Reflections by Hyper Rotations of Path SuperHyperColoring in Cancer's Neutrosophic Recognition and Neutrosophic SuperHyperGraph

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

New Ideas On Super Reflections by Hyper Rotations of Path SuperHyperColoring in Cancer's Neutrosophic Recognition and Neutrosophic SuperHyperGraph

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

New Ideas On Super Reﬂections By Hyper Rotations Of Path SuperHyperColoring

Preprint · February 2023

293 PUBLICATIONS 3,029 CITATIONS

On Algebraic Structures and Algebraic Hyperstructures View project

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

The user has requested enhancement of the downloaded file.

New Ideas On Super Reflections By Hyper Rotations Of 2

Path SuperHyperColoring In Cancer’s Neutrosophic 3

Recognition and Neutrosophic SuperHyperGraph 4

Henry Garrett · Independent Researcher · Department of Mathematics · 6

DrHenryGarrett@gmail.com · Manhattan, NY, USA 7

In this research, (Different Neutrosophic Types of Neutrosophic Path 9

SuperHyperColoring). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an 10

ordered pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } 11

and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called Neutrosophic e-Path 12

SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such that Va ∈ Ei , Ej ; Neutrosophic 13

re-Path SuperHyperColoring if ∀Ei ∈ E 0 , ∃Ej ∈ E 00 such that Ei = Ej ; Neutrosophic 14

v-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such that Vi , Vj ∈ Ea ; Neutrosophic 15

rv-Path SuperHyperColoring if ∀Vi ∈ V 0 , ∃Vj ∈ V 00 such that Vi = Vj ; Neutrosophic 16

Path SuperHyperColoring if it’s either of Neutrosophic e-Path SuperHyperColoring, 17

Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, 18

and Neutrosophic rv-Path SuperHyperColoring. ((Neutrosophic) Path 19

SuperHyperColoring). Assume a Neutrosophic SuperHyperGraph (NSHG) S is an 20

ordered pair S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) 21

E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme Path SuperHyperColoring if it’s 22

either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 23

SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, and Neutrosophic 24

rv-Path SuperHyperColoring and C(N SHG) for an Extreme SuperHyperGraph 25

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

high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 27

sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 28

form the Extreme Path SuperHyperColoring; a Neutrosophic Path SuperHyperColoring 29

if it’s either of Neutrosophic e-Path SuperHyperColoring, Neutrosophic re-Path 30

SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, and Neutrosophic 31

rv-Path SuperHyperColoring and C(N SHG) for a Neutrosophic SuperHyperGraph 32

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 33

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 34

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 35

that they form the Neutrosophic Path SuperHyperColoring; an Extreme Path 36

SuperHyperColoring SuperHyperPolynomial if it’s either of Neutrosophic e-Path 37

SuperHyperColoring, Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path 38

SuperHyperColoring, and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for 39

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

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

of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 43

the Extreme power is corresponded to its Extreme coefficient; a Neutrosophic Path 45

SuperHyperColoring SuperHyperPolynomial if it’s either of Neutrosophic e-Path 46

SuperHyperColoring, Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path 47

SuperHyperColoring, and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for 48

a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 49

SuperHyperPolynomial contains the Neutrosophic coefficients defined as the 50

Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 51

SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 52

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 53

power is corresponded to its Neutrosophic coefficient; an Extreme R-Path 55

SuperHyperColoring if it’s either of Neutrosophic e-Path SuperHyperColoring, 56

Neutrosophic re-Path SuperHyperColoring, Neutrosophic v-Path SuperHyperColoring, 57

and Neutrosophic rv-Path SuperHyperColoring and C(N SHG) for an Extreme 58

SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 59

SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 60

consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 61

SuperHyperVertices such that they form the Extreme Path SuperHyperColoring; a 62