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

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

Multipartite and Cycle By CONNECTIVE DOMINATION As Hyper Decoration On
Super Density
Preprint · July 2023

DOI: 10.5281/zenodo.8196099
CITATIONS
1 author:
Henry Garrett
531 PUBLICATIONS 26,425 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Fuzzy Logic View project
Metric Dimension in fuzzy(neutrosophic) Graphs 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 Multipartite and Cycle 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 SuperHyperMultipartite Neutrosophic Associated to the

Neutrosophic Notions in the Neutrosophic Example (4.2)

Edges Belong to The Neutrosophic SuperHyperWheel
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) E3 (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
= max
00 ⊆V
|{ ( T (Vi ), I(Vi ), F (Vi )) | ∀Vi ∈ VSHG , ∃Vj ∈ V 00 :
V SHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
TV (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 SuperHyperMultipartite (SHG) S is a pair 526
S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 527
SuperHyperMultipartite (SHG), is up in the illustration of the Table (8). 529






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







Let a Neutrosophic SuperHyperMultipartite (SHG) S be a pair S = (V, E). 530
Assume SuperHyperPart {Vi }7i=1 and non-SuperHyperPart {Vi }12 i=7 . Consider a 531
Neutrosophic SuperHyperSet V 0 = {V1 , V4 }. Then V 0 is called Neutrosophic 532
SuperHyperCONNECTIVE DOMINATION since the following expressions, terms and 533

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) E3 (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)
statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION criteria holds. 534
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 ={V1 ,V4 } Vi ∈V 0 ={V1 ,V4 } Vi ∈V 0 ={V1 ,V4 }
= (0.52, 0.52, 0.52) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) | V5 ∈ 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 (V5 ), TV 0 (V1 )]V5 ,V1 ∈E2 ,
IV0 (E2 ) = 0.26 = min[IV 0 (V5 ), IV 0 (V1 )]V5 ,V1 ∈E2 ,
and FV0 (E2 ) = 0.26 = min[FV 0 (V5 ), FV 0 (V1 )]V5 ,V1 ∈E2 ,
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
TV0 (E2 ) = 0.26 = min[TV 0 (V5 ), TV 0 (V1 )]V5 ,V1 ∈E2 ,
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V2 ∈ VSHG \ V 00 , ∃V4 ∈ V 00 :
,
V3 ∈ VSHG \ V 00 , ∃V4 ∈ V 00 :
}
Assume SuperHyperPart {Vi }7i=1 and non-SuperHyperPart {Vi }12

i=7 . Consider a 538
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.24, 0.24, 0.24) E3 (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 , V2 , V4 }. Then V 0 is called Neutrosophic 539
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 ={V1 ,V2 ,V4 } Vi ∈V 0 ={V1 ,V2 ,V4 } Vi ∈V 0 ={V1 ,V2 ,V4 }
= (0.76, 0.76, 0.76) =

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V3 ∈ VSHG \ V 00 , ∃V4 ∈ V 00 :
}
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , V3 , V4 }. Then V 0 is called Neutrosophic 546
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.24, 0.24, 0.24) E3 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.24, 0.24, 0.24)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X
|(
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 }
X X
T (Vi ), I(Vi ), F (Vi ))|
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 } Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 }
= (1, 1, 1) =
X X X
= max
00 ⊆V
|{ ( T (Vi ), I(Vi ), F (Vi )) | V5 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
V SHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
,
V6 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , V3 , V4 , V5 }. Then V 0 is called 553
Neutrosophic SuperHyperCONNECTIVE DOMINATION since the following expressions, 554
terms and statements is called Neutrosophic SuperHyperCONNECTIVE DOMINATION 555
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.24, 0.24, 0.24) E3 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.26, 0.26, 0.26)
criteria holds. 556

X
|( T (Vi ),
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 }
X X
I(Vi ), F (Vi ))|
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 } Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 }
= (1.24, 1.24, 1.24) =

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

,
V7 ∈ VSHG \ V 00 , ∃V1 ∈ V 00 :
}
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , V3 , V4 , V5 , V6 }. Then V 0 is called 561
criteria holds. 564

X
|( T (Vi ),
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 ,V6 }
X X
I(Vi ), F (Vi ))|
Vi ∈V 0 ={V ,V ,V ,V ,V ,V } Vi ∈V 0 ={V
1 2 3 4 5 6 1 ,V2 ,V3 ,V4 ,V5 ,V6 }
= (1.48, 1.48, 1.48) =

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) E2 (0.26, 0.26, 0.26)
V3 (0.24, 0.24, 0.24) E3 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
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.24, 0.24, 0.24) E3 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , V3 , V4 , V5 , V6 , V7 }. Then V 0 is called 569
criteria holds. 572
X
|( T (Vi ),
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 ,V6 ,V7 }
X X
I(Vi ), F (Vi ))|
Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 ,V6 ,V7 } Vi ∈V 0 ={V1 ,V2 ,V3 ,V4 ,V5 ,V6 ,V7 }
= (1.72, 1.72, 1.72).
Neutrosophic SuperHyperSet V 0 = {Vi }12 0

i=1 . Then V is called Neutrosophic 577
X
|( T (Vi ),
Vi ∈V 0 ={Vi }12
i=1
X X
I(Vi ), F (Vi ))|
Vi ∈V 0 ={Vi }12
i=1 Vi ∈V 0 ={Vi }12
i=1
= (2.88, 2.88, 2.88).
Example 4.3. Assume a Neutrosophic SuperHyperCycle (SHG) S is a pair S = (V, E) 580
in the mentioned Neutrosophic Figures in every Neutrosophic items. 581
Edges Belong to The Neutrosophic SuperHyperStar
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)
SuperHyperCycle (SHG), is up in the illustration of the Table (15). 583
Let a Neutrosophic SuperHyperCycle (SHG) S be a pair S = (V, E). Assume 584
SuperHyperExternal {Vi }7i=1 and non-SuperHyperInternal {Vi }34 i=8 . Consider a 585
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 }. Then V 0 is called Neutrosophic 586
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,32−34 ∈ VSHG \ V , ∃V1 ∈ V :
TV0 (E1 ) = 0.26 = min[TV 0 (Vii=11,15,19,24,32−34 ), TV 0 (V1 )]Vii=11,15,19,24,32−34 ,V1 ∈E1 ,
IV0 (E1 ) = 0.26 = min[IV 0 (Vii=11,15,19,24,32−34 ), IV 0 (V1 )]Vii=11,15,19,24,32−34 ,V1 ∈E1 ,
and FV0 (E1 ) = 0.26 = min[FV 0 (Vii=11,15,19,24,32−34 ), FV 0 (V1 )]Vii=11,15,19,24,32−34 ,V1 ∈E1 ,
, TV0 (E7 ) = 0.26 = min[TV 0 (Vii=32−34 ), TV 0 (V1 )]Vii=32−34 ,V1 ∈E7 ,
IV0 (E7 ) = 0.26 = min[IV 0 (Vii=32−34 ), IV 0 (V1 )]Vii=32−34 ,V1 ∈E7 ,
and FV0 (E7 ) = 0.26 = min[FV 0 (Vii=32−34 ), FV 0 (V1 )]Vii=32−34 ,V1 ∈E7 ,
,
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 ,
,
Vii=6,25−30 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
TV0 (E6 ) = 0.26 = min[TV 0 (Vii=6,25−30 ), TV 0 (V7 )]Vii=6,25−30 ,V7 ∈E6 ,
}
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.24, 0.24, 0.24)
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,11,15,19,24,27,32−34 }. Then V 0 593
is called Neutrosophic SuperHyperCONNECTIVE DOMINATION since the following 594
expressions, terms and statements is called Neutrosophic SuperHyperCONNECTIVE 595
DOMINATION criteria holds. 596
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 }
X
I(Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 }
X
F (Vi ))|
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 }
= (2.94, 2.94, 2.94) =

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 ∈ VSHG \ V 00 , ∃V27 ∈ V 00 :
TV0 (E6 ) = 0.26 = min[TV 0 (Vii=6,25−30 ), TV 0 (V27)]Vi ,V27 ∈E6 ,
i=6,25−30

}
Neutrosophic SuperHyperSet 601
V 0 = {V1 , V3 , V5 , V7 , Vii=2,11,15,19,24,27,32−34 , Vii=32,8−10,4,12−14 }. Then V 0 is called 602
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.24, 0.24, 0.24)
criteria holds. 605
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 ,Vii=32,8−10,4,12−14 }
X
I(Vi ),
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 ,Vii=32,8−10,4,12−14 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 ,Vii=32,8−10,4,12−14 }
= (4.86, 4.86, 4.86) =

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 ∈ VSHG \ V 00 , ∃V27 ∈ V 00 :
i=6,25−30

}
Neutrosophic SuperHyperSet 610
V 0 = {V1 , V3 , V5 , V7 , Vii=2,11,15,19,24,27,32−34 , Vii=32,8−10,4,12−14 , Vii=16−18,20−23 }. Then 611
V 0 is called Neutrosophic SuperHyperCONNECTIVE DOMINATION since the following 612
expressions, terms and statements is called Neutrosophic SuperHyperCONNECTIVE 613
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.24, 0.24, 0.24)
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.24, 0.24, 0.24)
DOMINATION criteria holds. 614
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,11,15,19,24,27,32−34 ,Vii=32,8−10,4,12−14 ,Vii=16−18,20−23 }
X
I(Vi ),
X
F (Vi ))|
= (6.54, 6.54, 6.54) =

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=6,25−30 ∈ VSHG \ V , ∃V27 ∈ V :
i=6,25−30

}
SuperHyperExternal {Vi }7i=1 and non-SuperHyperInternal {Vi }34

Neutrosophic SuperHyperSet V 0 = VSHG . Then V 0 is called Neutrosophic 619
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.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
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.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
X
|( T (Vi ),
Vi ∈V 0 =VSHG
X X
I(Vi ), F (Vi ))|
Vi ∈V 0 =VSHG Vi ∈V 0 =VSHG
= (8.24, 8.24, 8.24).
}

X
|( T (Vi ),
Vi ∈V 0 =VSHG
X X
I(Vi ), F (Vi ))|
= (8.26, 8.26, 8.26).
}

X
|( T (Vi ),
Vi ∈V 0 =VSHG
X X
I(Vi ), F (Vi ))|
= (8.28, 8.28, 8.28).
}
5 Main Result 636
Theorem 5.1. (Main Result and Main Theorem). 637
Assume every Neutrosophic SuperHyperMultipartite has the letter z. The notion on 638
the Neutrosophic SuperHyperMultipartite and Neutrosophic SuperHyperCycle don’t 639
coincide. 640
Proof. 641
(i). Let 642
P :
V1Pi , E1 ,
P
V1 j , E2
643
P :
V1Pi , E1 ,
P
V1 j , E2
be a longest path taken a connected Extreme SuperHyperMultipartite ESHM : (V, E). 644
There’s a new way to redefine as 645
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 646
corresponded to ViEXT ERN AL in the literatures of Neutrosophic SuperHyperCONNECTIVE 647
DOMINATION. The latter is straightforward. 648
(ii). Let 649
P :
ViEXT ERN AL , Ei∗ ,
EXT ERN AL ∗
Vi+1 , Ei+1
650
P :
EXT ERN AL ∗
Vi+1 , Ei+1
is a longest SuperHyperCONNECTIVE DOMINATION taken from a connected Extreme 651
SuperHyperCycle ESHC : (V, E). There’s a new way to redefine as 652

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

S = (V, E). Assume every Neutrosophic SuperHyperVertex has the letter z. The
Neutrosophic SuperHyperCONNECTIVE DOMINATION set is as follows.
P
{V1Pi , V1 j }.
Proof. Let 661
P :
V1Pi , E1 ,
P
V1 j , E2
662
P :
V1Pi , E1 ,
P
V1 j , E2

Proposition 5.3. Let a Neutrosophic SuperHyperMultipartite ESHM be a pair

Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
2 × 0.26.
Proof. Let 668
P :
V1Pi , E1 ,
P
V1 j , E2
669
P :
V1Pi , E1 ,
P
V1 j , E2

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

Proposition 5.5. Let a Neutrosophic SuperHyperCycle (ESHC) S be a pair

Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
|V |
× 0.26.
2
Proof. Let 690
P :
EXT ERN AL ∗
Vi+1 , Ei+1
691
P :
EXT ERN AL ∗
Vi+1 , Ei+1

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

pair S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION set is as follows.
P
{V1Pi , V1 j }.
Proof. Let 714
P :
V1Pi , E1 ,
P
V1 j , E2
715
P :
V1Pi , E1 ,
P
V1 j , E2

Proposition 5.8. Let an Uniform Neutrosophic SuperHyperMultipartite ESHM be a

pair S = (V, E). The Neutrosophic SuperHyperCONNECTIVE DOMINATION number is as follows.
2 × 0.26.
Proof. Let 721
P :
V1Pi , E1 ,
P
V1 j , E2
722
P :
V1Pi , E1 ,
P
V1 j , E2

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

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

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

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

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

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

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

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

sophic SuperHyperCONNECTIVE DOMINATION
Edges Belong to The Neutrosophic SuperHyperBipartite
7 Case 1: The Initial Neutrosophic Steps 840
Toward Neutrosophic SuperHyperBipartite as 841
Neutrosophic SuperHyperModel 842
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (43), the 843
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 844
featured. 845
By using the Neutrosophic Figure (43) and the Table (22), the Neutrosophic 846
SuperHyperBipartite is obtained. 847
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 848
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 849
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 850
SuperHyperModel (43), is the Neutrosophic SuperHyperCONNECTIVE DOMINATION. 851
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 852
Toward Neutrosophic SuperHyperMultipartite as 853
Neutrosophic SuperHyperModel 854
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (44), the 855
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 856
Neutrosophic featured. 857
By using the Neutrosophic Figure (44) and the Table (23), the Neutrosophic 858
SuperHyperMultipartite is obtained. 859
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 860
previous result, of the Neutrosophic SuperHyperVertices of the connected 861
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 862
SuperHyperModel (44), is the Neutrosophic SuperHyperCONNECTIVE DOMINATION. 863
9 Wondering Open Problems But As The 864
Directions To Forming The Motivations 865
In what follows, some “problems” and some “questions” are proposed. 866
The SuperHyperCONNECTIVE DOMINATION and the Neutrosophic SuperHyperCONNECTIVE 867
DOMINATION are defined on a real-world application, titled “Cancer’s Recognitions”. 868
Question 9.1. Which the else SuperHyperModels could be defined based on Cancer’s 869
recognitions? 870
Question 9.2. Are there some SuperHyperNotions related to SuperHyperCONNECTIVE 871
and the Neutrosophic SuperHyperCONNECTIVE DOMINATION?

DOMINATION 872
Question 9.3. Are there some Algorithms to be defined on the SuperHyperModels to 873
compute them? 874
Question 9.4. Which the SuperHyperNotions are related to beyond the 875
SuperHyperCONNECTIVE DOMINATION and the Neutrosophic SuperHyperCONNECTIVE DOMINATION? 876
Problem 9.5. The SuperHyperCONNECTIVE DOMINATION and the Neutrosophic 877
SuperHyperCONNECTIVE DOMINATION do a SuperHyperModel for the Cancer’s recognitions and 878
they’re based on SuperHyperCONNECTIVE DOMINATION, are there else? 879
Problem 9.6. Which the fundamental SuperHyperNumbers are related to these 880
SuperHyperNumbers types-results? 881
Problem 9.7. What’s the independent research based on Cancer’s recognitions 882
concerning the multiple types of SuperHyperNotions? 883
10 Conclusion and Closing Remarks 884
In this section, closing and concluding remarks are presented. The drawbacks of this 885
scientific research are shown. Some advantages and disadvantages of this scientific 886
research are highlighted. 887
This scientific research uses some approaches to further understand the Neutrosophic 888
SuperHyperGraphs. In this effort, two SuperHyperNotions are defined on the 889
CONNECTIVE DOMINATION. For this reason, in the second definition, the original 890
definition of the Neutrosophic SuperHyperGraph is redefined on the position of the 891
alphabets. Based on the new Neutrosophic SuperHyperGraph definition, the new 892
SuperHyperNotion, Neutrosophic CONNECTIVE DOMINATION, finds a suitable 893
background to implement some results on. Some SuperHyperClasses and some 894
Neutrosophic SuperHyperClasses are the subjects of this scientific research on modeling 895
areas that are subject to cancer attacks in order to recognize this disease as mentioned 896
under the title “Cancer Diagnosis”. To formalize the SuperHyperNotion, 897
CONNECTIVE DOMINATION, SuperHyperClasses and new SuperHyperClasses 898
instances are introduced. Some general results are summarized in the CONNECTIVE 899
DOMINATION and Neutrosophic CONNECTIVE DOMINATION sections. 900
Clarifications, examples, and literature reviews go all the way. In this scientific research, 901
the literature review has met the lines containing concepts and results. 902
SuperHyperGraph and Neutrosophic SuperHyperGraph are super-hypermodels in 903
“cancer diagnosis” and both are the foundation of the background of this scientific 904
research. Sometimes cancer has occurred in an area full of cells, cell groups, and 905
embedded styles. In this section, SuperHyperModel proposes SuperHyperNotions, 906
formally called “CONNECTIVE DOMINATION”, based on the connections of Cancer’s 907
movements in the longest and strongest styles with the formation of design and 908
architecture, in terms of terms and whispering words. . The “SuperHyper” prefix refers 909
to the topic of embedded styles to explore the background of SuperHyperNotions. In 910
the table (24), the advantages and ways of this scientific research are specified, pointed 911
out and expressed. 912
11 Background 913
There are some scientific researches covering the topic of this scientific research. In what 914
follows, there are some discussion and literature reviews about them. 915
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 916
Cancer And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot” in Ref. [1] 917
by Henry Garrett (2023). In this research article, a novel approach is implemented on 918
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms with 919
introducing used neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 920
in prestigious and fancy journal is entitled “Current Trends in Mass Communication 921
(CTMC)” with ISO abbreviation “Curr Trends Mass Comm” in volume 2 and issue 1 922
with pages 32-55. 923
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 924
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 925
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [2] by Henry Garrett 926
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 927
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 928
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 929
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 930
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 931
pages 35-47. The research article studies deeply with choosing directly neutrosophic 932
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 933
results based on initial background and fundamental SuperHyperNumbers. 934
The seminal paper and groundbreaking article is titled “A Research on Cancer’s 935
Recognition and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and 936
Hamiltonian Sets as Hyper Covering Versus Super separations” in Ref. [3] by Henry 937
Garrett (2023). In this research article, a novel approach is implemented on 938
SuperHyperGraph and neutrosophic SuperHyperGraph based on fundamental notions 939
and using vital tools in Cancer’s Recognition. It’s published in prestigious and fancy 940
journal is entitled “Journal of Mathematical Techniques and Computational 941
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 942
volume 2 and issue 3 with pages 136-148. The research article studies deeply with 943
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 944
breakthrough toward independent results based on initial background and fundamental 945
SuperHyperNumbers. 946
The seminal paper and groundbreaking article is titled “Neutrosophic 1-Failed 947
SuperHyperForcing in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs 948
on Cancer’s Neutrosophic Recognition and Beyond ” in Ref. [4] by Henry Garrett (2023). 949
In this research article, a novel approach is implemented on SuperHyperGraph and 950
neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 951
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 952
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 953
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 954
Comput Math” in volume 2 and issue 6 with pages 221-307. The research article studies 955
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 956
It’s the breakthrough toward independent results based on initial background and 957
fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is 958
titled “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super 959
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 960
Classes” in Ref. [5] by Henry Garrett (2022). In this research article, a novel approach 961
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on 962
fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of 963
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 964
entitled “Journal of Mathematical Techniques and Computational 965
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 966
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 968
breakthrough toward independent results based on initial background and fundamental 969
SuperHyperNumbers. The seminal paper and groundbreaking article is titled 970
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the 971
setting of some classes related to neutrosophic hypergraphs” in Ref. [6] by Henry 972
Garrett (2023). In this research article, a novel approach is implemented on 973
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms without 974
using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 975
prestigious and fancy journal is entitled “Journal of Current Trends in Computer 976
Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in 977
choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 979
breakthrough toward independent results based on initial background. The research 980
article studies deeply with choosing neutrosophic hypergraphs instead of neutrosophic 981
SuperHyperGraph. It’s the breakthrough toward independent results based on initial 982
background. In some articles are titled “0039 — Closing Numbers and Super-Closing 983
Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 984
(Neutrosophic)n-SuperHyperGraph” in Ref. [7] by Henry Garrett (2022), “0049 — 985
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [8] by Henry Garrett 986
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 987
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 988
in Ref. [9] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 989
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 990
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [10] by 991
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 992
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 993
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 994
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 995
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 996
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [12] by Henry 997
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 998
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 999
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 1000
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 1001
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 1002
Ref. [14] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 1003
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1004
SuperHyperGraphs” in Ref. [15] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 1005
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 1006
Ref. [16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 1007
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1008
Special ViewPoints” in Ref. [17] by Henry Garrett (2022), “Neutrosophic 1-Failed 1009
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 1010
on Cancer’s Neutrosophic Recognition And Beyond ” in Ref. [18] by Henry Garrett 1011
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 1012
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [19] by Henry Garrett 1013
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1014
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1015
in Ref. [15] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 1016
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 1017
And (Neutrosophic) SuperHyperGraphs” in Ref. [20] by Henry Garrett (2022), 1018
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 1019
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [21] by 1020
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1021
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [22] by 1022
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1023
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 1024
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 1025
(Neutrosophic) SuperHyperClasses” in Ref. [23] by Henry Garrett (2022), 1026
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 1027
SuperHyperModeling of Cancer’s Recognitions” in Ref. [24] by Henry Garrett (2022), 1028
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1029
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 1030
Treatments” in Ref. [25] by Henry Garrett (2022), “SuperHyperDominating and 1031
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 1032
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [26] by Henry Garrett 1033
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1034
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [206] by Henry 1035
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 1036
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 1037
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [207] by Henry Garrett 1038
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 1039
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 1040
Named (Neutrosophic) SuperHyperGraphs” in Ref. [208] by Henry Garrett (2023), 1041
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 1042
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 1043
Neutrosophic SuperHyperGraphs” in Ref. [209] by Henry Garrett (2023), “Perfect 1044
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 1045
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [212] by 1046
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 1047
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 1048
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [213] by Henry 1049
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 1050
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 1051
the Form of Neutrosophic SuperHyperGraphs” in Ref. [216] by Henry Garrett (2023), 1052
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 1053
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [219] by Henry 1054
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1055
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1056
in Ref. [220] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 1057
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 1058
Ref. [221] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 1059
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 1060
Recognition And Beyond ” in Ref. [222] by Henry Garrett (2022), “(Neutrosophic) 1061
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 1062
SuperHyperGraphs” in Ref. [223] by Henry Garrett (2022), “Basic Notions on 1063
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 1064
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [224] by Henry Garrett 1065
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1066
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [235] by Henry 1067
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 1068
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 1069
SuperHyperGraph (NSHG)” in Ref. [236] by Henry Garrett (2022), and [4–236], there 1070
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 1071
SuperHyperGraph and SuperHyperGraph alongside scientific research books 1072
at [237–367]. Two popular scientific research books in Scribd in the terms of high 1073
readers, 4728 and 5721 respectively, on neutrosophic science is on [368, 369]. 1074
Some scientific studies and scientific researches about neutrosophic graphs, are 1075
proposed as book in Ref. [368] by Henry Garrett (2023) which is indexed by Google 1076
Scholar and has more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic 1077
Graphs” and published by Dr. Henry Garrett. This research book covers different types 1078
of notions and settings in neutrosophic graph theory and neutrosophic 1079
SuperHyperGraph theory. 1080
Also, some scientific studies and scientific researches about neutrosophic graphs, are 1081
proposed as book in Ref. [369] by Henry Garrett (2023) which is indexed by Google 1082
Scholar and has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” 1083
and published by Dr. Henry Garrett. This research book presents different types of 1084
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 1085
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 1086
book has scrutiny on the complement of the intended set and the intended set, 1087
simultaneously. It’s smart to consider a set but acting on its complement that what’s 1088
done in this research book which is popular in the terms of high readers in Scribd. 1089
See the seminal scientific researches [1–3]. The formalization of the notions on the 1090
framework of notions in SuperHyperGraphs, Neutrosophic notions in 1091
SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [4–236] 1092
alongside scientific research books at [237–367]. Two popular scientific research books 1093
in Scribd ,in the terms of high readers, 4728 and 5721 respectively, on neutrosophic 1094
science is on [368, 369]. 1095
References 1096
1. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 1097
SuperHyperGraph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 1098
2(1) (2023) 32-55. (https://www.opastpublishers.com/open-access-articles/new- 1099
ideas-in-recognition-of-cancer-and-neutrosophic-super-hypergraph-as-hyper- 1100
tool-on-super-toot.pdf) 1101
2. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 1102
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 1103
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 1104
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 1105
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 1106
graphs-and-super-hyper-graphs-alongside-a.pdf) 1107
3. Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 1108
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 1109
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 1110
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 1111
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by- 1112
eulerian-super-hyper-cycles-and-hamiltonian-sets-.pdf) 1113
4. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 1114
SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s 1115
Neutrosophic Recognition and Beyond ”, J Math Techniques Comput Math 2(6) 1116
(2023) 221-307. (https://www.opastpublishers.com/open-access- 1117
articles/neutrosophic-1failed-superhyperforcing-in-the-superhyperfunction-to- 1118
use-neutrosophic-superhypergraphs-on-cancers-neutros.pdf) 1119
5. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 1120
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 1121
Hypergraphs”, J Curr Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 1122
10.33140/JCTCSR.02.01.04) 1123
6. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 1124
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 1125
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 1126
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 1127
7. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 1128
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 1129
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 1130
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 1131
Research, https://doi.org/10.5281/zenodo.6319942. 1132
https://oa.mg/work/10.5281/zenodo.6319942 1133
8. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 1134
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 1135
2022. CERN European Organization for Nuclear Research, 1136
https://doi.org/10.13140/rg.2.2.35241.26724. 1137
https://oa.mg/work/10.13140/rg.2.2.35241.26724 1138
9. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 1139
Confrontation under Cancer’s Recognition as the Model in The Setting of 1140
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 1141
10.20944/preprints202301.0308.v1). 1142
10. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 1143
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1144
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1145
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1146
11. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 1147
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 1148
2023010267 (doi: 10.20944/preprints202301.0267.v1). 1149
12. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1150
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1151
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1152
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1153
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1154
10.20944/preprints202301.0265.v1). 1155
13. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 1156
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1157
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1158
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1159
14. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1160
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1161
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1162
10.20944/preprints202301.0240.v1). 1163
15. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1164
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1165
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1166
10.20944/preprints202301.0224.v1). 1167
16. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 1168
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1169
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1170
17. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 1171
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 1172
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 1173
10.20944/preprints202301.0088.v1). 1174
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 1176
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1177
19. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 1178
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1179
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1180
20. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 1181
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 1182
10.20944/preprints202301.0105.v1). 1184
10.20944/preprints202301.0088.v1). 1188
22. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1189
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1190
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1191
23. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1192
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 1193
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 1194
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1195
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1196
24. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 1197
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 1198
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1199
25. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1200
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1201
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1202
10.20944/preprints202212.0324.v1). 1203
26. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 1204
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 1205
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1206
10.20944/preprints202211.0576.v1). 1207
SuperHyperGraph With Bipartite and Path By DOMINATION As Hyper 1209
Decoration On Super Density”, Zenodo 2023, (doi: 10.5281/zenodo.8187955). 1210
SuperHyperGraph With Star and Wheel By DOMINATION As Hyper 1212
SuperHyperGraph With Multipartite and Cycle By DOMINATION As Hyper 1215
SuperHyperGraph By SuperHyperPerfect Search As Hyper Perf On Super 1218
Perfidy”, Zenodo 2023, (doi: 10.5281/zenodo.8104836). 1219
31. Henry Garrett, “New Ideas On Super Perfidy By Hyper Perf Of 1220
SuperHyperPerfect Search In Recognition of Cancer With (Neutrosophic) 1221
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8104857). 1222
SuperHyperGraph By Reverse Strict Dimension Dominating As Hyper Dimple 1224
On Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8092796). 1225
33. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1226
Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1227
SuperHyperGraph By Unequal Dimension Dominating As Hyper Dimple On 1230
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8088438). 1231
35. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal 1232
Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1233
SuperHyperGraph By Strict Dimension Dominating As Hyper Dimple On Super 1236
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8084436). 1237
37. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Strict 1238
SuperHyperGraph By Reverse Strict Connective As Hyper Conceit On Super 1242
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8080100). 1243
39. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict 1244
Connective In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1245
Zenodo 2023, (doi: 10.5281/zenodo.8080068). 1246
SuperHyperGraph By Unequal Connective Dominating As Hyper Conceit On 1248
Super Con”, Zenodo 2023, (doi: 10.5281/zenodo.8078445). 1249
41. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal 1250
Connective Dominating In Recognition of Cancer With (Neutrosophic) 1251
SuperHyperGraph By Strict Connective Dominating As Hyper Conceit On 1254
43. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict 1256
SuperHyperGraph By Reverse Dimension Dominating As Hyper Dimple On 1260
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8072171). 1261
45. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1262
SuperHyperGraph By Equal Dimension Dominating As Hyper Dimple On Super 1266
47. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal 1268
SuperHyperGraph By Dimension Dominating As Hyper Dimple On Super 1272
49. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension 1274
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1275
SuperHyperGraph By Reverse Connective Dominating As Hyper Conceit On 1278
51. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse 1280
SuperHyperGraph By Equal Connective Dominating As Hyper Conceit On 1284
53. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal 1286
SuperHyperGraph By Connective Dominating As Hyper Conceit On Super 1290
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8051346). 1291
55. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective 1292
SuperHyperGraph By United Dominating As Hyper Ultra On Super Units”, 1296
57. Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United 1298
SuperHyperGraph By Zero Forcing As Hyper ford On Super forceps”, Zenodo 1302
2023, (doi: 10.5281/zenodo.8017246). 1303
59. Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 1304
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1305
(doi: 10.5281/zenodo.8020128). 1306
SuperHyperGraph By Matrix-Based As Hyper mat On Super matte”, Zenodo 1308
2023, (doi: 10.5281/zenodo.7978571). 1309
61. Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 1310
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1311
(doi: 10.5281/zenodo.7978857). 1312
SuperHyperGraph By Dominating-Edges As Hyper Dome On Super Eddy”, 1314
63. Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of 1316
Dominating-Edges In Cancer’s Recognition With (Neutrosophic) 1317
SuperHyperGraph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, 1320
(doi: 10.5281/zenodo.7916595). 1321
65. Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In 1322
(doi: 10.5281/zenodo.7923632). 1324
SuperHyperGraph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On 1326
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7904698). 1327
67. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 1328
Eulerian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1329
SuperHyperGraph By Eulerian-Type-Cycle-Decomposition As Hyper 1332
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1333
10.5281/zenodo.7904529). 1334
69. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 1335
Eulerian-Type-Cycle-Decomposition In Cancer’s Recognition With 1336
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 1337
10.5281/zenodo.7904401). 1338
SuperHyperGraph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super 1340
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7871026). 1341
Eulerian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1343
SuperHyperGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super 1346
Eulerian-Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) 1349
SuperHyperGraph By Eulerian-Cycle-Decomposition As Hyper Decompress On 1352
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7855661). 1353
Eulerian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) 1355
SuperHyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, 1358
77. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 1360
Eulerian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1361
SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super 1364
Eulerian-Type-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1367
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 1370
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 1371
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1373
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 1376
EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 1377
Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1379
SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 1382
Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1385
SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 1388
Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1391
SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 1394
10.5281/zenodo.7812236). 1395
SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 1397
Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 1398
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 1400
EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 1401
Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1403
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 1406
SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 1409
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 1410
Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1412
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 1415
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1416
10.5281/zenodo.7804238). 1417
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 1419
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 1420
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 1422
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 1423
98. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 1424
Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1425
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 1428
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 1431
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 1432
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 1434
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 1435
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1437
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 1440
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 1443
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 1446
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 1449
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 1452
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 1455
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 1458
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 1461
111. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 1463
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 1464
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 1465
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 1467
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 1470
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 1471
114. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 1472
(doi: 10.5281/zenodo.7764916). 1474
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 1476
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 1479
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 1482
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 1483
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 1485
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 1486
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 1488
2023, (doi: 10.13140/RG.2.2.11377.76644). 1489
120. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 1490
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1491
2023, (doi: 10.13140/RG.2.2.23750.96329). 1492
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 1494
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 1497
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 1500
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 1501
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 1503
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 1506
126. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 1508
2023, (doi: 10.13140/RG.2.2.32467.25124). 1510
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 1512
128. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1514
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 1515
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 1518
130. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 1520
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 1521
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 1524
132. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 1526
2023, (doi: 10.13140/RG.2.2.20170.24000). 1528
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 1530
134. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1532
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 1533
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 1536
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 1537
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 1539
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 1542
138. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 1544
2023, (doi: 10.13140/RG.2.2.27392.30721). 1546
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 1548
2023, (doi: 10.13140/RG.2.2.33028.40321). 1549
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 1551
141. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 1553
2023, (doi: 10.13140/RG.2.2.16356.04489). 1555
SuperHyperGraph By Space As Hyper Sparse On Super Spark ”, ResearchGate 1557
2023, (doi: 10.13140/RG.2.2.21756.21129). 1558
143. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 1559
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 1560
(doi: 10.13140/RG.2.2.30983.68009). 1561
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 1563
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 1564
145. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 1565
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 1566
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 1569
147. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 1571
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 1572
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 1575
149. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 1577
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 1578
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 1581
151. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 1583
2023, (doi: 10.13140/RG.2.2.11172.14720). 1585
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 1587
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 1588
153. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 1589
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 1590
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 1593
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 1594
155. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 1595
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 1596
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 1599
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 1600
157. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 1601
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 1602
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 1605
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 1606
159. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 1607
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 1608
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 1611
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 1612
161. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 1613
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 1614
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 1617
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 1618
163. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 1619
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 1620
164. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 1622
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 1623
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 1626
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 1627
166. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 1628
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 1629
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 1632
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 1633
168. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 1634
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 1635
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 1638
170. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 1640
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 1641
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 1644
172. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 1646
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 1647
173. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 1649
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 1650
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 1653
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 1656
176. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 1658
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 1659
177. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 1661
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 1662
178. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1664
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 1665
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1666
179. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1667
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 1668
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 1669
180. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 1670
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 1671
181. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 1673
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 1674
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 1675
182. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 1676
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 1677
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1678
183. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 1679
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 1680
Hyper Covering Versus Super separations-VI ”, ResearchGate 2023, (doi: 1681
10.13140/RG.2.2.29913.80482). 1682
Hyper Covering Versus Super separations-V ”, ResearchGate 2023, (doi: 1685
10.13140/RG.2.2.33269.24809). 1686
Hyper Covering Versus Super separations-IV ”, ResearchGate 2023, (doi: 1689
10.13140/RG.2.2.34946.96960). 1690
186. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 1691
Hyper Covering Versus Super separations-III ”, ResearchGate 2023, (doi: 1693
10.13140/RG.2.2.14814.31040). 1694
Hyper Covering Versus Super separations-II ”, ResearchGate 2023, (doi: 1697
10.13140/RG.2.2.15653.17125). 1698
Hyper Covering Versus Super separations-I ”, ResearchGate 2023, (doi: 1701
10.13140/RG.2.2.25719.50089). 1702
189. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 1703
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 1704
SuperHyperConnectivities”, ResearchGate 2023, (doi: 1705
10.13140/RG.2.2.29441.94562). 1706
190. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 1707
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 1708
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 1709
191. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 1710
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 1711
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1712
192. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 1713
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 1714
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 1715
193. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 1716
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 1717
Recognition”, Preprints 2023, 2023010396 (doi: 1718
10.20944/preprints202301.0396.v1). 1719
194. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 1720
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 1721
Recognition”, Preprints 2023, 2023010395 (doi: 1722
10.20944/preprints202301.0395.v1). 1723
195. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 1724
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 1725
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 1726
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 1727
10.13140/RG.2.2.26240.51204). 1728
196. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 1729
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 1730
Classes With Hyper Effects In The Background of the Framework is So-Called 1731
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1732
10.13140/RG.2.2.12818.73925). 1733
197. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 1734
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 1735
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 1736
10.13140/RG.2.2.26836.88960). 1737
198. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 1738
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 1739
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 1740
199. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 1741
Confrontation under Cancer’s Recognition as the Model in The Setting of 1742
10.20944/preprints202301.0308.v1). 1744
200. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 1745
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1746
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1747
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1748
201. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1749
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 1750
(doi: 10.20944/preprints202301.0267.v1).). 1751
202. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1752
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1753
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1754
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1755
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1756
10.20944/preprints202301.0265.v1). 1757
203. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 1758
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1759
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1760
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1761
204. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1762
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1763
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1764
10.20944/preprints202301.0240.v1). 1765
205. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1766
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1767
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1768
10.20944/preprints202301.0224.v1). 1769
206. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 1770
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 1771
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 1772
207. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 1773
The Cancer’s Extreme Recognition With Different Types of Extreme 1774
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 1775
208. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1777
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1778
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1779
2023, (doi: 10.13140/RG.2.2.32530.73922). 1780
209. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 1781
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 1782
SuperHyperClique on Cancer’s Recognition called Neutrosophic 1783
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 1784
210. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1785
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1786
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1787
2023, (doi: 10.13140/RG.2.2.32530.73922). 1788
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1790
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1791
212. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 1792
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 1793
213. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 1795
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 1796
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 1797
10.20944/preprints202301.0105.v1). 1802
10.20944/preprints202301.0088.v1). 1806
216. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 1807
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 1808
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 1809
(doi: 10.13140/RG.2.2.17385.36968). 1810
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1813
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1815
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1816
219. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 1817
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 1818
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1821
Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 1822
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1824
2023, (doi: 10.13140/RG.2.2.35774.77123). 1825
Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 1828
10.13140/RG.2.2.36141.77287). 1829
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1831
10.13140/RG.2.2.29430.88642). 1832
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1835
10.13140/RG.2.2.11369.16487). 1836
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1838
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1839
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 1841
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1846
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1847
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 1851
2022, (doi: 10.13140/RG.2.2.14426.41923). 1852
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1855
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 1858
231. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 1859
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1860
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1861
10.20944/preprints202212.0324.v1). 1862
232. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1863
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 1864
in Cancer’s Treatments”, ResearchGate 2022 (doi: 1865
10.13140/RG.2.2.23123.04641). 1866
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1869
10.20944/preprints202211.0576.v1). 1870
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 1873
10.13140/RG.2.2.23324.56966). 1874
235. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 1875
and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 1876
2022 (doi: 10.13140/RG.2.2.29173.86244). 1877
236. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 1878
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 1879
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 1880
10.13140/RG.2.2.25385.88160). 1881
237. Henry Garrett, “Domination In Neutrosophic SuperHyperGraphs”. Dr. Henry 1882
Garrett, 2023 (doi: 10.5281/zenodo.8113416). 1883
238. Henry Garrett, “SuperHyperPerfect Search In SuperHyperGraphs”. Dr. Henry 1884
239. Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyperGraphs”. 1886
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8092816). 1887
240. Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. 1888
Henry Garrett, 2023 (doi: 10.5281/zenodo.8090194). 1889
241. Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. 1890
242. Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry 1892
243. Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. 1894
244. Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. 1896
245. Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. 1898
246. Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. 1900
247. Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1902
248. Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. 1904
249. Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. 1906
250. Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry 1908
251. Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1910
2023 (doi: 10.5281/zenodo.8027488). 1911
252. Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1912
(doi: 10.5281/zenodo.8020181). 1913
253. Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1914
(doi: 10.5281/zenodo.7978921). 1915
254. Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 1916
10.5281/zenodo.7943878). 1917
255. Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 1918
2023 (doi: 10.5281/zenodo.7943871). 1919
256. Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1920
(doi: 10.5281/zenodo.7923786). 1921
257. Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1922
258. Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1924
259. Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1926
260. Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1928
261. Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1930
262. Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1932
2023 (doi: 10.5281/zenodo.7854561). 1933
263. Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. 1934
264. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 1936
265. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 1938
266. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 1940
267. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 1942
268. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1944
2023 (doi: 10.5281/zenodo.7812750). 1945
269. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1946
270. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1948
271. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1950
272. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1952
273. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1954
274. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1956
275. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 1958
276. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 1960
277. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1962
2023 (doi: 10.5281/zenodo.7783791). 1963
278. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1964
2023 (doi: 10.5281/zenodo.7780123). 1965
279. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 1966
280. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 1968
10.5281/zenodo.7637762). 1969
281. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1970
(doi: 10.5281/zenodo.7766174). 1971
282. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1972
(doi: 10.5281/zenodo.7762232). 1973
283. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1974
2023 (doi: 10.5281/zenodo.7758601). 1975
284. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1976
10.5281/zenodo.7754661). 1977
285. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1978
2023 (doi: 10.5281/zenodo.7750995) . 1979
286. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 1980
287. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1982
(doi: 10.5281/zenodo.7747236). 1983
288. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1984
2023 (doi: 10.5281/zenodo.7742587). 1985
289. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 1986
290. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1988
(doi: 10.5281/zenodo.7734719). 1989
291. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 1990
2023 (doi: 10.5281/zenodo.7730484). 1991
292. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 1992
293. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1994
(doi: 10.5281/zenodo.7722865). 1995
294. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1996
10.5281/zenodo.7713563). 1997
295. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1998
10.5281/zenodo.7709116). 1999
296. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2000
2023 (doi: 10.5281/zenodo.7706415). 2001
297. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2002
2023 (doi: 10.5281/zenodo.7706063). 2003
298. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2004
2023 (doi: 10.5281/zenodo.7701906). 2005
299. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2006
10.5281/zenodo.7700205). 2007
300. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2008
2023 (doi: 10.5281/zenodo.7694876). 2009
301. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2010
2023 (doi: 10.5281/zenodo.7679410). 2011
302. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2012
(doi: 10.5281/zenodo.7675982). 2013
303. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2014
(doi: 10.5281/zenodo.7672388). 2015
304. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2016
10.5281/zenodo.7668648). 2017
305. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2018
10.5281/zenodo.7662810). 2019
306. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2020
(doi: 10.5281/zenodo.7659162). 2021
307. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2022
10.5281/zenodo.7653233). 2023
308. Henry Garrett, “SuperHyperWheel ”. Dr. Henry Garrett, 2023 (doi: 2024
10.5281/zenodo.7653204). 2025
309. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 2026
10.5281/zenodo.7653142). 2027
310. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 2028
10.5281/zenodo.7653117). 2029
311. Henry Garrett, “SuperHyperStar ”. Dr. Henry Garrett, 2023 (doi: 2030
10.5281/zenodo.7653089). 2031
312. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2032
10.5281/zenodo.7651687). 2033
313. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 2034
10.5281/zenodo.7651619). 2035
314. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 2036
10.5281/zenodo.7651439). 2037
315. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 2038
10.5281/zenodo.7650729). 2039
316. Henry Garrett, “SuperHyperConnected ”. Dr. Henry Garrett, 2023 (doi: 2040
10.5281/zenodo.7647868). 2041
317. Henry Garrett, “SuperHyperTotal ”. Dr. Henry Garrett, 2023 (doi: 2042
10.5281/zenodo.7647017). 2043
318. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 2044
10.5281/zenodo.7644894). 2045
319. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 2046
10.5281/zenodo.7641880). 2047
320. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 2048
10.5281/zenodo.7632923). 2049
321. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 2050
10.5281/zenodo.7623459). 2051
322. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2052
2023 (doi: 10.5281/zenodo.7606416). 2053
323. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 2054
(doi: 10.5281/zenodo.7606416). 2055
324. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 2056
10.5281/zenodo.7606404). 2057
325. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2058
10.5281/zenodo.7580018). 2059
326. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2060
10.5281/zenodo.7580018). 2061
327. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2062
10.5281/zenodo.7580018). 2063
328. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2064
10.5281/zenodo.7579929). 2065
329. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2066
10.5281/zenodo.7563170). 2067
330. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2068
10.5281/zenodo.7563164). 2069
331. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2070
10.5281/zenodo.7563160). 2071
332. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2072
10.5281/zenodo.7563160). 2073
333. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2074
10.5281/zenodo.7563160). 2075
334. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 2076
(doi: 10.5281/zenodo.7557063). 2077
335. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2078
10.5281/zenodo.7557009). 2079
336. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 2080
(doi: 10.5281/zenodo.7539484). 2081
337. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2082
2023 (doi: 10.5281/zenodo.7523390). 2083
338. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 2084
(doi: 10.5281/zenodo.7523390). 2085
339. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2086
2023 (doi: 10.5281/zenodo.7523390). 2087
340. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2088
10.5281/zenodo.7574952). 2089
341. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2090
10.5281/zenodo.7574992). 2091
342. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2092
10.5281/zenodo.7523357). 2093
343. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2094
10.5281/zenodo.7523357). 2095
344. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2096
2023 (doi: 10.5281/zenodo.7504782). 2097
345. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 2098
(doi: 10.5281/zenodo.7504782). 2099
346. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2100
2023 (doi: 10.5281/zenodo.7504782). 2101
347. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2102
10.5281/zenodo.7499395). 2103
348. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2104
10.5281/zenodo.7499395). 2105
349. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2106
10.5281/zenodo.7499395). 2107
350. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2108
2023 (doi: 10.5281/zenodo.7497450). 2109
351. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 2110
(doi: 10.5281/zenodo.7497450). 2111
352. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 2112
(doi: 10.5281/zenodo.7494862). 2113
353. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2114
10.5281/zenodo.7494862). 2115
354. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 2116
(doi: 10.5281/zenodo.7494862). 2117
355. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 2118
(doi: 10.5281/zenodo.7493845). 2119
356. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2120
10.5281/zenodo.7493845). 2121
357. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 2122
(doi: 10.5281/zenodo.7493845). 2123
358. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2124
10.5281/zenodo.7539484). 2125
359. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2126
10.5281/zenodo.7523390). 2127
360. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2128
10.5281/zenodo.7523357). 2129
361. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2130
10.5281/zenodo.7504782). 2131
362. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2132
10.5281/zenodo.7499395). 2133
363. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2134
10.5281/zenodo.7497450). 2135
364. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2136
10.5281/zenodo.7494862). 2137
365. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2138
10.5281/zenodo.7493845). 2139
366. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2140
10.5281/zenodo.7480110). 2141
367. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 2142
10.5281/zenodo.7378758). 2143
368. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 2144
10.5281/zenodo.6320305). 2145
369. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 2146
10.5281/zenodo.6677173). 2147
View publication stats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph With Multipartite and Cycle 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 Multipartite and Cycle 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

531 PUBLICATIONS 26,425 CITATIONS

On Fuzzy Logic View project

Metric Dimension in fuzzy(neutrosophic) Graphs View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

SuperHyperGraph With Multipartite and Cycle 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