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

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

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

DOI: 10.5281/zenodo.8201255
CITATIONS
1 author:
Henry Garrett
536 PUBLICATIONS 27,009 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project
All content following this page was uploaded by Henry Garrett on 31 July 2023.
The user has requested enhancement of the downloaded file.

Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
New Ideas In Recognition of Cancer And Neutrosophic 2
SuperHyperGraph With Bipartite and Path By EQUAL 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
SuperHyperEQUAL CONNECTIVE DOMINATION). Let a Neutrosophic SuperHyperGraph 11
(NSHG) S be a pair S = (V, E). Consider a Neutrosophic SuperHyperSet 12
V 0 = {V1 , V2 , . . . , Vs }. Then V 0 is called Neutrosophic SuperHyperEQUAL CONNECTIVE 13
DOMINATION if the following expressions, terms and statements is called Neutrosophic 14
SuperHyperEQUAL CONNECTIVE DOMINATION criteria 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
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0 0 0
TV (Vi , Vj ∈ Ei ) = min[TV (Vi ), TV (Vj )]Vi ,Vj0 ∈P :Vi ,...,Vj ,
0 0
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 EQUAL CONNECTIVE DOMINATION and a 17
Neutrosophic EQUAL CONNECTIVE DOMINATION. Two different 18
SuperHyperDefinitions were started for them, but research has progressed and 19
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass are well-defined and 20
well-reviewed based on them. Literature review is implemented throughout this research. 21
To shine the light and importance of this research, a comparison between this 22
SuperHyperNotion with other SuperHyperNotions and basic SuperHyperNumbers is 23
presented. Definitions are followed by examples and examples, so clarifications are 24
guided by various tools. Applications are designed to understand the theoretical aspect 25
of this ongoing research. “Cancer diagnosis” are the things that are being researched to 26
explore the challenges that make sense in ongoing research and future research. It is a 27
special case. Cells are viewed in the intended manner. There are different types of them. 28
Some are individual and some are well modeled by groups of cells. All these types are 29
officially called “SuperHyperVertex”, but the relationships between them all are 30
officially called “SuperHyperEdge”. “SuperHyperGraph” and “Neutrosophic 31
SuperHyperGraph” frameworks are selected and selected for research on “Cancer 32
Diagnosis”. Thus, these complex and dense super-hypermodels open avenues for 33
research on theoretical aspects and “cancer diagnosis”. Ways to pursue this scientific 34
research have been considered. It has also been formally collected in the form of several 35
questions and problems. It is useful to define a “neutrosophic” version of EQUAL 36
CONNECTIVE DOMINATION. Since there are more ways to get type results a 37
EQUAL CONNECTIVE DOMINATION becomes more understandable. In order to 38
master the Neutrosophic EQUAL CONNECTIVE DOMINATION, there is a need to 39
“re-define” the concept of “EQUAL CONNECTIVE DOMINATION mastery”. 40
SuperHyperVertices and SuperHyperEdges are assigned by alphabetical labels. In this 41
method, the position of tags is used to assign values. Suppose a EQUAL 42
CONNECTIVE DOMINATION. If the specified table contains “values of vertices, 43
supervertices, edges, hyperedges, and hyperedges belonging to Neutrosophic 44
SuperHyperGraph” with key points, it is redefined. ”values of vertices & number of 45
positions in alphabet”, ”Values of SuperVertices&maximum values of its vertices”, 46
”values of edges&maximum values of its vertices”, ”super edge values&max values of its 47
vertices”, “super edge values” and maximum values of its endpoints”. To get examples 48
and structural examples, I would like to introduce the next SuperHyperClass 49
SuperHyperGraph based on EQUAL CONNECTIVE DOMINATION. This is the 50
original. Having the foundation of the previous definition in the SuperHyperClass type 51
would be disciplined. If there is a need to have all EQUAL CONNECTIVE 52
DOMINATION until EQUAL CONNECTIVE DOMINATION, then it is officially 53
called “EQUAL CONNECTIVE DOMINATION”, but otherwise, it is not EQUAL 54
CONNECTIVE DOMINATION. There is some explanation for the original definition 55
titled “EQUAL CONNECTIVE DOMINATION”. These two examples are further 56
explored and distinguished because they are characterized in the SuperHyperClass 57
disciplinary methods based on a dominant EQUAL CONNECTIVE DOMINATION. 58
Because of having EQUAL CONNECTIVE DOMINATION, there is a need to 59
“re-define” the concept of “neutrosophic EQUAL CONNECTIVE DOMINATION” and 60
“neutrosophic EQUAL CONNECTIVE DOMINATION”. SuperHyperVertices and 61
SuperHyperEdges are assigned by alphabetical labels. In this method, the position of 62
tags is used to assign values. Consider a Neutrosophic SuperHyperGraph. 63
“Neutrosophic SuperHyperGraph” is redefined if the desired table exists. And if the 64
desired table exists, a EQUAL CONNECTIVE DOMINATION is redefined to a 65
“Neutrosophic EQUAL CONNECTIVE DOMINATION”. It is useful to define a 66
“Neutrosophic” version of SuperHyperClasses. Since there are more ways to obtain 67
Neutrosophic type results, a SuperHyper- Neutrosophic EQUAL CONNECTIVE 68
DOMINATION becomes more understandable. Consider a Neutrosophic 69
SuperHyperGraph. If the desired table exists, there are a number of Neutrosophic 70
SuperHyperClasses. So are SuperHyperPath, SuperHyperCycle, SuperHyperStar, 71
SuperHyperBipartite, SuperHyperMultiPartite and SuperHyperWheel. ”Neutrosophic 72
SuperHyperPath”, “Neutrosophic SuperHyperCycle”, “Neutrosophic SuperHyperStar”, 73
“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite” and 74
“Neutrosophic SuperHyperWheel”. A graph is SuperHyperUniform if it is a 75
SuperHyperGraph and the number of SuperHyperEdges elements is the same. Consider 76
a Neutrosophic SuperHyperGraph. There are a number of SuperHyperClasses as follows. 77
It is a SuperHyperPath if there is only one SuperVertex as an intersection between two 78
given SuperHyperEdges with two exceptions. If only one SuperVertex is given as an 79
intersection between two SuperHyperEdges, it is SuperHyperCycle. It is 80
SuperHyperStar and only one SuperVertex as intersection among all SuperHyperEdges. 81
It is SuperHyperBipartite, and only one SuperVertex is given as the intersection between 82
two SuperHyperEdges, and these SuperVertices, which form two distinct sets, have no 83
SuperHyperEdge in common. This is SuperHyperMultiPartite. Only one SuperVertex is 84
given as an intersection between two SuperHyperEdges, and these SuperVertices, which 85
form separate multisets, have no SuperHyperEdge in common. If only one 86
SuperHyperEdge among the given two SuperHyperEdges is a SuperHyperWheel and a 87
SuperVertex has a SuperHyperEdge with any regular SuperVertex. SuperHyperModel 88
suggests specific designs and specific architectures. SuperHyperModel is officially called 89
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, 90
the “special” cells and the “special group” of cells are SuperHyperModeled as 91
“SuperHyperVertices” and the common and desired properties between the “special” 92
cells and the “special group” of cells. SuperHyperModeled as “SuperHyperEdges”. 93
Sometimes, to have a more accurate SuperHyperModel, it is useful to have some degree 94
of determinism, uncertainty, and neutrality, in this case the SuperHyperModel is called 95
“Neutrosophic”. In future scientific research, the foundation will be based on “diagnosis 96
of cancer” and the results and definitions will be introduced in redeemed methods. 97
Cancer diagnosis in long-term practice. The specific region is assigned by the model 98
(called SuperHyperGraph) and the long cycle of movement of the cancer is determined 99
by this scientific research. Sometimes the movement of cancer is not easy to detect, 100
because there is certainty, uncertainty and neutrality about the movements and effects 101
of cancer on that area. This event leads us to choose another model [which is said to be 102
the Neutrosophic superhypergraph] in order to have a proper understanding of what 103
happened and was done. There are some specific models, which are well known and 104
have names, and some SuperHyperGeneral SuperHyperModels. The movements and 105
effects of cancer in complex pathways and between complex groups of cells can be 106
visualized with a Neutrosophic SuperHyperPath (-/SuperHyperCycle, SuperHyperStar, 107
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The goal is to find 108
the longest EQUAL CONNECTIVE DOMINATION or the strongest EQUAL 109
CONNECTIVE DOMINATION in those Neutrosophic SuperHyperModels. Some 110
general results are presented for the longest EQUAL CONNECTIVE DOMINATION 111
called EQUAL CONNECTIVE DOMINATION and the strongest EQUAL 112
CONNECTIVE DOMINATION called Neutrosophic EQUAL CONNECTIVE 113
DOMINATION. Beyond that in SuperHyperStar, all possible SuperHyperPaths have 114
only two SuperHyperEdges, but it is not enough as having at least three 115
SuperHyperEdges is necessary to form any style of cycle. There is no form of any cycle, 116
but literally, it is the transformation of any cycle. It literally transforms and does not 117
form. A basic introduction to the theory of EQUAL CONNECTIVE DOMINATION 118
Neutrosophic, SuperHyperGraphs and Neutrosophic SuperHyperGraphs is suggested. 119
Keywords: Neutrosophic SuperHyperGraph, SuperHyperEQUAL CONNECTIVE 120
, Cancer’s Neutrosophic Recognition

DOMINATION 121
AMS Subject Classification: 05C17, 05C22, 05E45 122
2 Applied Notions Under The Scrutiny Of The 123
Motivation Of This Scientific Research 124
In this scientific research, there are ideas in the prominent frameworks of motivations. I 125
try to bring motivations in narrative ways. Some Cells have faced attacks from the 126
established situation with cancer attacks in this case, there is some analysis embedded 127
in the case current situations where cells can be labeled as some groups and some 128
groups or individuals are overlabeled, all from behaviors to overcome cancer attacks. In 129
embedded situations, cell individuals and cell groups can be considered as “new groups”. 130
So it encourages us to find suitable SuperHyperModels for more appropriate analysis 131
about this dirty story. I found SuperHyperModels, officially called “SuperHyperGraphs” 132
and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, cells and groups of 133
cells are defined as “SuperHyperVertices” and relationships between individual cells and 134
groups of cells are defined as “SuperHyperEdges”. So this is another motivation for us 135
to do research on this SuperHyperModel based on “cancer diagnosis”. Sometimes, 136
things get worse. The situation has passed certainty and precise style. So it is beyond 137
them. There are three descriptions, i.e., degrees of determination, uncertainty, and 138
neutrality, for any object based on ambiguous forms, i.e., incomplete data, imprecise 139
data, and uncertain analysis. The second model can be considered in the previous 140
SuperHyperModel. This is SuperHyperModel. This is SuperHyperGraph but officially 141
called “Neutrosophic SuperHyperGraphs”. Cancer is a disease, but the model is 142
supposed to understand what happens in this phenomenon. The special case of this 143
disease is considered and some parameters are used as consequences of the model. Cells 144
are attacked by the disease, but the movement of cancer is in a specific area. Knowing 145
the mind of cancer can help to find some cures for this disease. SuperHyperGraph and 146
Neutrosophic Super-HyperGraph are super-hypermodels used in “cancer diagnosis” and 147
both are the foundation of the background of this scientific research. Sometimes cancer 148
has occurred in an area full of cells, cell groups, and embedded styles. In this section, 149
SuperHyperModel proposes based on the links of cancer movements in the form of unity 150
styles with the formation of design and architecture officially called “EQUAL 151
CONNECTIVE DOMINATION”, in the themes of specialized terms and common 152
words. Particle for direct object. Applied concepts under the investigation of the 153
motivation of this scientific research. The “SuperHyper” prefix refers to the theme of 154
embedded styles for background discovery for SuperHyperNotions. Cancer diagnosis in 155
long-term practice. The specific region is assigned by the model (called 156
SuperHyperGraph) and the long cycle of movement of the cancer is determined by this 157
scientific research. Sometimes the movement of Cancer is not easy to identify because 158
there is certainty, uncertainty and neutrality about the movements and effects of Cancer 159
in that region. This event leads us to choose another model [said to be Neutrosophic 160
SuperHyperGraph]. Easy understanding of what happened and what was done. There 161
are some specific models that are well known and named and some general models. The 162
movements and effects of cancer in complex pathways and between complex groups of 163
cells can be visualized by a neurosophic superhyperpath (-/SuperHyperCycle, 164
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 165
The goal is to find EQUAL CONNECTIVE DOMINATION or Neutrosophic EQUAL 166
CONNECTIVE DOMINATION for SuperHyperModels in it. Some general results are 167
presented. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPaths 168
have only two SuperHyperEdges, but it is not enough as having at least three 169
SuperHyperEdges is necessary to form any style of cycle. There is no form of cycle, but 170
it is literally a form of any cycle. It literally transforms and does not form. 171
Question 2.1. How to define “SuperHyperNotions and to do research” to find the 172
“EQUAL CONNECTIVE DOMINATION Rate” of any cell or groups of cells based on 173
fixed cell or fixed group of cells broadly, “EQUAL CONNECTIVE DOMINATION 174
Rate” based on fixed groups or fixed cells. Groups of groups of cells? 175
Question 2.2. What are the best descriptions for “diagnosing cancer” in terms of 176
these chaotic and dense super-hypermodels in which embedded concepts are depicted? 177
This motivation to find concepts to use in this dense model is called 178
“SuperHyperGraphs”. So it motivates us to define different types of “EQUAL 179
CONNECTIVE DOMINATION” and “neutrosophic EQUAL CONNECTIVE 180
DOMINATION” over “superhypergraph” and “neutrosophic superhypergraph”. Then 181
this scientific research has taken more motivations to define SuperHyperClasses and find 182
some connections among this SuperHyperNotion with other SuperHyperNotions. It 183
motivates us to obtain examples and examples to clarify the framework of this scientific 184
research. The general results and some of the results about some of the connections are 185
the ways that the key point of this scientific research, “diagnosis of cancer” is more 186
understandable and clear. 187
The framework of this research is as follows. First, I will introduce the basic 188
definitions to clarify the basics. In the “Introductions” subsection, basic definitions 189
about SuperHyperGraphs and Neutrosophic SuperHyperGraph are introduced and 190
discussed in depth. Basic concepts are thoroughly explained and illustrated, and 191
sometimes a literature review is used to make sense of what is to come in the coming 192
sections. The main definitions and their explanations, along with some results on the 193
new concepts, EQUAL CONNECTIVE DOMINATION and Neutrosophic EQUAL 194
CONNECTIVE DOMINATION, are specified in the sections “EQUAL CONNECTIVE 195
DOMINATION” and “Neutrosophic EQUAL CONNECTIVE DOMINATION”. In the 196
concept of dealing with results and in EQUAL CONNECTIVE DOMINATION to 197
create logic about the continuation of the scientific research, the ideas of 198
SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and as their 199
consequences, the corresponding SuperHyperClasses are specified to summarize the 200
work done in this section, as “Results on SuperHyperClasses” and “Results on 201
Neutrosophic SuperHyperClasses”. Going back to the core concepts, clever steps 202
towards common concepts to extend new concepts in new frameworks, 203
SuperHyperGraph and Neutrosophic SuperHyperGraph, in “Results on 204
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses” sections. There 205
is the initial scientific research on supergeneral relations and as the final and final part 206
of the theoretical scientific research is available in the section “General results”. Some 207
general SuperHyperRelations are fundamental and are known as fundamental 208
SuperHyperNotions, as in “General results” were extracted and discussed. “EQUAL 209
CONNECTIVE DOMINATION”, “Neutrosophic EQUAL CONNECTIVE 210
DOMINATION”, “Results on SuperHyperClasses” and “Results on Neutrosophic 211
SuperHyperClasses”. There are curious questions about what has been done about 212
SuperHyperNotions to make sense of the superiority of this scientific research and to 213
discover the word “best” as a description and adjective of this scientific research as 214
presented in the “EQUAL CONNECTIVE DOMINATION” section. The keyword of 215
this scientific research was presented in the section “Applications in cancer diagnosis” 216
with two cases and sub-sections “Case 1: Initial steps towards SuperHyperBipartite as 217
SuperHyperModel” and “Case 2: Incremental steps towards SuperHyperMultiperdel as 218
SuperHyper. In the “open issues” section, there is a detailed examination and 219
recognition of what was done in this scientific research and what happened in this 220
scientific research in the form of “questions” and “issues” in order to understand this 221
scientific research in an outstanding style, the advantages and limitations of this 222
scientific research in addition to What has been done in this scientific research is stated 223
in the “conclusion and final remarks” section. 224
3 Neutrosophic Preliminaries Of This Scientific 225
Research On the Redeemed Ways 226
In this section, the basic material in this scientific research, is referred to [Single Valued 227
Neutrosophic Set](Ref. [1],Definition 2.2,p.2), [Neutrosophic Set](Ref. [1],Definition 228
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 2.5,p.2), 229
[Characterization of the Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 230
2.7,p.3), [t-norm](Ref. [1], Definition 2.7, p.3), and [Characterization of the 231
Neutrosophic SuperHyperGraph (NSHG)](Ref. [1],Definition 2.7,p.3), [Neutrosophic 232
Strength of the Neutrosophic SuperHyperPaths] (Ref. [1],Definition 5.3,p.7), and 233
[Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)] 234
(Ref. [1],Definition 5.4,p.7). Also, the new ideas and their clarifications are addressed 235
to Ref. [1]. 236
In this subsection, the basic material which is used in this scientific research, is 237
presented. Also, the new ideas and their clarifications are elicited. 238
Definition 3.1 (Neutrosophic Set). (Ref. [1],Definition 2.1,p.1). 239
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 240
+
]− 0, 1 [. 241
Definition 3.2 (Single Valued Neutrosophic Set). (Ref. [1],Definition 2.2,p.2). 242
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 243
2.5,p.2). 244
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 245
pair S = (V, E), where 246
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 247
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 248
1, 2, . . . , n); 249
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 250
V; 251
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 252
1, 2, . . . , n0 ); 253
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 254
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 255
Figure 1. The Neutrosophic SuperHyperGraphs with a illustrated SuperHyperModeling

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

ing on Recognition of Cancer in the Neutrosophic Example (3.6)
notion, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 280
E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a 281
Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 282
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 283
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that 284
there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 285
• On the Figure (3), the SuperHyperNotion, namely, SuperHyperGirth, is up. 286
E1 , E2 and E3 are some empty SuperHyperEdges but E4 is a SuperHyperEdge. 287
Thus in the terms of SuperHyperNeighbor, there’s only one SuperHyperEdge, 288
namely, E4 . 289
• On the Figure (4), there’s no empty SuperHyperEdge but E3 are a loop 290
SuperHyperEdge on {F } and there are some SuperHyperEdges, namely, E1 on 291
{H, V1 , V3 }, alongside E2 on {O, H, V4 , V3 } and E4 , E5 on {N, V1 , V2 , V3 , F }. 292
• On the Figure (5),there’s neither empty SuperHyperEdge nor loop 293
SuperHyperEdge. 294
• On the Figure (6), there’s neither empty SuperHyperEdge nor loop 295
SuperHyperEdge. 296
SuperHyperEdge. 298
SuperHyperEdge. 300
SuperHyperEdge. 302
SuperHyperEdge. 304
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. 306
SuperHyperEdge. 308
SuperHyperEdge. 310
SuperHyperEdge. 312
SuperHyperEdge. 314
SuperHyperEdge. 316
SuperHyperEdge. 318
SuperHyperEdge. 320
SuperHyperEdge. 322
SuperHyperEdge. 324
SuperHyperEdge. 326
SuperHyperEdge. 328
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)). 329
(Ref. [1],Definition 2.7,p.3). 330
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 331
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 332
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 333
characterized as follow-up items. 334
(i) If |Vi | = 1, then Vi is called vertex; 335
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 336
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 337
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 338
HyperEdge; 339
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 340
SuperEdge; 341
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 342
SuperHyperEdge. 343
If we choose different types of binary operations, then we could get hugely diverse 344
types of general forms of Neutrosophic SuperHyperGraph (NSHG). 345
Definition 3.8 (t-norm). (Ref. [1], Definition 2.7, p.3). 346
A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following 347
for x, y, z, w ∈ [0, 1]: 348
(i) 1 ⊗ x = x; 349
(ii) x ⊗ y = y ⊗ x; 350
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 351
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 352
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)). 353
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a 354
pair S = (V, E), where 355
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 356
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 357
1, 2, . . . , n); 358
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of 359
V; 360
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 361
1, 2, . . . , n0 ); 362
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 363
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 364
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 365
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ).
0 366
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic 367
SuperHyperVertices (NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), 368
and FV 0 (Vi ) denote the degree of truth-membership, the degree of 369
indeterminacy-membership and the degree of falsity-membership the Neutrosophic 370
SuperHyperVertex (NSHV) Vi to the Neutrosophic SuperHyperVertex (NSHV) V. 371
TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth-membership, the degree of 372
indeterminacy-membership and the degree of falsity-membership of the Neutrosophic 373
SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) E. Thus, 374
the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 375
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 376
Definition 3.12 (Characterization of the Neutrosophic SuperHyperGraph (NSHG)). 377
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The 379
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices 380
(NSHV) Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be 381
characterized as follow-up items. 382
(i) If |Vi | = 1, then Vi is called vertex; 383
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 384
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 385
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called 386
HyperEdge; 387
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 388
SuperEdge; 389
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 390
SuperHyperEdge. 391
This SuperHyperModel is too messy and too dense. Thus there’s a need to have 392
some restrictions and conditions on SuperHyperGraph. The special case of this 393
SuperHyperGraph makes the patterns and regularities. 394
Definition 3.13. A graph is SuperHyperUniform if it’s SuperHyperGraph and the 395
number of elements of SuperHyperEdges are the same. 396
To get more visions on SuperHyperUniform, the some SuperHyperClasses are 397
introduced. It makes to have SuperHyperUniform more understandable. 398
Definition 3.14. Assume a Neutrosophic SuperHyperGraph. There are some 399
SuperHyperClasses as follows. 400
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as 401
intersection amid two given SuperHyperEdges with two exceptions; 402
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two 403
given SuperHyperEdges; 404
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 405
SuperHyperEdges; 406
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two 407
given SuperHyperEdges and these SuperVertices, forming two separate sets, has 408
no SuperHyperEdge in common; 409
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid 410
two given SuperHyperEdges and these SuperVertices, forming multi separate sets, 411
has no SuperHyperEdge in common; 412
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two 413
given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any 414
common SuperVertex. 415
Example 3.15. In the Figure (23), the connected Neutrosophic SuperHyperPath 416
ESHP : (V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the 417
Neutrosophic SuperHyperModel (23), is the notion. 418
Example 3.16. In the Figure (24), the connected Neutrosophic SuperHyperCycle 419
N SHC : (V, E), is highlighted and featured. The obtained Neutrosophic 420
SuperHyperSet, in the Neutrosophic SuperHyperModel (24), is up. 421
Example 3.17. In the Figure (25), the connected Neutrosophic SuperHyperStar 422
ESHS : (V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, 423
by the Algorithm in previous Neutrosophic result, of the Neutrosophic 424
SuperHyperVertices of the connected Neutrosophic SuperHyperStar ESHS : (V, E), in 425
the Neutrosophic SuperHyperModel (25), is up. 426
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 427
SuperHyperBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic 428
featured. The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 429
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 430
Neutrosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic 431
SuperHyperModel (26), is up. 432
Example 3.19. In the Figure (27), the connected Neutrosophic 433
SuperHyperMultipartite ESHM : (V, E), is highlighted and Neutrosophic featured. 434
The obtained Neutrosophic SuperHyperSet, by the Algorithm in previous Neutrosophic 435
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 436
SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (27), 437
is up. 438
Example 3.20. In the Neutrosophic Figure (28), the connected Neutrosophic 439
SuperHyperWheel N SHW : (V, E), is Neutrosophic highlighted and featured. The 440
obtained Neutrosophic SuperHyperSet, by the Algorithm in previous result, of the 441
Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperWheel 442
ESHW : (V, E), in the Neutrosophic SuperHyperModel (28), is up. 443
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 444
SuperHyperVertex (NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either 445
of following conditions hold: 446
(i) Vi , Vi+1 ∈ Ei0 ; 447
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 ; 448
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 449
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 450
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ Ei0 ; 451
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 452
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 453
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 454
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

0
∈ Vi+1 such that 455
Vi0 , Vi+1
0
∈ Ei0 . 456
Definition 3.22. (Characterization of the Neutrosophic SuperHyperPaths). 457
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. 458
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 459
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 460
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 461
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic 462
SuperHyperPath . 463
Definition 3.23 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths). 464
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 466
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 467
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 468
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 469
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 470
Definition 3.24 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges 471
(NSHE)). (Ref. [1],Definition 5.4,p.7). 472
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 473
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 474
(ix) Neutrosophic t-connective if T (E) ≥ maximum number of Neutrosophic 475
t-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 476
(NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 477
(x) Neutrosophic i-connective if I(E) ≥ maximum number of Neutrosophic 478
i-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 479
(xi) Neutrosophic f-connective if F (E) ≥ maximum number of Neutrosophic 481
f-strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 482
(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of 484
Neutrosophic strength of SuperHyperPath (NSHP) from Neutrosophic 485
SuperHyperVertex (NSHV) Vi to Neutrosophic SuperHyperVertex (NSHV) Vj 486
where 1 ≤ i, j ≤ s. 487
For the sake of having a Neutrosophic notion, there’s a need to “redefine” the 488
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 489
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 490
procedure, there’s the usage of the position of labels to assign to the values. 491
Definition 3.25. Assume a Neutrosophic SuperHyperGraph (SHG) S is a pair 492
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (1) holds. 493
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s 494
more ways to get Neutrosophic type-results to make a Neutrosophic more 495
understandable. 496

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 497
S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (2) 498
holds. Thus Neutrosophic SuperHyperPath , notion, SuperHyperStar, 499
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 500
Neutrosophic SuperHyperPath, Neutrosophic SuperHyperCycle, 501
Neutrosophic SuperHyperStar, Neutrosophic SuperHyperBipartite, 502
Neutrosophic SuperHyperMultiPartite, and Neutrosophic 503
SuperHyperWheel if the Table (2) holds. 504
It’s useful to define a “Neutrosophic” version of a Neutrosophic notion. Since there’s 505
more ways to get type-results to make a Neutrosophic notion more Neutrosophicly 506
understandable. 507
For the sake of having a Neutrosophic notion, there’s a need to “redefine” the 508
Neutrosophic notion of “Neutrosophic notion”. The SuperHyperVertices and the 509
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 510
procedure, there’s the usage of the position of labels to assign to the values. 511
Definition 3.27. Assume a notion. It’s redefined a Neutrosophic notion if the 512
Table (3) holds. 513
Example 3.28. Referred to the Example (3.6), assume a Neutrosophic 514
SuperHyperGraph (SHG) S is a pair S = (V, E) in the mentioned Neutrosophic Figures 515
in every Neutrosophic items. 516
SuperHyperGraph (SHG), is up in the illustration of the Table (4). 518
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 525
Definition 4.1. (Different Neutrosophic Types of Neutrosophic SuperHyperEQUAL 526
CONNECTIVE DOMINATION). 527
Let a Neutrosophic SuperHyperGraph (SHG) S be a pair S = (V, E). Consider a 528
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs }. Then V 0 is called Neutrosophic 529
SuperHyperEQUAL CONNECTIVE DOMINATION if the following expressions, terms and 530

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

Neutrosophic Notions in the Neutrosophic Example (4.2)

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






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








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

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

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

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

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

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

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

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

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

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

X X X
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
0
}
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.24, 0.24, 0.24) - -
V3 (0.24, 0.24, 0.24) - -
V4 (0.24, 0.24, 0.24) V5 (0.24, 0.24, 0.24)
V6 (0.24, 0.24, 0.24) V7 (0.24, 0.24, 0.24)
Edges Belong to The Neutrosophic SuperHyperPath
V1 (0.26, 0.26, 0.26) E1 (0.26, 0.26, 0.26)
V2 (0.26, 0.26, 0.26) E2 (0.26, 0.26, 0.26)
V3 (0.26, 0.26, 0.26) Eii=37 (0.26, 0.26, 0.26)
V4 (0.26, 0.26, 0.26) V5 (0.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
X X X
|( T (Vi ), I(Vi ), F (Vi ))|
= (1.7, 1.7, 1.7).
Example 4.3. Assume a Neutrosophic SuperHyperPath (SHG) S is a pair S = (V, E) 583
in the mentioned Neutrosophic Figures in every Neutrosophic items. 584
SuperHyperCycle (SHG), is up in the illustration of the Table (15). 586
Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Assume 587
SuperHyperExternal {Vi }7i=1 and non-SuperHyperInternal {Vi }34 i=8 . Consider a 588
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 }. Then V 0 is called 589
Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION since the following 590
expressions, terms and statements is called Neutrosophic SuperHyperEQUAL 591
CONNECTIVE DOMINATION criteria holds. 592
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 ={V
ii=1,3,5,7 }
= (1.04, 1.04, 1.04) =

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

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

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

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

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

X X X
= 00max |{ ( T (Vi ), I(Vi ), F (Vi )) |
V ⊆VSHG
Vi ∈V 00 Vi ∈V 00 Vi ∈V 00
00 00
Vii=16−18,20−23 ∈ VSHG \ V , ∃V5 ∈ V :
,
Vii=6,25−30,32−34 ∈ VSHG \ V 00 , ∃V7 ∈ V 00 :
}
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.26, 0.26, 0.26)
V6 (0.26, 0.26, 0.26) V7 (0.26, 0.26, 0.26)
Neutrosophic SuperHyperSet V 0 = {V1 , V3 , V5 , V7 , Vii=2,4,8−18,19,24,31 }. Then V 0 is 624
X
|( T (Vi ),
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
X
I(Vi ),
Vi ∈V 0 ={V
ii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
X
F (Vi ))|
Vi ∈V 0 ={Vii=1,3,5,7 ,Vii=2,4,8−18,19,24,31 }
= (4.88, 4.88, 4.88) =

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

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

Neutrosophic SuperHyperSet V 0 = VSHG . Then V 0 is called Neutrosophic 642
SuperHyperEQUAL CONNECTIVE DOMINATION since the following expressions, terms and 643
statements is called Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION criteria 644
holds. 645
X
|( T (Vi ),
Vi ∈V 0 =VSHG
X
I(Vi ),
Vi ∈V 0 =VSHG
X
F (Vi ))|
Vi ∈V 0 =VSHG
= (7.52, 7.52, 7.52).
646
5 Main Result 647
Theorem 5.1. (Main Result and Main Theorem). 648
Assume every Neutrosophic SuperHyperBipartite has the letter z. The notion on the 649
Neutrosophic SuperHyperBipartite and Neutrosophic SuperHyperPath coincide. 650
Proof. 651
(i). Let 652
P :
V1P1 , E1 ,
V1P1 , E2
653
P :
V1P1 , E1 ,
V1P1 , E2
be a longest path taken a connected Extreme SuperHyperBipartite ESHM : (V, E). 654
There’s a new way to redefine as 655
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 656
corresponded to ViEXT ERN AL in the literatures of Neutrosophic SuperHyperEQUAL 657
CONNECTIVE DOMINATION. The latter is straightforward. 658
(ii). Let 659
P :
ViEXT ERN AL , Ei∗ ,
EXT ERN AL ∗
Vi+1 , Ei+1
660
P :
EXT ERN AL ∗
Vi+1 , Ei+1
is a longest SuperHyperEQUAL CONNECTIVE DOMINATION taken from a connected Extreme 661
SuperHyperPath ESHC : (V, E). There’s a new way to redefine as 662

CONNECTIVE DOMINATION. The latter is straightforward. Then there’s at least one 665
Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION. Thus the notion of quasi isn’t up 666
and the SuperHyperNotions based on Neutrosophic SuperHyperEQUAL CONNECTIVE 667
DOMINATION could be applied. The unique embedded Neutrosophic SuperHyperEQUAL 668
CONNECTIVE DOMINATION proposes some longest Neutrosophic SuperHyperEQUAL CONNECTIVE 669
DOMINATION excerpt from some representatives. The latter is straightforward. 670
Proposition 5.2. Let a Neutrosophic SuperHyperBipartite ESHM be a pair

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

Proposition 5.3. Let a Neutrosophic SuperHyperBipartite ESHM be a pair

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

Proposition 5.4. Let a Neutrosophic SuperHyperPath (ESHC) S be a pair S = (V, E). 685
Assume every Neutrosophic SuperHyperVertex has the letter z. The Neutrosophic 686
SuperHyperEQUAL CONNECTIVE DOMINATION set is as follows. 687
{
ViEXT ERN AL ,
EXT ERN AL
Vi+2 ,...
}
Proof. Let 688
P :
EXT ERN AL ∗
Vi+1 , Ei+1
689
P :
EXT ERN AL ∗
Vi+1 , Ei+1

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

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

Definition 5.6. (Uniform Neutrosophic SuperHyperBipartite and Uniform 712
Neutrosophic SuperHyperPath). 713
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Every 714
pair of Neutrosophic SuperHyperVertices has the same maximum letter, i.e., 715
Neutrosophic SuperHyperVertices mutually has the same maximum letter. A 716
Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E) is called 717
Uniform Neutrosophic SuperHyperBipartite. 718
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Every pair of 719
Neutrosophic SuperHyperVertices has the same maximum letter, i.e., 720
Neutrosophic SuperHyperVertices mutually has the same maximum letter. A 721
Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E) is called Uniform 722
Neutrosophic SuperHyperPath. 723
Proposition 5.7. Let an Uniform Neutrosophic SuperHyperBipartite ESHM be a pair

S = (V, E). The Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION set is as follows.
{V1P1 }.
Proof. Let 724
P :
V1P1 , E1 ,
V1P1 , E2
725
P :
V1P1 , E1 ,
V1P1 , E2

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

S = (V, E). The Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION number is as follows.
×0.26.
Proof. Let 731
P :
V1P1 , E1 ,
V1P1 , E2
732
P :
V1P1 , E1 ,
V1P1 , E2

Proposition 5.9. Let an Uniform Neutrosophic SuperHyperPath (ESHC) S be a pair 738
S = (V, E). The Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION set is as follows. 739
{
ViEXT ERN AL ,
EXT ERN AL
Vi+2 ,...
}
Proof. Let 740
P :
EXT ERN AL ∗
Vi+1 , Ei+1
741
P :
EXT ERN AL ∗
Vi+1 , Ei+1

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

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

Proposition 5.11. (Neutrosophic SuperHyperBipartite and Neutrosophic 764
SuperHyperPath). 765
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Assume 766
two Neutrosophic SuperHyperVertices, from different SuperHyperParts, have the 767
maximum letter. Then the Neutrosophic SuperHyperVertices don’t have the same 768
maximum letter, are in every Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION 769
set. 770
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Assume every 771
Neutrosophic EXTERNAL SuperHyperVertices with distance two have the 772
maximum letter. Then the Neutrosophic SuperHyperVertices don’t have the same 773
maximum letter, are in every Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION 774
set. 775
Proof. 776
(i). Let 777
P :
V1Pi , E1 ,
P
V1 j , E2
778
P :
V1Pi , E1 ,
P
V1 j , E2

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

Proposition 5.12. (Embedded Neutrosophic SuperHyperBipartite and Embedded 796
Neutrosophic SuperHyperPath). 797
(i). Let a Neutrosophic SuperHyperBipartite (SHG) S be a pair S = (V, E). Then two 798
Neutrosophic SuperHyperVertices, from different SuperHyperParts, is in every 799
Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION set. 800
(ii). Let a Neutrosophic SuperHyperPath (SHG) S be a pair S = (V, E). Then every 801
Neutrosophic EXTERNAL SuperHyperVertices with distance two is in every 802
Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION set. 803
Proof. 804
(i). Let 805
P :
V1Pi , E1 ,
P
V1 j , E2
806
P :
V1Pi , E1 ,
P
V1 j , E2

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

6 Neutrosophic Applications in Cancer’s 824
Neutrosophic Recognition 825
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure 826
out what’s going on this Neutrosophic phenomenon. The special Neutrosophic case of 827
this Neutrosophic disease is considered and as the consequences of the model, some 828
parameters are used. The cells are under attack of this disease but the moves of the 829
cancer in the special region are the matter of mind. The Neutrosophic recognition of the 830
cancer could help to find some Neutrosophic treatments for this Neutrosophic disease. 831
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 832
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in 833
the long-term Neutrosophic function. 834
Step 2. (Neutrosophic Issue) The specific region has been assigned by the 835
Neutrosophic model [it’s called Neutrosophic SuperHyperGraph] and the long 836
Neutrosophic cycle of the move from the cancer is identified by this research. 837
Sometimes the move of the cancer hasn’t be easily identified since there are some 838
determinacy, indeterminacy and neutrality about the moves and the effects of the 839
cancer on that region; this event leads us to choose another model [it’s said to be 840
Neutrosophic SuperHyperGraph] to have convenient perception on what’s 841
happened and what’s done. 842
Figure 43. a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutro-

sophic SuperHyperEQUAL CONNECTIVE DOMINATION
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, 843
which are well-known and they’ve got the names, and some general Neutrosophic 844
models. The moves and the Neutrosophic traces of the cancer on the complex 845
tracks and between complicated groups of cells could be fantasized by a 846
Neutrosophic SuperHyperPath(-/SuperHyperEQUAL CONNECTIVE DOMINATION, 847
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 848
SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperEQUAL 849
CONNECTIVE DOMINATION or the Neutrosophic SuperHyperEQUAL CONNECTIVE 850
DOMINATION in those Neutrosophic Neutrosophic SuperHyperModels. 851
7 Case 1: The Initial Neutrosophic Steps 852
Toward Neutrosophic SuperHyperBipartite as 853
Neutrosophic SuperHyperModel 854
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (43), the 855
Neutrosophic SuperHyperBipartite is Neutrosophic highlighted and Neutrosophic 856
featured. 857
By using the Neutrosophic Figure (43) and the Table (22), the Neutrosophic 858
SuperHyperBipartite is obtained. 859
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 860
previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the 861
connected Neutrosophic SuperHyperBipartite ESHB : (V, E), in the 862
Neutrosophic SuperHyperModel (43), is the Neutrosophic SuperHyperEQUAL 863
CONNECTIVE DOMINATION. 864
Figure 44. a Neutrosophic SuperHyperMultipartite Associated to the Notions of

Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION
8 Case 2: The Increasing Neutrosophic Steps 865
Toward Neutrosophic SuperHyperMultipartite as 866
Neutrosophic SuperHyperModel 867
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (44), the 868
Neutrosophic SuperHyperMultipartite is Neutrosophic highlighted and 869
Neutrosophic featured. 870
By using the Neutrosophic Figure (44) and the Table (23), the Neutrosophic 871
SuperHyperMultipartite is obtained. 872
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in 873
previous result, of the Neutrosophic SuperHyperVertices of the connected 874
Neutrosophic SuperHyperMultipartite ESHM : (V, E), in the Neutrosophic 875
SuperHyperModel (44), is the Neutrosophic SuperHyperEQUAL CONNECTIVE 876
DOMINATION. 877
Edges Belong to The Neutrosophic SuperHyperMultipartite
9 Wondering Open Problems But As The 878
Directions To Forming The Motivations 879
In what follows, some “problems” and some “questions” are proposed. 880
The SuperHyperEQUAL CONNECTIVE DOMINATION and the Neutrosophic SuperHyperEQUAL 881
CONNECTIVE DOMINATION are defined on a real-world application, titled “Cancer’s 882
Recognitions”. 883
Question 9.1. Which the else SuperHyperModels could be defined based on Cancer’s 884
recognitions? 885
Question 9.2. Are there some SuperHyperNotions related to SuperHyperEQUAL 886
and the Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION?

CONNECTIVE DOMINATION 887
Question 9.3. Are there some Algorithms to be defined on the SuperHyperModels to 888
compute them? 889
Question 9.4. Which the SuperHyperNotions are related to beyond the SuperHyperEQUAL 890
and the Neutrosophic SuperHyperEQUAL CONNECTIVE DOMINATION?

CONNECTIVE DOMINATION 891
Problem 9.5. The SuperHyperEQUAL CONNECTIVE DOMINATION and the Neutrosophic 892
SuperHyperEQUAL CONNECTIVE DOMINATION do a SuperHyperModel for the Cancer’s recognitions 893
and they’re based on SuperHyperEQUAL CONNECTIVE DOMINATION, are there else? 894
Problem 9.6. Which the fundamental SuperHyperNumbers are related to these 895
SuperHyperNumbers types-results? 896
Problem 9.7. What’s the independent research based on Cancer’s recognitions 897
concerning the multiple types of SuperHyperNotions? 898
10 Conclusion and Closing Remarks 899
In this section, closing and concluding remarks are presented. The drawbacks of this 900
scientific research are shown. Some advantages and disadvantages of this scientific 901
research are highlighted. 902
This scientific research uses some approaches to further understand the Neutrosophic 903
SuperHyperGraphs. In this effort, two SuperHyperNotions are defined on the EQUAL 904
CONNECTIVE DOMINATION. For this reason, in the second definition, the original 905
definition of the Neutrosophic SuperHyperGraph is redefined on the position of the 906
alphabets. Based on the new Neutrosophic SuperHyperGraph definition, the new 907
SuperHyperNotion, Neutrosophic EQUAL CONNECTIVE DOMINATION, finds a 908
suitable background to implement some results on. Some SuperHyperClasses and some 909
Neutrosophic SuperHyperClasses are the subjects of this scientific research on modeling 910
areas that are subject to cancer attacks in order to recognize this disease as mentioned 911
under the title “Cancer Diagnosis”. To formalize the SuperHyperNotion, EQUAL 912
CONNECTIVE DOMINATION, SuperHyperClasses and new SuperHyperClasses 913
instances are introduced. Some general results are summarized in the EQUAL 914
CONNECTIVE DOMINATION and Neutrosophic EQUAL CONNECTIVE 915
DOMINATION sections. Clarifications, examples, and literature reviews go all the way. 916
In this scientific research, the literature review has met the lines containing concepts 917
and results. SuperHyperGraph and Neutrosophic SuperHyperGraph are 918
super-hypermodels in “cancer diagnosis” and both are the foundation of the background 919
of this scientific research. Sometimes cancer has occurred in an area full of cells, cell 920
groups, and embedded styles. In this section, SuperHyperModel proposes 921
SuperHyperNotions, formally called “EQUAL CONNECTIVE DOMINATION”, based 922
on the connections of Cancer’s movements in the longest and strongest styles with the 923
formation of design and architecture, in terms of terms and whispering words. . The 924
“SuperHyper” prefix refers to the topic of embedded styles to explore the background of 925
SuperHyperNotions. In the table (24), the advantages and ways of this scientific
Table 24. A look at this scientific research and beyond

Advantages Limitations
1. Redefining the Neutrosophic SuperHyperGraph 1. General Results
2. EQUAL CONNECTIVE DOMINATION
3. Neutrosophic EQUAL CONNECTIVE DOMINATION 2. Other SuperHyperNumbers
4. modeling cancer diagnoses
5. SuperHyperClasses 3. SuperHyperFamilies
926
research are specified, pointed out and expressed. 927
11 Background 928
There are some scientific researches covering the topic of this scientific research. In what 929
follows, there are some discussion and literature reviews about them. 930
The seminal paper and groundbreaking article is titled “New Ideas In Recognition of 931
Cancer And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot” in Ref. [1] 932
by Henry Garrett (2023). In this research article, a novel approach is implemented on 933
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms with 934
introducing used neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 935
in prestigious and fancy journal is entitled “Current Trends in Mass Communication 936
(CTMC)” with ISO abbreviation “Curr Trends Mass Comm” in volume 2 and issue 1 937
with pages 32-55. 938
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees 939
and Co-Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper 940
Graphs Alongside Applications in Cancer’s Treatments” in Ref. [2] by Henry Garrett 941
(2023). In this research article, a novel approach is implemented on SuperHyperGraph 942
and neutrosophic SuperHyperGraph based on fundamental notions and using vital tools 943
in Cancer’s Treatments. It’s published in prestigious and fancy journal is entitled 944
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with 945
ISO abbreviation “J Math Techniques Comput Math” in volume 2 and issue 1 with 946
pages 35-47. The research article studies deeply with choosing directly neutrosophic 947
SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward independent 948
results based on initial background and fundamental SuperHyperNumbers. 949
The seminal paper and groundbreaking article is titled “A Research on Cancer’s 950
Recognition and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and 951
Hamiltonian Sets as Hyper Covering Versus Super separations” in Ref. [3] by Henry 952
Garrett (2023). In this research article, a novel approach is implemented on 953
SuperHyperGraph and neutrosophic SuperHyperGraph based on fundamental notions 954
and using vital tools in Cancer’s Recognition. It’s published in prestigious and fancy 955
journal is entitled “Journal of Mathematical Techniques and Computational 956
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 957
volume 2 and issue 3 with pages 136-148. The research article studies deeply with 958
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 959
breakthrough toward independent results based on initial background and fundamental 960
SuperHyperNumbers. 961
The seminal paper and groundbreaking article is titled “Neutrosophic 1-Failed 962
SuperHyperForcing in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs 963
on Cancer’s Neutrosophic Recognition and Beyond ” in Ref. [4] by Henry Garrett (2023). 964
In this research article, a novel approach is implemented on SuperHyperGraph and 965
neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber and using 966
neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 967
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 968
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques 969
Comput Math” in volume 2 and issue 6 with pages 221-307. The research article studies 970
deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 971
It’s the breakthrough toward independent results based on initial background and 972
fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is 973
titled “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super 974
Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 975
Classes” in Ref. [5] by Henry Garrett (2022). In this research article, a novel approach 976
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on 977
fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of 978
neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 979
entitled “Journal of Mathematical Techniques and Computational 980
Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 981
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the 983
breakthrough toward independent results based on initial background and fundamental 984
SuperHyperNumbers. The seminal paper and groundbreaking article is titled 985
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the 986
setting of some classes related to neutrosophic hypergraphs” in Ref. [6] by Henry 987
Garrett (2023). In this research article, a novel approach is implemented on 988
SuperHyperGraph and neutrosophic SuperHyperGraph based on general forms without 989
using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 990
prestigious and fancy journal is entitled “Journal of Current Trends in Computer 991
Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in 992
choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 994
breakthrough toward independent results based on initial background. The research 995
article studies deeply with choosing neutrosophic hypergraphs instead of neutrosophic 996
SuperHyperGraph. It’s the breakthrough toward independent results based on initial 997
background. In some articles are titled “0039 — Closing Numbers and Super-Closing 998
Numbers as (Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 999
(Neutrosophic)n-SuperHyperGraph” in Ref. [7] by Henry Garrett (2022), “0049 — 1000
(Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [8] by Henry Garrett 1001
(2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1002
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” 1003
in Ref. [9] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer 1004
Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique 1005
inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [10] by 1006
Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1007
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [11] by Henry Garrett (2022), 1008
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The 1009
Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 1010
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory 1011
Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” in Ref. [12] by Henry 1012
Garrett (2022), “Breaking the Continuity and Uniformity of Cancer In The Worst Case 1013
of Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition 1014
Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [13] by Henry Garrett (2022), 1015
“Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 1016
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in 1017
Ref. [14] by Henry Garrett (2022), “Extremism of the Attacked Body Under the 1018
Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1019
SuperHyperGraphs” in Ref. [15] by Henry Garrett (2022), “(Neutrosophic) 1-Failed 1020
SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in 1021
Ref. [16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 1022
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1023
Special ViewPoints” in Ref. [17] by Henry Garrett (2022), “Neutrosophic 1-Failed 1024
SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 1025
on Cancer’s Neutrosophic Recognition And Beyond ” in Ref. [18] by Henry Garrett 1026
(2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 1027
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [19] by Henry Garrett 1028
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1029
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1030
in Ref. [15] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) 1031
SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions 1032
And (Neutrosophic) SuperHyperGraphs” in Ref. [20] by Henry Garrett (2022), 1033
“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 1034
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [21] by 1035
Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1036
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in Ref. [22] by 1037
Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1038
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 1039
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related 1040
(Neutrosophic) SuperHyperClasses” in Ref. [23] by Henry Garrett (2022), 1041
“SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With 1042
SuperHyperModeling of Cancer’s Recognitions” in Ref. [24] by Henry Garrett (2022), 1043
“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1044
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 1045
Treatments” in Ref. [25] by Henry Garrett (2022), “SuperHyperDominating and 1046
SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions in 1047
Game Theory and Neutrosophic SuperHyperClasses” in Ref. [26] by Henry Garrett 1048
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1049
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [209] by Henry 1050
Garrett (2023), “The Focus on The Partitions Obtained By Parallel Moves In The 1051
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching Set 1052
and Polynomial on (Neutrosophic) SuperHyperGraphs” in Ref. [210] by Henry Garrett 1053
(2023), “Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s 1054
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels 1055
Named (Neutrosophic) SuperHyperGraphs” in Ref. [211] by Henry Garrett (2023), 1056
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks 1057
In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called 1058
Neutrosophic SuperHyperGraphs” in Ref. [212] by Henry Garrett (2023), “Perfect 1059
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding 1060
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [215] by 1061
Henry Garrett (2023), “Demonstrating Complete Connections in Every Embedded 1062
Regions and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) 1063
SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in Ref. [216] by Henry 1064
Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions titled 1065
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in 1066
the Form of Neutrosophic SuperHyperGraphs” in Ref. [219] by Henry Garrett (2023), 1067
“Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel 1068
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [222] by Henry 1069
Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 1070
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 1071
in Ref. [223] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s 1072
Recognition by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in 1073
Ref. [224] by Henry Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the 1074
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 1075
Recognition And Beyond ” in Ref. [225] by Henry Garrett (2022), “(Neutrosophic) 1076
1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) 1077
SuperHyperGraphs” in Ref. [226] by Henry Garrett (2022), “Basic Notions on 1078
(Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling in Cancer’s 1079
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [227] by Henry Garrett 1080
(2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1081
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [238] by Henry 1082
Garrett (2022), “Initial Material of Neutrosophic Preliminaries to Study Some 1083
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic 1084
SuperHyperGraph (NSHG)” in Ref. [239] by Henry Garrett (2022), and [4–239], there 1085
are some endeavors to formalize the basic SuperHyperNotions about neutrosophic 1086
SuperHyperGraph and SuperHyperGraph alongside scientific research books 1087
at [240–371]. Two popular scientific research books in Scribd in the terms of high 1088
readers, 4728 and 5721 respectively, on neutrosophic science is on [372, 373]. 1089
Some scientific studies and scientific researches about neutrosophic graphs, are 1090
proposed as book in Ref. [372] by Henry Garrett (2023) which is indexed by Google 1091
Scholar and has more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic 1092
Graphs” and published by Dr. Henry Garrett. This research book covers different types 1093
of notions and settings in neutrosophic graph theory and neutrosophic 1094
SuperHyperGraph theory. 1095
Also, some scientific studies and scientific researches about neutrosophic graphs, are 1096
proposed as book in Ref. [373] by Henry Garrett (2023) which is indexed by Google 1097
Scholar and has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” 1098
and published by Dr. Henry Garrett. This research book presents different types of 1099
notions SuperHyperResolving and SuperHyperDominating in the setting of duality in 1100
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research 1101
book has scrutiny on the complement of the intended set and the intended set, 1102
simultaneously. It’s smart to consider a set but acting on its complement that what’s 1103
done in this research book which is popular in the terms of high readers in Scribd. 1104
See the seminal scientific researches [1–3]. The formalization of the notions on the 1105
framework of notions in SuperHyperGraphs, Neutrosophic notions in 1106
SuperHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [4–239] 1107
alongside scientific research books at [240–371]. Two popular scientific research books 1108
in Scribd ,in the terms of high readers, 4728 and 5721 respectively, on neutrosophic 1109
science is on [372, 373]. 1110
References 1111
1. Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic 1112
SuperHyperGraph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 1113
2(1) (2023) 32-55. (https://www.opastpublishers.com/open-access-articles/new- 1114
ideas-in-recognition-of-cancer-and-neutrosophic-super-hypergraph-as-hyper- 1115
tool-on-super-toot.pdf) 1116
2. Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on 1117
Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 1118
Applications in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) 1119
(2023) 35-47. (https://www.opastpublishers.com/open-access-articles/some- 1120
super-hyper-degrees-and-cosuper-hyper-degrees-on-neutrosophic-super-hyper- 1121
graphs-and-super-hyper-graphs-alongside-a.pdf) 1122
3. Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 1123
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper 1124
Covering Versus Super separations”, J Math Techniques Comput Math 2(3) 1125
(2023) 136-148. (https://www.opastpublishers.com/open-access-articles/a- 1126
research-on-cancers-recognition-and-neutrosophic-super-hypergraph-by- 1127
eulerian-super-hyper-cycles-and-hamiltonian-sets-.pdf) 1128
4. Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the 1129
SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s 1130
Neutrosophic Recognition and Beyond ”, J Math Techniques Comput Math 2(6) 1131
(2023) 221-307. (https://www.opastpublishers.com/open-access- 1132
articles/neutrosophic-1failed-superhyperforcing-in-the-superhyperfunction-to- 1133
use-neutrosophic-superhypergraphs-on-cancers-neutros.pdf) 1134
5. Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside 1135
Chromatic Numbers in the Setting of Some Classes Related to Neutrosophic 1136
Hypergraphs”, J Curr Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 1137
10.33140/JCTCSR.02.01.04) 1138
6. Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on 1139
Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 1140
Neutrosophic Super Hyper Classes”, J Math Techniques Comput Math 1(3) 1141
(2022) 242-263. (doi: 10.33140/JMTCM.01.03.09) 1142
7. Garrett, Henry. “0039 — Closing Numbers and Super-Closing Numbers as 1143
(Dual)Resolving and (Dual)Coloring alongside (Dual)Dominating in 1144
(Neutrosophic)n-SuperHyperGraph.” CERN European Organization for Nuclear 1145
Research - Zenodo, Nov. 2022. CERN European Organization for Nuclear 1146
Research, https://doi.org/10.5281/zenodo.6319942. 1147
https://oa.mg/work/10.5281/zenodo.6319942 1148
8. Garrett, Henry. “0049 — (Failed)1-Zero-Forcing Number in Neutrosophic 1149
Graphs.” CERN European Organization for Nuclear Research - Zenodo, Feb. 1150
2022. CERN European Organization for Nuclear Research, 1151
https://doi.org/10.13140/rg.2.2.35241.26724. 1152
https://oa.mg/work/10.13140/rg.2.2.35241.26724 1153
9. Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of 1154
Confrontation under Cancer’s Recognition as the Model in The Setting of 1155
(Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010308 (doi: 1156
10.20944/preprints202301.0308.v1). 1157
10. Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The 1158
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1159
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1160
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1161
11. Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In 1162
Cancer’s Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 1163
2023010267 (doi: 10.20944/preprints202301.0267.v1). 1164
12. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1165
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1166
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1167
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1168
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1169
10.20944/preprints202301.0265.v1). 1170
13. Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The 1171
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1172
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1173
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1174
14. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1175
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1176
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1177
10.20944/preprints202301.0240.v1). 1178
15. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1179
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1180
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1181
10.20944/preprints202301.0224.v1). 1182
16. Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 1183
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1184
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1185
17. Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form 1186
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions 1187
In Special ViewPoints”, Preprints 2023, 2023010088 (doi: 1188
10.20944/preprints202301.0088.v1). 1189
SuperHyperFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s 1191
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1192
19. Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by 1193
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1194
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1195
20. Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And 1196
(Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And 1197
10.20944/preprints202301.0105.v1). 1199
10.20944/preprints202301.0088.v1). 1203
22. Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions 1204
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1205
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1206
23. Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive 1207
and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) 1208
SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s 1209
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1210
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1211
24. Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic 1212
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, 1213
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1214
25. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1215
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1216
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1217
10.20944/preprints202212.0324.v1). 1218
26. Henry Garrett, “SuperHyperDominating and SuperHyperResolving on 1219
Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 1220
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1221
10.20944/preprints202211.0576.v1). 1222
SuperHyperGraph With Star and Wheel By CONNECTIVE DOMINATION As 1224
Hyper Decoration On Super Density”, Zenodo 2023, (doi: 1225
10.5281/zenodo.8196147). 1226
SuperHyperGraph With Bipartite and Path By CONNECTIVE DOMINATION 1228
As Hyper Decoration On Super Density”, Zenodo 2023, (doi: 1229
10.5281/zenodo.8196132). 1230
SuperHyperGraph With Multipartite and Cycle By CONNECTIVE 1232
DOMINATION As Hyper Decoration On Super Density”, Zenodo 2023, (doi: 1233
10.5281/zenodo.8196099). 1234
SuperHyperGraph With Bipartite and Path By DOMINATION As Hyper 1236
Decoration On Super Density”, Zenodo 2023, (doi: 10.5281/zenodo.8187955). 1237
SuperHyperGraph With Star and Wheel By DOMINATION As Hyper 1239
SuperHyperGraph With Multipartite and Cycle By DOMINATION As Hyper 1242
SuperHyperGraph By SuperHyperPerfect Search As Hyper Perf On Super 1245
Perfidy”, Zenodo 2023, (doi: 10.5281/zenodo.8104836). 1246
34. Henry Garrett, “New Ideas On Super Perfidy By Hyper Perf Of 1247
SuperHyperPerfect Search In Recognition of Cancer With (Neutrosophic) 1248
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8104857). 1249
SuperHyperGraph By Reverse Strict Dimension Dominating As Hyper Dimple 1251
On Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8092796). 1252
36. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1253
Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1254
SuperHyperGraph By Unequal Dimension Dominating As Hyper Dimple On 1257
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8088438). 1258
38. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal 1259
Dimension Dominating In Recognition of Cancer With (Neutrosophic) 1260
SuperHyperGraph By Strict Dimension Dominating As Hyper Dimple On Super 1263
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8084436). 1264
40. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Strict 1265
SuperHyperGraph By Reverse Strict Connective As Hyper Conceit On Super 1269
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8080100). 1270
42. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict 1271
Connective In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1272
Zenodo 2023, (doi: 10.5281/zenodo.8080068). 1273
SuperHyperGraph By Unequal Connective Dominating As Hyper Conceit On 1275
Super Con”, Zenodo 2023, (doi: 10.5281/zenodo.8078445). 1276
44. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal 1277
Connective Dominating In Recognition of Cancer With (Neutrosophic) 1278
SuperHyperGraph By Strict Connective Dominating As Hyper Conceit On 1281
46. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict 1283
SuperHyperGraph By Reverse Dimension Dominating As Hyper Dimple On 1287
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8072171). 1288
48. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse 1289
SuperHyperGraph By Equal Dimension Dominating As Hyper Dimple On Super 1293
50. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal 1295
SuperHyperGraph By Dimension Dominating As Hyper Dimple On Super 1299
52. Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension 1301
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 1302
SuperHyperGraph By Reverse Connective Dominating As Hyper Conceit On 1305
54. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse 1307
SuperHyperGraph By Equal Connective Dominating As Hyper Conceit On 1311
56. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal 1313
SuperHyperGraph By Connective Dominating As Hyper Conceit On Super 1317
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8051346). 1318
58. Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective 1319
SuperHyperGraph By United Dominating As Hyper Ultra On Super Units”, 1323
60. Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United 1325
SuperHyperGraph By Zero Forcing As Hyper ford On Super forceps”, Zenodo 1329
2023, (doi: 10.5281/zenodo.8017246). 1330
62. Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 1331
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1332
(doi: 10.5281/zenodo.8020128). 1333
SuperHyperGraph By Matrix-Based As Hyper mat On Super matte”, Zenodo 1335
2023, (doi: 10.5281/zenodo.7978571). 1336
64. Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 1337
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 1338
(doi: 10.5281/zenodo.7978857). 1339
SuperHyperGraph By Dominating-Edges As Hyper Dome On Super Eddy”, 1341
66. Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of 1343
Dominating-Edges In Cancer’s Recognition With (Neutrosophic) 1344
SuperHyperGraph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, 1347
(doi: 10.5281/zenodo.7916595). 1348
68. Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In 1349
(doi: 10.5281/zenodo.7923632). 1351
SuperHyperGraph By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On 1353
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7904698). 1354
70. Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of 1355
Eulerian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1356
SuperHyperGraph By Eulerian-Type-Cycle-Decomposition As Hyper 1359
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1360
10.5281/zenodo.7904529). 1361
72. Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 1362
Eulerian-Type-Cycle-Decomposition In Cancer’s Recognition With 1363
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 1364
10.5281/zenodo.7904401). 1365
SuperHyperGraph By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super 1367
Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7871026). 1368
Eulerian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1370
SuperHyperGraph By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super 1373
Eulerian-Cycle-Neighbor In Recognition of Cancer With (Neutrosophic) 1376
SuperHyperGraph By Eulerian-Cycle-Decomposition As Hyper Decompress On 1379
Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7855661). 1380
Eulerian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) 1382
SuperHyperGraph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, 1385
80. Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of 1387
Eulerian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1388
SuperHyperGraph By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super 1391
Eulerian-Type-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1394
SuperHyperGraph By Eulerian-Type-Path-Decomposition As Hyper Decompress 1397
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7839333). 1398
Eulerian-Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1400
SuperHyperGraph By Eulerian-Type-Path-Cut As Hyper Eulogy On Super 1403
EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7834229). 1404
Eulerian-Type-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1406
SuperHyperGraph By Eulerian-Path-Neighbor As Hyper Nebbish On Super 1409
Eulerian-Path-Neighbor In Cancer’s Recognition With (Neutrosophic) 1412
SuperHyperGraph By Eulerian-Path-Decomposition As Hyper Decompress On 1415
Eulerian-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) 1418
SuperHyperGraph As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 1421
10.5281/zenodo.7812236). 1422
SuperHyperGraph By initial Eulerian-Path-Cut As Hyper initial Eulogy On 1424
Super initial EULA”, Zenodo 2023, (doi: 10.5281/zenodo.7809365). 1425
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super 1427
EULA-Path-Cut”, Zenodo 2023, (doi: 10.5281/zenodo.7809358). 1428
Eulerian-Path-Cut In Cancer’s Recognition With (Neutrosophic) 1430
SuperHyperGraph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, 1433
SuperHyperGraph By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On 1436
Super Nebulous”, Zenodo 2023, (doi: 10.5281/zenodo.7806767). 1437
Hamiltonian-Type-Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) 1439
SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper 1442
Decompress On Super Decompensation”, Zenodo 2023, (doi: 1443
10.5281/zenodo.7804238). 1444
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With 1446
(Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 1447
SuperHyperGraph By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super 1449
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7799902). 1450
101. Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of 1451
Hamiltonian-Type-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1452
SuperHyperGraph By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super 1455
SuperHyperGraph By Hamiltonian-Cycle-Decomposition As Hyper Decompress 1458
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7793372). 1459
SuperHyperGraph By Hamiltonian-Cycle-Cut As Hyper Hamper On Super 1461
Hammy”, Zenodo 2023, (doi: 10.5281/zenodo.7791952). 1462
Hamiltonian-Cycle-Cut In Recognition of Cancer With (Neutrosophic) 1464
SuperHyperGraph By Hamiltonian-Neighbor As Hyper Nebbish On Super 1467
Hamiltonian-Neighbor In Recognition of Cancer With (Neutrosophic) 1470
SuperHyperGraph By Hamiltonian-Decomposition As Hyper Decompress On 1473
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) 1476
SuperHyperGraph By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, 1479
Hamiltonian-Cut In Recognition of Cancer With (Neutrosophic) 1482
SuperHyperGraph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, 1485
Trace-Neighbor In Recognition of Cancer With (Neutrosophic) 1488
114. Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic 1490
SuperHyperGraph By Trace-Decomposition As Hyper Decompress On Super 1491
Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7771831). 1492
Trace-Decomposition In Cancer’s Recognition With (Neutrosophic) 1494
SuperHyperGraph By Trace-Cut As Hyper Nebbish On Super Nebulous”, 1497
ResearchGate 2023, (doi: 10.13140/RG.2.2.20913.25446). 1498
117. Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In 1499
(doi: 10.5281/zenodo.7764916). 1501
SuperHyperGraph By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, 1503
Edge-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 1506
SuperHyperGraph By Edge-Decomposition As Hyper Decompress On Super 1509
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22545.10089). 1510
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) 1512
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 1513
SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 1515
2023, (doi: 10.13140/RG.2.2.11377.76644). 1516
123. Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In 1517
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1518
2023, (doi: 10.13140/RG.2.2.23750.96329). 1519
SuperHyperGraph By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, 1521
Vertex-Neighbor In Cancer’s Recognition With (Neutrosophic) 1524
SuperHyperGraph By Vertex-Decomposition As Hyper Decompress On Super 1527
Decompensation”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30212.81289). 1528
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) 1530
SuperHyperGraph By Vertex-Cut As Hyper Vertu On Super Vertigo”, 1533
129. Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 1535
2023, (doi: 10.13140/RG.2.2.32467.25124). 1537
SuperHyperGraph By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, 1539
131. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1541
Stable-Neighbor In Cancer’s Recognition With (Neutrosophic) 1542
SuperHyperGraph By Stable-Decompositions As Hyper Stain On Super Stagy”, 1545
133. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of 1547
Stable-Decompositions In Cancer’s Recognition With (Neutrosophic) 1548
SuperHyperGraph By Stable-Cut As Hyper Stain On Super Stagy”, 1551
135. Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In 1553
2023, (doi: 10.13140/RG.2.2.20170.24000). 1555
SuperHyperGraph By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, 1557
137. Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of 1559
Clique-Neighbors In Cancer’s Recognition With (Neutrosophic) 1560
SuperHyperGraph By Clique-Decompositions As Hyper Decompile On Super 1563
Decommission”, ResearchGate 2023, (doi: 10.13140/RG.2.2.18780.87683). 1564
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) 1566
SuperHyperGraph By Clique-Cut As Hyper Click On Super Cliche”, 1569
141. Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In 1571
2023, (doi: 10.13140/RG.2.2.27392.30721). 1573
SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 1575
2023, (doi: 10.13140/RG.2.2.33028.40321). 1576
SuperHyperGraph By List- Coloring As Hyper List On Super Lisle”, 1578
144. Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 1580
2023, (doi: 10.13140/RG.2.2.16356.04489). 1582
SuperHyperGraph By Space As Hyper Sparse On Super Spark ”, ResearchGate 1584
2023, (doi: 10.13140/RG.2.2.21756.21129). 1585
146. Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 1586
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, 1587
(doi: 10.13140/RG.2.2.30983.68009). 1588
SuperHyperGraph By Edge-Connectivity As Hyper Disclosure On Super 1590
Closure”, ResearchGate 2023, (doi: 10.13140/RG.2.2.28552.29445). 1591
148. Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of 1592
Edge-Connectivity In Cancer’s Recognition With (Neutrosophic) 1593
SuperHyperGraph By Vertex-Connectivity As Hyper Leak On Super Structure”, 1596
150. Henry Garrett, “New Ideas On Super System By Hyper Explosions Of 1598
Vertex-Connectivity In Cancer’s Recognition With (Neutrosophic) 1599
SuperHyperGraph By Tree-Decomposition As Hyper Forward On Super Returns”, 1602
152. Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of 1604
Tree-Decomposition In Cancer’s Recognition With (Neutrosophic) 1605
SuperHyperGraph By Chord As Hyper Excellence On Super Excess”, 1608
154. Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 1610
2023, (doi: 10.13140/RG.2.2.11172.14720). 1612
SuperHyperGraph By SuperHyper(i,j)-Domination As Hyper Controller On 1614
Super Waves”, ResearchGate 2023, (doi: 10.13140/RG.2.2.22011.80165). 1615
156. Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of 1616
SuperHyper(i,j)-Domination In Cancer’s Recognition With (Neutrosophic) 1617
SuperHyperGraph By SuperHyperEdge-Domination As Hyper Reversion On 1620
Super Indirection”, ResearchGate 2023, (doi: 10.13140/RG.2.2.10493.84962). 1621
158. Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of 1622
SuperHyperEdge-Domination In Cancer’s Recognition With (Neutrosophic) 1623
SuperHyperGraph By SuperHyperK-Domination As Hyper k-Actions On Super 1626
Patterns”, ResearchGate 2023, (doi: 10.13140/RG.2.2.19944.14086). 1627
160. Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of 1628
SuperHyperK-Domination In Cancer’s Recognition With (Neutrosophic) 1629
SuperHyperGraph By SuperHyperK-Number As Hyper k-Partition On Super 1632
Layers”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33103.76968). 1633
162. Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of 1634
SuperHyperK-Number In Cancer’s Recognition With (Neutrosophic) 1635
SuperHyperGraph By SuperHyperOrder As Hyper Enumerations On Super 1638
Landmarks”, ResearchGate 2023, (doi: 10.13140/RG.2.2.35646.56641). 1639
164. Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of 1640
SuperHyperOrder In Cancer’s Recognition With (Neutrosophic) 1641
SuperHyperGraph By SuperHyperColoring As Hyper Categories On Super 1644
Neighbors”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13973.81121). 1645
166. Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of 1646
SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) 1647
167. Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of 1649
SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic 1650
SuperHyperGraph By SuperHyperDimension As Hyper Distinguishing On Super 1653
Distances”, ResearchGate 2023, (doi: 10.13140/RG.2.2.31956.88961). 1654
169. Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of 1655
SuperHyperDimension In Cancer’s Recognition With (Neutrosophic) 1656
SuperHyperGraph By SuperHyperDominating As Hyper Closing On Super 1659
Messy”, ResearchGate 2023, (doi: 10.13140/RG.2.2.21510.45125). 1660
171. Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of 1661
SuperHyperDominating In Cancer’s Recognition With (Neutrosophic) 1662
SuperHyperGraph By SuperHyperConnected As Hyper Group On Super Surge”, 1665
173. Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of 1667
SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) 1668
SuperHyperGraph By SuperHyperTotal As Hyper Covering On Super Infections”, 1671
175. Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of 1673
SuperHyperTotal In Cancer’s Recognition with (Neutrosophic) 1674
176. Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of 1676
SuperHyperPerfect In Cancer’s Recognition with (Neutrosophic) 1677
SuperHyperGraph By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, 1680
SuperHyperGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, 1683
179. Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 1685
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) 1686
180. Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions 1688
Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic 1689
181. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1691
SuperHyperGraph By SuperHyperDuality As Hyper Imaginations On Super 1692
Mixed-Illustrations”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1693
182. Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) 1694
SuperHyperGraph By Path SuperHyperColoring As Hyper Correction On Super 1695
Faults”, ResearchGate 2023, (doi: 10.13140/RG.2.2.30182.50241). 1696
183. Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path 1697
SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic 1698
184. Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In 1700
Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph By 1701
SuperHyperDensity”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13444.60806). 1702
185. Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On 1703
Super Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic 1704
SuperHyperGraph”, ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1705
186. Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic 1706
SuperHyperGraph By Eulerian SuperHyperCycles and Hamiltonian Sets As 1707
Hyper Covering Versus Super separations-VI ”, ResearchGate 2023, (doi: 1708
10.13140/RG.2.2.29913.80482). 1709
Hyper Covering Versus Super separations-V ”, ResearchGate 2023, (doi: 1712
10.13140/RG.2.2.33269.24809). 1713
Hyper Covering Versus Super separations-IV ”, ResearchGate 2023, (doi: 1716
10.13140/RG.2.2.34946.96960). 1717
189. Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic 1718
Hyper Covering Versus Super separations-III ”, ResearchGate 2023, (doi: 1720
10.13140/RG.2.2.14814.31040). 1721
Hyper Covering Versus Super separations-II ”, ResearchGate 2023, (doi: 1724
10.13140/RG.2.2.15653.17125). 1725
Hyper Covering Versus Super separations-I ”, ResearchGate 2023, (doi: 1728
10.13140/RG.2.2.25719.50089). 1729
192. Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme 1730
Recognition As Neutrosophic SuperHyperGraph By Hyper Plans Called 1731
SuperHyperConnectivities”, ResearchGate 2023, (doi: 1732
10.13140/RG.2.2.29441.94562). 1733
193. Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic 1734
SuperHyperGraph By SuperHyperConnectivities As Hyper Diagnosis On Super 1735
Mechanism”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17252.24968). 1736
194. Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By 1737
the Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles 1738
On Super Mess”, ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1739
195. Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition 1740
and Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions 1741
of Cycles”, ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485). 1742
196. Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth 1743
theory and (Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme 1744
Recognition”, Preprints 2023, 2023010396 (doi: 1745
10.20944/preprints202301.0396.v1). 1746
197. Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of 1747
neutrosophic SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic 1748
Recognition”, Preprints 2023, 2023010395 (doi: 1749
10.20944/preprints202301.0395.v1). 1750
198. Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the 1751
Cancer’s Recognition in The Confrontation With Super Attacks In Hyper 1752
Situations By Implementing (Neutrosophic) 1-Failed SuperHyperForcing in The 1753
Technical Approaches to Neutralize SuperHyperViews”, ResearchGate 2023, (doi: 1754
10.13140/RG.2.2.26240.51204). 1755
199. Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the 1756
Entrepreneurs on Cancer’s Recognitions To Fail Forcing Style As the Super 1757
Classes With Hyper Effects In The Background of the Framework is So-Called 1758
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1759
10.13140/RG.2.2.12818.73925). 1760
200. Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible 1761
Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and 1762
Neutrosophic SuperHyperGraph”, ResearchGate 2023,(doi: 1763
10.13140/RG.2.2.26836.88960). 1764
201. Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the 1765
Cancer’s Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, 1766
ResearchGate 2023,(doi: 10.13140/RG.2.2.36745.93289). 1767
202. Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of 1768
Confrontation under Cancer’s Recognition as the Model in The Setting of 1769
10.20944/preprints202301.0308.v1). 1771
203. Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The 1772
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside 1773
Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 1774
2023010282 (doi: 10.20944/preprints202301.0282.v1). 1775
204. Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1776
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 1777
(doi: 10.20944/preprints202301.0267.v1).). 1778
205. Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and 1779
Affected Cells Toward The Totality Under Cancer’s Recognition By New 1780
Multiple Definitions On the Sets Polynomials Alongside Numbers In The 1781
(Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 1782
Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi: 1783
10.20944/preprints202301.0265.v1). 1784
206. Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The 1785
Worst Case of Full Connections With Extreme Failed SuperHyperClique In 1786
Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 1787
2023, 2023010262,(doi: 10.20944/preprints202301.0262.v1). 1788
207. Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the 1789
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in 1790
Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 1791
10.20944/preprints202301.0240.v1). 1792
208. Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s 1793
Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 1794
SuperHyperGraphs”, Preprints 2023, 2023010224, (doi: 1795
10.20944/preprints202301.0224.v1). 1796
209. Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To 1797
Monitor Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, 1798
ResearchGate 2023,(doi: 10.13140/RG.2.2.35061.65767). 1799
210. Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In 1800
The Cancer’s Extreme Recognition With Different Types of Extreme 1801
SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, 1802
211. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1804
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1805
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1806
2023, (doi: 10.13140/RG.2.2.32530.73922). 1807
212. Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In 1808
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed 1809
SuperHyperClique on Cancer’s Recognition called Neutrosophic 1810
SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15897.70243). 1811
213. Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the 1812
Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By 1813
SuperHyperModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 1814
2023, (doi: 10.13140/RG.2.2.32530.73922). 1815
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1817
2023010105 (doi: 10.20944/preprints202301.0105.v1). 1818
215. Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic 1819
Recognition Forwarding Neutrosophic SuperHyperClique on Neutrosophic 1820
216. Henry Garrett,“Demonstrating Complete Connections in Every Embedded 1822
Regions and Sub-Regions in the Terms of Cancer’s Recognition and 1823
(Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique”, 1824
10.20944/preprints202301.0105.v1). 1829
10.20944/preprints202301.0088.v1). 1833
219. Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled 1834
neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition 1835
modeled in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, 1836
(doi: 10.13140/RG.2.2.17385.36968). 1837
Neutrosophic Recognition And Beyond ”, Preprints 2023, 2023010044 1840
Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 1842
2023010043 (doi: 10.20944/preprints202301.0043.v1). 1843
222. Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To 1844
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) 1845
Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In 1848
Special ViewPoints”, ResearchGate 2023, (doi: 10.13140/RG.2.2.11447.80803). 1849
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1851
2023, (doi: 10.13140/RG.2.2.35774.77123). 1852
Neutrosophic Recognition And Beyond ”, ResearchGate 2022, (doi: 1855
10.13140/RG.2.2.36141.77287). 1856
Recognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1858
10.13140/RG.2.2.29430.88642). 1859
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1862
10.13140/RG.2.2.11369.16487). 1863
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 1865
2022, 2022120549 (doi: 10.20944/preprints202212.0549.v1). 1866
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, 1868
Recognitions And Related (Neutrosophic) SuperHyperClasses”, Preprints 2022, 1873
2022120540 (doi: 10.20944/preprints202212.0540.v1). 1874
Recognitions And Related (Neutrosophic) SuperHyperClasses”, ResearchGate 1878
2022, (doi: 10.13140/RG.2.2.14426.41923). 1879
Preprints 2022, 2022120500 (doi: 10.20944/preprints202212.0500.v1). 1882
ResearchGate 2022 (doi: 10.13140/RG.2.2.20993.12640). 1885
234. Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on 1886
Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications 1887
in Cancer’s Treatments”, Preprints 2022, 2022120324 (doi: 1888
10.20944/preprints202212.0324.v1). 1889
235. Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on 1890
Neutrosophic SuperHyperGraphs And SuperHyperGraphs Alongside Applications 1891
in Cancer’s Treatments”, ResearchGate 2022 (doi: 1892
10.13140/RG.2.2.23123.04641). 1893
Neutrosophic SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 1896
10.20944/preprints202211.0576.v1). 1897
Neutrosophic SuperHyperClasses”, ResearchGate 2022 (doi: 1900
10.13140/RG.2.2.23324.56966). 1901
238. Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating 1902
and Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 1903
2022 (doi: 10.13140/RG.2.2.29173.86244). 1904
239. Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some 1905
Neutrosophic Notions Based on Neutrosophic SuperHyperEdge (NSHE) in 1906
Neutrosophic SuperHyperGraph (NSHG)”, ResearchGate 2022 (doi: 1907
10.13140/RG.2.2.25385.88160). 1908
240. Henry Garrett, “Connective Domination In Neutrosophic SuperHyperGraphs”. 1909
Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8194003). 1910
241. Henry Garrett, “Domination In Neutrosophic SuperHyperGraphs”. Dr. Henry 1911
Garrett, 2023 (doi: 10.5281/zenodo.8113416). 1912
242. Henry Garrett, “SuperHyperPerfect Search In SuperHyperGraphs”. Dr. Henry 1913
243. Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyperGraphs”. 1915
244. Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. 1917
Henry Garrett, 2023 (doi: 10.5281/zenodo.8090194). 1918
245. Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. 1919
246. Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry 1921
247. Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. 1923
248. Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. 1925
249. Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. 1927
250. Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. 1929
251. Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1931
252. Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. 1933
253. Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. 1935
254. Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry 1937
255. Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1939
2023 (doi: 10.5281/zenodo.8027488). 1940
256. Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1941
(doi: 10.5281/zenodo.8020181). 1942
257. Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1943
(doi: 10.5281/zenodo.7978921). 1944
258. Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 1945
10.5281/zenodo.7943878). 1946
259. Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 1947
2023 (doi: 10.5281/zenodo.7943871). 1948
260. Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1949
(doi: 10.5281/zenodo.7923786). 1950
261. Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1951
262. Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1953
263. Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1955
264. Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1957
265. Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1959
266. Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1961
2023 (doi: 10.5281/zenodo.7854561). 1962
267. Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. 1963
268. Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. 1965
269. Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry 1967
270. Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry 1969
271. Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. 1971
272. Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1973
2023 (doi: 10.5281/zenodo.7812750). 1974
273. Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. 1975
274. Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. 1977
275. Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1979
276. Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1981
277. Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. 1983
278. Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry 1985
279. Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry 1987
280. Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry 1989
281. Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1991
2023 (doi: 10.5281/zenodo.7783791). 1992
282. Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1993
2023 (doi: 10.5281/zenodo.7780123). 1994
283. Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry 1995
284. Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 1997
10.5281/zenodo.7637762). 1998
285. Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1999
(doi: 10.5281/zenodo.7766174). 2000
286. Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2001
(doi: 10.5281/zenodo.7762232). 2002
287. Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2003
2023 (doi: 10.5281/zenodo.7758601). 2004
288. Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2005
10.5281/zenodo.7754661). 2006
289. Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2007
2023 (doi: 10.5281/zenodo.7750995) . 2008
290. Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry 2009
291. Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2011
(doi: 10.5281/zenodo.7747236). 2012
292. Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2013
2023 (doi: 10.5281/zenodo.7742587). 2014
293. Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry 2015
294. Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2017
(doi: 10.5281/zenodo.7734719). 2018
295. Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2019
2023 (doi: 10.5281/zenodo.7730484). 2020
296. Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry 2021
297. Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2023
(doi: 10.5281/zenodo.7722865). 2024
298. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2025
10.5281/zenodo.7713563). 2026
299. Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2027
10.5281/zenodo.7709116). 2028
300. Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2029
2023 (doi: 10.5281/zenodo.7706415). 2030
301. Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2031
2023 (doi: 10.5281/zenodo.7706063). 2032
302. Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2033
2023 (doi: 10.5281/zenodo.7701906). 2034
303. Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2035
10.5281/zenodo.7700205). 2036
304. Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2037
2023 (doi: 10.5281/zenodo.7694876). 2038
305. Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2039
2023 (doi: 10.5281/zenodo.7679410). 2040
306. Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2041
(doi: 10.5281/zenodo.7675982). 2042
307. Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2043
(doi: 10.5281/zenodo.7672388). 2044
308. Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2045
10.5281/zenodo.7668648). 2046
309. Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2047
10.5281/zenodo.7662810). 2048
310. Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 2049
(doi: 10.5281/zenodo.7659162). 2050
311. Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2051
10.5281/zenodo.7653233). 2052
312. Henry Garrett, “SuperHyperWheel ”. Dr. Henry Garrett, 2023 (doi: 2053
10.5281/zenodo.7653204). 2054
313. Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 2055
10.5281/zenodo.7653142). 2056
314. Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 2057
10.5281/zenodo.7653117). 2058
315. Henry Garrett, “SuperHyperStar ”. Dr. Henry Garrett, 2023 (doi: 2059
10.5281/zenodo.7653089). 2060
316. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2061
10.5281/zenodo.7651687). 2062
317. Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 2063
10.5281/zenodo.7651619). 2064
318. Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 2065
10.5281/zenodo.7651439). 2066
319. Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 2067
10.5281/zenodo.7650729). 2068
320. Henry Garrett, “SuperHyperConnected ”. Dr. Henry Garrett, 2023 (doi: 2069
10.5281/zenodo.7647868). 2070
321. Henry Garrett, “SuperHyperTotal ”. Dr. Henry Garrett, 2023 (doi: 2071
10.5281/zenodo.7647017). 2072
322. Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 2073
10.5281/zenodo.7644894). 2074
323. Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 2075
10.5281/zenodo.7641880). 2076
324. Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 2077
10.5281/zenodo.7632923). 2078
325. Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 2079
10.5281/zenodo.7623459). 2080
326. Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2081
2023 (doi: 10.5281/zenodo.7606416). 2082
327. Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 2083
(doi: 10.5281/zenodo.7606416). 2084
328. Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 2085
10.5281/zenodo.7606404). 2086
329. Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2087
10.5281/zenodo.7580018). 2088
330. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2089
10.5281/zenodo.7580018). 2090
331. Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2091
10.5281/zenodo.7580018). 2092
332. Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 2093
10.5281/zenodo.7579929). 2094
333. Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2095
10.5281/zenodo.7563170). 2096
334. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2097
10.5281/zenodo.7563164). 2098
335. Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2099
10.5281/zenodo.7563160). 2100
336. Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2101
10.5281/zenodo.7563160). 2102
337. Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 2103
10.5281/zenodo.7563160). 2104
338. Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 2105
(doi: 10.5281/zenodo.7557063). 2106
339. Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2107
10.5281/zenodo.7557009). 2108
340. Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 2109
(doi: 10.5281/zenodo.7539484). 2110
341. Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2111
2023 (doi: 10.5281/zenodo.7523390). 2112
342. Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 2113
(doi: 10.5281/zenodo.7523390). 2114
343. Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2115
2023 (doi: 10.5281/zenodo.7523390). 2116
344. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2117
10.5281/zenodo.7574952). 2118
345. Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2119
10.5281/zenodo.7574992). 2120
346. Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2121
10.5281/zenodo.7523357). 2122
347. Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2123
10.5281/zenodo.7523357). 2124
348. Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2125
2023 (doi: 10.5281/zenodo.7504782). 2126
349. Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 2127
(doi: 10.5281/zenodo.7504782). 2128
350. Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2129
2023 (doi: 10.5281/zenodo.7504782). 2130
351. Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2131
10.5281/zenodo.7499395). 2132
352. Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2133
10.5281/zenodo.7499395). 2134
353. Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2135
10.5281/zenodo.7499395). 2136
354. Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2137
2023 (doi: 10.5281/zenodo.7497450). 2138
355. Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 2139
(doi: 10.5281/zenodo.7497450). 2140
356. Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 2141
(doi: 10.5281/zenodo.7494862). 2142
357. Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2143
10.5281/zenodo.7494862). 2144
358. Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 2145
(doi: 10.5281/zenodo.7494862). 2146
359. Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 2147
(doi: 10.5281/zenodo.7493845). 2148
360. Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2149
10.5281/zenodo.7493845). 2150
361. Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 2151
(doi: 10.5281/zenodo.7493845). 2152
362. Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 2153
10.5281/zenodo.7539484). 2154
363. Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2155
10.5281/zenodo.7523390). 2156
364. Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 2157
10.5281/zenodo.7523357). 2158
365. Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2159
10.5281/zenodo.7504782). 2160
366. Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 2161
10.5281/zenodo.7499395). 2162
367. Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2163
10.5281/zenodo.7497450). 2164
368. Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 2165
10.5281/zenodo.7494862). 2166
369. Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 2167
10.5281/zenodo.7493845). 2168
370. Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 2169
10.5281/zenodo.7480110). 2170
371. Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 2171
10.5281/zenodo.7378758). 2172
372. Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 2173
10.5281/zenodo.6320305). 2174
373. Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 2175
10.5281/zenodo.6677173). 2176
View publication stats

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

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

New Ideas in Recognition of Cancer and Neutrosophic SuperHyperGraph With Bipartite and Path by EQUAL 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

536 PUBLICATIONS 27,009 CITATIONS

Featured Articles View project

Neutrosophic SuperHyperGraphs and SuperHyperGraphs View project

The user has requested enhancement of the downloaded file.

New Ideas In Recognition of Cancer And Neutrosophic 2

SuperHyperGraph With Bipartite and Path By EQUAL 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

SuperHyperEQUAL CONNECTIVE DOMINATION). Let a Neutrosophic SuperHyperGraph 11

(NSHG) S be a pair S = (V, E). Consider a Neutrosophic SuperHyperSet 12

V 0 = {V1 , V2 , . . . , Vs }. Then V 0 is called Neutrosophic SuperHyperEQUAL CONNECTIVE 13

DOMINATION if the following expressions, terms and statements is called Neutrosophic 14

SuperHyperEQUAL CONNECTIVE DOMINATION criteria holds. 15

SuperHyperNotions, namely a EQUAL CONNECTIVE DOMINATION and a 17

Neutrosophic EQUAL CONNECTIVE DOMINATION. Two different 18

SuperHyperNotion, SuperHyperUniform, and SuperHyperClass are well-defined and 20

well-reviewed based on them. Literature review is implemented throughout this research. 21

SuperHyperNotion with other SuperHyperNotions and basic SuperHyperNumbers is 23

presented. Definitions are followed by examples and examples, so clarifications are 24

officially called “SuperHyperEdge”. “SuperHyperGraph” and “Neutrosophic 31

SuperHyperGraph” frameworks are selected and selected for research on “Cancer 32

questions and problems. It is useful to define a “neutrosophic” version of EQUAL 36

EQUAL CONNECTIVE DOMINATION becomes more understandable. In order to 38

master the Neutrosophic EQUAL CONNECTIVE DOMINATION, there is a need to 39

“re-define” the concept of “EQUAL CONNECTIVE DOMINATION mastery”. 40

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

method, the position of tags is used to assign values. Suppose a EQUAL 42

CONNECTIVE DOMINATION. If the specified table contains “values of vertices, 43

supervertices, edges, hyperedges, and hyperedges belonging to Neutrosophic 44

SuperHyperGraph” with key points, it is redefined. ”values of vertices & number of 45

positions in alphabet”, ”Values of SuperVertices&maximum values of its vertices”, 46

and structural examples, I would like to introduce the next SuperHyperClass 49

SuperHyperGraph based on EQUAL CONNECTIVE DOMINATION. This is the 50

would be disciplined. If there is a need to have all EQUAL CONNECTIVE 52

DOMINATION until EQUAL CONNECTIVE DOMINATION, then it is officially 53

called “EQUAL CONNECTIVE DOMINATION”, but otherwise, it is not EQUAL 54

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

titled “EQUAL CONNECTIVE DOMINATION”. These two examples are further 56

explored and distinguished because they are characterized in the SuperHyperClass 57

disciplinary methods based on a dominant EQUAL CONNECTIVE DOMINATION. 58

Because of having EQUAL CONNECTIVE DOMINATION, there is a need to 59

“re-define” the concept of “neutrosophic EQUAL CONNECTIVE DOMINATION” and 60

“neutrosophic EQUAL CONNECTIVE DOMINATION”. SuperHyperVertices and 61

SuperHyperEdges are assigned by alphabetical labels. In this method, the position of 62

tags is used to assign values. Consider a Neutrosophic SuperHyperGraph. 63

“Neutrosophic SuperHyperGraph” is redefined if the desired table exists. And if the 64

desired table exists, a EQUAL CONNECTIVE DOMINATION is redefined to a 65

“Neutrosophic EQUAL CONNECTIVE DOMINATION”. It is useful to define a 66

“Neutrosophic” version of SuperHyperClasses. Since there are more ways to obtain 67

Neutrosophic type results, a SuperHyper- Neutrosophic EQUAL CONNECTIVE 68

DOMINATION becomes more understandable. Consider a Neutrosophic 69

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

SuperHyperClasses. So are SuperHyperPath, SuperHyperCycle, SuperHyperStar, 71

SuperHyperBipartite, SuperHyperMultiPartite and SuperHyperWheel. ”Neutrosophic 72

SuperHyperPath”, “Neutrosophic SuperHyperCycle”, “Neutrosophic SuperHyperStar”, 73

“Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite” and 74

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

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