New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph With Bipartite and Path by CONNECTIVE DOMINATION As Hyper Decoration On Super Density

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/372747857
New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With

Bipartite and Path By CONNECTIVE DOMINATION As Hyper Decoration On Super
Density
Preprint · July 2023

DOI: 10.5281/zenodo.8196132
CITATIONS
1 author:
Henry Garrett
532 PUBLICATIONS 26,551 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
Number Graphs And Numbers View project
All content following this page was uploaded by Henry Garrett on 29 July 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 In Recognition of Cancer And Neutrosophic 2
SuperHyperGraph With Bipartite and Path By 3
CONNECTIVE DOMINATION As Hyper Decoration On 4
Super Density 5
Henry Garrett · Independent Researcher · Department of Mathematics · 7
DrHenryGarrett@gmail.com · Manhattan, NY, USA 8
1 ABSTRACT 9
In this scientific research, (Different Neutrosophic Types of Neutrosophic 10
SuperHyperCONNECTIVE DOMINATION). Let a Neutrosophic SuperHyperGraph (NSHG) S be 11
a pair S = (V, E). Consider a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs }. Then 12
V 0 is called Neutrosophic SuperHyperCONNECTIVE DOMINATION if the following expressions, 13
terms and statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria 14
holds. 15
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 Vi ∈V 0 Vi ∈V 0
X X X
= max
00 ⊆V
|{ ( T (Vi ), I(Vi ), F (Vi )) | ∀Vi ∈ VN SHG , ∃Vj ∈ V 00 :
V N SHG 00 00 00
Vi ∈V Vi ∈V Vi ∈V
TV0 (Vi , Vj ∈ Ei0 ) ≥ min[TV (Vi0 ), TV (Vj0 )]Vi0 ,Vj0 ∈P :Vi ,...,Vj ,
IV0 (Vi , Vj ∈ Ei0 ) ≥ min[IV (Vi0 ), IV (Vj0 )]Vi ,Vj ∈Ei0 Vi0 ,Vj0 ∈P :Vi ,...,Vj ,
and FV0 (Ei0 )(Vi , Vj ∈ Ei0 ) ≥ min[FV (Vi0 ), FV (Vj0 )]Vi ,Vj ∈Ei0 Vi0 ,Vj0 ∈P :Vi ,...,Vj
}
In this scientific research, new configurations are introduced for the new 16
SuperHyperNotions, namely a CONNECTIVE DOMINATION and a Neutrosophic 17
CONNECTIVE DOMINATION. Two different SuperHyperDefinitions were started for 18
them, but research has progressed and SuperHyperNotion, SuperHyperUniform, and 19
SuperHyperClass are well-defined and well-reviewed based on them. Literature review is 20
implemented throughout this research. To shine the light and importance of this 21
research, a comparison between this SuperHyperNotion with other SuperHyperNotions 22
and basic SuperHyperNumbers is presented. Definitions are followed by examples and 23
examples, so clarifications are guided by various tools. Applications are designed to 24
understand the theoretical aspect of this ongoing research. “Cancer diagnosis” are the 25
things that are being researched to explore the challenges that make sense in ongoing 26
research and future research. It is a special case. Cells are viewed in the intended 27
manner. There are different types of them. Some are individual and some are well 28
modeled by groups of cells. All these types are officially called “SuperHyperVertex”, but 29
the relationships between them all are officially called “SuperHyperEdge”. 30
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph” frameworks are selected and 31
selected for research on “Cancer Diagnosis”. Thus, these complex and dense 32
super-hypermodels open avenues for research on theoretical aspects and “cancer 33
diagnosis”. Ways to pursue this scientific research have been considered. It has also 34
been formally collected in the form of several questions and problems. It is useful to 35
define a “neutrosophic” version of CONNECTIVE DOMINATION. Since there are 36
more ways to get type results a CONNECTIVE DOMINATION becomes more 37
understandable. In order to master the Neutrosophic CONNECTIVE DOMINATION, 38
there is a need to “re-define” the concept of “CONNECTIVE DOMINATION mastery”. 39
SuperHyperVertices and SuperHyperEdges are assigned by alphabetical labels. In this 40
method, the position of tags is used to assign values. Suppose a CONNECTIVE 41
DOMINATION. If the specified table contains “values of vertices, supervertices, edges, 42
hyperedges, and hyperedges belonging to Neutrosophic SuperHyperGraph” with key 43
points, it is redefined. ”values of vertices & number of positions in alphabet”, ”Values 44
of SuperVertices&maximum values of its vertices”, ”values of edges&maximum values of 45
its vertices”, ”super edge values&max values of its vertices”, “super edge values” and 46
maximum values of its endpoints”. To get examples and structural examples, I would 47
like to introduce the next SuperHyperClass SuperHyperGraph based on CONNECTIVE 48
DOMINATION. This is the original. Having the foundation of the previous definition in 49
the SuperHyperClass type would be disciplined. If there is a need to have all 50
CONNECTIVE DOMINATION until CONNECTIVE DOMINATION, then it is 51
officially called “CONNECTIVE DOMINATION”, but otherwise, it is not 52
CONNECTIVE DOMINATION. There is some explanation for the original definition 53
titled “CONNECTIVE DOMINATION”. These two examples are further explored and 54
distinguished because they are characterized in the SuperHyperClass disciplinary 55
methods based on a dominant CONNECTIVE DOMINATION. Because of having 56
CONNECTIVE DOMINATION, there is a need to “re-define” the concept of 57
“neutrosophic CONNECTIVE DOMINATION” and “neutrosophic CONNECTIVE 58
DOMINATION”. SuperHyperVertices and SuperHyperEdges are assigned by 59
alphabetical labels. In this method, the position of tags is used to assign values. 60
Consider a Neutrosophic SuperHyperGraph. “Neutrosophic SuperHyperGraph” is 61
redefined if the desired table exists. And if the desired table exists, a CONNECTIVE 62
DOMINATION is redefined to a “Neutrosophic CONNECTIVE DOMINATION”. It is 63
useful to define a “Neutrosophic” version of SuperHyperClasses. Since there are more 64
ways to obtain Neutrosophic type results, a SuperHyper- Neutrosophic CONNECTIVE 65
DOMINATION becomes more understandable. Consider a Neutrosophic 66
SuperHyperGraph. If the desired table exists, there are a number of Neutrosophic 67
SuperHyperClasses. So are SuperHyperPath, SuperHyperCycle, SuperHyperStar, 68
SuperHyperBipartite, SuperHyperMultiPartite and SuperHyperWheel. ”Neutrosophic 69
SuperHyperPath”, “Neutrosophic SuperHyperCycle”, “Neutrosophic SuperHyperStar”, 70
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite” and 71
“Neutrosophic SuperHyperWheel”. A graph is SuperHyperUniform if it is a 72
SuperHyperGraph and the number of SuperHyperEdges elements is the same. Consider 73
a Neutrosophic SuperHyperGraph. There are a number of SuperHyperClasses as follows. 74
It is a SuperHyperPath if there is only one SuperVertex as an intersection between two 75
given SuperHyperEdges with two exceptions. If only one SuperVertex is given as an 76
intersection between two SuperHyperEdges, it is SuperHyperCycle. It is 77
SuperHyperStar and only one SuperVertex as intersection among all SuperHyperEdges. 78
It is SuperHyperBipartite, and only one SuperVertex is given as the intersection between 79
two SuperHyperEdges, and these SuperVertices, which form two distinct sets, have no 80
SuperHyperEdge in common. This is SuperHyperMultiPartite. Only one SuperVertex is 81
given as an intersection between two SuperHyperEdges, and these SuperVertices, which 82
form separate multisets, have no SuperHyperEdge in common. If only one 83
SuperHyperEdge among the given two SuperHyperEdges is a SuperHyperWheel and a 84
SuperVertex has a SuperHyperEdge with any regular SuperVertex. SuperHyperModel 85
suggests specific designs and specific architectures. SuperHyperModel is officially called 86
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, 87
the “special” cells and the “special group” of cells are SuperHyperModeled as 88
“SuperHyperVertices” and the common and desired properties between the “special” 89
cells and the “special group” of cells. SuperHyperModeled as “SuperHyperEdges”. 90
Sometimes, to have a more accurate SuperHyperModel, it is useful to have some degree 91
of determinism, uncertainty, and neutrality, in this case the SuperHyperModel is called 92
“Neutrosophic”. In future scientific research, the foundation will be based on “diagnosis 93
of cancer” and the results and definitions will be introduced in redeemed methods. 94
Cancer diagnosis in long-term practice. The specific region is assigned by the model 95
(called SuperHyperGraph) and the long cycle of movement of the cancer is determined 96
by this scientific research. Sometimes the movement of cancer is not easy to detect, 97
because there is certainty, uncertainty and neutrality about the movements and effects 98
of cancer on that area. This event leads us to choose another model [which is said to be 99
the Neutrosophic superhypergraph] in order to have a proper understanding of what 100
happened and was done. There are some specific models, which are well known and 101
have names, and some SuperHyperGeneral SuperHyperModels. The movements and 102
effects of cancer in complex pathways and between complex groups of cells can be 103
visualized with a Neutrosophic SuperHyperPath (-/SuperHyperCycle, SuperHyperStar, 104
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The goal is to find 105
the longest CONNECTIVE DOMINATION or the strongest CONNECTIVE 106
DOMINATION in those Neutrosophic SuperHyperModels. Some general results are 107
presented for the longest CONNECTIVE DOMINATION called CONNECTIVE 108
DOMINATION and the strongest CONNECTIVE DOMINATION called Neutrosophic 109
CONNECTIVE DOMINATION. Beyond that in SuperHyperStar, all possible 110
SuperHyperPaths have only two SuperHyperEdges, but it is not enough as having at 111
least three SuperHyperEdges is necessary to form any style of cycle. There is no form of 112
any cycle, but literally, it is the transformation of any cycle. It literally transforms and 113
does not form. A basic introduction to the theory of CONNECTIVE DOMINATION 114
Neutrosophic, SuperHyperGraphs and Neutrosophic SuperHyperGraphs is suggested. 115
Keywords: Neutrosophic SuperHyperGraph, SuperHyperCONNECTIVE DOMINATION, 116
Cancer’s Neutrosophic Recognition 117
AMS Subject Classification: 05C17, 05C22, 05E45 118
2 Applied Notions Under The Scrutiny Of The 119
Motivation Of This Scientific Research 120
In this scientific research, there are ideas in the prominent frameworks of motivations. I 121
try to bring motivations in narrative ways. Some Cells have faced attacks from the 122
established situation with cancer attacks in this case, there is some analysis embedded 123
in the case current situations where cells can be labeled as some groups and some 124
groups or individuals are overlabeled, all from behaviors to overcome cancer attacks. In 125
embedded situations, cell individuals and cell groups can be considered as “new groups”. 126
So it encourages us to find suitable SuperHyperModels for more appropriate analysis 127
about this dirty story. I found SuperHyperModels, officially called “SuperHyperGraphs” 128
and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, cells and groups of 129
cells are defined as “SuperHyperVertices” and relationships between individual cells and 130
groups of cells are defined as “SuperHyperEdges”. So this is another motivation for us 131
to do research on this SuperHyperModel based on “cancer diagnosis”. Sometimes, 132
things get worse. The situation has passed certainty and precise style. So it is beyond 133
them. There are three descriptions, i.e., degrees of determination, uncertainty, and 134
neutrality, for any object based on ambiguous forms, i.e., incomplete data, imprecise 135
data, and uncertain analysis. The second model can be considered in the previous 136
SuperHyperModel. This is SuperHyperModel. This is SuperHyperGraph but officially 137
called “Neutrosophic SuperHyperGraphs”. Cancer is a disease, but the model is 138
supposed to understand what happens in this phenomenon. The special case of this 139
disease is considered and some parameters are used as consequences of the model. Cells 140
are attacked by the disease, but the movement of cancer is in a specific area. Knowing 141
the mind of cancer can help to find some cures for this disease. SuperHyperGraph and 142
Neutrosophic Super-HyperGraph are super-hypermodels used in “cancer diagnosis” and 143
both are the foundation of the background of this scientific research. Sometimes cancer 144
has occurred in an area full of cells, cell groups, and embedded styles. In this section, 145
SuperHyperModel proposes based on the links of cancer movements in the form of unity 146
styles with the formation of design and architecture officially called “CONNECTIVE 147
DOMINATION”, in the themes of specialized terms and common words. Particle for 148
direct object. Applied concepts under the investigation of the motivation of this 149
scientific research. The “SuperHyper” prefix refers to the theme of embedded styles for 150
background discovery for SuperHyperNotions. Cancer diagnosis in long-term practice. 151
The specific region is assigned by the model (called SuperHyperGraph) and the long 152
cycle of movement of the cancer is determined by this scientific research. Sometimes the 153
movement of Cancer is not easy to identify because there is certainty, uncertainty and 154
neutrality about the movements and effects of Cancer in that region. This event leads 155
us to choose another model [said to be Neutrosophic SuperHyperGraph]. Easy 156
understanding of what happened and what was done. There are some specific models 157
that are well known and named and some general models. The movements and effects 158
of cancer in complex pathways and between complex groups of cells can be visualized by 159
a neurosophic superhyperpath (-/SuperHyperCycle, SuperHyperStar, 160
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The goal is to find 161
CONNECTIVE DOMINATION or Neutrosophic CONNECTIVE DOMINATION for 162
SuperHyperModels in it. Some general results are presented. Beyond that in 163
SuperHyperStar, all possible Neutrosophic SuperHyperPaths have only two 164
SuperHyperEdges, but it is not enough as having at least three SuperHyperEdges is 165
necessary to form any style of cycle. There is no form of cycle, but it is literally a form 166
of any cycle. It literally transforms and does not form. 167
Question 2.1. How to define “SuperHyperNotions and to do research” to find the 168
“CONNECTIVE DOMINATION Rate” of any cell or groups of cells based on fixed cell 169
or fixed group of cells broadly, “CONNECTIVE DOMINATION Rate” based on fixed 170
groups or fixed cells. Groups of groups of cells? 171
Question 2.2. What are the best descriptions for “diagnosing cancer” in terms of 172
these chaotic and dense super-hypermodels in which embedded concepts are depicted? 173
This motivation to find concepts to use in this dense model is called 174
“SuperHyperGraphs”. So it motivates us to define different types of “CONNECTIVE 175
DOMINATION” and “neutrosophic CONNECTIVE DOMINATION” over 176
“superhypergraph” and “neutrosophic superhypergraph”. Then this scientific research 177
has taken more motivations to define SuperHyperClasses and find some connections 178
among this SuperHyperNotion with other SuperHyperNotions. It motivates us to obtain 179
examples and examples to clarify the framework of this scientific research. The general 180
results and some of the results about some of the connections are the ways that the key 181
point of this scientific research, “diagnosis of cancer” is more understandable and clear. 182
The framework of this research is as follows. First, I will introduce the basic 183
definitions to clarify the basics. In the “Introductions” subsection, basic definitions 184
about SuperHyperGraphs and Neutrosophic SuperHyperGraph are introduced and 185
discussed in depth. Basic concepts are thoroughly explained and illustrated, and 186
sometimes a literature review is used to make sense of what is to come in the coming 187
sections. The main definitions and their explanations, along with some results on the 188
new concepts, CONNECTIVE DOMINATION and Neutrosophic CONNECTIVE 189
DOMINATION, are specified in the sections “CONNECTIVE DOMINATION” and 190
“Neutrosophic CONNECTIVE DOMINATION”. In the concept of dealing with results 191
and in CONNECTIVE DOMINATION to create logic about the continuation of the 192
scientific research, the ideas of SuperHyperUniform and Neutrosophic 193
SuperHyperUniform are introduced and as their consequences, the corresponding 194
SuperHyperClasses are specified to summarize the work done in this section, as “Results 195
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. Going back 196
to the core concepts, clever steps towards common concepts to extend new concepts in 197
new frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in “Results 198
on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses” sections. 199
There is the initial scientific research on supergeneral relations and as the final and final 200
part of the theoretical scientific research is available in the section “General results”. 201
Some general SuperHyperRelations are fundamental and are known as fundamental 202
SuperHyperNotions, as in “General results” were extracted and discussed. 203
“CONNECTIVE DOMINATION”, “Neutrosophic CONNECTIVE DOMINATION”, 204
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. 205
There are curious questions about what has been done about SuperHyperNotions to 206
make sense of the superiority of this scientific research and to discover the word “best” 207
as a description and adjective of this scientific research as presented in the 208
“CONNECTIVE DOMINATION” section. The keyword of this scientific research was 209
presented in the section “Applications in cancer diagnosis” with two cases and 210
sub-sections “Case 1: Initial steps towards SuperHyperBipartite as SuperHyperModel” 211
and “Case 2: Incremental steps towards SuperHyperMultiperdel as SuperHyper. In the 212
“open issues” section, there is a detailed examination and recognition of what was done 213
in this scientific research and what happened in this scientific research in the form of 214
“questions” and “issues” in order to understand this scientific research in an outstanding 215
style, the advantages and limitations of this scientific research in addition to What has 216
been done in this scientific research is stated in the “conclusion and final remarks” 217
section. 218
3 Neutrosophic Preliminaries Of This Scientific 219
Research On the Redeemed Ways 220
In this section, the basic material in this scientific research, is referred to [Single Valued 221
Neutrosophic Set](Ref. [1],Definition 2.2,p.2), [Neutrosophic Set](Ref. [1],Definition 222
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 2.5,p.2), 223
[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 224
2.7,p.3), [t-norm](Ref. [1], Definition 2.7, p.3), and [Characterization of the 225
Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 2.7,p.3), [Neutrosophic 226
Strength of the Neutrosophic SuperHyperPaths] (Ref. [1],Definition 5.3,p.7), and 227
[Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)] 228
(Ref. [1],Definition 5.4,p.7). Also, the new ideas and their clarifications are addressed 229
to Ref. [1]. 230
In this subsection, the basic material which is used in this scientific research, is 231
presented. Also, the new ideas and their clarifications are elicited. 232
Definition 3.1 (Neutrosophic Set). (Ref. [1],Definition 2.1,p.1). 233
Let X be a Eulerian-Path-Cut 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 234
+
]− 0, 1 [. 235
Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [1],Definition 2.2,p.2). 236
Let X be a Eulerian-Path-Cut 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. [1],Definition 237
2.5,p.2). 238
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 239
pair S = (V, E), where 240
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 241
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 242
1, 2, . . . , n); 243
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 244
V; 245
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 246
1, 2, . . . , n0 ); 247
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 248
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 249
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 250
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n );
0 251
Figure 1. The Neutrosophic SuperHyperGraphs with a illustrated SuperHyperModeling

on Recognition of Cancer in the Neutrosophic Example (3.6)
(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 . 252
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 253
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 254
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 255
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 256
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 257
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 258
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 259
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 260
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 261
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 262
Example 3.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 263
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 264
• On the Figure (1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 265
notion, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. E1 266
and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop 267
Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus 268
in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 269
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is 270
Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it 271
as a Neutrosophic endpoint. 272
notion, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 274
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a 275
Figure 2. TThe Neutrosophic SuperHyperGraphs with a illustrated SuperHyperModel-

ing on Recognition of Cancer in the Neutrosophic Example (3.6)
Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 276
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 277
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 278
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 279
• On the Figure (3), the SuperHyperNotion, namely, SuperHyperGirth, is up. 280
E1 , E2 and E3 are some empty SuperHyperEdges but E4 is a SuperHyperEdge. 281
Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, 282
namely, E4 . 283
• On the Figure (4), there’s no empty SuperHyperEdge but E3 are a loop 284
SuperHyperEdge on {F } and there are some SuperHyperEdges, namely, E1 on 285
{H, V1 , V3 }, alongside E2 on {O, H, V4 , V3 } and E4 , E5 on {N, V1 , V2 , V3 , F }. 286
• On the Figure (5),there’s neither empty SuperHyperEdge nor loop 287
SuperHyperEdge. 288
• On the Figure (6), there’s neither empty SuperHyperEdge nor loop 289
SuperHyperEdge. 290
SuperHyperEdge. 292
SuperHyperEdge. 294
SuperHyperEdge. 296
SuperHyperEdge. 298
SuperHyperEdge. 300
Figure 3. The Neutrosophic SuperHyperGraphs with a illustrated SuperHyperModeling

on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 4. The Connected Neutrosophic SuperHyperGraphs with a illustrated Super-

HyperModeling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 5. The Connected Neutrosophic SuperHyperGraphs mentioned as the SuperHy-

perModeling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 6. The Connected Neutrosophic SuperHyperGraphs with a illustrated Super-

HyperModeling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 7. The Connected Neutrosophic SuperHyperGraphs depicted SuperHyperMod-

eling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 8. The Connected Neutrosophic SuperHyperGraphs with dense SuperHyper-

Modeling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 9. The Connected Neutrosophic SuperHyperGraphs with a messy SuperHyper-

Modeling on Recognition of Cancer in the Neutrosophic Example (3.6)
Figure 10. The Connected Neutrosophic SuperHyperGraphs with highly-embedding-

connected SuperHyperModeling on Recognition of Cancer in the Neutrosophic Example
(3.6)
Figure 11. The Connected Neutrosophic SuperHyperGraphs with a SuperHyperModel-

SuperHyperEdge. 302
SuperHyperEdge. 304
SuperHyperEdge. 306
SuperHyperEdge. 308
SuperHyperEdge. 310
SuperHyperEdge. 312
SuperHyperEdge. 314
SuperHyperEdge. 316
SuperHyperEdge. 318
SuperHyperEdge. 320
SuperHyperEdge. 322
Figure 12. The Connected Neutrosophic SuperHyperGraphs with highly-multiple-

connected-style SuperHyperModeling on Recognition of Cancer in the Neutrosophic
Example (3.6)


Figure 15. The Connected Neutrosophic SuperHyperGraphs with Linearly-Connected

SuperHyperModeling on Recognition of Cancer in the Neutrosophic Example (3.6)

Figure 17. The Connected Neutrosophic SuperHyperGraphs with a Linearly-over-

packed SuperHyperModeling on Recognition of Cancer in the Neutrosophic Example
(3.6)





Definition 3.7 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 323
(Ref. [1],Definition 2.7,p.3). 324
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 325
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 326
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 327
characterized as follow-up items. 328
(i) If |Vi | = 1, then Vi is called vertex; 329
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 330
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 331
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 332
HyperEdge; 333
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 334
SuperEdge; 335
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 336
SuperHyperEdge. 337
If we choose different types of binary operations, then we could get hugely diverse 338
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 339
Definition 3.8 (t-norm). (Ref. [1], Definition 2.7, p.3). 340
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 341
for x, y, z, w ∈ [0, 1]: 342
(i) 1 ⊗ x = x; 343
(ii) x ⊗ y = y ⊗ x; 344
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 345
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 346
Definition 3.9. 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.10. 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.11. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 347
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 348
pair S = (V, E), where 349
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 350
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 351
1, 2, . . . , n); 352
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 353
V; 354
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 355
1, 2, . . . , n0 ); 356
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 357
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 358
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 359
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ).
0 360
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 361
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 362
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 363
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 364
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 365
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 366
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 367
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 368
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 369
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 370
Definition 3.12 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 371
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 373
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 374
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 375
characterized as follow-up items. 376
(i) If |Vi | = 1, then Vi is called vertex; 377
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 378
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 379
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 380
HyperEdge; 381
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 382
SuperEdge; 383
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 384
SuperHyperEdge. 385
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 386
some restrictions and conditions on SuperHyperGraph. The special case of this 387
SuperHyperGraph makes the patterns and regularities. 388
Definition 3.13. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 389
number of elements of SuperHyperEdges are the same. 390
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 391
introduced. It makes to have SuperHyperUniform more understandable. 392
Definition 3.14. Assume a Neutrosophic SuperHyperGraph. There are some 393
SuperHyperClasses as follows. 394
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 395
intersection amid two given SuperHyperEdges with two exceptions; 396
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 397
given SuperHyperEdges; 398
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 399
SuperHyperEdges; 400
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 401
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 402
no SuperHyperEdge in common; 403
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 404
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 405
has no SuperHyperEdge in common; 406
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 407
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 408
common SuperVertex. 409
Example 3.15. In the Figure (23), the connected Neutrosophic SuperHyperPath 410
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 411
Neutrosophic SuperHyperModel (23), is the notion. 412
Example 3.16. In the Figure (24), the connected Neutrosophic SuperHyperCycle 413
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 414
SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is up. 415
Example 3.17. In the Figure (25), the connected Neutrosophic SuperHyperStar 416
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 417
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 418
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 419
the Neutrosophic SuperHyperModel (25), is up. 420
Figure 23. a Neutrosophic SuperHyperPath Associated to the Notions in the Example

(3.15)
Figure 24. a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions

in the Neutrosophic Example (3.16)
Figure 25. a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions in

the Neutrosophic Example (3.17)
Example 3.18. In the Neutrosophic Figure (26), the connected Neutrosophic 421
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 422
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 423
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 424
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 425
SuperHyperModel (26), is up. 426
Example 3.19. In the Figure (27), the connected Neutrosophic 427
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 428
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 429
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 430
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 431
is up. 432
Example 3.20. In the Neutrosophic Figure (28), the connected Neutrosophic 433
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 434
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 435
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 436
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is up. 437
Definition 3.21. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG)

S. Then a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic
SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic 438
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 439
of following conditions hold: 440
(i) Vi , Vi+1 ∈ Ei0 ; 441
Figure 26. Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutro-

sophic Notions in the Example (3.18)
Figure 27. a Neutrosophic SuperHyperMultipartite Associated to the Notions in the

Example (3.19)
Figure 28. a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutro-

sophic Notions in the Neutrosophic Example (3.20)
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 442
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 443
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 444
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 445
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 446
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 447
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 448
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 449
Vi0 , Vi+1
0
∈ Ei0 . 450
Definition 3.22. (Characterization of the Neutrosophic SuperHyperPaths). 451
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a

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

Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV)
Table 1. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHy-

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.27)
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
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 460
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 461
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 462
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 463
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 464
Definition 3.24 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 465
(NSHE)). (Ref. [1],Definition 5.4,p.7). 466
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 467
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 468
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 469
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 470
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 471
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 472
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 473
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 475
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 476
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 478
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 479
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 480
where 1 ≤ i, j ≤ s. 481
For the sake of having a Neutrosophic notion, there’s a need to “redefine” the 482
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 483
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 484
procedure, there’s the usage of the position of labels to assign to the values. 485
Definition 3.25. Assume a Neutrosophic SuperHyperGraph (SHG) S is a pair 486
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 487
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 488
more ways to get Neutrosophic type-results to make a Neutrosophic more 489
understandable. 490

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

perEdges Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition
(3.27)
Definition 3.26. Assume a Neutrosophic SuperHyperGraph (SHG) S is a pair 491
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 492
holds. Thus Neutrosophic SuperHyperPath , notion, SuperHyperStar, 493
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 494
Neutrosophic SuperHyperPath, Neutrosophic SuperHyperCycle, 495
Neutrosophic SuperHyperStar, Neutrosophic SuperHyperBipartite, 496
Neutrosophic SuperHyperMultiPartite, and Neutrosophic 497
SuperHyperWheel if the Table (2) holds. 498
It’s useful to define a “Neutrosophic” version of a Neutrosophic notion. Since there’s 499
more ways to get type-results to make a Neutrosophic notion more Neutrosophicly 500
understandable. 501
For the sake of having a Neutrosophic notion, there’s a need to “redefine” the 502
Neutrosophic notion of “Neutrosophic notion”. The SuperHyperVertices and the 503
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 504
procedure, there’s the usage of the position of labels to assign to the values. 505
Definition 3.27. Assume a notion. It’s redefined a Neutrosophic notion if the 506
Table (3) holds. 507
Example 3.28. Referred to the Example (3.6), assume a Neutrosophic 508
SuperHyperGraph (SHG) S is a pair S = (V, E) in the mentioned Neutrosophic Figures 509
in every Neutrosophic items. 510
SuperHyperGraph (SHG), is up in the illustration of the Table (4). 512
Table 4. The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyper-

Edges Belong to The Neutrosophic SuperHyperGraph
Vi (TVi , IVi , FVi ) Ei (TEi , IEi , FEi )
V1 (0.13, 0.13, 0.13) E1 (0, 0, 0)
V2 (0.13, 0.13, 0.13) E2 (0.13, 0.13, 0.13)
V3 (0.15, 0.15, 0.15) E3 (0, 0, 0)
V4 (0.14, 0.14, 0.14) E4 (0.14, 0.14, 0.14)

V1 (0.13, 0.13, 0.13) E1 (0, 0, 0)
V2 (0.03, 0.03, 0.03) E2 (0, 0, 0)
V3 (0.15, 0.15, 0.15) E3 (0, 0, 0)
V4 (0.14, 0.14, 0.14) E4 (0.14, 0.14, 0.14)

V1 (0.13, 0.13, 0.13) E1 (0, 0, 0)
V2 (0.11, 0.11, 0.11) E2 (0, 0, 0)
V3 (0.14, 0.14, 0.14) E3 (0, 0, 0)
- - E4 (0.14, 0.14, 0.14)
4 Main Resultant 519
Definition 4.1. (Different Neutrosophic Types of Neutrosophic SuperHyperCONNECTIVE 520
DOMINATION). 521
Let a Neutrosophic SuperHyperGraph (SHG) S be a pair S = (V, E). Consider a 522
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs }. Then V 0 is called Neutrosophic 523
SuperHyperCONNECTIVE DOMINATION if the following expressions, terms and statements is 524

V1 (0.13, 0.13, 0.13) E1 (0.08, 0.08, 0.08)
V2 (0.11, 0.11, 0.11) E2 (0.15, 0.15, 0.15)
V3 (0.05, 0.05, 0.05) E3 (0, 0, 0)
V4 (0.12, 0.12, 0.12) E4 (0.14, 0.14, 0.14)
{F } (0.06, 0.06, 0.06) E5 (0.14, 0.14, 0.14)
{H} (0.08, 0.08, 0.08) - -
{N } (0.14, 0.14, 0.14) - -
{O} (0.15, 0.15, 0.15) - -
Figure 29. a Neutrosophic SuperHyperBipartite Neutrosophic Associated to the

Neutrosophic Notions in the Neutrosophic Example (4.2)

Edges Belong to The Neutrosophic SuperHyperBipartite
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.26, 0.26, 0.26) - -
V3 (0.26, 0.26, 0.26) - -
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria holds. 525
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 Vi ∈V 0 Vi ∈V 0
X X X
= 00
max |{ ( T (Vi ), I(Vi ), F (Vi )) | ∀Vi ∈ VSHG , ∃Vj ∈ V 00 :
V ⊆VSHG 00 00 00
Vi ∈V Vi ∈V Vi ∈V
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
}
Example 4.2. Assume a Neutrosophic SuperHyperBipartite (SHG) S is a pair 526
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 527
SuperHyperBipartite (SHG), is up in the illustration of the Table (8). 529
Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Assume 530
SuperHyperPart {Vi }7i=1 . Consider a Neutrosophic SuperHyperSet V 0 = {V1 }. 531
Then V 0 is called Neutrosophic SuperHyperCONNECTIVE DOMINATION since the 532
following expressions, terms and statements is called Neutrosophic 533






Figure 36. a Neutrosophic SuperHyperPath Neutrosophic Associated to the Neutro-







SuperHyperCONNECTIVE DOMINATION criteria holds. 534

X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 ={V } Vi ∈V 0 ={V 0 ={V }
1 1} Vi ∈V 1
= (0.26, 0.26, 0.26) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) | V2 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
TV (E2 ) = 0.26 = min[TV 0 (V2 ), TV 0 (V1 )]V2 ,V1 ∈E2 ,
IV0 (E2 ) = 0.26 = min[IV 0 (V2 ), IV 0 (V1 )]V2 ,V1 ∈E2 ,
and FV0 (E2 ) = 0.26 = min[FV 0 (V2 ), FV 0 (V1 )]V2 ,V1 ∈E2 ,
,
V3 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
TV0 (E2 ) = 0.26 = min[TV 0 (V3 ), TV 0 (V1 )]V3 ,V1 ∈E2 ,
,
V4 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V5 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}

V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.26, 0.26, 0.26) - -
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
SuperHyperPart {Vi }7i=1 . Consider a Neutrosophic SuperHyperSet V 0 = {Vi }2i=1 . 538
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 ={Vi }2i=1 Vi ∈V 0 ={Vi }2i=1 Vi ∈V 0 ={Vi }2i=1
= (0.5, 0.5, 0.5) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
TV (E2 ) = 0.26 = min[TV (V3 ), TV (V1 )]V3 ,V1 ∈E2 ,
0 0

,
V4 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V5 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.24, 0.24, 0.24) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (0.74, 0.74, 0.74) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
0 0

,
V5 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.24, 0.24, 0.24) V5 (0.24, 0.24, 0.24)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (0.98, 0.98, 0.98) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
0 0

,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.24, 0.24, 0.24) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (1.22, 1.22, 1.22) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (1.46, 1.46, 1.46) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
}
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.24, 0.24, 0.24) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
Edges Belong to The Neutrosophic SuperHyperPath
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.26, 0.26, 0.26) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (1.7, 1.7, 1.7).
Example 4.3. Assume a Neutrosophic SuperHyperPath (SHG) S is a pair S = (V, E) 577
in the mentioned Neutrosophic Figures in every Neutrosophic items. 578
SuperHyperCycle (SHG), is up in the illustration of the Table (15). 580
Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Assume 581
SuperHyperExternal {Vi }7i=1 and non-SuperHyperInternal {Vi }34 i=8 . Consider a 582
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 }. Then V 0 is called Neutrosophic 583
SuperHyperCONNECTIVE DOMINATION since the following expressions, terms and 584
statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria holds. 585
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 }
X
I(Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 }
= (1.04, 1.04, 1.04) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=11,15,19,24 ∈ VSHG \ V , ∃V1 ∈ V :
TV0 (E1 ) = 0.26 = min[TV 0 (Vii=11,15,19,24 ), TV 0 (V1 )]Vii=11,15,19,24 ,V1 ∈E1 ,
IV0 (E1 ) = 0.26 = min[IV 0 (Vii=11,15,19,24 ), IV 0 (V1 )]Vii=11,15,19,24 ,V1 ∈E1 ,
and FV0 (E1 ) = 0.26 = min[FV 0 (Vii=11,15,19,24 ), FV 0 (V1 )]Vii=11,15,19,24 ,V1 ∈E1 ,
,
Vii=2,32,8−10,4,12−14 ∈ VSHG \ V 00 , ∃V3 ∈ V 00 :
TV0 (E2 ) = 0.26 = min[TV 0 (Vii=2,32,8−10 ), TV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
IV0 (E2 ) = 0.26 = min[IV 0 (Vii=12,32,8−10 ), IV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
and FV0 (E2 ) = 0.26 = min[FV 0 (Vii=2,32,8−10 ), FV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
, TV0 (E3 ) = 0.26 = min[TV 0 (Vii=4,12−14 ), TV 0 (V3 )]Vii=4,12−14 ,V3 ∈E3 ,
IV0 (E3 ) = 0.26 = min[IV 0 (Vii=4,12−14 ), IV 0 (V3 )]Vii=4,12−14 ,V3 ∈E3 ,
and FV0 (E3 ) = 0.26 = min[FV 0 (Vii=4,12−14 ), FV 0 (V3 )]Vii=4,12−14 ,V3 ∈E3 ,
,
Vii=16−18,20−23 ∈ VSHG \ V 00 , ∃V5 ∈ V 00 :
TV0 (E4 ) = 0.26 = min[TV 0 (Vii=16−18 ), TV 0 (V5 )]Vii=16−18 ,V5 ∈E4 ,
IV0 (E4 ) = 0.26 = min[IV 0 (Vii=16−18 ), IV 0 (V5 )]Vii=16−18 ,V5 ∈E4 ,
and FV0 (E4 ) = 0.26 = min[FV 0 (Vii=16−18 ), FV 0 (V5 )]Vii=16−18 ,V5 ∈E4 ,
, TV0 (E5 ) = 0.26 = min[TV 0 (Vii=20−23 ), TV 0 (V5 )]Vii=20−23 ,V5 ∈E5 ,
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
TV0 (E6 ) = 0.26 = min[TV 0 (Vii=6,25−30,32−34 ), TV 0 (V7 )]Vii=6,25−30,32−34 ,V7 ∈E6 ,
IV0 (E6 ) = 0.26 = min[IV 0 (Vii=6,25−30,32−34 ), IV 0 (V7 )]Vii=6,25−30,32−34 ,V7 ∈E6 ,
and FV0 (E6 ) = 0.26 = min[FV 0 (Vii=6,25−30,32−34 ), FV 0 (V7 )]Vii=6,25−30,32−34 ,V7 ∈E6 ,
and FV0 (E7 ) = 0.26 = min[FV 0 (Vii=32−34 ), FV 0 (V7 )]Vii=32−34 ,V7 ∈E7
}
Edges Belong to The Neutrosophic SuperHyperStar
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
SuperHyperPath (SHG), is up in the illustration of the Table (16). 587
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,11,15,19,24 }. Then V 0 is 590
called Neutrosophic SuperHyperCONNECTIVE DOMINATION since the following 591
expressions, terms and statements is called Neutrosophic SuperHyperCONNECTIVE 592
DOMINATION criteria holds. 593

X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24 }
X
I(Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24 }
= (2.24, 2.24, 2.24) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=2,32,8−10,4,12−14 ∈ VSHG \ V , ∃V3 ∈ V :
TV0 (E2 ) = 0.26 = min[TV 0 (Vii=2,32,8−10 ), TV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
IV0 (E2 ) = 0.26 = min[IV 0 (Vii=12,32,8−10 ), IV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
and FV0 (E2 ) = 0.26 = min[FV 0 (Vii=2,32,8−10 ), FV 0 (V3 )]Vii=2,32,8−10 ,V3 ∈E2 ,
, TV0 (E3 ) = 0.26 = min[TV 0 (Vii=4,12−14 ), TV 0 (V3 )]Vii=4,12−14 ,V3 ∈E3 ,
,
Vii=16−18,20−23 ∈ VSHG \ V 00 , ∃V5 ∈ V 00 :
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
}
594
SuperHyperExternal {Vi }7i=1 and non-SuperHyperInternal {Vi }34

i=8 . Consider a 598
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,8−11,15,19,24,31 }. Then V 0 is 599
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,8−11,15,19,24,31 }
X
I(Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,8−11,15,19,24,31 }
X
F (Vi ))|
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,8−11,15,19,24,31 }
= (3.2, 3.2, 3.2) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00
Vii=4,12−14 ∈ VSHG \ V , ∃V3 ∈ V 00 :
TV0 (E3 ) = 0.26 = min[TV 0 (Vii=4,12−14 ), TV 0 (V3 )]Vii=4,12−14 ,V3 ∈E3 ,
,
Vii=16−18,20−23 ∈ VSHG \ V 00 , ∃V5 ∈ V 00 :
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
}
603
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,4,8−15,19,24,31 }. Then V 0 is 608
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.24, 0.24, 0.24) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−15,19,24,31 }
X
I(Vi ),
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,4,8−15,19,24,31 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−15,19,24,31 }
= (4.16, 4.16, 4.16) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=16−18,20−23 ∈ VSHG \ V , ∃V5 ∈ V :
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
}
612

V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.24, 0.24, 0.24) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,4,8−18,19,24,31 }. Then V 0 is 617
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
X
I(Vi ),
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
= (4.88, 4.88, 4.88) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=20−23 ∈ VSHG \ V , ∃V5 ∈ V :
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
}
621
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,4,6,8−18,19−24,31 }. Then V 0 is 626
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.24, 0.24, 0.24) V5 (0.26, 0.26, 0.26)
V6 (0.24, 0.24, 0.24) V7 (0.26, 0.26, 0.26)
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.24, 0.24, 0.24) V5 (0.26, 0.26, 0.26)
V6 (0.24, 0.24, 0.24) V7 (0.26, 0.26, 0.26)
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,6,8−18,19−24,31 }
X
I(Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,6,8−18,19−24,31 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,6,8−18,19−24,31 }
= (5.84, 5.84, 5.84) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=25−30,32−34 ∈ VSHG \ V , ∃V7 ∈ V :
TV0 (E6 ) = 0.26 = min[TV 0 (Vii=25−30,32−34 ), TV 0 (V7 )]Vii=25−30,32−34 ,V7 ∈E6 ,
IV0 (E6 ) = 0.26 = min[IV 0 (Vii=25−30,32−34 ), IV 0 (V7 )]Vii=25−30,32−34 ,V7 ∈E6 ,
and FV0 (E6 ) = 0.26 = min[FV 0 (Vii=25−30,32−34 ), FV 0 (V7 )]Vii=25−30,32−34 ,V7 ∈E6 ,
}
630

Neutrosophic SuperHyperSet V 0 = VSHG . Then V 0 is called Neutrosophic 635
SuperHyperCONNECTIVE DOMINATION since the following expressions, terms and 636
statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria holds. 637
X
|( T (Vi ),
Vi ∈V 0 =VSHG
X
I(Vi ),
Vi ∈V 0 =VSHG
X
F (Vi ))|
Vi ∈V 0 =VSHG
= (7.52, 7.52, 7.52).
638
5 Main Result 639
Theorem 5.1. (Main Result and Main Theorem). 640
Assume every Neutrosophic SuperHyperBipartite has the letter z. The notion on the 641
Neutrosophic SuperHyperBipartite and Neutrosophic SuperHyperPath coincide. 642
Proof. 643
(i). Let 644
P :
V1P1 , E1 ,
V1P1 , E2
645
P :
V1P1 , E1 ,
V1P1 , E2
be a longest path taken a connected Extreme SuperHyperBipartite ESHM : (V, E). 646
There’s a new way to redefine as 647
ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is 648
corresponded to ViEXT ERN AL in the literatures of Neutrosophic SuperHyperCONNECTIVE 649
DOMINATION. The latter is straightforward. 650
(ii). Let 651
P :
ViEXT ERN AL , Ei∗ ,
EXT ERN AL ∗
Vi+1 , Ei+1
652
P :
EXT ERN AL ∗
Vi+1 , Ei+1
is a longest SuperHyperCONNECTIVE DOMINATION taken from a connected Extreme 653
SuperHyperPath ESHC : (V, E). There’s a new way to redefine as 654

DOMINATION. The latter is straightforward. Then there’s at least one Neutrosophic 657
SuperHyperCONNECTIVE DOMINATION. Thus the notion of quasi isn’t up and the 658
SuperHyperNotions based on Neutrosophic SuperHyperCONNECTIVE DOMINATION could be 659
applied. The unique embedded Neutrosophic SuperHyperCONNECTIVE DOMINATION 660
proposes some longest Neutrosophic SuperHyperCONNECTIVE DOMINATION excerpt from 661
some representatives. The latter is straightforward. 662
Proposition 5.2. Let a Neutrosophic SuperHyperBipartite ESHM be a pair

S = (V, E). Assume every Neutrosophic SuperHyperVertex has the letter z. The
Neutrosophic SuperHyperCONNECTIVE DOMINATION set is as follows.
{V1P1 }.
Proof. Let 663
P :
V1P1 , E1 ,
V1P1 , E2
664
P :
V1P1 , E1 ,
V1P1 , E2

Proposition 5.3. Let a Neutrosophic SuperHyperBipartite ESHM be a pair

S = (V, E). Assume every Neutrosophic SuperHyperVertex has the letter z. The
Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
2 × 0.26.
Proof. Let 670
P :
V1P1 , E1 ,
V1P1 , E2
671
P :
V1Pi , E1 ,
P
V1 j , E2

Proposition 5.4. Let a Neutrosophic SuperHyperPath (ESHC) S be a pair S = (V, E). 677
Assume every Neutrosophic SuperHyperVertex has the letter z. The Neutrosophic 678
SuperHyperCONNECTIVE DOMINATION set is as follows. 679
{
ViEXT ERN AL ,
EXT ERN AL
Vi+2 ,...
}
Proof. Let 680
P :
EXT ERN AL ∗
Vi+1 , Ei+1
681
P :
EXT ERN AL ∗
Vi+1 , Ei+1

Proposition 5.5. Let a Neutrosophic SuperHyperPath (ESHC) S be a pair S = (V, E).

Assume every Neutrosophic SuperHyperVertex has the letter z. The Neutrosophic
SuperHyperCONNECTIVE DOMINATION number is as follows.
|V |
× 0.26.
2
Proof. Let 692
P :
EXT ERN AL ∗
Vi+1 , Ei+1
693
P :
EXT ERN AL ∗
Vi+1 , Ei+1

Definition 5.6. (Uniform Neutrosophic SuperHyperBipartite and Uniform 704
Neutrosophic SuperHyperPath). 705
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Every 706
pair of Neutrosophic SuperHyperVertices has the same maximum letter, i.e., 707
Neutrosophic SuperHyperVertices mutually has the same maximum letter. A 708
Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E) is called 709
Uniform Neutrosophic SuperHyperBipartite. 710
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Every pair of 711
Neutrosophic SuperHyperVertices has the same maximum letter, i.e., 712
Neutrosophic SuperHyperVertices mutually has the same maximum letter. A 713
Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E) is called Uniform 714
Neutrosophic SuperHyperPath. 715
Proposition 5.7. Let an Uniform Neutrosophic SuperHyperBipartite ESHM be a pair

S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION set is as follows.
{V1P1 }.
Proof. Let 716
P :
V1P1 , E1 ,
V1P1 , E2
717
P :
V1P1 , E1 ,
V1P1 , E2

Proposition 5.8. Let an Uniform Neutrosophic SuperHyperBipartite ESHM be a pair

S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
×0.26.
Proof. Let 723
P :
V1P1 , E1 ,
V1P1 , E2
724
P :
V1P1 , E1 ,
V1P1 , E2

Proposition 5.9. Let an Uniform Neutrosophic SuperHyperPath (ESHC) S be a pair 730
S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION set is as follows. 731
{
ViEXT ERN AL ,
EXT ERN AL
Vi+2 ,...
}
Proof. Let 732
P :
EXT ERN AL ∗
Vi+1 , Ei+1
733
P :
EXT ERN AL ∗
Vi+1 , Ei+1

Proposition 5.10. Let an Uniform Neutrosophic SuperHyperPath (ESHC) S be a pair

S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
|V |
× 0.26.
2
Proof. Let 744
P :
EXT ERN AL ∗
Vi+1 , Ei+1
745
P :
EXT ERN AL ∗
Vi+1 , Ei+1

Proposition 5.11. (Neutrosophic SuperHyperBipartite and Neutrosophic 756
SuperHyperPath). 757
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Assume 758
two Neutrosophic SuperHyperVertices, from different SuperHyperParts, have the 759
maximum letter. Then the Neutrosophic SuperHyperVertices don’t have the same 760
maximum letter, are in every Neutrosophic SuperHyperCONNECTIVE DOMINATION set. 761
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Assume every 762
Neutrosophic EXTERNAL SuperHyperVertices with distance two have the 763
maximum letter. Then the Neutrosophic SuperHyperVertices don’t have the same 764
maximum letter, are in every Neutrosophic SuperHyperCONNECTIVE DOMINATION set. 765
Proof. 766
(i). Let 767
P :
V1Pi , E1 ,
P
V1 j , E2
768
P :
V1Pi , E1 ,
P
V1 j , E2

(ii). Let 774
P :
EXT ERN AL ∗
Vi+1 , Ei+1
775
P :
EXT ERN AL ∗
Vi+1 , Ei+1

Proposition 5.12. (Embedded Neutrosophic SuperHyperBipartite and Embedded 786
Neutrosophic SuperHyperPath). 787
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Then two 788
Neutrosophic SuperHyperVertices, from different SuperHyperParts, is in every 789
Neutrosophic SuperHyperCONNECTIVE DOMINATION set. 790
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Then every 791
Neutrosophic EXTERNAL SuperHyperVertices with distance two is in every 792
Neutrosophic SuperHyperCONNECTIVE DOMINATION set. 793
Proof. 794
(i). Let 795
P :
V1Pi , E1 ,
P
V1 j , E2
796
P :
V1Pi , E1 ,
P
V1 j , E2

(ii). Let 802
P :
EXT ERN AL ∗
Vi+1 , Ei+1
803
P :
EXT ERN AL ∗
Vi+1 , Ei+1

6 Neutrosophic Applications in Cancer’s 814
Neutrosophic Recognition 815
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure 816
out what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of 817
this Neutrosophic disease is considered and as the consequences of the model, some 818
parameters are used. The cells are under attack of this disease but the moves of the 819
cancer in the special region are the matter of mind. The Neutrosophic recognition of the 820
cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 821
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 822
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 823
the long-term Neutrosophic function. 824
Step 2. (Neutrosophic Issue) The specific region has been assigned by the 825
Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 826
Neutrosophic cycle of the move from the cancer is identified by this research. 827
Sometimes the move of the cancer hasn’t be easily identified since there are some 828
determinacy, indeterminacy and neutrality about the moves and the effects of the 829
cancer on that region; this event leads us to choose another model [it’s said to be 830
Neutrosophic SuperHyperGraph] to have convenient perception on what’s 831
happened and what’s done. 832
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, 833
which are well-known and they’ve got the names, and some general Neutrosophic 834
models. The moves and the Neutrosophic traces of the cancer on the complex 835
tracks and between complicated groups of cells could be fantasized by a 836
Neutrosophic SuperHyperPath(-/SuperHyperCONNECTIVE DOMINATION, 837
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 838
SuperHyperWheel). The aim is to find either the Neutrosophic 839
SuperHyperCONNECTIVE DOMINATION or the Neutrosophic SuperHyperCONNECTIVE 840
DOMINATION in those Neutrosophic Neutrosophic SuperHyperModels. 841
Figure 43. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-

sophic SuperHyperCONNECTIVE DOMINATION
7 Case 1: The Initial Neutrosophic Steps 842
Toward Neutrosophic SuperHyperBipartite as 843
Neutrosophic SuperHyperModel 844
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (43), the 845
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 846
featured. 847
By using the Neutrosophic Figure (43) and the Table (22), the Neutrosophic 848
SuperHyperBipartite is obtained. 849
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 850
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 851
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 852
SuperHyperModel (43), is the Neutrosophic SuperHyperCONNECTIVE DOMINATION. 853
Figure 44. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperCONNECTIVE DOMINATION
Edges Belong to The Neutrosophic SuperHyperMultipartite
8 Case 2: The Increasing Neutrosophic Steps 854
Toward Neutrosophic SuperHyperMultipartite as 855
Neutrosophic SuperHyperModel 856
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (44), the 857
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 858
Neutrosophic featured. 859
By using the Neutrosophic Figure (44) and the Table (23), the Neutrosophic 860
SuperHyperMultipartite is obtained. 861
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 862
previous result, of the Neutrosophic SuperHyperVertices of the connected 863
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 864
SuperHyperModel (44), is the Neutrosophic SuperHyperCONNECTIVE DOMINATION. 865
9 Wondering Open Problems But As The 866
Directions To Forming The Motivations 867
In what follows, some “problems” and some “questions” are proposed. 868
The SuperHyperCONNECTIVE DOMINATION and the Neutrosophic SuperHyperCONNECTIVE 869
DOMINATION are defined on a real-world application, titled “Cancer’s Recognitions”. 870
Question 9.1. Which the else SuperHyperModels could be defined based on Cancer’s 871
recognitions? 872
Question 9.2. Are there some SuperHyperNotions related to SuperHyperCONNECTIVE 873
and the Neutrosophic SuperHyperCONNECTIVE DOMINATION?

DOMINATION 874
Question 9.3. Are there some Algorithms to be defined on the SuperHyperModels to 875
compute them? 876
Question 9.4. Which the SuperHyperNotions are related to beyond the 877
SuperHyperCONNECTIVE DOMINATION and the Neutrosophic SuperHyperCONNECTIVE DOMINATION? 878
Problem 9.5. The SuperHyperCONNECTIVE DOMINATION and the Neutrosophic 879
SuperHyperCONNECTIVE DOMINATION do a SuperHyperModel for the Cancer’s recognitions and 880
they’re based on SuperHyperCONNECTIVE DOMINATION, are there else? 881
Problem 9.6. Which the fundamental SuperHyperNumbers are related to these 882
SuperHyperNumbers types-results? 883
Problem 9.7. What’s the independent research based on Cancer’s recognitions 884
concerning the multiple types of SuperHyperNotions? 885
10 Conclusion and Closing Remarks 886
In this section, closing and concluding remarks are presented. The drawbacks of this 887
scientific research are shown. Some advantages and disadvantages of this scientific 888
research are highlighted. 889
This scientific research uses some approaches to further understand the Neutrosophic 890
SuperHyperGraphs. In this effort, two SuperHyperNotions are defined on the 891
CONNECTIVE DOMINATION. For this reason, in the second definition, the original 892
definition of the Neutrosophic SuperHyperGraph is redefined on the position of the 893
alphabets. Based on the new Neutrosophic SuperHyperGraph definition, the new 894
SuperHyperNotion, Neutrosophic CONNECTIVE DOMINATION, finds a suitable 895
background to implement some results on. Some SuperHyperClasses and some 896
Neutrosophic SuperHyperClasses are the subjects of this scientific research on modeling 897
areas that are subject to cancer attacks in order to recognize this disease as mentioned 898
under the title “Cancer Diagnosis”. To formalize the SuperHyperNotion, 899
CONNECTIVE DOMINATION, SuperHyperClasses and new SuperHyperClasses 900
instances are introduced. Some general results are summarized in the CONNECTIVE 901
DOMINATION and Neutrosophic CONNECTIVE DOMINATION sections. 902
Clarifications, examples, and literature reviews go all the way. In this scientific research, 903
the literature review has met the lines containing concepts and results. 904
SuperHyperGraph and Neutrosophic SuperHyperGraph are super-hypermodels in 905
“cancer diagnosis” and both are the foundation of the background of this scientific 906
research. Sometimes cancer has occurred in an area full of cells, cell groups, and 907
embedded styles. In this section, SuperHyperModel proposes SuperHyperNotions, 908
formally called “CONNECTIVE DOMINATION”, based on the connections of Cancer’s 909
movements in the longest and strongest styles with the formation of design and 910
architecture, in terms of terms and whispering words. . The “SuperHyper” prefix refers 911
to the topic of embedded styles to explore the background of SuperHyperNotions. In 912
the table (24), the advantages and ways of this scientific research are specified, pointed 913
out and expressed. 914
11 Background 915
There are some scientific researches covering the topic of this scientific research. In what 916
follows, there are some discussion and literature reviews about them. 917
Table 24. A look at this scientific research and beyond

Advantages Limitations
1. Redefining the Neutrosophic SuperHyperGraph 1. General Results
2. CONNECTIVE DOMINATION
3. Neutrosophic CONNECTIVE DOMINATION 2. Other SuperHyperNumbers
4. modeling cancer diagnoses
5. SuperHyperClasses 3. SuperHyperFamilies
The seminal paper and groundbreaking article is titled “New Ideas In Recognition of 918
Cancer And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot” in Ref. [1] 919
by Henry Garrett (2023). In this research article, a novel approach is implemented on 920
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms with 921
introducing used neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 922
in prestigious and fancy journal is entitled “Current Trends in Mass Communication 923
(CTMC)” with ISO abbreviation “Curr Trends Mass Comm” in volume 2 and issue 1 924
with pages 32-55. 925
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 926
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 927
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [2] by Henry Garrett 928
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 929
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 930
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 931
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 932
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 933
pages 35-47. The research article studies deeply with choosing directly neutrosophic 934
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 935
results based on initial background and fundamental SuperHyperNumbers. 936
The seminal paper and groundbreaking article is titled “A Research on Cancer’s 937
Recognition and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and 938
Hamiltonian Sets as Hyper Covering Versus Super separations” in Ref. [3] by Henry 939
Garrett (2023). In this research article, a novel approach is implemented on 940
SuperHyperGraph and neutrosophic SuperHyperGraph based on fundamental notions 941
and using vital tools in Cancer’s Recognition. It’s published in prestigious and fancy 942
journal is entitled “Journal of Mathematical Techniques and Computational 943
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 944
volume 2 and issue 3 with pages 136-148. The research article studies deeply with 945
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 946
breakthrough toward independent results based on initial background and fundamental 947
SuperHyperNumbers. 948
The seminal paper and groundbreaking article is titled “Neutrosophic 1-Failed 949
SuperHyperForcing in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs 950
on Cancer’s Neutrosophic Recognition and Beyond ” in Ref. [4] by Henry Garrett (2023). 951
In this research article, a novel approach is implemented on SuperHyperGraph and 952
neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 953
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 954
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 955
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 956
Comput Math” in volume 2 and issue 6 with pages 221-307. The research article studies 957
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 958
It’s the breakthrough toward independent results based on initial background and 959
fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is 960
titled “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super 961
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 962
Classes” in Ref. [5] by Henry Garrett (2022). In this research article, a novel approach 963
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on 964
fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of 965
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 966
entitled “Journal of Mathematical Techniques and Computational 967
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 968
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 970
breakthrough toward independent results based on initial background and fundamental 971
SuperHyperNumbers. The seminal paper and groundbreaking article is titled 972
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the 973
setting of some classes related to neutrosophic hypergraphs” in Ref. [6] by Henry 974
Garrett (2023). In this research article, a novel approach is implemented on 975
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms without 976
using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 977
prestigious and fancy journal is entitled “Journal of Current Trends in Computer 978
Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in 979
choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 981
breakthrough toward independent results based on initial background. The research 982
article studies deeply with choosing neutrosophic hypergraphs instead of neutrosophic 983
SuperHyperGraph. It’s the breakthrough toward independent results based on initial 984
background. In some articles are titled “0039 — Closing Numbers and Super-Closing 985
Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 986
(Neutrosophic)n-SuperHyperGraph” in Ref. [7] by Henry Garrett (2022), “0049 — 987
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [8] by Henry Garrett 988
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 989
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 990
in Ref. [9] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 991
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 992
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [10] by 993
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 994
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 995
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 996
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 997
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 998
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [12] by Henry 999
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 1000
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 1001
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 1002
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 1003
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 1004
Ref. [14] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 1005
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1006
SuperHyperGraphs” in Ref. [15] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 1007
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 1008
Ref. [16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 1009
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1010
Special ViewPoints” in Ref. [17] by Henry Garrett (2022), “Neutrosophic 1-Failed 1011
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 1012
on Cancer’s Neutrosophic Recognition And Beyond ” in Ref. [18] by Henry Garrett 1013
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 1014
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [19] by Henry Garrett 1015
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1016
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1017
in Ref. [15] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 1018
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 1019
And (Neutrosophic) SuperHyperGraphs” in Ref. [20] by Henry Garrett (2022), 1020
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 1021
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [21] by 1022
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1023
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [22] by 1024
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1025
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 1026
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 1027
(Neutrosophic) SuperHyperClasses” in Ref. [23] by Henry Garrett (2022), 1028
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 1029
SuperHyperModeling of Cancer’s Recognitions” in Ref. [24] by Henry Garrett (2022), 1030
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1031
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 1032
Treatments” in Ref. [25] by Henry Garrett (2022), “SuperHyperDominating and 1033
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 1034
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [26] by Henry Garrett 1035
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1036
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [206] by Henry 1037
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 1038
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 1039
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [207] by Henry Garrett 1040
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 1041
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 1042
Named (Neutrosophic) SuperHyperGraphs” in Ref. [208] by Henry Garrett (2023), 1043
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 1044
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 1045
Neutrosophic SuperHyperGraphs” in Ref. [209] by Henry Garrett (2023), “Perfect 1046
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 1047
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [212] by 1048
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 1049
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 1050
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [213] by Henry 1051
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 1052
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 1053
the Form of Neutrosophic SuperHyperGraphs” in Ref. [216] by Henry Garrett (2023), 1054
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 1055
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [219] by Henry 1056
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1057
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1058
in Ref. [220] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 1059
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 1060
Ref. [221] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 1061
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 1062
Recognition And Beyond ” in Ref. [222] by Henry Garrett (2022), “(Neutrosophic) 1063
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 1064
SuperHyperGraphs” in Ref. [223] by Henry Garrett (2022), “Basic Notions on 1065
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 1066
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [224] by Henry Garrett 1067
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1068
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [235] by Henry 1069
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 1070
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 1071
SuperHyperGraph (NSHG)” in Ref. [236] by Henry Garrett (2022), and [4–236], there 1072
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 1073
SuperHyperGraph and SuperHyperGraph alongside scientific research books 1074
at [237–367]. Two popular scientific research books in Scribd in the terms of high 1075
readers, 4728 and 5721 respectively, on neutrosophic science is on [368, 369]. 1076
Some scientific studies and scientific researches about neutrosophic graphs, are 1077
proposed as book in Ref. [368] by Henry Garrett (2023) which is indexed by Google 1078
Scholar and has more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic 1079
Graphs” and published by Dr. Henry Garrett. This research book covers different types 1080
of notions and settings in neutrosophic graph theory and neutrosophic 1081
SuperHyperGraph theory. 1082
Also, some scientific studies and scientific researches about neutrosophic graphs, are 1083
proposed as book in Ref. [369] by Henry Garrett (2023) which is indexed by Google 1084
Scholar and has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” 1085
and published by Dr. Henry Garrett. This research book presents different types of 1086
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 1087
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 1088
book has scrutiny on the complement of the intended set and the intended set, 1089
simultaneously. It’s smart to consider a set but acting on its complement that what’s 1090
done in this research book which is popular in the terms of high readers in Scribd. 1091
See the seminal scientific researches [1–3]. The formalization of the notions on the 1092
framework of notions in SuperHyperGraphs, Neutrosophic notions in 1093
SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [4–236] 1094
alongside scientific research books at [237–367]. Two popular scientific research books 1095
in Scribd ,in the terms of high readers, 4728 and 5721 respectively, on neutrosophic 1096
science is on [368, 369]. 1097
References 1098
1. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 1099
SuperHyperGraph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 1100
2(1) (2023) 32-55. (https://www.opastpublishers.com/open-access-articles/new- 1101
ideas-in-recognition-of-cancer-and-neutrosophic-super-hypergraph-as-hyper- 1102
tool-on-super-toot.pdf) 1103
2. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 1104
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 1105
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 1106
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 1107
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 1108
graphs-and-super-hyper-graphs-alongside-a.pdf) 1109
3. Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 1110
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 1111
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 1112
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 1113
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by- 1114
eulerian-super-hyper-cycles-and-hamiltonian-sets-.pdf) 1115
4. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 1116
SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s 1117
Neutrosophic Recognition and Beyond ”, J Math Techniques Comput Math 2(6) 1118
(2023) 221-307. (https://www.opastpublishers.com/open-access- 1119
articles/neutrosophic-1failed-superhyperforcing-in-the-superhyperfunction-to- 1120
use-neutrosophic-superhypergraphs-on-cancers-neutros.pdf) 1121
5. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 1122
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 1123
Hypergraphs”, J Curr Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 1124
10.33140/JCTCSR.02.01.04) 1125
6. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 1126
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 1127
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 1128
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 1129
7. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 1130
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 1131
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 1132
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 1133
Research, https://doi.org/10.5281/zenodo.6319942. 1134
https://oa.mg/work/10.5281/zenodo.6319942 1135
8. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 1136
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 1137
2022. CERN European Organization for Nuclear Research, 1138
https://doi.org/10.13140/rg.2.2.35241.26724. 1139
https://oa.mg/work/10.13140/rg.2.2.35241.26724 1140
9. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 1141
Confrontation under Cancer’s Recognition as the Model in The Setting of 1142
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 1143
10.20944/preprints202301.0308.v1). 1144
10. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 1145
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1146
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1147
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1148
11. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 1149
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 1150
2023010267 (doi: 10.20944/preprints202301.0267.v1). 1151
12. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1152
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1153
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1154
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1155
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1156
10.20944/preprints202301.0265.v1). 1157
13. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 1158
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1159
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1160
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1161
14. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1162
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1163
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1164
10.20944/preprints202301.0240.v1). 1165
15. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1166
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1167
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1168
10.20944/preprints202301.0224.v1). 1169
16. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 1170
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1171
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1172
17. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 1173
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 1174
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 1175
10.20944/preprints202301.0088.v1). 1176
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 1178
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1179
19. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 1180
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1181
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1182
20. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 1183
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 1184
10.20944/preprints202301.0105.v1). 1186
10.20944/preprints202301.0088.v1). 1190
22. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1191
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1192
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1193
23. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1194
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 1195
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 1196
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1197
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1198
24. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 1199
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 1200
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1201
25. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1202
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1203
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1204
10.20944/preprints202212.0324.v1). 1205
26. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 1206
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 1207
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1208
10.20944/preprints202211.0576.v1). 1209
SuperHyperGraph With Bipartite and Path By DOMINATION As Hyper 1211
Decoration On Super Density”, Zenodo 2023, (doi: 10.5281/zenodo.8187955). 1212
SuperHyperGraph With Star and Wheel By DOMINATION As Hyper 1214
SuperHyperGraph With Multipartite and Cycle By DOMINATION As Hyper 1217
SuperHyperGraph By SuperHyperPerfect Search As Hyper Perf On Super 1220
Perfidy”, Zenodo 2023, (doi: 10.5281/zenodo.8104836). 1221
31. Henry Garrett, “New Ideas On Super Perfidy By Hyper Perf Of 1222
SuperHyperPerfect Search In Recognition of Cancer With (Neutrosophic) 1223
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8104857). 1224
SuperHyperGraph By Reverse Strict Dimension Dominating As Hyper Dimple 1226
On Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8092796). 1227
33. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1228
Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1229
SuperHyperGraph By Unequal Dimension Dominating As Hyper Dimple On 1232
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8088438). 1233
35. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal 1234
Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1235
SuperHyperGraph By Strict Dimension Dominating As Hyper Dimple On Super 1238
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8084436). 1239
37. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Strict 1240
SuperHyperGraph By Reverse Strict Connective As Hyper Conceit On Super 1244
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8080100). 1245
39. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict 1246
Connective In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1247
Zenodo 2023, (doi: 10.5281/zenodo.8080068). 1248
SuperHyperGraph By Unequal Connective Dominating As Hyper Conceit On 1250
Super Con”, Zenodo 2023, (doi: 10.5281/zenodo.8078445). 1251
41. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal 1252
Connective Dominating In Recognition of Cancer With (Neutrosophic) 1253
SuperHyperGraph By Strict Connective Dominating As Hyper Conceit On 1256
43. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict 1258
SuperHyperGraph By Reverse Dimension Dominating As Hyper Dimple On 1262
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8072171). 1263
45. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1264
SuperHyperGraph By Equal Dimension Dominating As Hyper Dimple On Super 1268
47. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal 1270
SuperHyperGraph By Dimension Dominating As Hyper Dimple On Super 1274
49. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension 1276
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1277
SuperHyperGraph By Reverse Connective Dominating As Hyper Conceit On 1280
51. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse 1282
SuperHyperGraph By Equal Connective Dominating As Hyper Conceit On 1286
53. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal 1288
SuperHyperGraph By Connective Dominating As Hyper Conceit On Super 1292
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8051346). 1293
55. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective 1294
SuperHyperGraph By United Dominating As Hyper Ultra On Super Units”, 1298
57. Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United 1300
SuperHyperGraph By Zero Forcing As Hyper ford On Super forceps”, Zenodo 1304
2023, (doi: 10.5281/zenodo.8017246). 1305
59. Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 1306
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1307
(doi: 10.5281/zenodo.8020128). 1308
SuperHyperGraph By Matrix-Based As Hyper mat On Super matte”, Zenodo 1310
2023, (doi: 10.5281/zenodo.7978571). 1311
61. Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 1312
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1313
(doi: 10.5281/zenodo.7978857). 1314
SuperHyperGraph By Dominating-Edges As Hyper Dome On Super Eddy”, 1316
63. Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of 1318
Dominating-Edges In Cancer’s Recognition With (Neutrosophic) 1319
SuperHyperGraph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, 1322
(doi: 10.5281/zenodo.7916595). 1323
65. Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In 1324
(doi: 10.5281/zenodo.7923632). 1326
SuperHyperGraph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On 1328
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7904698). 1329
67. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 1330
Eulerian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1331
SuperHyperGraph By Eulerian-Type-Cycle-Decomposition As Hyper 1334
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1335
10.5281/zenodo.7904529). 1336
69. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 1337
Eulerian-Type-Cycle-Decomposition In Cancer’s Recognition With 1338
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 1339
10.5281/zenodo.7904401). 1340
SuperHyperGraph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super 1342
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7871026). 1343
Eulerian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1345
SuperHyperGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super 1348
Eulerian-Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) 1351
SuperHyperGraph By Eulerian-Cycle-Decomposition As Hyper Decompress On 1354
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7855661). 1355
Eulerian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) 1357
SuperHyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, 1360
77. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 1362
Eulerian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1363
SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super 1366
Eulerian-Type-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1369
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 1372
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 1373
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1375
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 1378
EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 1379
Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1381
SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 1384
Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1387
SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 1390
Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1393
SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 1396
10.5281/zenodo.7812236). 1397
SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 1399
Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 1400
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 1402
EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 1403
Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1405
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 1408
SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 1411
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 1412
Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1414
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 1417
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1418
10.5281/zenodo.7804238). 1419
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 1421
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 1422
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 1424
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 1425
98. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 1426
Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1427
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 1430
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 1433
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 1434
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 1436
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 1437
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1439
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 1442
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 1445
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 1448
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 1451
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 1454
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 1457
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 1460
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 1463
111. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 1465
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 1466
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 1467
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 1469
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 1472
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 1473
114. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 1474
(doi: 10.5281/zenodo.7764916). 1476
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 1478
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 1481
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 1484
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 1485
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 1487
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 1488
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 1490
2023, (doi: 10.13140/RG.2.2.11377.76644). 1491
120. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 1492
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1493
2023, (doi: 10.13140/RG.2.2.23750.96329). 1494
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 1496
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 1499
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 1502
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 1503
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 1505
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 1508
126. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 1510
2023, (doi: 10.13140/RG.2.2.32467.25124). 1512
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 1514
128. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1516
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 1517
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 1520
130. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 1522
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 1523
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 1526
132. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 1528
2023, (doi: 10.13140/RG.2.2.20170.24000). 1530
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 1532
134. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1534
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 1535
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 1538
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 1539
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 1541
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 1544
138. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 1546
2023, (doi: 10.13140/RG.2.2.27392.30721). 1548
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 1550
2023, (doi: 10.13140/RG.2.2.33028.40321). 1551
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 1553
141. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 1555
2023, (doi: 10.13140/RG.2.2.16356.04489). 1557
SuperHyperGraph By Space As Hyper Sparse On Super Spark ”, ResearchGate 1559
2023, (doi: 10.13140/RG.2.2.21756.21129). 1560
143. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 1561
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 1562
(doi: 10.13140/RG.2.2.30983.68009). 1563
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 1565
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 1566
145. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 1567
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 1568
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 1571
147. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 1573
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 1574
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 1577
149. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 1579
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 1580
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 1583
151. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 1585
2023, (doi: 10.13140/RG.2.2.11172.14720). 1587
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 1589
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 1590
153. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 1591
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 1592
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 1595
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 1596
155. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 1597
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 1598
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 1601
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 1602
157. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 1603
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 1604
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 1607
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 1608
159. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 1609
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 1610
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 1613
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 1614
161. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 1615
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 1616
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 1619
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 1620
163. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 1621
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 1622
164. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 1624
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 1625
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 1628
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 1629
166. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 1630
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 1631
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 1634
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 1635
168. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 1636
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 1637
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 1640
170. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 1642
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 1643
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 1646
172. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 1648
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 1649
173. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 1651
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 1652
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 1655
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 1658
176. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 1660
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 1661
177. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 1663
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 1664
178. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1666
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 1667
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1668
179. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1669
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 1670
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 1671
180. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 1672
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 1673
181. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 1675
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 1676
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 1677
182. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 1678
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 1679
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1680
183. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 1681
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 1682
Hyper Covering Versus Super separations-VI ”, ResearchGate 2023, (doi: 1683
10.13140/RG.2.2.29913.80482). 1684
Hyper Covering Versus Super separations-V ”, ResearchGate 2023, (doi: 1687
10.13140/RG.2.2.33269.24809). 1688
Hyper Covering Versus Super separations-IV ”, ResearchGate 2023, (doi: 1691
10.13140/RG.2.2.34946.96960). 1692
186. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 1693
Hyper Covering Versus Super separations-III ”, ResearchGate 2023, (doi: 1695
10.13140/RG.2.2.14814.31040). 1696
Hyper Covering Versus Super separations-II ”, ResearchGate 2023, (doi: 1699
10.13140/RG.2.2.15653.17125). 1700
Hyper Covering Versus Super separations-I ”, ResearchGate 2023, (doi: 1703
10.13140/RG.2.2.25719.50089). 1704
189. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 1705
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 1706
SuperHyperConnectivities”, ResearchGate 2023, (doi: 1707
10.13140/RG.2.2.29441.94562). 1708
190. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 1709
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 1710
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 1711
191. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 1712
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 1713
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1714
192. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 1715
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 1716
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 1717
193. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 1718
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 1719
Recognition”, Preprints 2023, 2023010396 (doi: 1720
10.20944/preprints202301.0396.v1). 1721
194. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 1722
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 1723
Recognition”, Preprints 2023, 2023010395 (doi: 1724
10.20944/preprints202301.0395.v1). 1725
195. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 1726
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 1727
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 1728
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 1729
10.13140/RG.2.2.26240.51204). 1730
196. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 1731
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 1732
Classes With Hyper Effects In The Background of the Framework is So-Called 1733
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1734
10.13140/RG.2.2.12818.73925). 1735
197. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 1736
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 1737
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 1738
10.13140/RG.2.2.26836.88960). 1739
198. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 1740
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 1741
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 1742
199. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 1743
Confrontation under Cancer’s Recognition as the Model in The Setting of 1744
10.20944/preprints202301.0308.v1). 1746
200. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 1747
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1748
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1749
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1750
201. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1751
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 1752
(doi: 10.20944/preprints202301.0267.v1).). 1753
202. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1754
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1755
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1756
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1757
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1758
10.20944/preprints202301.0265.v1). 1759
203. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 1760
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1761
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1762
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1763
204. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1764
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1765
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1766
10.20944/preprints202301.0240.v1). 1767
205. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1768
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1769
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1770
10.20944/preprints202301.0224.v1). 1771
206. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 1772
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 1773
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 1774
207. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 1775
The Cancer’s Extreme Recognition With Different Types of Extreme 1776
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 1777
208. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1779
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1780
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1781
2023, (doi: 10.13140/RG.2.2.32530.73922). 1782
209. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 1783
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 1784
SuperHyperClique on Cancer’s Recognition called Neutrosophic 1785
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 1786
210. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1787
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1788
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1789
2023, (doi: 10.13140/RG.2.2.32530.73922). 1790
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1792
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1793
212. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 1794
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 1795
213. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 1797
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 1798
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 1799
10.20944/preprints202301.0105.v1). 1804
10.20944/preprints202301.0088.v1). 1808
216. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 1809
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 1810
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 1811
(doi: 10.13140/RG.2.2.17385.36968). 1812
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1815
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1817
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1818
219. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 1819
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 1820
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1823
Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 1824
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1826
2023, (doi: 10.13140/RG.2.2.35774.77123). 1827
Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 1830
10.13140/RG.2.2.36141.77287). 1831
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1833
10.13140/RG.2.2.29430.88642). 1834
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1837
10.13140/RG.2.2.11369.16487). 1838
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1840
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1841
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 1843
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1848
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1849
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 1853
2022, (doi: 10.13140/RG.2.2.14426.41923). 1854
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1857
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 1860
231. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 1861
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1862
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1863
10.20944/preprints202212.0324.v1). 1864
232. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1865
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 1866
in Cancer’s Treatments”, ResearchGate 2022 (doi: 1867
10.13140/RG.2.2.23123.04641). 1868
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1871
10.20944/preprints202211.0576.v1). 1872
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 1875
10.13140/RG.2.2.23324.56966). 1876
235. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 1877
and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 1878
2022 (doi: 10.13140/RG.2.2.29173.86244). 1879
236. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 1880
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 1881
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 1882
10.13140/RG.2.2.25385.88160). 1883
237. Henry Garrett, “Domination In Neutrosophic SuperHyperGraphs”. Dr. Henry 1884
Garrett, 2023 (doi: 10.5281/zenodo.8113416). 1885
238. Henry Garrett, “SuperHyperPerfect Search In SuperHyperGraphs”. Dr. Henry 1886
239. Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyperGraphs”. 1888
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8092816). 1889
240. Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. 1890
Henry Garrett, 2023 (doi: 10.5281/zenodo.8090194). 1891
241. Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. 1892
242. Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry 1894
243. Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. 1896
244. Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. 1898
245. Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. 1900
246. Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. 1902
247. Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1904
248. Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. 1906
249. Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. 1908
250. Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry 1910
251. Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1912
2023 (doi: 10.5281/zenodo.8027488). 1913
252. Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1914
(doi: 10.5281/zenodo.8020181). 1915
253. Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1916
(doi: 10.5281/zenodo.7978921). 1917
254. Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 1918
10.5281/zenodo.7943878). 1919
255. Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 1920
2023 (doi: 10.5281/zenodo.7943871). 1921
256. Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1922
(doi: 10.5281/zenodo.7923786). 1923
257. Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1924
258. Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1926
259. Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1928
260. Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1930
261. Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1932
262. Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1934
2023 (doi: 10.5281/zenodo.7854561). 1935
263. Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. 1936
264. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 1938
265. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 1940
266. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 1942
267. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 1944
268. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1946
2023 (doi: 10.5281/zenodo.7812750). 1947
269. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1948
270. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1950
271. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1952
272. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1954
273. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1956
274. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1958
275. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 1960
276. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 1962
277. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1964
2023 (doi: 10.5281/zenodo.7783791). 1965
278. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1966
2023 (doi: 10.5281/zenodo.7780123). 1967
279. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 1968
280. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 1970
10.5281/zenodo.7637762). 1971
281. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1972
(doi: 10.5281/zenodo.7766174). 1973
282. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1974
(doi: 10.5281/zenodo.7762232). 1975
283. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1976
2023 (doi: 10.5281/zenodo.7758601). 1977
284. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1978
10.5281/zenodo.7754661). 1979
285. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1980
2023 (doi: 10.5281/zenodo.7750995) . 1981
286. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 1982
287. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1984
(doi: 10.5281/zenodo.7747236). 1985
288. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1986
2023 (doi: 10.5281/zenodo.7742587). 1987
289. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 1988
290. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1990
(doi: 10.5281/zenodo.7734719). 1991
291. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 1992
2023 (doi: 10.5281/zenodo.7730484). 1993
292. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 1994
293. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1996
(doi: 10.5281/zenodo.7722865). 1997
294. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1998
10.5281/zenodo.7713563). 1999
295. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2000
10.5281/zenodo.7709116). 2001
296. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2002
2023 (doi: 10.5281/zenodo.7706415). 2003
297. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2004
2023 (doi: 10.5281/zenodo.7706063). 2005
298. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2006
2023 (doi: 10.5281/zenodo.7701906). 2007
299. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2008
10.5281/zenodo.7700205). 2009
300. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2010
2023 (doi: 10.5281/zenodo.7694876). 2011
301. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2012
2023 (doi: 10.5281/zenodo.7679410). 2013
302. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2014
(doi: 10.5281/zenodo.7675982). 2015
303. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2016
(doi: 10.5281/zenodo.7672388). 2017
304. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2018
10.5281/zenodo.7668648). 2019
305. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2020
10.5281/zenodo.7662810). 2021
306. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2022
(doi: 10.5281/zenodo.7659162). 2023
307. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2024
10.5281/zenodo.7653233). 2025
308. Henry Garrett, “SuperHyperWheel ”. Dr. Henry Garrett, 2023 (doi: 2026
10.5281/zenodo.7653204). 2027
309. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 2028
10.5281/zenodo.7653142). 2029
310. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 2030
10.5281/zenodo.7653117). 2031
311. Henry Garrett, “SuperHyperStar ”. Dr. Henry Garrett, 2023 (doi: 2032
10.5281/zenodo.7653089). 2033
312. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2034
10.5281/zenodo.7651687). 2035
313. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 2036
10.5281/zenodo.7651619). 2037
314. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 2038
10.5281/zenodo.7651439). 2039
315. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 2040
10.5281/zenodo.7650729). 2041
316. Henry Garrett, “SuperHyperConnected ”. Dr. Henry Garrett, 2023 (doi: 2042
10.5281/zenodo.7647868). 2043
317. Henry Garrett, “SuperHyperTotal ”. Dr. Henry Garrett, 2023 (doi: 2044
10.5281/zenodo.7647017). 2045
318. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 2046
10.5281/zenodo.7644894). 2047
319. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 2048
10.5281/zenodo.7641880). 2049
320. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 2050
10.5281/zenodo.7632923). 2051
321. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 2052
10.5281/zenodo.7623459). 2053
322. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2054
2023 (doi: 10.5281/zenodo.7606416). 2055
323. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 2056
(doi: 10.5281/zenodo.7606416). 2057
324. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 2058
10.5281/zenodo.7606404). 2059
325. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2060
10.5281/zenodo.7580018). 2061
326. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2062
10.5281/zenodo.7580018). 2063
327. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2064
10.5281/zenodo.7580018). 2065
328. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2066
10.5281/zenodo.7579929). 2067
329. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2068
10.5281/zenodo.7563170). 2069
330. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2070
10.5281/zenodo.7563164). 2071
331. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2072
10.5281/zenodo.7563160). 2073
332. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2074
10.5281/zenodo.7563160). 2075
333. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2076
10.5281/zenodo.7563160). 2077
334. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 2078
(doi: 10.5281/zenodo.7557063). 2079
335. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2080
10.5281/zenodo.7557009). 2081
336. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 2082
(doi: 10.5281/zenodo.7539484). 2083
337. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2084
2023 (doi: 10.5281/zenodo.7523390). 2085
338. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 2086
(doi: 10.5281/zenodo.7523390). 2087
339. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2088
2023 (doi: 10.5281/zenodo.7523390). 2089
340. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2090
10.5281/zenodo.7574952). 2091
341. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2092
10.5281/zenodo.7574992). 2093
342. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2094
10.5281/zenodo.7523357). 2095
343. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2096
10.5281/zenodo.7523357). 2097
344. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2098
2023 (doi: 10.5281/zenodo.7504782). 2099
345. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 2100
(doi: 10.5281/zenodo.7504782). 2101
346. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2102
2023 (doi: 10.5281/zenodo.7504782). 2103
347. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2104
10.5281/zenodo.7499395). 2105
348. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2106
10.5281/zenodo.7499395). 2107
349. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2108
10.5281/zenodo.7499395). 2109
350. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2110
2023 (doi: 10.5281/zenodo.7497450). 2111
351. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 2112
(doi: 10.5281/zenodo.7497450). 2113
352. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 2114
(doi: 10.5281/zenodo.7494862). 2115
353. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2116
10.5281/zenodo.7494862). 2117
354. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 2118
(doi: 10.5281/zenodo.7494862). 2119
355. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 2120
(doi: 10.5281/zenodo.7493845). 2121
356. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2122
10.5281/zenodo.7493845). 2123
357. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 2124
(doi: 10.5281/zenodo.7493845). 2125
358. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2126
10.5281/zenodo.7539484). 2127
359. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2128
10.5281/zenodo.7523390). 2129
360. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2130
10.5281/zenodo.7523357). 2131
361. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2132
10.5281/zenodo.7504782). 2133
362. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2134
10.5281/zenodo.7499395). 2135
363. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2136
10.5281/zenodo.7497450). 2137
364. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2138
10.5281/zenodo.7494862). 2139
365. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2140
10.5281/zenodo.7493845). 2141
366. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2142
10.5281/zenodo.7480110). 2143
367. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 2144
10.5281/zenodo.7378758). 2145
368. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 2146
10.5281/zenodo.6320305). 2147
369. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 2148
10.5281/zenodo.6677173). 2149
View publication stats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph With Bipartite and Path by CONNECTIVE DOMINATION As Hyper Decoration On Super Density

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 in Recognition of Cancer and Neutrosophic SuperHyperGraph With Bipartite and Path by CONNECTIVE DOMINATION As Hyper Decoration On Super Density

Uploaded by

Copyright:

Available Formats

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

New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph With

Preprint · July 2023

532 PUBLICATIONS 26,551 CITATIONS

Featured Articles View project

Number Graphs And Numbers View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

SuperHyperGraph With Bipartite and Path By 3

CONNECTIVE DOMINATION As Hyper Decoration On 4

Henry Garrett · Independent Researcher · Department of Mathematics · 7

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

In this scientific research, (Different Neutrosophic Types of Neutrosophic 10

SuperHyperCONNECTIVE DOMINATION). Let a Neutrosophic SuperHyperGraph (NSHG) S be 11

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

V 0 is called Neutrosophic SuperHyperCONNECTIVE DOMINATION if the following expressions, 13

terms and statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria 14

SuperHyperNotions, namely a CONNECTIVE DOMINATION and a Neutrosophic 17

CONNECTIVE DOMINATION. Two different SuperHyperDefinitions were started for 18

them, but research has progressed and SuperHyperNotion, SuperHyperUniform, and 19

SuperHyperClass are well-defined and well-reviewed based on them. Literature review is 20

research, a comparison between this SuperHyperNotion with other SuperHyperNotions 22

and basic SuperHyperNumbers is presented. Definitions are followed by examples and 23

examples, so clarifications are guided by various tools. Applications are designed to 24

the relationships between them all are officially called “SuperHyperEdge”. 30

“SuperHyperGraph” and “Neutrosophic SuperHyperGraph” frameworks are selected and 31

super-hypermodels open avenues for research on theoretical aspects and “cancer 33

define a “neutrosophic” version of CONNECTIVE DOMINATION. Since there are 36

more ways to get type results a CONNECTIVE DOMINATION becomes more 37

understandable. In order to master the Neutrosophic CONNECTIVE DOMINATION, 38

there is a need to “re-define” the concept of “CONNECTIVE DOMINATION mastery”. 39

SuperHyperVertices and SuperHyperEdges are assigned by alphabetical labels. In this 40

method, the position of tags is used to assign values. Suppose a CONNECTIVE 41

DOMINATION. If the specified table contains “values of vertices, supervertices, edges, 42

hyperedges, and hyperedges belonging to Neutrosophic SuperHyperGraph” with key 43

points, it is redefined. ”values of vertices & number of positions in alphabet”, ”Values 44

of SuperVertices&maximum values of its vertices”, ”values of edges&maximum values of 45

like to introduce the next SuperHyperClass SuperHyperGraph based on CONNECTIVE 48

the SuperHyperClass type would be disciplined. If there is a need to have all 50

CONNECTIVE DOMINATION until CONNECTIVE DOMINATION, then it is 51

officially called “CONNECTIVE DOMINATION”, but otherwise, it is not 52

CONNECTIVE DOMINATION. There is some explanation for the original definition 53

distinguished because they are characterized in the SuperHyperClass disciplinary 55

methods based on a dominant CONNECTIVE DOMINATION. Because of having 56

CONNECTIVE DOMINATION, there is a need to “re-define” the concept of 57

“neutrosophic CONNECTIVE DOMINATION” and “neutrosophic CONNECTIVE 58

DOMINATION”. SuperHyperVertices and SuperHyperEdges are assigned by 59

Consider a Neutrosophic SuperHyperGraph. “Neutrosophic SuperHyperGraph” is 61

DOMINATION is redefined to a “Neutrosophic CONNECTIVE DOMINATION”. It is 63

useful to define a “Neutrosophic” version of SuperHyperClasses. Since there are more 64

ways to obtain Neutrosophic type results, a SuperHyper- Neutrosophic CONNECTIVE 65

DOMINATION becomes more understandable. Consider a Neutrosophic 66

SuperHyperGraph. If the desired table exists, there are a number of Neutrosophic 67

SuperHyperClasses. So are SuperHyperPath, SuperHyperCycle, SuperHyperStar, 68

SuperHyperBipartite, SuperHyperMultiPartite and SuperHyperWheel. ”Neutrosophic 69

SuperHyperPath”, “Neutrosophic SuperHyperCycle”, “Neutrosophic SuperHyperStar”, 70

“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite” and 71

“Neutrosophic SuperHyperWheel”. A graph is SuperHyperUniform if it is a 72

SuperHyperGraph and the number of SuperHyperEdges elements is the same. Consider 73

a Neutrosophic SuperHyperGraph. There are a number of SuperHyperClasses as follows. 74

It is a SuperHyperPath if there is only one SuperVertex as an intersection between two 75

given SuperHyperEdges with two exceptions. If only one SuperVertex is given as an 76

intersection between two SuperHyperEdges, it is SuperHyperCycle. It is 77