Super Hyper Join

SuperHyperJoin
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures iv
List of Tables v
1 ABSTRACT 1
2 BACKGROUND 15
Bibliography 19
3 Acknowledgements 27
4 Extreme SuperHyperJoin 29
5 New Ideas On Super connections By Hyper disconnections Of SuperHy-

perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph 33
6 ABSTRACT 35
7 Background 41
8 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

Research 45
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 49
10 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 59
11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

Motivation 87
13 Extreme Applications in Cancer’s Extreme Recognition 99
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipartite

as Extreme SuperHyperModel 101
15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyperMul-

tipartite as Extreme SuperHyperModel 103
16 Wondering Open Problems But As The Directions To Forming The

Motivations 105
17 Conclusion and Closing Remarks 107
Bibliography 109
18 Neutrosophic SuperHyperJoin 113
19 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By SuperHyperJoin As Hyper Separations On Super Sorts 117
20 ABSTRACT 119
21 Background 125
22 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

Research 129
23 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

Ways 133
24 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

Dense And Super Forms 143
25 The Neutrosophic Departures on The Theoretical Results Toward Theor-

etical Motivations 161
26 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 171
27 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 183
28 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 185
29 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic Super-

HyperMultipartite as Neutrosophic SuperHyperModel 187

30 Wondering Open Problems But As The Directions To Forming The

Motivations 189
31 Conclusion and Closing Remarks 191
Bibliography 193
32 Books’ Contributions 197
33 “SuperHyperGraph-Based Books”: | Featured Tweets 205
34 CV 233

List of Figures
1.1 Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of

SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.17761.79206). . . . . . . . . . . . . . . . 7
1.4 Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper-
Graph By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 9
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 9
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 10
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1 “#103rd Book” || SuperHyperJoin February 2023 License: CC BY-NC-ND 4.0 Print
length: 254 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs 24

vi

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperJoin in the Extreme Example (24.0.1) . . . . . . . . . . . . . . . . . . . 60
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme


11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperJoin

in the Example (25.0.2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of Extreme
SuperHyperJoin in the Example (25.0.8) . . . . . . . . . . . . . . . . . . . . . . . . . 83
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-
HyperJoin in the Example (25.0.10) . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperJoin in the Extreme Example (25.0.12) . . . . . . . . . . . . . . 86
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyperJoin 101
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-

HyperJoin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 114
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 114
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 115
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 115
24.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperJoin in the Neutrosophic Example (24.0.1) . . . . . . . . . 144


24.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
25.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperJoin in the Example (25.0.2) . . . . . . . . . . . . . . . . . . . . . . . . . 162
25.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
25.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of Neutro-
sophic SuperHyperJoin in the Neutrosophic Example (25.0.6) . . . . . . . . . . . . . 165
25.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperJoin in the Example (25.0.8) . . . . . . . . . . . 167

25.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperJoin in the Example (25.0.10) . . . . . . . . . . . . . . . . . . . . . . . . 169
25.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperJoin in the Neutrosophic Example (25.0.12) . . 170
28.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperJoin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185
29.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperJoin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187

2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 200
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 200
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 201
2023, (doi: 10.13140/RG.2.2.11050.90569). . . . . . . . . . . . . . . . . . . . . . . . . 201
32.10“#103rd Book” || SuperHyperJoin February 2023 License: CC BY-NC-ND 4.0 Print
33.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 206

33.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 207
33.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . . 208


33.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . . 214

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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (23.0.23) 57
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (23.0.22) 58

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . . 102

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . . 104
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 108

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . . 186

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . . 188
31.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 192
xii
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme SuperHy- 1
perJoin” and “Neutrosophic SuperHyperJoin” about some scientific research on SuperHyperJoin 2
by two (Extreme/Neutrosophic) notions, namely, Extreme SuperHyperJoin and Neutrosophic 3

SuperHyperJoin. With scientific research on the basic scientific research properties, the scientific 4
research book starts to make Extreme SuperHyperJoin theory and Neutrosophic SuperHyperJoin 5
theory more (Extremely/Neutrosophicly) understandable. 6
7
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 8
Notions, namely, a SuperHyperJoin and Neutrosophic SuperHyperJoin . Two different types 9

of SuperHyperDefinitions are debut for them but the scientific research goes further and the 10
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 11
and well-reviewed. The literature review is implemented in the whole of this research. For shining 12
the elegancy and the significancy of this research, the comparison between this SuperHyperNo- 13
tion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 14
definitions are followed by the examples and the instances thus the clarifications are driven with 15
different tools. The applications are figured out to make sense about the theoretical aspect of 16
this ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 17
out the challenges make sense about ongoing and upcoming research. The special case is up. 18
The cells are viewed in the deemed ways. There are different types of them. Some of them are 19
individuals and some of them are well-modeled by the group of cells. These types are all officially 20
called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. 21
The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and 22
elected to scientific research about “Cancer’s Recognition”. Thus these complex and dense 23
SuperHyperModels open up some avenues to scientific research on theoretical segments and 24
“Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also officially 25
collected in the form of some questions and some problems. Assume a SuperHyperGraph. Then 26
δ−SuperHyperJoin is a maximal of SuperHyperVertices with a maximum cardinality such that 27

either of the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeigh- 28
bors of s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 29
The first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, 30
holds if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperJoin is a maximal 31
Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that either 32
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeigh- 33
1
bors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; and 34

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 35
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 36
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperJoin . 37
Since there’s more ways to get type-results to make a SuperHyperJoin more understandable. 38
For the sake of having Neutrosophic SuperHyperJoin, there’s a need to “redefine” the notion 39
of a “SuperHyperJoin ”. The SuperHyperVertices and the SuperHyperEdges are assigned by 40

the labels from the letters of the alphabets. In this procedure, there’s the usage of the position 41
of labels to assign to the values. Assume a SuperHyperJoin . It’s redefined a Neutrosophic 42
SuperHyperJoin if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, 43
Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with 44
the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 45
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 46
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 47
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 48
To get structural examples and instances, I’m going to introduce the next SuperHyperClass of 49
SuperHyperGraph based on a SuperHyperJoin . It’s the main. It’ll be disciplinary to have the 50
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 51
SuperHyperJoin until the SuperHyperJoin, then it’s officially called a “SuperHyperJoin” but 52
otherwise, it isn’t a SuperHyperJoin . There are some instances about the clarifications for 53
the main definition titled a “SuperHyperJoin ”. These two examples get more scrutiny and 54
discernment since there are characterized in the disciplinary ways of the SuperHyperClass based 55
on a SuperHyperJoin . For the sake of having a Neutrosophic SuperHyperJoin, there’s a need to 56
“redefine” the notion of a “Neutrosophic SuperHyperJoin” and a “Neutrosophic SuperHyperJoin ”. 57
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 58
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 59
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the 60
intended Table holds. And a SuperHyperJoin are redefined to a “Neutrosophic SuperHyperJoin” 61
if the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 62
Since there’s more ways to get Neutrosophic type-results to make a Neutrosophic SuperHyperJoin 63
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutro- 64

sophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperJoin, 65
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 66
“Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperJoin”, “Neutrosophic SuperHy- 67
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 68
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a “Neut- 69

rosophic SuperHyperJoin” where it’s the strongest [the maximum Neutrosophic value from all the 70
SuperHyperJoin amid the maximum value amid all SuperHyperVertices from a SuperHyperJoin 71
.] SuperHyperJoin . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the number 72
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 73
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 74
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperJoin if it’s 75
only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 76
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 77
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 78
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 79

forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 81
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 82
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 83
the specific designs and the specific architectures. The SuperHyperModel is officially called 84
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 85
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 86

and the common and intended properties between “specific” cells and “specific group” of cells 87
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 88
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 89
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 90
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced in 91
redeemed ways. The recognition of the cancer in the long-term function. The specific region 92
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 93
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 94
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 95
and the effects of the cancer on that region; this event leads us to choose another model [it’s 96
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 97
and what’s done. There are some specific models, which are well-known and they’ve got the 98
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 99
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 100
Neutrosophic SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, SuperHyperBipartite, Super- 101
HyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperJoin 102
or the strongest SuperHyperJoin in those Neutrosophic SuperHyperModels. For the longest 103
SuperHyperJoin, called SuperHyperJoin, and the strongest SuperHyperJoin, called Neutrosophic 104
SuperHyperJoin, some general results are introduced. Beyond that in SuperHyperStar, all 105
possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential 106
to have at least three SuperHyperEdges to form any style of a SuperHyperJoin. There isn’t any 107
formation of any SuperHyperJoin but literarily, it’s the deformation of any SuperHyperJoin. It, 108
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 109
Neutrosophic SuperHyperGraph theory are proposed. 110

Keywords: SuperHyperGraph, (Neutrosophic) SuperHyperJoin, Cancer’s Recognition 111
AMS Subject Classification: 05C17, 05C22, 05E45 112

113
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 114
Notion, namely, Neutrosophic SuperHyperJoin . Two different types of SuperHyperDefinitions are 115
debut for them but the scientific research goes further and the SuperHyperNotion, SuperHyper- 116
Uniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature 117
review is implemented in the whole of this research. For shining the elegancy and the significancy 118
of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions 119
and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 120
and the instances thus the clarifications are driven with different tools. The applications are 121
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 122
Neutrosophic Recognition” are the under scientific research to figure out the challenges make sense 123
about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed 124

ways. There are different types of them. Some of them are individuals and some of them are 125
well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the 126
relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 127
and “Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Can- 128
cer’s Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 129
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 130
Some avenues are posed to pursue this research. It’s also officially collected in the form of some 131
questions and some problems. Assume a SuperHyperGraph. Then an “δ−SuperHyperJoin” is a 132
maximal SuperHyperJoin of SuperHyperVertices with maximum cardinality such that either of the 133
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 134
|S∩N (s)| > |S∩(V \N (s))|+δ, |S∩N (s)| < |S∩(V \N (s))|+δ. The first Expression, holds if S is an 135
“δ−SuperHyperOffensive”. And the second Expression, holds if S is an “δ−SuperHyperDefensive”; 136
a“Neutrosophic δ−SuperHyperJoin” is a maximal Neutrosophic SuperHyperJoin of SuperHyper- 137

Vertices with maximum Neutrosophic cardinality such that either of the following expressions hold 138
for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : |S ∩ N (s)|N eutrosophic > 139
|S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first 140
Expression, holds if S is a “Neutrosophic δ−SuperHyperOffensive”. And the second Expression, 141
holds if S is a “Neutrosophic δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” 142
version of SuperHyperJoin . Since there’s more ways to get type-results to make SuperHyperJoin 143
more understandable. For the sake of having Neutrosophic SuperHyperJoin, there’s a need to “re- 144
define” the notion of “SuperHyperJoin ”. The SuperHyperVertices and the SuperHyperEdges are 145
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 146
position of labels to assign to the values. Assume a SuperHyperJoin . It’s redefined Neutrosophic 147
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 154
of SuperHyperGraph based on SuperHyperJoin . It’s the main. It’ll be disciplinary to have 155
the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to 156
have all SuperHyperJoin until the SuperHyperJoin, then it’s officially called “SuperHyperJoin” 157
but otherwise, it isn’t SuperHyperJoin . There are some instances about the clarifications 158
for the main definition titled “SuperHyperJoin ”. These two examples get more scrutiny and 159
on SuperHyperJoin . For the sake of having Neutrosophic SuperHyperJoin, there’s a need to 161
“redefine” the notion of “Neutrosophic SuperHyperJoin” and “Neutrosophic SuperHyperJoin ”. 162
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of 163
the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 164
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 165
the intended Table holds. And SuperHyperJoin are redefined “Neutrosophic SuperHyperJoin” 166
if the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 167
Since there’s more ways to get Neutrosophic type-results to make Neutrosophic SuperHyperJoin 168
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutro- 169
sophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperJoin, 170

SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 171

“Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperJoin”, “Neutrosophic SuperHy- 172
perStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and 173
“Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “Neut- 174
rosophic SuperHyperJoin” where it’s the strongest [the maximum Neutrosophic value from all 175
SuperHyperJoin amid the maximum value amid all SuperHyperVertices from a SuperHyperJoin 176
.] SuperHyperJoin . A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of 177

elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. There 178
are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as 179
intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperJoin if it’s 180
forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s 186
be based on the “Cancer’s Neutrosophic Recognition” and the results and the definitions will 196
be introduced in redeemed ways. The Neutrosophic recognition of the cancer in the long-term 197
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 198
and the long cycle of the move from the cancer is identified by this research. Sometimes the 199
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 200
and neutrality about the moves and the effects of the cancer on that region; this event leads 201
us to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 202
perception on what’s happened and what’s done. There are some specific models, which are 203
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 204
moves and the traces of the cancer on the complex tracks and between complicated groups 205
of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperJoin, SuperHy- 206

perStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to 207
find either the longest SuperHyperJoin or the strongest SuperHyperJoin in those Neutrosophic 208
SuperHyperModels. For the longest SuperHyperJoin, called SuperHyperJoin, and the strongest 209
SuperHyperJoin, called Neutrosophic SuperHyperJoin, some general results are introduced. 210
Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges 211
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 212
of a SuperHyperJoin. There isn’t any formation of any SuperHyperJoin but literarily, it’s the 213
deformation of any SuperHyperJoin. It, literarily, deforms and it doesn’t form. A basic familiarity 214
with SuperHyperGraph theory and Neutrosophic SuperHyperGraph theory are proposed. 215
Keywords: Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperJoin, Cancer’s Neutro- 216

sophic Recognition 217

219
The following references are cited by chapters. 220
221
[Ref150] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of 222
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 223

2023, (doi: 10.13140/RG.2.2.17761.79206). 224
225
[Ref151] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 226
perGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 227
10.13140/RG.2.2.11050.90569). 228
229
The links to the contributions of this scientific research book are listed below. Article #150 230
231
New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin In Cancer’s 232
Recognition with (Neutrosophic) SuperHyperGraph 233
234
ResearchGate: https://www.researchgate.net/publication/368505978 235

236
Scribd: https://www.scribd.com/document/625851794 237
238
academia: https://www.academia.edu/96920884 239
240
ZENODO_ORG: https://zenodo.org/record/7641856 241
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 242
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 243
10.13140/RG.2.2.17761.79206). 244
#150thArticle 245
February 2023 246

DOI: 10.13140/RG.2.2.17761.79206 247
License: CC BY-NC-ND 4.0 248
Print length: 61 pages 249
Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs 250
Available at WordPress ResearchGate Scribd academia ZENODO_ORG Amazon googlebooks 251
GooglePlay Article #151 252

253
New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By SuperHyper- 254
Join As Hyper Separations On Super Sorts 255
256
258
260
262

Figure 1.1: Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of
SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.17761.79206).
2023, (doi: 10.13140/RG.2.2.17761.79206).

2023, (doi: 10.13140/RG.2.2.17761.79206).

Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 264
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 265
10.13140/RG.2.2.11050.90569). 266
#151st Article” 267
February 2023 268
DOI: 10.13140/RG.2.2.11050.90569 269

GooglePlay Some scientific studies and scientific researches about neutrosophic graphs, are 274
proposed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 275
and has more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and 276
published by Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, 277
Ohio 43212 United State. This research book covers different types of notions and settings in 278
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 279
280
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educa- 281
tional Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 282
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 283
284
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 285
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 286
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by 287

Figure 1.4: Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper-
Graph By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 288
33131 United States. This research book presents different types of notions SuperHyperResolving 289
and SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutro- 290
sophic SuperHyperGraph theory. This research book has scrutiny on the complement of the 291
intended set and the intended set, simultaneously. It’s smart to consider a set but acting on 292
its complement that what’s done in this research book which is popular in the terms of high 293
readers in Scribd. [Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL 294
KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. 295
ISBN: 978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 296



CHAPTER 2 297
BACKGROUND 298
There are some scientific researches covering the topic of this research. In what follows, there are 299
some discussion and literature reviews about them date back on January 22, 2023. 300
First article is titled “properties of SuperHyperGraph and neutrosophic SuperHyperGraph” in 301

Ref. [HG1] by Henry Garrett (2022). It’s first step toward the research on neutrosophic Super- 302
HyperGraphs. This research article is published on the journal “Neutrosophic Sets and Systems” 303
in issue 49 and the pages 531-561. In this research article, different types of notions like dom- 304
inating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) 305
neutrosophic path, zero forcing number, zero forcing neutrosophic- number, independent number, 306
independent neutrosophic-number, clique number, clique neutrosophic-number, matching number, 307

matching neutrosophic-number, girth, neutrosophic girth, 1-zero-forcing number, 1-zero- forcing 308
neutrosophic-number, failed 1-zero-forcing number, failed 1-zero-forcing neutrosophic-number, 309
global- offensive alliance, t-offensive alliance, t-defensive alliance, t-powerful alliance, and global- 310
powerful alliance are defined in SuperHyperGraph and neutrosophic SuperHyperGraph. Some 311
Classes of SuperHyperGraph and Neutrosophic SuperHyperGraph are cases of research. Some 312
results are applied in family of SuperHyperGraph and neutrosophic SuperHyperGraph. Thus this 313
research article has concentrated on the vast notions and introducing the majority of notions. 314
The seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 315
degree alongside chromatic numbers in the setting of some classes related to neutrosophic hy- 316
pergraphs” in Ref. [HG2] by Henry Garrett (2022). In this research article, a novel approach 317
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 318
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published in 319
prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science Research 320
(JCTCSR)” with abbreviation “J Curr Trends Comp Sci Res” in volume 1 and issue 1 with pages 321
06-14. The research article studies deeply with choosing neutrosophic hypergraphs instead of 322
neutrosophic SuperHyperGraph. It’s the breakthrough toward independent results based on 323
initial background. 324
The seminal paper and groundbreaking article is titled “Super Hyper Dominating and Super 325
Hyper Resolving on Neutrosophic Super Hyper Graphs and Their Directions in Game Theory and 326
Neutrosophic Super Hyper Classes” in Ref. [HG3] by Henry Garrett (2022). In this research art- 327
icle, a novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph 328
based on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of neutro- 329
sophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal 330
of Mathematical Techniques and Computational Mathematics(JMTCM)” with abbreviation “J 331
15
Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. The research article 332
studies deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. 333
It’s the breakthrough toward independent results based on initial background and fundamental 334
SuperHyperNumbers. 335
In some articles are titled “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 336
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. 337
[HG4] by Henry Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” 338
in Ref. [HG5] by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme 339
of Confrontation under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) 340
SuperHyperGraphs” in Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And 341
Effect Of Cancer Alongside The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHy- 342
perClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] 343
by Henry Garrett (2022), “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 344
Recognition On Neutrosophic SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), 345
“The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality 346
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside 347
Numbers In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and 348
Neutrosophic SuperHyperGraph” in Ref. [HG9] by Henry Garrett (2022), “Breaking the Con- 349
tinuity and Uniformity of Cancer In The Worst Case of Full Connections With Extreme Failed 350
SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic) SuperHyperGraphs” in 351
Ref. [HG10] by Henry Garrett (2022), “Neutrosophic Failed SuperHyperStable as the Survivors 352
on the Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic 353
SuperHyperGraphs” in Ref. [HG11] by Henry Garrett (2022), “Extremism of the Attacked 354
Body Under the Cancer’s Circumstances Where Cancer’s Recognition Titled (Neutrosophic) 355
SuperHyperGraphs” in Ref. [HG12] by Henry Garrett (2022), “(Neutrosophic) 1-Failed Super- 356
HyperForcing in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] 357
by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 358
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 359
[HG14] by Henry Garrett (2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHy- 360
perFunction To Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition 361
And Beyond” in Ref. [HG15] by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on 362
Cancer’s Recognition by Well- SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. 363
[HG16] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neut- 364
rosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” 365
in Ref. [HG12] by Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperFor- 366
cing And (Neutrosophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) 367

SuperHyperGraphs” in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style 368
SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic 369
Recognitions In Special ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) 370
SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive 371
SuperHyperAlliances” in Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHy- 372
perAlliances With SuperHyperDefensive and SuperHyperOffensive Type-SuperHyperSet On 373

(Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling of Cancer’s Re- 374
cognitions And Related (Neutrosophic) SuperHyperClasses” in Ref. [HG20] by Henry Garrett 375
(2022), “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Su- 376
perHyperModeling of Cancer’s Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some 377

SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and Super- 378

HyperGraphs Alongside Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett 379
(2022), “SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs 380
And Their Directions in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] 381
by Henry Garrett (2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 382
Cancer’s Recognition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett 383
(2023), “The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme 384
Recognition With Different Types of Extreme SuperHyperMatching Set and Polynomial on 385
(Neutrosophic) SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed 386
SuperHyperClique Decides the Failures on the Cancer’s Recognition in the Perfect Connections 387
of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. 388
[HG26] by Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In 389
Front of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s 390
Recognition called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), 391
“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutro- 392
sophic SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 393
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 394
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 395
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 396
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 397
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 398
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To Super- 399
HyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] 400

[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 403
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 404
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 405
Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 406
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 407
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 408
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 409
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 410
Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 411
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 412
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 413
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 414
[HG38] by Henry Garrett (2022), there are some endeavors to formalize the basic SuperHyper- 415
Notions about neutrosophic SuperHyperGraph and SuperHyperGraph. 416
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as book 417
in Ref. [HG39] by Henry Garrett (2022) which is indexed by Google Scholar and has more 418
than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by Ohio: 419
E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United 420
State. This research book covers different types of notions and settings in neutrosophic graph 421
theory and neutrosophic SuperHyperGraph theory. 422
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 423

as book in Ref. [HG40] by Henry Garrett (2022) which is indexed by Google Scholar and has 424
more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Florida: 425
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 426
United States. This research book presents different types of notions SuperHyperResolving and 427
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 428
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 429
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 430
that what’s done in this research book which is popular in the terms of high readers in Scribd. 431
See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on the 432
framework of Extreme Failed SuperHyperClique theory, Neutrosophic Failed SuperHyperClique 433
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; 434
HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; 435
HG33; HG34; HG35; HG36; HG37; HG38]. Two popular scientific research books in Scribd 437
in the terms of high readers, 2638 and 3363 respectively, on neutrosophic science is on [HG39; 438
HG40]. 439

Bibliography 440
[1] Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyper- 441
Graph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 10.5281/zen- 442
odo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf). (ht- 443
tps://digitalrepository.unm.edu/nss_journal/vol49/iss1/34). 444
[2] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 445
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 446
Trends Comp Sci Res 1(1) (2022) 06-14. 447
[3] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic 448
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper 449
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. 450
[4] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 451
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 452
CERN European Organization for Nuclear scientific research - Zenodo, Nov. 2022. CERN 453
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 454

https://oa.mg/work/10.5281/zenodo.6319942 455
[5] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN 456
European Organization for Nuclear scientific research - Zenodo, Feb. 2022. CERN 457
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 458

https://oa.mg/work/10.13140/rg.2.2.35241.26724 459
[6] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 460
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 461

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 462
[7] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 463
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic Supe- 464
rHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 10.20944/pre- 465
prints202301.0282.v1). 466
[8] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 467
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 468
10.20944/preprints202301.0267.v1). 469
19
[9] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 470
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 471
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 472
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 473
(doi: 10.20944/preprints202301.0265.v1). 474
[10] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 475
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 476
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 477
prints202301.0262.v1). 478
[11] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 479
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyper- 480
Graphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 481
[12] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where 482
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224, 483

(doi: 10.20944/preprints202301.0224.v1). 484
[13] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 485
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 486

prints202301.0105.v1). 487
[14] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 488

SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 489
[15] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 491

Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 492
Preprints 2023, 2023010044 493
[16] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 494

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 495
10.20944/preprints202301.0043.v1). 496
[17] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 497
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 498

[19] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 503

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 504
(doi: 10.20944/preprints202212.0549.v1). 505
[20] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 506

SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 507
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 508
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 509

[21] Henry Garrett, “SuperHyperCycle on SuperHyperGraph and Neutrosophic SuperHyperGraph 510

With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 (doi: 511
10.20944/preprints202212.0500.v1). 512
[22] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 513

SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 514
[23] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 516

HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 517
[24] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 519

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 520
10.13140/RG.2.2.35061.65767). 521
[25] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 522
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 523
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 524
10.13140/RG.2.2.18494.15680). 525
[26] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 526
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 527
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 528

10.13140/RG.2.2.32530.73922). 529
[27] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 530
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 531

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 532
10.13140/RG.2.2.15897.70243). 533
[28] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 534
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 535
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004). 536
[29] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 537

and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 538
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 539
10.13140/RG.2.2.23172.19849). 540
[30] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic 541
Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of 542
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968). 543
[31] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyper- 544
Model Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, 545
(doi: 10.13140/RG.2.2.28945.92007). 546



SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 551
10.13140/RG.2.2.35774.77123). 552

[35] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 556

cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 557
10.13140/RG.2.2.29430.88642). 558
[37] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 562
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 563
10.13140/RG.2.2.29173.86244). 564
[38] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 565
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph 566

(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 567
[39] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 568
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 979-1- 569
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 570
[40] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - 571
Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 572
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 573

– 574
575
#Latest_Updates 576
577
#The_Links 578
579
| Book #103 580

581
|Title: SuperHyperJoin 582
583
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG 584
Twitter LinkedIn Amazon googlebooks GooglePlay 585
586
– 587
588
| Publisher | – 589
590
| ISBN | – 591
592
| Print length | – 593
594
#Latest_Updates 595
596
#The_Links 597
598
| ResearchGate: - 599
600
| WordPress: - 601
602
@Scribd: - 603
604
| academia: - 605
606
| ZENODO_ORG: - 607
608
| googlebooks: - 609
610
| GooglePlay: - 611
612
613

Figure 2.1: “#103rd Book” || SuperHyperJoin February 2023 License: CC BY-NC-ND 4.0 Print
length: 254 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs
SuperHyperJoin (Published Version) 614
615
The Link: 616
617
- 618
619
– 620
621
Posted by Dr. Henry Garrett 622
623
February -, 2023 624
625
Posted in 0103 | SuperHyperJoin 626
627
Tags: 628
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 629
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 630
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 631
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 632
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperJoin, Open Problems, Open Ques- 633

tions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 634
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 635
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 636
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 637
SuperHyperJoin, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 638
Vertices. 639


CHAPTER 3 640
Acknowledgements 641
The author is going to express his gratitude and his appreciation about the brains and their 642
hands which are showing the importance of words in the framework of every wisdom, knowledge, 643
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches 644
to have the material and the contents which are only the way to flourish the minds, to grow the 645
notions, to advance the ways and to make the stable ways to be amid events and storms of minds 646
for surviving from them and making the outstanding experiences about the tools and the ideas 647
to be on the star lines of words and shining like stars, forever. 648
27
CHAPTER 4 649
Extreme SuperHyperJoin 650
The following sections are cited as follows, which is my 150th manuscript and I use prefix 150 as 651
number before any labelling for items. 652
653
2023, (doi: 10.13140/RG.2.2.17761.79206). 656
657
659
662
664

666
668

10.13140/RG.2.2.17761.79206). 672
#150thArticle 673
February 2023 674
DOI: 10.13140/RG.2.2.17761.79206 675

GooglePlay 680
29
2023, (doi: 10.13140/RG.2.2.17761.79206).
2023, (doi: 10.13140/RG.2.2.17761.79206).

2023, (doi: 10.13140/RG.2.2.17761.79206).

CHAPTER 5 681
New Ideas On Super connections By 682
Hyper disconnections Of SuperHyperJoin 683
In Cancer’s Recognition with 684
(Neutrosophic) SuperHyperGraph 685
33
CHAPTER 6 686
ABSTRACT 687
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 688

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider 689
a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then 690

either V 0 or E 0 is called Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 691
E 0 , such that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; Neutrosophic re- 692
SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , 693
such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; 694
Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ 695
Ea ; and ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ 696

EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 697
|Vi |NEUTROSOPIC CARDINALITY = |Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic SuperHyperJoin 698
if it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 699
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin. ((Neutrosophic) SuperHyperJoin). 700
a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme 702

SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, 703
Neutrosophic v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 704
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 705
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive 706
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 707
form the Extreme SuperHyperJoin; a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic 708
e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and 709
Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 710
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 711
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 712
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 713
SuperHyperJoin; an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 714

Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : 716
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 717
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an 718
Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges 719
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; and the 720
35
Extreme power is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperJoin 721

SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic re- 722
SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and 723
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 724
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 725
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 726
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 727

and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; 728
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; an Extreme R- 729
SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, 730
Neutrosophic v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an 731
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 732
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 733

consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices 734
such that they form the Extreme SuperHyperJoin; a Neutrosophic R-SuperHyperJoin if it’s 735
either of Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 736
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 737
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 738
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 739

consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 740
form the Neutrosophic SuperHyperJoin; an Extreme R-SuperHyperJoin SuperHyperPolynomial 741
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 743
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 744
coefficients defined as the Extreme number of the maximum Extreme cardinality of the 745
Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 746
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 747
form the Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 748
coefficient; a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 749
Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 751
(V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coefficients defined 752
as the Neutrosophic number of the maximum Neutrosophic cardinality of the Neutrosophic 753
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 754
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that 755
they form the Neutrosophic SuperHyperJoin; and the Neutrosophic power is corresponded 756
to its Neutrosophic coefficient. In this scientific research, new setting is introduced for new 757
SuperHyperNotions, namely, a SuperHyperJoin and Extreme SuperHyperJoin. Two different 758
types of SuperHyperDefinitions are debut for them but the research goes further and the 759
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and 760
well-reviewed. The literature review is implemented in the whole of this research. For shining the 761
elegancy and the significancy of this research, the comparison between this SuperHyperNotion with 762
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 763
followed by the examples and the instances thus the clarifications are driven with different tools. 764
The applications are figured out to make sense about the theoretical aspect of this ongoing research. 765
The “Cancer’s Recognition” are the under research to figure out the challenges make sense about 766

ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. 767
There are different types of them. Some of them are individuals and some of them are well-modeled 768
by the group of cells. These types are all officially called “SuperHyperVertex” but the relations 769
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 770
“Extreme SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. 771
Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical 772
segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s also 773
officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. 774
Assume a SuperHyperGraph. Then δ−SuperHyperJoin is a maximal of SuperHyperVertices 775
with a maximum cardinality such that either of the following expressions hold for the (Extreme) 776
cardinalities of SuperHyperNeighbors of s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and 777
|S∩N (s)| < |S∩(V \N (s))|+δ. The first Expression, holds if S is an δ−SuperHyperOffensive. And 778
the second Expression, holds if S is an δ−SuperHyperDefensive; an Extreme δ−SuperHyperJoin 779

is a maximal Extreme of SuperHyperVertices with maximum Extreme cardinality such that 780
either of the following expressions hold for the Extreme cardinalities of SuperHyperNeighbors 781
of s ∈ S there are: |S ∩ N (s)|Extreme > |S ∩ (V \ N (s))|Extreme + δ; and |S ∩ N (s)|Extreme < 782
|S ∩(V \N (s))|Extreme +δ. The first Expression, holds if S is an Extreme δ−SuperHyperOffensive. 783
And the second Expression, holds if S is an Extreme δ−SuperHyperDefensive It’s useful to 784
define a “Extreme” version of a SuperHyperJoin . Since there’s more ways to get type-results to 785
make a SuperHyperJoin more understandable. For the sake of having Extreme SuperHyperJoin, 786
there’s a need to “redefine” the notion of a “SuperHyperJoin ”. The SuperHyperVertices 787
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In 788
this procedure, there’s the usage of the position of labels to assign to the values. Assume a 789
SuperHyperJoin . It’s redefined an Extreme SuperHyperJoin if the mentioned Table holds, 790
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 791
Belong to The Extreme SuperHyperGraph” with the key points, “The Values of The Vertices 792
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 793
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 794
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 795
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 796
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 797
a SuperHyperJoin . It’s the main. It’ll be disciplinary to have the foundation of previous 798
definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperJoin until 799
the SuperHyperJoin, then it’s officially called a “SuperHyperJoin” but otherwise, it isn’t a 800
SuperHyperJoin . There are some instances about the clarifications for the main definition 801
titled a “SuperHyperJoin ”. These two examples get more scrutiny and discernment since there 802
are characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperJoin 803
. For the sake of having an Extreme SuperHyperJoin, there’s a need to “redefine” the notion 804
of a “Extreme SuperHyperJoin” and a “Extreme SuperHyperJoin ”. The SuperHyperVertices 805
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 806
procedure, there’s the usage of the position of labels to assign to the values. Assume an Extreme 807
SuperHyperGraph. It’s redefined “Extreme SuperHyperGraph” if the intended Table holds. 808
And a SuperHyperJoin are redefined to a “Extreme SuperHyperJoin” if the intended Table 809
holds. It’s useful to define “Extreme” version of SuperHyperClasses. Since there’s more ways to 810
get Extreme type-results to make an Extreme SuperHyperJoin more understandable. Assume 811
an Extreme SuperHyperGraph. There are some Extreme SuperHyperClasses if the intended 812

Table holds. Thus SuperHyperPath, SuperHyperJoin, SuperHyperStar, SuperHyperBipartite, 813

SuperHyperMultiPartite, and SuperHyperWheel, are “Extreme SuperHyperPath”, “Extreme 814
SuperHyperJoin”, “Extreme SuperHyperStar”, “Extreme SuperHyperBipartite”, “Extreme 815
SuperHyperMultiPartite”, and “Extreme SuperHyperWheel” if the intended Table holds. A 816
SuperHyperGraph has a “Extreme SuperHyperJoin” where it’s the strongest [the maximum 817
Extreme value from all the SuperHyperJoin amid the maximum value amid all SuperHyperVertices 818
from a SuperHyperJoin .] SuperHyperJoin . A graph is a SuperHyperUniform if it’s a 819

SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume an 820
Extreme SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath 821
if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two 822
exceptions; it’s SuperHyperJoin if it’s only one SuperVertex as intersection amid two given 823
SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all 824
SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid 825
two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no 826
SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 827
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 828
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex as 829
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 830
with any common SuperVertex. The SuperHyperModel proposes the specific designs and the 831
specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Extreme 832
SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are 833
SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between 834
“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. 835
Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have 836
more precise SuperHyperModel which in this case the SuperHyperModel is called “Extreme”. In 837
the future research, the foundation will be based on the “Cancer’s Recognition” and the results 838
and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long- 839
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 840
and the long cycle of the move from the cancer is identified by this research. Sometimes the 841
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 842
and neutrality about the moves and the effects of the cancer on that region; this event leads 843
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 844
perception on what’s happened and what’s done. There are some specific models, which are 845
well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The 846
moves and the traces of the cancer on the complex tracks and between complicated groups of 847
cells could be fantasized by an Extreme SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, 848

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 849
longest SuperHyperJoin or the strongest SuperHyperJoin in those Extreme SuperHyperModels. 850
For the longest SuperHyperJoin, called SuperHyperJoin, and the strongest SuperHyperJoin, called 851
Extreme SuperHyperJoin, some general results are introduced. Beyond that in SuperHyperStar, all 852
possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential 853
to have at least three SuperHyperEdges to form any style of a SuperHyperJoin. There isn’t any 854
literarily, deforms and it doesn’t form. A basic familiarity with Extreme SuperHyperJoin theory, 856
SuperHyperGraphs, and Extreme SuperHyperGraphs theory are proposed. 857
Keywords: Extreme SuperHyperGraph, SuperHyperJoin, Cancer’s Extreme Recognition 858


CHAPTER 7 860
Background 861


41






See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 995
the framework of Extreme SuperHyperJoin theory, Neutrosophic SuperHyperJoin theory, and 996
(Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 997
HG35; HG36; HG37; HG38]. Two popular scientific research books in Scribd in the terms of 1000
high readers, 3230 and 4117 respectively, on neutrosophic science is on [HG39; HG40]. 1001

CHAPTER 8 1002
Applied Notions Under The Scrutiny Of 1003
The Motivation Of This Scientific Research 1004
In this scientific research, there are some ideas in the featured frameworks of motivations. I try to 1005
bring the motivations in the narrative ways. Some cells have been faced with some attacks from the 1006
situation which is caused by the cancer’s attacks. In this case, there are some embedded analysis 1007
on the ongoing situations which in that, the cells could be labelled as some groups and some groups 1008
or individuals have excessive labels which all are raised from the behaviors to overcome the cancer’s 1009
attacks. In the embedded situations, the individuals of cells and the groups of cells could be 1010
considered as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 1011
more proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1012
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1013
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1014
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1015
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1016
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1017
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 1018
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 1019
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 1020
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 1021
called “Extreme SuperHyperGraphs”. The cancer is the disease but the model is going to figure 1022
out what’s going on this phenomenon. The special case of this disease is considered and as the 1023
consequences of the model, some parameters are used. The cells are under attack of this disease 1024
but the moves of the cancer in the special region are the matter of mind. The recognition of the 1025
cancer could help to find some treatments for this disease. The SuperHyperGraph and Extreme 1026
SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and both bases are 1027
the background of this research. Sometimes the cancer has been happened on the region, full 1028
of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 1029
some SuperHyperNotions based on the connectivities of the moves of the cancer in the forms 1030
of alliances’ styles with the formation of the design and the architecture are formally called 1031
“ SuperHyperJoin” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers 1032
to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 1033
The recognition of the cancer in the long-term function. The specific region has been assigned 1034
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1035
45
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1036
there are some determinacy, indeterminacy and neutrality about the moves and the effects of 1037
the cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1038
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are 1039
some specific models, which are well-known and they’ve got the names, and some general models. 1040
The moves and the traces of the cancer on the complex tracks and between complicated groups 1041
of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperJoin, SuperHyperStar, 1042

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1043
optimal SuperHyperJoin or the Extreme SuperHyperJoin in those Extreme SuperHyperModels. 1044
Some general results are introduced. Beyond that in SuperHyperStar, all possible Extreme 1045
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 1046
have at least three SuperHyperEdges to form any style of a SuperHyperJoin. There isn’t any 1047
literarily, deforms and it doesn’t form. 1049
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1050
amount of SuperHyperJoin” of either individual of cells or the groups of cells based on the fixed 1051
cell or the fixed group of cells, extensively, the “amount of SuperHyperJoin” based on the fixed 1052
groups of cells or the fixed groups of group of cells? 1053
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1054
messy and dense SuperHyperModels where embedded notions are illustrated? 1055
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1056
it motivates us to define different types of “ SuperHyperJoin” and “Extreme SuperHyperJoin” 1057
on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the research has taken 1058
more motivations to define SuperHyperClasses and to find some connections amid this 1059
SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances and 1060
examples to make clarifications about the framework of this research. The general results and 1061
some results about some connections are some avenues to make key point of this research, 1062
“Cancer’s Recognition”, more understandable and more clear. 1063
The framework of this research is as follows. In the beginning, I introduce basic definitions 1064
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1065
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth-discussed. 1066
The elementary concepts are clarified and illustrated completely and sometimes review literature 1067
are applied to make sense about what’s going to figure out about the upcoming sections. The main 1068
definitions and their clarifications alongside some results about new notions, SuperHyperJoin 1069
and Extreme SuperHyperJoin, are figured out in sections “ SuperHyperJoin” and “Extreme 1070
SuperHyperJoin”. In the sense of tackling on getting results and in order to make sense about 1071
continuing the research, the ideas of SuperHyperUniform and Extreme SuperHyperUniform are 1072
introduced and as their consequences, corresponded SuperHyperClasses are figured out to debut 1073
what’s done in this section, titled “Results on SuperHyperClasses” and “Results on Extreme 1074
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 1075
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 1076
Extreme SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 1077
Extreme SuperHyperClasses”. The starter research about the general SuperHyperRelations and 1078
as concluding and closing section of theoretical research are contained in the section “General 1079
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1080

fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1081
SuperHyperJoin”, “Extreme SuperHyperJoin”, “Results on SuperHyperClasses” and “Results 1082
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1083
SuperHyperNotions to make sense about excellency of this research and going to figure out the word 1084
“best” as the description and adjective for this research as presented in section, “ SuperHyperJoin”. 1085
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 1086
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 1087
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 1088
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 1089
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 1090
to make sense to figure out this research in featured style. The advantages and the limitations of 1091
this research alongside about what’s done in this research to make sense and to get sense about 1092
what’s figured out are included in the section, “Conclusion and Closing Remarks”. 1093

CHAPTER 9 1094
Extreme Preliminaries Of This Scientific 1095
Research On the Redeemed Ways 1096
In this section, the basic material in this scientific research, is referred to [Single Valued 1097
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 1098
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 1099

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 1100
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 1101
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 1102
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 1103
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 1104
their clarifications are addressed to Ref.[HG38]. 1105

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

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

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

Let X be a space of points (objects) with generic elements in X denoted by x. A single valued
Neutrosophic set A (SVNS A) is characterized by truth-membership function TA (x), an
indeterminacy-membership function IA (x), and a falsity-membership function FA (x). For each
point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
49
Definition 9.0.3. The degree of truth-membership, indeterminacy-membership and

falsity-membership of the subset X ⊂ A of the single valued Neutrosophic set A = {<
x : TA (x), IA (x), FA (x) >, x ∈ X}:
TA (X) = min[TA (vi ), TA (vj )]vi ,vj ∈X ,
IA (X) = min[IA (vi ), IA (vj )]vi ,vj ∈X ,

and FA (X) = min[FA (vi ), FA (vj )]vi ,vj ∈X .
Definition 9.0.4. The support of X ⊂ A of the single valued Neutrosophic set A = {< x :
TA (x), IA (x), FA (x) >, x ∈ X}:
supp(X) = {x ∈ X : TA (x), IA (x), FA (x) > 0}.
Definition 9.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 1109
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1110

S = (V, E), where 1111
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1112
(ii) V = {(Vi , TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi )) : TV 0 (Vi ), IV 0 (Vi ), FV 0 (Vi ) ≥ 0}, (i = 1, 2, . . . , n); 1113
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1114
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1, 2, . . . , n0 ); 1115
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1116
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1117
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1118
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1119
0
(ix) and the following conditions hold:
TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,

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

falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1124
SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1125
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1126
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 1127
E. Thus, the ii0 th element of the incidence matrix of Neutrosophic SuperHyperGraph (NSHG) 1128
are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E are crisp sets. 1129

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

(Ref.[HG38],Definition 2.7,p.3). 1131
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). The 1132
Neutrosophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) 1133
Vi of Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up 1134
items. 1135
(i) If |Vi | = 1, then Vi is called vertex; 1136
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1137
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1138
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1139
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1140
SuperEdge; 1141
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1142
SuperHyperEdge. 1143
If we choose different types of binary operations, then we could get hugely diverse types of 1144
general forms of Neutrosophic SuperHyperGraph (NSHG). 1145
Definition 9.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 1146

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1147
x, y, z, w ∈ [0, 1]: 1148
(i) 1 ⊗ x = x; 1149
(ii) x ⊗ y = y ⊗ x; 1150
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1151
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1152

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 9.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 1153

S = (V, E), where 1155

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1160
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1161
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1162
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1163
0

items. 1178
SuperEdge; 1184
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 1187
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 1188
makes the patterns and regularities. 1189
Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1190
of elements of SuperHyperEdges are the same. 1191

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1192
makes to have SuperHyperUniform more understandable. 1193
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1194
as follows. 1195
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1196
two given SuperHyperEdges with two exceptions; 1197
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1198
SuperHyperEdges; 1199
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1200
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1201
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1202
in common; 1203
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1204
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1205
SuperHyperEdge in common; 1206
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1207
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1208
SuperVertex. 1209
Definition 9.0.14. Let an ordered pair S = (V, E) be a Neutrosophic SuperHyperGraph

(NSHG) S. Then a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic
SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 1210

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1211
(i) Vi , Vi+1 ∈ Ei0 ; 1212
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1213
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1214
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1215
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1216
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 1217
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 1218
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 1219
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

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

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

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 1245
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 1246
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 1247
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 1248

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 1250
or E 0 is called 1251
(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 1252

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

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 1255
|Ej |NEUTROSOPIC CARDINALITY ; 1256
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 1257

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 1260
|Vj |NEUTROSOPIC CARDINALITY ; 1261
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 1262

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv- 1263
SuperHyperJoin. 1264
Definition 9.0.19. ((Neutrosophic) SuperHyperJoin). 1265

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neut- 1268

rosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv- 1269
SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 1270
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme car- 1271
dinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 1272
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 1273
SuperHyperJoin; 1274
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 1275

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 1276
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 1277
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 1278
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 1279
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 1280
form the Neutrosophic SuperHyperJoin; 1281

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 1282

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 1283
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 1284
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 1285
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 1286
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1287
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 1288
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 1289
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 1290

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 1291
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the 1293
Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1294
cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 1295
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 1296

sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; and the 1297
Neutrosophic power is corresponded to its Neutrosophic coefficient; 1298
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 1299

SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 1301
maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 1302
of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 1303
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 1306

SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 1308
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 1309
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 1313

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 1318
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 1321


Table 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (23.0.23)
The Values of The Vertices The Number of Position in Alphabet

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 1326
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 1327
Neutrosophic power is corresponded to its Neutrosophic coefficient. 1329
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperJoin). 1330

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Then 1331
(i) an δ−SuperHyperJoin is a Neutrosophic kind of Neutrosophic SuperHyperJoin such 1332

that either of the following expressions hold for the Neutrosophic cardinalities of 1333
SuperHyperNeighbors of s ∈ S : 1334
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ;

|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ.
The Expression (23.1), holds if S is an δ−SuperHyperOffensive. And the Expression 1335

(23.1), holds if S is an δ−SuperHyperDefensive; 1336
(ii) a Neutrosophic δ−SuperHyperJoin is a Neutrosophic kind of Neutrosophic SuperHy- 1337
perJoin such that either of the following Neutrosophic expressions hold for the Neutrosophic 1338
cardinalities of SuperHyperNeighbors of s ∈ S : 1339
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ;

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ.
The Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 1340

the Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 1341
For the sake of having a Neutrosophic SuperHyperJoin, there’s a need to “redefine” the 1342
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 1343
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 1344
of the position of labels to assign to the values. 1345
Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 1346
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (23.1) holds. 1347
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1348
to get Neutrosophic type-results to make a Neutrosophic more understandable. 1349

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



S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (23.2) holds. 1351
Thus Neutrosophic SuperHyperPath , SuperHyperJoin, SuperHyperStar, SuperHyperBipart- 1352
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath , 1353
Neutrosophic SuperHyperJoin, Neutrosophic SuperHyperStar, Neutrosophic Supe- 1354

rHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Super- 1355
HyperWheel if the Table (23.2) holds. 1356
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperJoin. Since there’s 1357
more ways to get type-results to make a Neutrosophic SuperHyperJoin more Neutrosophicly 1358
understandable. 1359
Neutrosophic notion of “Neutrosophic SuperHyperJoin”. The SuperHyperVertices and the 1361
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 1362
there’s the usage of the position of labels to assign to the values. 1363
Definition 9.0.23. Assume a SuperHyperJoin. It’s redefined a Neutrosophic SuperHyperJoin 1364
if the Table (23.3) holds. 1365

CHAPTER 10 1366
Extreme SuperHyperJoin But As The 1367
Extensions Excerpt From Dense And 1368
Super Forms 1369
Example 10.0.1. Assume an Extreme SuperHyperGraph (NSHG) S is an ordered pair S = (V, E) 1370
in the mentioned Extreme Figures in every Extreme items. 1371
• On the Figure (24.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 1372
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 1373
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 1374
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 1375
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 1376
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 1377
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 1378
C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 3z.
1380
• On the Figure (24.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, is 1381
up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 1382
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 1383
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 1384
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 1385
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , 1386
59
Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperJoin in the Extreme Example (24.0.1)
is excluded in every given Extreme SuperHyperJoin. 1387

1388
is up. The Extreme Algorithm is Extremely straightforward. 1390

1391
C(N SHG)Extreme SuperHyperJoin = {E4 , E2 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 2z 2 .
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V4 }.


C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = 15z 2 .

1394

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.
1397
C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)Extreme R-SuperHyperJoin = {V3i+17i=0 }.
1400
C(N SHG)Extreme SuperHyperJoin = {E15 , E16 , E17 }.


C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 3 .

C(N SHG)Extreme R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .
1403

4 × 5 × 5z 3 .
1406
C(N SHG)Extreme SuperHyperJoin = {E3i+13i=0 , E23 }.


C(N SHG)Extreme R-SuperHyperJoin = {V3i+13i=0 , V15 }.

1409

4 × 5 × 5z 3 .
1412




3 × 3z 2 .
1415

C(N SHG)Extreme R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4

1418

3 × 3z 2 .

1421

1424

1427


(1 × 5 × 5) + (1 × 2 + 1)z 3 .
1430

C(N SHG)Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
1433


C(N SHG)Extreme R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
1436
C(N SHG)Extreme SuperHyperJoin = {E3i+1i=03 }.




C(N SHG)Extreme R-SuperHyperJoin = {V2i+1i=05 }.
1439

1442


1445

C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
1448



CHAPTER 11 1449
The Extreme Departures on The 1450
Theoretical Results Toward Theoretical 1451
Motivations 1452
The previous Extreme approach apply on the upcoming Extreme results on Extreme 1453
SuperHyperClasses. 1454
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 1455
C(N SHG)Extreme SuperHyperJoin =

|EESHG:(V,E) |Extreme Cardinality
= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperJoin
= {ViEXT ERN AL }i=1 3

.
Y |EESHG:(V,E) |Extreme Cardinality
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z 3 .
Proof. Let 1456
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Extreme Cardinality , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality .
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 1457
77
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperJoin

in the Example (25.0.2)
new way to redefine as 1458
ViEXT ERN AL ∼ VjEXT ERN AL ≡

∃!Ez ∈ EESHG:(V,E) , ViEXT ERN AL , VjEXT ERN AL ∈ Ez ≡
∃!Ez ∈ EESHG:(V,E) , {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez .
The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 1459
ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 1460
Example 11.0.2. In the Figure (25.1), the connected Extreme SuperHyperPath ESHP : (V, E), 1461
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 1462
(25.1), is the SuperHyperJoin. 1463
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 1464

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


.
Proof. Let 1465
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 1466

Example 11.0.4. In the Figure (25.2), the connected Extreme SuperHyperCycle N SHC : 1470
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 1471
SuperHyperModel (25.2), is the Extreme SuperHyperJoin. 1472
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 1473
C(N SHG)Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z.
C(N SHG)Extreme R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 1474
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 1475
way to redefine as 1476


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

Example 11.0.6. In the Figure (25.3), the connected Extreme SuperHyperStar ESHS : (V, E), 1479
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 1480
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 1481
ESHS : (V, E), in the Extreme SuperHyperModel (25.3), is the Extreme SuperHyperJoin. 1482
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 1483
C(N SHG)Extreme Quasi-SuperHyperJoin

= (PERFECT MATCHING).
{Ei ∈ EPi ESHG:(V,E) ,
∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) | = min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE).
{},
If ∃Pi ESHG:(V,E) , |Pi ESHG:(V,E) | =
6 min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |.
i
X
=( (min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |)choose|Pi ESHG:(V,E) |)
i
i=|P ESHG:(V,E) |

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

ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
where ∀Pi ESHG:(V,E) , |Pi ESHG:(V,E) |
= min |Pi ESHG:(V,E) ∈ P ESHG:(V,E) |}.
i
= (OTHERWISE)0.
= {ViEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
= =( (|Pi ESHG:(V,E) |choose 2) = z 2 .
EXT ERN AL |
|VESHG:(V,E) i=|P ESHG:(V,E) |
Extreme Cardinality
Proof. Let 1484
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 1485
a new way to redefine as 1486

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 1488
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 1489
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 1490
SuperHyperPart could have one SuperHyperVertex as the representative in the 1491
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 1492

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 1493
SuperHyperEdges are attained in any solution 1494
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
The latter is straightforward. 1495
Example 11.0.8. In the Extreme Figure (25.4), the connected Extreme SuperHyperBipartite 1496
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 1497
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 1498
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 1499
Extreme SuperHyperModel (25.4), is the Extreme SuperHyperJoin. 1500
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). Then 1501

i

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

Extreme SuperHyperJoin in the Example (25.0.8)
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Extreme Cardinality

Proof. Let 1502
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite ESHM : 1503
(V, E). There’s a new way to redefine as 1504

based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 1508
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). Thus 1510
only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart SuperHyperEdges 1511
are attained in any solution 1512
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). The 1513
latter is straightforward. 1514
Example 11.0.10. In the Figure (25.5), the connected Extreme SuperHyperMultipartite ESHM : 1515
(V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by the 1516
Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 1517
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (25.5), is 1518
the Extreme SuperHyperJoin. 1519

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

SuperHyperJoin in the Example (25.0.10)
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 1520

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

.
Proof. Let 1521
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperWheel ESHW : (V, E). 1522

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

Extreme SuperHyperJoin in the Extreme Example (25.0.12)
There’s a new way to redefine as 1523

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s at 1525
least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 1526
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 1527
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 1528
Example 11.0.12. In the Extreme Figure (25.6), the connected Extreme SuperHyperWheel 1529
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, by 1530
the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected Extreme 1531
SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (25.6), is the Extreme 1532

CHAPTER 12 1534
The Surveys of Mathematical Sets On The 1535
Results But As The Initial Motivation 1536
For the SuperHyperJoin, Extreme SuperHyperJoin, and the Extreme SuperHyperJoin, some 1537
general results are introduced. 1538
Remark 12.0.1. Let remind that the Extreme SuperHyperJoin is “redefined” on the positions of 1539
the alphabets. 1540
Corollary 12.0.2. Assume Extreme SuperHyperJoin. Then 1541
Extreme SuperHyperJoin =
{theSuperHyperJoinof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperJoin
|ExtremecardinalityamidthoseSuperHyperJoin. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 1542
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 1543
the neutrality, for i = 1, 2, 3, respectively. 1544
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 1545
alphabet. Then the notion of Extreme SuperHyperJoin and SuperHyperJoin coincide. 1546
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperJoin 1548
if and only if it’s a SuperHyperJoin. 1549
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperJoin 1551
if and only if it’s a longest SuperHyperJoin. 1552
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 1553
identical letter of the alphabet. Then its Extreme SuperHyperJoin is its SuperHyperJoin and 1554
reversely. 1555
87
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, 1556

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of 1557
the alphabet. Then its Extreme SuperHyperJoin is its SuperHyperJoin and reversely. 1558
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperJoin isn’t 1559
well-defined if and only if its SuperHyperJoin isn’t well-defined. 1560
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its Extreme 1561
SuperHyperJoin isn’t well-defined if and only if its SuperHyperJoin isn’t well-defined. 1562
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, Su- 1563

perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme SuperHyperJoin 1564
isn’t well-defined if and only if its SuperHyperJoin isn’t well-defined. 1565
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperJoin is 1566
well-defined if and only if its SuperHyperJoin is well-defined. 1567
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 1568

Extreme SuperHyperJoin is well-defined if and only if its SuperHyperJoin is well-defined. 1569
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, Su- 1570

perHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Extreme SuperHyperJoin 1571
is well-defined if and only if its SuperHyperJoin is well-defined. 1572
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 1573
(i) : the dual SuperHyperDefensive SuperHyperJoin; 1574
(ii) : the strong dual SuperHyperDefensive SuperHyperJoin; 1575
(iii) : the connected dual SuperHyperDefensive SuperHyperJoin; 1576
(iv) : the δ-dual SuperHyperDefensive SuperHyperJoin; 1577
(v) : the strong δ-dual SuperHyperDefensive SuperHyperJoin; 1578
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperJoin. 1579
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 1580
(i) : the SuperHyperDefensive SuperHyperJoin; 1581
(ii) : the strong SuperHyperDefensive SuperHyperJoin; 1582
(iii) : the connected defensive SuperHyperDefensive SuperHyperJoin; 1583
(iv) : the δ-SuperHyperDefensive SuperHyperJoin; 1584
(v) : the strong δ-SuperHyperDefensive SuperHyperJoin; 1585
(vi) : the connected δ-SuperHyperDefensive SuperHyperJoin. 1586
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an independent 1587
SuperHyperSet is 1588

(iii) : the connected SuperHyperDefensive SuperHyperJoin; 1591
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 1595

which is a SuperHyperJoin/SuperHyperPath. Then V is a maximal 1596
(i) : SuperHyperDefensive SuperHyperJoin; 1597
(ii) : strong SuperHyperDefensive SuperHyperJoin; 1598
(iii) : connected SuperHyperDefensive SuperHyperJoin; 1599
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperJoin; 1600
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperJoin; 1601
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperJoin; 1602
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1603
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 1604

SuperHyperUniform SuperHyperWheel. Then V is a maximal 1605
(i) : dual SuperHyperDefensive SuperHyperJoin; 1606
(ii) : strong dual SuperHyperDefensive SuperHyperJoin; 1607
(iii) : connected dual SuperHyperDefensive SuperHyperJoin; 1608
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 1609
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 1610
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 1611
which is a SuperHyperJoin/SuperHyperPath. Then the number of 1614
(i) : the SuperHyperJoin; 1615
(ii) : the SuperHyperJoin; 1616
(iii) : the connected SuperHyperJoin; 1617
(iv) : the O(ESHG)-SuperHyperJoin; 1618

(v) : the strong O(ESHG)-SuperHyperJoin; 1619
(vi) : the connected O(ESHG)-SuperHyperJoin. 1620
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 1621
coincide. 1622

which is a SuperHyperWheel. Then the number of 1624
(i) : the dual SuperHyperJoin; 1625
(ii) : the dual SuperHyperJoin; 1626
(iii) : the dual connected SuperHyperJoin; 1627
(iv) : the dual O(ESHG)-SuperHyperJoin; 1628
(v) : the strong dual O(ESHG)-SuperHyperJoin; 1629
(vi) : the connected dual O(ESHG)-SuperHyperJoin. 1630
coincide. 1632

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 1634
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 1635
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 1636
is a 1637
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperJoin; 1641
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperJoin; 1642
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperJoin. 1643

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 1646
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 1647
is a 1648

(iv) : δ-SuperHyperDefensive SuperHyperJoin; 1652
(v) : strong δ-SuperHyperDefensive SuperHyperJoin; 1653
(vi) : connected δ-SuperHyperDefensive SuperHyperJoin. 1654

SuperHyperMultipartite. Then Then the number of 1657
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 1664
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 1665
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 1666
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 1667
connected component is |V − S| if there’s a SuperHyperSet which is a dual 1668
(iv) : SuperHyperJoin; 1672
(v) : strong 1-SuperHyperDefensive SuperHyperJoin; 1673
(vi) : connected 1-SuperHyperDefensive SuperHyperJoin. 1674
Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number is 1675
at most O(ESHG) and the Extreme number is at most On (ESHG). 1676
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 1677
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 1678
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 1679
t>
2

(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperJoin; 1683
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperJoin. 1685
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 1686
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 1687
dual 1688
(iv) : 0-SuperHyperDefensive SuperHyperJoin; 1692
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHyper- 1695
Complete. Then there’s no independent SuperHyperSet. 1696
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHyper- 1697
Join/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and the Extreme 1698
number is On (ESHG : (V, E)), in the setting of a dual 1699
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin; 1703
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin; 1704
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin. 1705
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 1706
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 1707
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 1708
t>
2
setting of a dual 1709



Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 1716
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 1717
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of these 1718
specific SuperHyperClasses of the Extreme SuperHyperGraphs. 1719
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1720
SuperHyperDefensive SuperHyperJoin, then ∀v ∈ V \ S, ∃x ∈ S such that 1721
(i) v ∈ Ns (x); 1722
(ii) vx ∈ E. 1723
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 1724
SuperHyperDefensive SuperHyperJoin, then 1725
(i) S is SuperHyperDominating set; 1726
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 1727
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 1728
(i) Γ ≤ O; 1729
(ii) Γs ≤ On . 1730
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 1731
connected. Then 1732
(i) Γ ≤ O − 1; 1733
(ii) Γs ≤ On − Σ3i=1 σi (x). 1734
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 1735
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperJoin; 1736
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 1737
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 1738
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 1739
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 1741
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperJoin; 1742
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 1743

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1744
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 1745
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperJoin. Then 1747
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperJoin; 1748
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 1749
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 1750
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 1751
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperJoin. Then 1753
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 1756
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 1757
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 1759
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperJoin; 1760
(ii) Γ = 1; 1761
(iii) Γs = Σ3i=1 σi (c); 1762
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperJoin. 1763
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 1764
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 1765
SuperHyperDefensive SuperHyperJoin; 1766
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 1767
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 1768
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 1769
SuperHyperDefensive SuperHyperJoin. 1770
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 1771
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperJoin; 1772
(ii) Γ = b n2 c + 1; 1773

(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
; 1774
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperJoin. 1775
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 1776
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperJoin; 1777
(ii) Γ = b n2 c; 1778
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
; 1779
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHyper- 1780
Join. 1781
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyperStars 1782

with common Extreme SuperHyperVertex SuperHyperSet. Then 1783
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperJoin for 1784

N SHF; 1785
(ii) Γ = m for N SHF : (V, E); 1786
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 1787
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperJoin for 1788
N SHF : (V, E). 1789
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperComplete 1790

SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 1791
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHyperJoin 1792
for N SHF; 1793
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 1794

2
for N SHF : (V, E); 1795
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=1
2
are only a dual maximal SuperHyperJoin for N SHF : 1796
(V, E). 1797
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperComplete 1798
SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 1799
bnc
2
is a dual SuperHyperDefensive SuperHyperJoin for 1800
N SHF : (V, E); 1801
(ii) Γ = b n2 c for N SHF : (V, E); 1802

2
for N SHF : (V, E); 1803
S={vi }i=1

bnc
2
are only dual maximal SuperHyperJoin for N SHF : (V, E). 1804
Proposition 12.0.47. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then following 1805
statements hold; 1806
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 1807
SuperHyperJoin, then S is an s-SuperHyperDefensive SuperHyperJoin; 1808
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 1809
SuperHyperJoin, then S is a dual s-SuperHyperDefensive SuperHyperJoin. 1810
Proposition 12.0.48. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then following 1811
statements hold; 1812
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 1813
SuperHyperJoin, then S is an s-SuperHyperPowerful SuperHyperJoin; 1814
SuperHyperJoin, then S is a dual s-SuperHyperPowerful SuperHyperJoin. 1816
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [r-]SuperHyperUniform-strong-Extreme 1817

SuperHyperGraph. Then following statements hold; 1818
(i) if ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1, then ESHG : (V, E) is a dual 2-SuperHyperDefensive 1821
(iii) if ∀a ∈ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is an r-SuperHyperDefensive 1823

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual r-SuperHyperDefensive 1825
Proposition 12.0.50. Let ESHG : (V, E) is a[an] [r-]SuperHyperUniform-strong-Extreme 1827

(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1831

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an r-SuperHyperDefensive SuperHyperJoin; 1833
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual r-SuperHyperDefensive 1834

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 1837

(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1840
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 1842

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


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1

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

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

SuperHyperGraph which is SuperHyperJoin. Then following statements hold; 1857
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperJoin; 1858
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1859

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive SuperHyperJoin; 1861
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 1862


(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 1866

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

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


CHAPTER 13 1874
Extreme Applications in Cancer’s Extreme 1875
Recognition 1876
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1877
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1878
as the consequences of the model, some parameters are used. The cells are under attack of this 1879
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1880
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1881
In the following, some Extreme steps are Extreme devised on this disease. 1882
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1883
function. 1884
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s called 1885
Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer is 1886
identified by this research. Sometimes the move of the cancer hasn’t be easily identified 1887
since there are some determinacy, indeterminacy and neutrality about the moves and the 1888
effects of the cancer on that region; this event leads us to choose another model [it’s said 1889
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1890
what’s done. 1891
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1892
they’ve got the names, and some general Extreme models. The moves and the Extreme 1893
traces of the cancer on the complex tracks and between complicated groups of cells 1894
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, 1895
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1896
either the Extreme SuperHyperJoin or the Extreme SuperHyperJoin in those Extreme 1897
Extreme SuperHyperModels. 1898
99
CHAPTER 14 1899
Case 1: The Initial Extreme Steps 1900
Toward Extreme SuperHyperBipartite 1901
as Extreme SuperHyperModel 1902
Step 4. (Extreme Solution) In the Extreme Figure (28.1), the Extreme SuperHyperBipartite is 1903
Extreme highlighted and Extreme featured. 1904
By using the Extreme Figure (28.1) and the Table (28.1), the Extreme SuperHyperBipartite 1905
is obtained. 1906
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 1907
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perJoin
101
Belong to The Extreme SuperHyperBipartite

result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite 1908

ESHB : (V, E), in the Extreme SuperHyperModel (28.1), is the Extreme SuperHyperJoin. 1909
1910

CHAPTER 15 1911
Case 2: The Increasing Extreme Steps 1912
Toward Extreme 1913
SuperHyperMultipartite as Extreme 1914
SuperHyperModel 1915
Step 4. (Extreme Solution) In the Extreme Figure (29.1), the Extreme SuperHyperMultipartite 1916
is Extreme highlighted and Extreme featured. 1917
By using the Extreme Figure (29.1) and the Table (29.1), the Extreme SuperHyperMulti- 1918
partite is obtained. 1919
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 1920
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperJoin
103
Belong to The Extreme SuperHyperMultipartite

of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite 1921

ESHM : (V, E), in the Extreme SuperHyperModel (29.1), is the Extreme SuperHyperJoin. 1922
1923

CHAPTER 16 1924
Wondering Open Problems But As The 1925
Directions To Forming The Motivations 1926
In what follows, some “problems” and some “questions” are proposed. 1927
The SuperHyperJoin and the Extreme SuperHyperJoin are defined on a real-world application, 1928
titled “Cancer’s Recognitions”. 1929
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 1930
recognitions? 1931
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperJoin and the Extreme 1932
SuperHyperJoin? 1933
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 1934
them? 1935
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperJoin and 1936
the Extreme SuperHyperJoin? 1937
Problem 16.0.5. The SuperHyperJoin and the Extreme SuperHyperJoin do a SuperHyperModel 1938
for the Cancer’s recognitions and they’re based on SuperHyperJoin, are there else? 1939
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 1940
Numbers types-results? 1941
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning the 1942
multiple types of SuperHyperNotions? 1943
105
CHAPTER 17 1944
Conclusion and Closing Remarks 1945
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 1946
research are illustrated. Some benefits and some advantages of this research are highlighted. 1947
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 1948
In this endeavor, two SuperHyperNotions are defined on the SuperHyperJoin. For that sake in 1949
the second definition, the main definition of the Extreme SuperHyperGraph is redefined on the 1950
position of the alphabets. Based on the new definition for the Extreme SuperHyperGraph, the 1951
new SuperHyperNotion, Extreme SuperHyperJoin, finds the convenient background to implement 1952
some results based on that. Some SuperHyperClasses and some Extreme SuperHyperClasses 1953
are the cases of this research on the modeling of the regions where are under the attacks of 1954
the cancer to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To 1955
formalize the instances on the SuperHyperNotion, SuperHyperJoin, the new SuperHyperClasses 1956
and SuperHyperClasses, are introduced. Some general results are gathered in the section 1957
on the SuperHyperJoin and the Extreme SuperHyperJoin. The clarifications, instances and 1958
literature reviews have taken the whole way through. In this research, the literature reviews have 1959
fulfilled the lines containing the notions and the results. The SuperHyperGraph and Extreme 1960
SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and both bases are 1961
the background of this research. Sometimes the cancer has been happened on the region, full 1962
of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel proposes 1963
some SuperHyperNotions based on the connectivities of the moves of the cancer in the longest 1964
and strongest styles with the formation of the design and the architecture are formally called “ 1965
SuperHyperJoin” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 1966
theme of the embedded styles to figure out the background for the SuperHyperNotions. In the 1967
Table (31.1), benefits and avenues for this research are, figured out, pointed out and spoken out. 1968
107
Table 17.1: An Overlook On This Research And Beyond
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperJoin
3. Extreme SuperHyperJoin 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

Bibliography 1969
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 1982

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 1986
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 1987

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 1988

prints202301.0282.v1). 1995
10.20944/preprints202301.0267.v1). 1998
109
(doi: 10.20944/preprints202301.0265.v1). 2003
prints202301.0262.v1). 2007

(doi: 10.20944/preprints202301.0224.v1). 2013

prints202301.0105.v1). 2016


Preprints 2023, 2023010044 2022

10.20944/preprints202301.0043.v1). 2025


(doi: 10.20944/preprints202212.0549.v1). 2034


[21] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 2039

10.20944/preprints202212.0500.v1). 2041



10.13140/RG.2.2.35061.65767). 2050
10.13140/RG.2.2.18494.15680). 2054

10.13140/RG.2.2.32530.73922). 2058

10.13140/RG.2.2.15897.70243). 2062

10.13140/RG.2.2.23172.19849). 2069
(doi: 10.13140/RG.2.2.28945.92007). 2075



10.13140/RG.2.2.35774.77123). 2081


10.13140/RG.2.2.29430.88642). 2087
10.13140/RG.2.2.29173.86244). 2093


CHAPTER 18 2103
Neutrosophic SuperHyperJoin 2104
The following sections are cited as follows, which is my 151st manuscript and I use prefix 151 as 2105
number before any labelling for items. 2106
2107
10.13140/RG.2.2.11050.90569). 2110
2111
The links to the contributions of this research book are listed below. Article #151 2112
2113
2116
2118

2120
2122

10.13140/RG.2.2.11050.90569). 2126
February 2023 2128
DOI: 10.13140/RG.2.2.11050.90569 2129

GooglePlay 2134
113
Figure 18.1: Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy-
perGraph By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

CHAPTER 19 2135
New Ideas In Cancer’s Recognition And 2136
Neutrosophic SuperHyperGraph By 2137
SuperHyperJoin As Hyper Separations On 2138
Super Sorts 2139
117
CHAPTER 20 2140
ABSTRACT 2141
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 2142

a Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either 2144

V 0 or E 0 is called Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 2145
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; Neutrosophic re-SuperHyperJoin 2146
if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ 2147
Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = |Ej |NEUTROSOPIC CARDINALITY ; Neutrosophic v- 2148
SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and ∀Vi , Vj ∈ V 0 , 2149
such that Vi , Vj 6∈ Ea ; Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , 2150

such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 2151
|Vj |NEUTROSOPIC CARDINALITY ; Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e- 2152
SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neut- 2153
rosophic rv-SuperHyperJoin. ((Neutrosophic) SuperHyperJoin). Assume a Neutrosophic Su- 2154
perHyperGraph (NSHG) S is an ordered pair S = (V, E). Consider a Neutrosophic Super- 2155
HyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperJoin if 2156

it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic 2157
v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme Su- 2158
perHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme Super- 2159
HyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive 2160
Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 2161
they form the Extreme SuperHyperJoin; a Neutrosophic SuperHyperJoin if it’s either of Neut- 2162
rosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 2163
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph 2164
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 2165
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 2166
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2167
SuperHyperJoin; an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 2168

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neut- 2169
rosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 2170
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the Extreme 2171
number of the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme Su- 2172
perHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2173
SuperHyperVertices such that they form the Extreme SuperHyperJoin; and the Extreme power is 2174
119
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperJoin SuperHyperPolynomial 2175

v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 2177
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neut- 2178
rosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality 2179
of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 2180
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 2181

such that they form the Neutrosophic SuperHyperJoin; and the Neutrosophic power is correspon- 2182
ded to its Neutrosophic coefficient; an Extreme R-SuperHyperJoin if it’s either of Neutrosophic 2183
e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neut- 2184
rosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2185
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2186
of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHy- 2187
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; a 2188
Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neutrosophic 2189
re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and 2190
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutro- 2191
sophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet 2192
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2193

sophic SuperHyperVertices such that they form the Neutrosophic SuperHyperJoin; an Extreme 2194
R-SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperJoin, Neutro- 2195
sophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin 2196
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyper- 2197
Polynomial contains the Extreme coefficients defined as the Extreme number of the maximum 2198
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 2199

Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 2200
such that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to its 2201
Extreme coefficient; a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of Neut- 2202
rosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 2203
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph 2204
N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic coeffi- 2205
cients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of the 2206
Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 2207
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 2208
such that they form the Neutrosophic SuperHyperJoin; and the Neutrosophic power is corres- 2209
ponded to its Neutrosophic coefficient. In this scientific research, new setting is introduced for 2210
new SuperHyperNotions, namely, a SuperHyperJoin and Neutrosophic SuperHyperJoin. Two 2211
different types of SuperHyperDefinitions are debut for them but the research goes further and the 2212
SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined 2213
and well-reviewed. The literature review is implemented in the whole of this research. For shining 2214
the elegancy and the significancy of this research, the comparison between this SuperHyperNo- 2215
tion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The 2216
definitions are followed by the examples and the instances thus the clarifications are driven with 2217
different tools. The applications are figured out to make sense about the theoretical aspect of this 2218
ongoing research. The “Cancer’s Recognition” are the under research to figure out the challenges 2219
make sense about ongoing and upcoming research. The special case is up. The cells are viewed 2220

in the deemed ways. There are different types of them. Some of them are individuals and some 2221
of them are well-modeled by the group of cells. These types are all officially called “SuperHy- 2222
perVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks 2223
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research 2224
about “Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some 2225
avenues to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed 2226
to pursue this research. It’s also officially collected in the form of some questions and some 2227
problems. Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperJoin 2228
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 2229
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 2230
there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 2231
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, 2232
holds if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperJoin is a maximal 2233

Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality such that 2234
either of the following expressions hold for the Neutrosophic cardinalities of SuperHyper- 2235
Neighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 2236
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 2237
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 2238
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Su- 2239

perHyperJoin . Since there’s more ways to get type-results to make a SuperHyperJoin more 2240
understandable. For the sake of having Neutrosophic SuperHyperJoin, there’s a need to “redefine” 2241
the notion of a “SuperHyperJoin ”. The SuperHyperVertices and the SuperHyperEdges are 2242
assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 2243
position of labels to assign to the values. Assume a SuperHyperJoin . It’s redefined a Neutrosophic 2244
To get structural examples and instances, I’m going to introduce the next SuperHyperClass of 2251
SuperHyperGraph based on a SuperHyperJoin . It’s the main. It’ll be disciplinary to have the 2252
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 2253
SuperHyperJoin until the SuperHyperJoin, then it’s officially called a “SuperHyperJoin” but 2254
otherwise, it isn’t a SuperHyperJoin . There are some instances about the clarifications for 2255
the main definition titled a “SuperHyperJoin ”. These two examples get more scrutiny and 2256
on a SuperHyperJoin . For the sake of having a Neutrosophic SuperHyperJoin, there’s a need to 2258
“redefine” the notion of a “Neutrosophic SuperHyperJoin” and a “Neutrosophic SuperHyperJoin 2259
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 2260
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 2261
values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyper- 2262

Graph” if the intended Table holds. And a SuperHyperJoin are redefined to a “Neutrosophic 2263
SuperHyperJoin” if the intended Table holds. It’s useful to define “Neutrosophic” version of 2264
SuperHyperClasses. Since there’s more ways to get Neutrosophic type-results to make a Neutro- 2265
sophic SuperHyperJoin more understandable. Assume a Neutrosophic SuperHyperGraph. There 2266

are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 2267
SuperHyperJoin, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHy- 2268
perWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperJoin”, “Neutrosophic 2269
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, 2270
and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has a 2271
“Neutrosophic SuperHyperJoin” where it’s the strongest [the maximum Neutrosophic value from 2272
all the SuperHyperJoin amid the maximum value amid all SuperHyperVertices from a SuperHy- 2273
perJoin .] SuperHyperJoin . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the 2274
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. 2275
There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex 2276
as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperJoin if it’s 2277
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 2283
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 2293
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 2294
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 2295
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 2297
and the effects of the cancer on that region; this event leads us to choose another model [it’s 2298
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 2299
and what’s done. There are some specific models, which are well-known and they’ve got the 2300
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 2301
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 2302
Neutrosophic SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, SuperHyperBipartite, Super- 2303
HyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperJoin 2304
or the strongest SuperHyperJoin in those Neutrosophic SuperHyperModels. For the longest 2305
SuperHyperJoin, called SuperHyperJoin, and the strongest SuperHyperJoin, called Neutrosophic 2306
SuperHyperJoin, some general results are introduced. Beyond that in SuperHyperStar, all possible 2307
SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to 2308
have at least three SuperHyperEdges to form any style of a SuperHyperJoin. There isn’t any 2309
literarily, deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperJoin 2311
theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are proposed. 2312

Keywords: Neutrosophic SuperHyperGraph, SuperHyperJoin, Cancer’s Neutrosophic Recogni- 2313
tion 2314

CHAPTER 21 2316
Background 2317


125






See the seminal scientific researches [HG1; HG2; HG3]. The formalization of the notions on 2451
the framework of Extreme SuperHyperJoin theory, Neutrosophic SuperHyperJoin theory, and 2452
(Neutrosophic) SuperHyperGraphs theory at [HG4; HG5; HG6; HG7; HG8; HG9; HG10; 2453
HG35; HG36; HG37; HG38]. Two popular scientific research books in Scribd in the terms of 2456
high readers, 3230 and 4117 respectively, on neutrosophic science is on [HG39; HG40]. 2457

CHAPTER 22 2458
Applied Notions Under The Scrutiny Of 2459
The Motivation Of This Scientific Research 2460
In this scientific research, there are some ideas in the featured frameworks of motivations. I try to 2461
bring the motivations in the narrative ways. Some cells have been faced with some attacks from the 2462
situation which is caused by the cancer’s attacks. In this case, there are some embedded analysis 2463
on the ongoing situations which in that, the cells could be labelled as some groups and some groups 2464
or individuals have excessive labels which all are raised from the behaviors to overcome the cancer’s 2465
attacks. In the embedded situations, the individuals of cells and the groups of cells could be 2466
considered as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting 2467
more proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 2468
called “SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, 2469
the cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 2470
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 2471
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 2472
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 2473
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the degrees 2474
of determinacy, indeterminacy and neutrality, for any object based on vague forms, namely, 2475
incomplete data, imprecise data, and uncertain analysis. The latter model could be considered on 2476
the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially 2477
called “Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to 2478
figure out what’s going on this phenomenon. The special case of this disease is considered and 2479
as the consequences of the model, some parameters are used. The cells are under attack of this 2480
disease but the moves of the cancer in the special region are the matter of mind. The recognition 2481
of the cancer could help to find some treatments for this disease. The SuperHyperGraph and 2482
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 2483
both bases are the background of this research. Sometimes the cancer has been happened on the 2484
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 2485
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 2486
forms of alliances’ styles with the formation of the design and the architecture are formally called 2487
“ SuperHyperJoin” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers 2488
to the theme of the embedded styles to figure out the background for the SuperHyperNotions. 2489
The recognition of the cancer in the long-term function. The specific region has been assigned 2490
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 2491
129
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 2492
there are some determinacy, indeterminacy and neutrality about the moves and the effects of the 2493
cancer on that region; this event leads us to choose another model [it’s said to be Neutrosophic 2494
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 2495
are some specific models, which are well-known and they’ve got the names, and some general 2496
models. The moves and the traces of the cancer on the complex tracks and between complicated 2497
groups of cells could be fantasized by a Neutrosophic SuperHyperPath (-/SuperHyperJoin, 2498

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 2499
aim is to find either the optimal SuperHyperJoin or the Neutrosophic SuperHyperJoin in 2500
those Neutrosophic SuperHyperModels. Some general results are introduced. Beyond that in 2501
SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two SuperHyperEdges 2502
but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 2503
of a SuperHyperJoin. There isn’t any formation of any SuperHyperJoin but literarily, it’s the 2504
deformation of any SuperHyperJoin. It, literarily, deforms and it doesn’t form. 2505
Question 22.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 2506
amount of SuperHyperJoin” of either individual of cells or the groups of cells based on the fixed 2507
cell or the fixed group of cells, extensively, the “amount of SuperHyperJoin” based on the fixed 2508
groups of cells or the fixed groups of group of cells? 2509
Question 22.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 2510
messy and dense SuperHyperModels where embedded notions are illustrated? 2511
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 2512
Thus it motivates us to define different types of “ SuperHyperJoin” and “Neutrosophic 2513
SuperHyperJoin” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. Then the 2514
research has taken more motivations to define SuperHyperClasses and to find some connections 2515
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some instances 2516
and examples to make clarifications about the framework of this research. The general results 2517
and some results about some connections are some avenues to make key point of this research, 2518
“Cancer’s Recognition”, more understandable and more clear. 2519
The framework of this research is as follows. In the beginning, I introduce basic definitions 2520
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 2521
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 2522
discussed. The elementary concepts are clarified and illustrated completely and sometimes 2523
review literature are applied to make sense about what’s going to figure out about the upcoming 2524
sections. The main definitions and their clarifications alongside some results about new notions, 2525
SuperHyperJoin and Neutrosophic SuperHyperJoin, are figured out in sections “ SuperHyperJoin” 2526
and “Neutrosophic SuperHyperJoin”. In the sense of tackling on getting results and in order to 2527
make sense about continuing the research, the ideas of SuperHyperUniform and Neutrosophic 2528
SuperHyperUniform are introduced and as their consequences, corresponded SuperHyperClasses 2529
are figured out to debut what’s done in this section, titled “Results on SuperHyperClasses” 2530
and “Results on Neutrosophic SuperHyperClasses”. As going back to origin of the notions, 2531
there are some smart steps toward the common notions to extend the new notions in new 2532
frameworks, SuperHyperGraph and Neutrosophic SuperHyperGraph, in the sections “Results on 2533
SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. The starter research 2534
about the general SuperHyperRelations and as concluding and closing section of theoretical 2535
research are contained in the section “General Results”. Some general SuperHyperRelations 2536

are fundamental and they are well-known as fundamental SuperHyperNotions as elicited and 2537
discussed in the sections, “General Results”, “ SuperHyperJoin”, “Neutrosophic SuperHyperJoin”, 2538
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There are 2539
curious questions about what’s done about the SuperHyperNotions to make sense about excellency 2540
of this research and going to figure out the word “best” as the description and adjective for this 2541
research as presented in section, “ SuperHyperJoin”. The keyword of this research debut in the 2542
section “Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The 2543
Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing 2544
Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, 2545
there are some scrutiny and discernment on what’s done and what’s happened in this research in 2546
the terms of “questions” and “problems” to make sense to figure out this research in featured 2547
style. The advantages and the limitations of this research alongside about what’s done in this 2548
research to make sense and to get sense about what’s figured out are included in the section, 2549
“Conclusion and Closing Remarks”. 2550

CHAPTER 23 2551
Neutrosophic Preliminaries Of This 2552
Scientific Research On the Redeemed 2553
Ways 2554
In this section, the basic material in this scientific research, is referred to [Single Valued 2555
Neutrosophic Set](Ref.[HG38],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG38],Definition 2556

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.5,p.2), [Charac- 2557
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [t- 2558
norm](Ref.[HG38], Definition 2.7, p.3), and [Characterization of the Neutrosophic SuperHyper- 2559
Graph (NSHG)](Ref.[HG38],Definition 2.7,p.3), [Neutrosophic Strength of the Neutrosophic 2560
SuperHyperPaths] (Ref.[HG38],Definition 5.3,p.7), and [Different Neutrosophic Types of Neut- 2561
rosophic SuperHyperEdges (NSHE)] (Ref.[HG38],Definition 5.4,p.7). Also, the new ideas and 2562
their clarifications are addressed to Ref.[HG38]. 2563
In this subsection, the basic material which is used in this scientific research, is presented. Also, 2564
the new ideas and their clarifications are elicited. 2565
Definition 23.0.1 (Neutrosophic Set). (Ref.[HG38],Definition 2.1,p.1).

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

Let X be a space of points (objects) with generic elements in X denoted by x. A single valued
Neutrosophic set A (SVNS A) is characterized by truth-membership function TA (x), an
indeterminacy-membership function IA (x), and a falsity-membership function FA (x). For each
point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
133

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 23.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG38],Definition 2.5,p.2). 2567

S = (V, E), where 2569
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2574
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2575
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2576
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 2577
0
(ix) and the following conditions hold:
TV0 (Ei0 ) ≤ min[TV 0 (Vi ), TV 0 (Vj )]Vi ,Vj ∈Ei0 ,
IV0 (Ei0 ) ≤ min[IV 0 (Vi ), IV 0 (Vj )]Vi ,Vj ∈Ei0 ,

and FV0 (Ei0 ) ≤ min[FV 0 (Vi ), FV 0 (Vj )]Vi ,Vj ∈Ei0
where i0 = 1, 2, . . . , n0 . 2578



items. 2593
SuperEdge; 2599
If we choose different types of binary operations, then we could get hugely diverse types of 2602
general forms of Neutrosophic SuperHyperGraph (NSHG). 2603
Definition 23.0.7 (t-norm). (Ref.[HG38], Definition 2.7, p.3). 2604

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 2605
x, y, z, w ∈ [0, 1]: 2606
(i) 1 ⊗ x = x; 2607
(ii) x ⊗ y = y ⊗ x; 2608
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 2609
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 2610

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 .
TA (x), IA (x), FA (x) >, x ∈ X}:
Definition 23.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 2611

S = (V, E), where 2613

(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2618
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2619
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2620
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 2621
0

items. 2636
SuperEdge; 2642
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 2645
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 2646
makes the patterns and regularities. 2647
Definition 23.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2648
of elements of SuperHyperEdges are the same. 2649

To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2650
makes to have SuperHyperUniform more understandable. 2651
Definition 23.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2652
Classes as follows. 2653
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2654
two given SuperHyperEdges with two exceptions; 2655
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2656
SuperHyperEdges; 2657
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2658
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2659
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2660
in common; 2661
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2662
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2663
SuperHyperEdge in common; 2664
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2665
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2666
SuperVertex. 2667
Definition 23.0.14. Let an ordered pair S = (V, E) be a Neutrosophic SuperHyperGraph

(NSHG) S. Then a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic
SuperHyperEdges (NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 2668

(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2669
(i) Vi , Vi+1 ∈ Ei0 ; 2670
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2671
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2672
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2673
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2674
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2675
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2676
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2677
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 23.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). a
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 2679
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2680
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2681
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2682
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHyper- 2683
Path . 2684
Definition 23.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG38],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). A
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 2685
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2686
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2687
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2688
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2689
Definition 23.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2690

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

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


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

(xii) Neutrosophic connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2703
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 2704
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2705
Definition 23.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 2706

Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2708
or E 0 is called 2709
(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 2710

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

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPIC CARDINALITY = 2713
|Ej |NEUTROSOPIC CARDINALITY ; 2714
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 2715

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPIC CARDINALITY = 2718
|Vj |NEUTROSOPIC CARDINALITY ; 2719
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2720

Definition 23.0.19. ((Neutrosophic) SuperHyperJoin). 2723

(i) an Extreme SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, Neut- 2726

rosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic rv- 2727
SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 2728
the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme car- 2729
dinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme 2730
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2733

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 2734
rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 2735
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 2736

(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 2740

SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 2745
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2748

cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of 2753
high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2754

Neutrosophic power is corresponded to its Neutrosophic coefficient; 2756
(v) an Extreme R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2757

SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the 2759
maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality 2760
of the Extreme SuperHyperVertices in the consecutive Extreme sequence of Extreme 2761
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 2764

SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 2766
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 2767
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 2771

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 2776
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 2779



cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S 2784
of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutro- 2785
Neutrosophic power is corresponded to its Neutrosophic coefficient. 2787
Definition 23.0.20. ((Extreme/Neutrosophic)δ−SuperHyperJoin). 2788

Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair S = (V, E). Then 2789
(i) an δ−SuperHyperJoin is a Neutrosophic kind of Neutrosophic SuperHyperJoin such 2790

that either of the following expressions hold for the Neutrosophic cardinalities of 2791
SuperHyperNeighbors of s ∈ S : 2792
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ;

|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ.
The Expression (23.1), holds if S is an δ−SuperHyperOffensive. And the Expression 2793

(23.1), holds if S is an δ−SuperHyperDefensive; 2794
(ii) a Neutrosophic δ−SuperHyperJoin is a Neutrosophic kind of Neutrosophic SuperHy- 2795
perJoin such that either of the following Neutrosophic expressions hold for the Neutrosophic 2796
cardinalities of SuperHyperNeighbors of s ∈ S : 2797
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ;

|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ.
The Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2798

the Expression (23.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2799
notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the SuperHyperEdges 2801
are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage 2802
of the position of labels to assign to the values. 2803
S = (V, E). It’s redefined Neutrosophic SuperHyperGraph if the Table (23.1) holds. 2805
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2806
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2807

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



S = (V, E). There are some Neutrosophic SuperHyperClasses if the Table (23.2) holds. 2809
Thus Neutrosophic SuperHyperPath , SuperHyperJoin, SuperHyperStar, SuperHyperBipart- 2810
ite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic SuperHyperPath , 2811
Neutrosophic SuperHyperJoin, Neutrosophic SuperHyperStar, Neutrosophic Supe- 2812

rHyperBipartite, Neutrosophic SuperHyperMultiPartite, and Neutrosophic Super- 2813
HyperWheel if the Table (23.2) holds. 2814
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperJoin. Since there’s 2815
more ways to get type-results to make a Neutrosophic SuperHyperJoin more Neutrosophicly 2816
understandable. 2817
Neutrosophic notion of “Neutrosophic SuperHyperJoin”. The SuperHyperVertices and the 2819
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 2820
there’s the usage of the position of labels to assign to the values. 2821
Definition 23.0.23. Assume a SuperHyperJoin. It’s redefined a Neutrosophic SuperHyper- 2822
Join if the Table (23.3) holds. 2823

CHAPTER 24 2824
Neutrosophic SuperHyperJoin But As The 2825
Extensions Excerpt From Dense And 2826
Super Forms 2827
Example 24.0.1. Assume a Neutrosophic SuperHyperGraph (NSHG) S is an ordered pair 2828

S = (V, E) in the mentioned Neutrosophic Figures in every Neutrosophic items. 2829
• On the Figure (24.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 2830

SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 2831
E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 2832
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 2833
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, 2834
E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 2835
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 2836
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperJoin. 2837
C(N SHG)Neutrosophic SuperHyperJoin = {E4 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V4 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 3z.
2838

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 2841
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 2842
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 2843
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as a 2844
Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every 2845
143
Figure 24.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperJoin in the Neutrosophic Example (24.0.1)
given Neutrosophic SuperHyperJoin. 2846

2847

2850

C(N SHG)Neutrosophic SuperHyperJoin = {E4 , E2 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 2z 2 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , V4 }.





C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = 15z 2 .

2853


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.
2856

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E3i+243i=0 }.

C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial 6z 8 .
C(N SHG)Neutrosophic R-SuperHyperJoin = {V3i+17i=0 }.
2859

C(N SHG)Neutrosophic SuperHyperJoin = {E15 , E16 , E17 }.





C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = z 3 .

C(N SHG)Neutrosophic R-SuperHyperJoin = {V3 , V13 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .
2862


4 × 5 × 5z 3 .
2865
C(N SHG)Neutrosophic SuperHyperJoin = {E3i+13i=0 , E23 }.



C(N SHG)Neutrosophic R-SuperHyperJoin = {V3i+13i=0 , V15 }.

2868


4 × 5 × 5z 3 .
2871








3 × 3z 2 .
2874

C(N SHG)Neutrosophic R-SuperHyperJoin = {V1 , Vii610=5,7,8 }.
i=4

2877


3 × 3z 2 .


2880

2883


2886




(1 × 5 × 5) + (1 × 2 + 1)z 3 .
2889

C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
2892




C(N SHG)Neutrosophic R-SuperHyperJoin = {V27 , V2 , V7 , V17 }.
(1 × 1 × 2 + 1)z 4 .
2895

C(N SHG)Neutrosophic SuperHyperJoin = {E3i+1i=03 }.









C(N SHG)Neutrosophic R-SuperHyperJoin = {V2i+1i=05 }.
2898

2901




2904


C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .
2907





CHAPTER 25 2908
The Neutrosophic Departures on The 2909
Theoretical Results Toward Theoretical 2910
Motivations 2911
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on Neutrosophic 2912
SuperHyperClasses. 2913
Proposition 25.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 2914
C(N SHG)Neutrosophic SuperHyperJoin =

|EESHG:(V,E) |Neutrosophic Cardinality
= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 2915
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
E |EESHG:(V,E) |Neutrosophic Cardinality , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality .
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). There’s 2916
161
Figure 25.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic


Example 25.0.2. In the Figure (25.1), the connected Neutrosophic SuperHyperPath ESHP : 2920
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 2921
SuperHyperModel (25.1), is the SuperHyperJoin. 2922
Proposition 25.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 2923

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


.
Proof. Let 2924
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). There’s 2925

Example 25.0.4. In the Figure (25.2), the connected Neutrosophic SuperHyperCycle N SHC : 2929
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 2930
Neutrosophic SuperHyperModel (25.2), is the Neutrosophic SuperHyperJoin. 2931
Proposition 25.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 2932
C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperJoin SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 2933
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .

be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 2934


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

Example 25.0.6. In the Figure (25.3), the connected Neutrosophic SuperHyperStar ESHS : 2938
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 2939
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 2940
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (25.3), is 2941
the Neutrosophic SuperHyperJoin. 2942
Proposition 25.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 2943
Then 2944
C(N SHG)Neutrosophic Quasi-SuperHyperJoin

i
= (OTHERWISE).
{},
i

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

X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.
i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Neutrosophic Cardinality
Proof. Let 2945
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,

...,
EXT ERN AL
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 2946
There’s a new way to redefine as 2947

based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 2951
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite ESHB : 2953

(V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 2954
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Example 25.0.8. In the Neutrosophic Figure (25.4), the connected Neutrosophic SuperHyperBi- 2957
partite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The obtained 2958
Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic result, 2959
of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyperBipartite 2960

ESHB : (V, E), in the Neutrosophic SuperHyperModel (25.4), is the Neutrosophic SuperHyper- 2961
Join. 2962
Proposition 25.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 2963
Then 2964

Figure 25.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperJoin in the Example (25.0.8)
i
= (OTHERWISE).
{},
i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
i
= (OTHERWISE)0.


i
ERN AL
ESHG:(V,E) , Vi
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.

X X
EXT ERN AL |
Neutrosophic Cardinality
Proof. Let 2965
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 2966

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

based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 2971
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : 2973

(V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 2974
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 2976

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

Example 25.0.10. In the Figure (25.5), the connected Neutrosophic SuperHyperMultipartite 2978
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 2979
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 2980

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 2981
the Neutrosophic SuperHyperModel (25.5), is the Neutrosophic SuperHyperJoin. 2982
Proposition 25.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 2983
Then, 2984

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

.
Proof. Let 2985
P :
V1EXT ERN AL , E1 ,

Figure 25.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperJoin in the Neutrosophic Example (25.0.12)
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 2986

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

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s at 2989
least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 2990
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 2991
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 2992
Example 25.0.12. In the Neutrosophic Figure (25.6), the connected Neutrosophic SuperHyper- 2993
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 2994
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVertices of 2995
the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic SuperHy- 2996
perModel (25.6), is the Neutrosophic SuperHyperJoin. 2997

CHAPTER 26 2998
The Surveys of Mathematical Sets On The 2999
Results But As The Initial Motivation 3000
For the SuperHyperJoin, Neutrosophic SuperHyperJoin, and the Neutrosophic SuperHyperJoin, 3001
some general results are introduced. 3002
Remark 26.0.1. Let remind that the Neutrosophic SuperHyperJoin is “redefined” on the positions 3003
of the alphabets. 3004
Corollary 26.0.2. Assume Neutrosophic SuperHyperJoin. Then 3005
N eutrosophic SuperHyperJoin =
{theSuperHyperJoinof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperJoin
|N eutrosophiccardinalityamidthoseSuperHyperJoin. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 3006
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 3007
the neutrality, for i = 1, 2, 3, respectively. 3008
Corollary 26.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 3009
alphabet. Then the notion of Neutrosophic SuperHyperJoin and SuperHyperJoin coincide. 3010
alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic SuperHyperJoin 3012
if and only if it’s a SuperHyperJoin. 3013
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperJoin 3015
if and only if it’s a longest SuperHyperJoin. 3016
Corollary 26.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 3017
identical letter of the alphabet. Then its Neutrosophic SuperHyperJoin is its SuperHyperJoin and 3018
reversely. 3019
171
Corollary 26.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperJoin, SuperHyperStar, 3020

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same identical letter of 3021
the alphabet. Then its Neutrosophic SuperHyperJoin is its SuperHyperJoin and reversely. 3022
Corollary 26.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHyper- 3023
Join isn’t well-defined if and only if its SuperHyperJoin isn’t well-defined. 3024
Corollary 26.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3025

Neutrosophic SuperHyperJoin isn’t well-defined if and only if its SuperHyperJoin isn’t well-defined. 3026

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3028
SuperHyperJoin isn’t well-defined if and only if its SuperHyperJoin isn’t well-defined. 3029
Corollary 26.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 3030
perJoin is well-defined if and only if its SuperHyperJoin is well-defined. 3031
Corollary 26.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 3032

Neutrosophic SuperHyperJoin is well-defined if and only if its SuperHyperJoin is well-defined. 3033

SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its Neutrosophic 3035
SuperHyperJoin is well-defined if and only if its SuperHyperJoin is well-defined. 3036
Proposition 26.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 3037
(i) : the dual SuperHyperDefensive SuperHyperJoin; 3038
(ii) : the strong dual SuperHyperDefensive SuperHyperJoin; 3039
(iii) : the connected dual SuperHyperDefensive SuperHyperJoin; 3040
(iv) : the δ-dual SuperHyperDefensive SuperHyperJoin; 3041
(v) : the strong δ-dual SuperHyperDefensive SuperHyperJoin; 3042
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperJoin. 3043
Proposition 26.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 3044
(iii) : the connected defensive SuperHyperDefensive SuperHyperJoin; 3047
Proposition 26.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 3051
independent SuperHyperSet is 3052

(iii) : the connected SuperHyperDefensive SuperHyperJoin; 3055
Proposition 26.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 3059

Graph which is a SuperHyperJoin/SuperHyperPath. Then V is a maximal 3060
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperJoin; 3064
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperJoin; 3065
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperJoin; 3066
Proposition 26.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 3068

SuperHyperUniform SuperHyperWheel. Then V is a maximal 3069
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 3073
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 3074
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperJoin; 3075
Graph which is a SuperHyperJoin/SuperHyperPath. Then the number of 3078
(i) : the SuperHyperJoin; 3079
(ii) : the SuperHyperJoin; 3080
(iii) : the connected SuperHyperJoin; 3081
(iv) : the O(ESHG)-SuperHyperJoin; 3082

(v) : the strong O(ESHG)-SuperHyperJoin; 3083
(vi) : the connected O(ESHG)-SuperHyperJoin. 3084
coincide. 3086

Graph which is a SuperHyperWheel. Then the number of 3088
(i) : the dual SuperHyperJoin; 3089
(ii) : the dual SuperHyperJoin; 3090
(iii) : the dual connected SuperHyperJoin; 3091
(iv) : the dual O(ESHG)-SuperHyperJoin; 3092
(v) : the strong dual O(ESHG)-SuperHyperJoin; 3093
(vi) : the connected dual O(ESHG)-SuperHyperJoin. 3094
coincide. 3096

Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 3098
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 3099
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 3100
is a 3101
O(ESHG)
O(ESHG)
O(ESHG)

SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the number 3110
of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest SuperHyperPart 3111
is a 3112

(iv) : δ-SuperHyperDefensive SuperHyperJoin; 3116
(v) : strong δ-SuperHyperDefensive SuperHyperJoin; 3117
(vi) : connected δ-SuperHyperDefensive SuperHyperJoin. 3118

SuperHyperMultipartite. Then Then the number of 3121
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of multiplying 3128
r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. Where the 3129
exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 3130
Proposition 26.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 3131
connected component is |V − S| if there’s a SuperHyperSet which is a dual 3132
(iv) : SuperHyperJoin; 3136
Proposition 26.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the number 3139
is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 3140
Proposition 26.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 3141
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 3142
min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 3143
t>
2



Proposition 26.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 3150
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 3151
of dual 3152
(iv) : 0-SuperHyperDefensive SuperHyperJoin; 3156

SuperHyperComplete. Then there’s no independent SuperHyperSet. 3160
SuperHyperJoin/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : (V, E)) and 3162

the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 3163
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin; 3167
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin; 3168
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperJoin. 3169

SuperHyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 3171
O(ESHG:(V,E))
2 + 1 and the Neutrosophic number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in 3172
t>
2
the setting of a dual 3173



Proposition 26.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 3180
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 3181
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 3182
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 3183
Proposition 26.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3184

dual SuperHyperDefensive SuperHyperJoin, then ∀v ∈ V \ S, ∃x ∈ S such that 3185
(i) v ∈ Ns (x); 3186
(ii) vx ∈ E. 3187
Proposition 26.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is a 3188

dual SuperHyperDefensive SuperHyperJoin, then 3189
(i) S is SuperHyperDominating set; 3190
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 3191
Proposition 26.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 3192
(i) Γ ≤ O; 3193
(ii) Γs ≤ On . 3194
Proposition 26.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 3195
connected. Then 3196
(i) Γ ≤ O − 1; 3197
(ii) Γs ≤ On − Σ3i=1 σi (x). 3198
Proposition 26.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 3199
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 3202
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 3203
Proposition 26.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 3205
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperJoin; 3206
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 3207

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3208
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3209
Proposition 26.0.38. Let ESHG : (V, E) be an even SuperHyperJoin. Then 3211
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperJoin; 3212
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 3213
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 3214
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 3215
Proposition 26.0.39. Let ESHG : (V, E) be an odd SuperHyperJoin. Then 3217
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3220
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3221
Proposition 26.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3223
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperJoin; 3224
(ii) Γ = 1; 3225
(iii) Γs = Σ3i=1 σi (c); 3226
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperJoin. 3227
Proposition 26.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3228
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3229
SuperHyperDefensive SuperHyperJoin; 3230
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3231
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3232
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3233
SuperHyperDefensive SuperHyperJoin. 3234
Proposition 26.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3235
b n c+1
2
is a dual SuperHyperDefensive SuperHyperJoin; 3236
(ii) Γ = b n2 c + 1; 3237


2
; 3238
S={vi }i=1
b n c+1
2
is only a dual SuperHyperDefensive SuperHyperJoin. 3239
Proposition 26.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3240
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperJoin; 3241
(ii) Γ = b n2 c; 3242

2
; 3243
S={vi }i=1
bnc
2
is only a dual maximal SuperHyperDefensive SuperHyper- 3244
Join. 3245
Proposition 26.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 3246

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3247
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperJoin for 3248

N SHF; 3249
(ii) Γ = m for N SHF : (V, E); 3250
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3251
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperJoin for 3252
N SHF : (V, E). 3253
Proposition 26.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperComplete 3254

SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3255
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHyperJoin 3256
for N SHF; 3257
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3258

2
for N SHF : (V, E); 3259
S={vi }i=1
b n c+1
2
are only a dual maximal SuperHyperJoin for N SHF : 3260
(V, E). 3261
Proposition 26.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperComplete 3262
SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 3263
bnc
2
is a dual SuperHyperDefensive SuperHyperJoin for 3264
N SHF : (V, E); 3265
(ii) Γ = b n2 c for N SHF : (V, E); 3266

2
for N SHF : (V, E); 3267
S={vi }i=1

bnc
2
are only dual maximal SuperHyperJoin for N SHF : (V, E). 3268
following statements hold; 3270
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3271
SuperHyperJoin, then S is an s-SuperHyperDefensive SuperHyperJoin; 3272
SuperHyperJoin, then S is a dual s-SuperHyperDefensive SuperHyperJoin. 3274
following statements hold; 3276
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3277
SuperHyperJoin, then S is an s-SuperHyperPowerful SuperHyperJoin; 3278
SuperHyperJoin, then S is a dual s-SuperHyperPowerful SuperHyperJoin. 3280
Proposition 26.0.49. Let ESHG : (V, E) be a[an] [r-]SuperHyperUniform-strong-Neutrosophic 3281

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

(iv) if ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0, then ESHG : (V, E) is a dual r-SuperHyperDefensive 3289
Proposition 26.0.50. Let ESHG : (V, E) is a[an] [r-]SuperHyperUniform-strong-Neutrosophic 3291

(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3295

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an r-SuperHyperDefensive SuperHyperJoin; 3297
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual r-SuperHyperDefensive 3298


(i) ∀a ∈ S, |Ns (a) ∩ S| b O−1

2 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3304
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 3306

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


(i) if ∀a ∈ S, |Ns (a) ∩ S| b O−1

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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperJoin; 3322
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3323

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive SuperHyperJoin; 3325
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3326


(i) if ∀a ∈ S, |Ns (a) ∩ S| < 2, then ESHG : (V, E) is an 2-SuperHyperDefensive 3330

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

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


CHAPTER 27 3338
Neutrosophic Applications in Cancer’s 3339
Neutrosophic Recognition 3340
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 3341
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 3342
disease is considered and as the consequences of the model, some parameters are used. The 3343
cells are under attack of this disease but the moves of the cancer in the special region are the 3344
matter of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 3345
treatments for this Neutrosophic disease. 3346
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 3347
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long-term 3348
Neutrosophic function. 3349
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic model 3350
[it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the move 3351
easily identified since there are some determinacy, indeterminacy and neutrality about the 3353
moves and the effects of the cancer on that region; this event leads us to choose another 3354
model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception on 3355
what’s happened and what’s done. 3356
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 3357
known and they’ve got the names, and some general Neutrosophic models. The moves 3358
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 3359
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperJoin, 3360
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3361
aim is to find either the Neutrosophic SuperHyperJoin or the Neutrosophic SuperHyperJoin 3362
in those Neutrosophic Neutrosophic SuperHyperModels. 3363
183
CHAPTER 28 3364
Case 1: The Initial Neutrosophic Steps 3365
Toward Neutrosophic 3366
SuperHyperBipartite as Neutrosophic 3367
SuperHyperModel 3368
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (28.1), the Neutrosophic Super- 3369
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 3370
Figure 28.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

SuperHyperJoin
185
Belong to The Neutrosophic SuperHyperBipartite

By using the Neutrosophic Figure (28.1) and the Table (28.1), the Neutrosophic SuperHy- 3371
perBipartite is obtained. 3372
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 3373
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic 3374
SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (28.1), is the 3375
Neutrosophic SuperHyperJoin. 3376

CHAPTER 29 3377
Case 2: The Increasing Neutrosophic 3378
Steps Toward Neutrosophic 3379
SuperHyperMultipartite as 3380
Neutrosophic SuperHyperModel 3381
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (29.1), the Neutrosophic Super- 3382
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 3383
By using the Neutrosophic Figure (29.1) and the Table (29.1), the Neutrosophic SuperHy- 3384
perMultipartite is obtained. 3385
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 3386
Figure 29.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

SuperHyperJoin
187
Belong to The Neutrosophic SuperHyperMultipartite

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 3387

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (29.1), is the 3388
Neutrosophic SuperHyperJoin. 3389

CHAPTER 30 3390
Wondering Open Problems But As The 3391
Directions To Forming The Motivations 3392
In what follows, some “problems” and some “questions” are proposed. 3393
The SuperHyperJoin and the Neutrosophic SuperHyperJoin are defined on a real-world application, 3394
titled “Cancer’s Recognitions”. 3395
Question 30.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3396
recognitions? 3397
Question 30.0.2. Are there some SuperHyperNotions related to SuperHyperJoin and the 3398
Neutrosophic SuperHyperJoin? 3399
Question 30.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3400
them? 3401
Question 30.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperJoin and 3402
the Neutrosophic SuperHyperJoin? 3403
Problem 30.0.5. The SuperHyperJoin and the Neutrosophic SuperHyperJoin do a SuperHyper- 3404
Model for the Cancer’s recognitions and they’re based on SuperHyperJoin, are there else? 3405
Problem 30.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3406
Numbers types-results? 3407
Problem 30.0.7. What’s the independent research based on Cancer’s recognitions concerning the 3408
multiple types of SuperHyperNotions? 3409
189
CHAPTER 31 3410
Conclusion and Closing Remarks 3411
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3412
research are illustrated. Some benefits and some advantages of this research are highlighted. 3413
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 3414
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperJoin. For that sake 3415
in the second definition, the main definition of the Neutrosophic SuperHyperGraph is redefined on 3416
the position of the alphabets. Based on the new definition for the Neutrosophic SuperHyperGraph, 3417
the new SuperHyperNotion, Neutrosophic SuperHyperJoin, finds the convenient background 3418
to implement some results based on that. Some SuperHyperClasses and some Neutrosophic 3419
SuperHyperClasses are the cases of this research on the modeling of the regions where are 3420
under the attacks of the cancer to recognize this disease as it’s mentioned on the title “Cancer’s 3421
Recognitions”. To formalize the instances on the SuperHyperNotion, SuperHyperJoin, the new 3422
SuperHyperClasses and SuperHyperClasses, are introduced. Some general results are gathered in 3423
the section on the SuperHyperJoin and the Neutrosophic SuperHyperJoin. The clarifications, 3424
instances and literature reviews have taken the whole way through. In this research, the literature 3425
reviews have fulfilled the lines containing the notions and the results. The SuperHyperGraph and 3426
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognitions” and 3427
both bases are the background of this research. Sometimes the cancer has been happened on the 3428
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 3429
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer in the 3430
longest and strongest styles with the formation of the design and the architecture are formally 3431
called “ SuperHyperJoin” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers 3432
to the theme of the embedded styles to figure out the background for the SuperHyperNotions. In 3433
the Table (31.1), benefits and avenues for this research are, figured out, pointed out and spoken 3434
out. 3435
191
Table 31.1: An Overlook On This Research And Beyond
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperJoin
3. Neutrosophic SuperHyperJoin 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

Bibliography 3436
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 3449

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European 3453
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. ht- 3454

tps://oa.mg/work/10.13140/rg.2.2.35241.26724 3455

prints202301.0282.v1). 3462
10.20944/preprints202301.0267.v1). 3465
193
(doi: 10.20944/preprints202301.0265.v1). 3470
prints202301.0262.v1). 3474

(doi: 10.20944/preprints202301.0224.v1). 3480

prints202301.0105.v1). 3483


Preprints 2023, 2023010044 3489

10.20944/preprints202301.0043.v1). 3492


(doi: 10.20944/preprints202212.0549.v1). 3501


[21] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph 3506

10.20944/preprints202212.0500.v1). 3508



10.13140/RG.2.2.35061.65767). 3517
10.13140/RG.2.2.18494.15680). 3521

10.13140/RG.2.2.32530.73922). 3525

10.13140/RG.2.2.15897.70243). 3529

10.13140/RG.2.2.23172.19849). 3536
(doi: 10.13140/RG.2.2.28945.92007). 3542



10.13140/RG.2.2.35774.77123). 3548


10.13140/RG.2.2.29430.88642). 3554
10.13140/RG.2.2.29173.86244). 3560


CHAPTER 32 3570
Books’ Contributions 3571
“Books’ Contributions”: | Featured Threads 3572

The following references are cited by chapters. 3573
3574
2023, (doi: 10.13140/RG.2.2.17761.79206). 3577
3578
10.13140/RG.2.2.11050.90569). 3581
3582
3584

3587
3589
3591

3593
10.13140/RG.2.2.17761.79206). 3597
#150thArticle 3598
February 2023 3599
DOI: 10.13140/RG.2.2.17761.79206 3600
197
2023, (doi: 10.13140/RG.2.2.17761.79206).
GooglePlay Article #151 3605

3606
3609
3611
3613
3615
10.13140/RG.2.2.11050.90569). 3619
February 2023 3621
DOI: 10.13140/RG.2.2.11050.90569 3622

GooglePlay – 3627
3628
#Latest_Updates 3629

2023, (doi: 10.13140/RG.2.2.17761.79206).
2023, (doi: 10.13140/RG.2.2.17761.79206).

10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

10.13140/RG.2.2.11050.90569).
10.13140/RG.2.2.11050.90569).

3630
#The_Links 3631
3632
| Book #103 3633
3634
|Title: SuperHyperJoin 3635
3636
| Available at WordPress Preprints_org ResearchGate Scribd academia ZENODO_ORG 3637
Twitter LinkedIn Amazon googlebooks GooglePlay 3638
3639
– 3640
3641
| Publisher | – 3642
3643
| ISBN | – 3644
3645
| Print length | – 3646
3647
#Latest_Updates 3648
3649
#The_Links 3650
3651
| ResearchGate: - 3652
3653
| WordPress: - 3654
3655
@Scribd: - 3656
3657
| academia: - 3658
3659
| ZENODO_ORG: - 3660
3661
| googlebooks: - 3662
3663
| GooglePlay: - 3664
3665
3666

SuperHyperJoin (Published Version) 3667
3668
The Link: 3669
3670
- 3671
3672
– 3673
3674
Posted by Dr. Henry Garrett 3675
3676
February -, 2023 3677
3678
Posted in 0103 | SuperHyperJoin 3679
3680
Tags: 3681
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 3682
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 3683
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 3684
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 3685
neutrosophic SuperHyperGraphs, Neutrosophic SuperHyperJoin, Open Problems, Open Ques- 3686

tions, Problems, Pure Math, Pure Mathematics, Questions, Real-World Applications, Recent 3687
Research, Recognitions, Research, scientific research Article, scientific research Articles, scientific 3688
research Book, scientific research Chapter, scientific research Chapters, Review, SuperHyper- 3689
Classes, SuperHyperEdges, SuperHyperGraph, SuperHyperGraph Theory, SuperHyperGraphs, 3690
SuperHyperJoin, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 3691
Vertices. 3692

Figure 32.10: “#103rd Book” || SuperHyperJoin February 2023 License: CC BY-NC-ND 4.0
Print length: 254 pages Project: Neutrosophic SuperHyperGraphs and SuperHyperGraphs

CHAPTER 33 3693
“SuperHyperGraph-Based Books”: | 3694
Featured Tweets 3695
“SuperHyperGraph-Based Books”: | Featured Tweets 3696
205
Figure 33.1: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 33.2: “SuperHyperGraph-Based Books”: | Featured Tweets

Figure 33.3: “SuperHyperGraph-Based Books”: | Featured Tweets #69
























CHAPTER 34 3697
CV 3698
233
3699
Henry Garrett · Independent Researcher · Department of Mathematics · DrHenryGarrett@gmail.com · Manhattan, NY, USA
Henry Garrett CV
Status: Known As Henry Garrett With Highly Productive Style.
Fields: Combinatorics, Algebraic Structures, Algebraic Hyperstructures, Fuzzy

Logic
Prefers: Graph Theory, Domination, Metric Dimension, Neutrosophic Graph

Theory, Neutrosophic Domination, Lattice Theory, Groups and
Hypergroups
Activities: Traveling, Painting, Writing, Reading books and Papers
Professional Experiences
2017 - Present Continuous Member AMS
I tried to show them that Science is not only interesting, it’s beautiful and exciting.
Participating in the academic space of the largest mathematical Society gave me valuable
experiences. The use of Bulletin and Notice of the American Mathematical Society is another
benefit of this presence.
2017 - 2019 Continuous Member EMS
The use Newsletter of the European Mathematical Society is benefit of this membership.
I am interested in giving a small, though small, effect on math epidemic progress
Awards and Achievements
Sep 2022 Award: Selected as an Editorial Board Member to JMTCM JMTCM
Award: Selected as an Editorial Board Member to Journal of Mathematical Techniques and

Computational Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Award: Selected as an Editorial Board Member to JCTCSR JCTCSR
Award: Selected as an Editorial Board Member to Journal of Current Trends in Computer

Science Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
Jan 23, 2022 Award: Diploma By Neutrosophic Science International Association Neutrosophic Science International
Association
Award: Distinguished Achievements

Honorary Memebrship
Journal Referee
Sep 2022 Editorial Board Member to JMTCM JMTCM
Editorial Board Member to Journal of Mathematical Techniques and Computational

Mathematics(JMTCM)
Journal of Mathematical Techniques and Computational Mathematics(JMTCM)
Jun 2022 Editorial Board Member to JCTCSR JCTCSR
Editorial Board Member to Journal of Current Trends in Computer Science

Research(JCTCSR)
Journal of Current Trends in Computer Science Research(JCTCSR)
3700
Publications: Articles
2023 0126 | Extreme SuperHyperClique as the Firm Scheme of Confrontation under Cancer’s Recognition Manuscript
as the Model in The Setting of (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”,
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1).
Available at Twitter, ResearchGate, Scribd, Academia, Zenodo, LinkedIn
2023 0125 | Uncertainty On The Act And Effect Of Cancer Alongside The Foggy Positions Of Cells Manuscript
Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic SuperHyperGraphs Titled Cancer’s
Recognition
Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi:
10.20944/preprints202301.0282.v1).
2023 0124 | Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic Manuscript
SuperHyperGraphs
Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi:
10.20944/preprints202301.0267.v1).).
2023 0123 | The Shift Paradigm To Classify Separately The Cells and Affected Cells Toward The Totality Manuscript
Under Cancer’s Recognition By New Multiple Definitions On the Sets Polynomials Alongside Numbers
In The (Neutrosophic) SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic
SuperHyperGraph
Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 (doi:
10.20944/preprints202301.0265.v1).
2023 0122 | Breaking the Continuity and Uniformity of Cancer In The Worst Case of Full Manuscript
Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied in (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The
Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s
Recognition Applied in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi:
10.20944/preprints202301.0262.v1).
2023 0121 | Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic Manuscript
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs
Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the
Cancer’s Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic
SuperHyperGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1).
2023 0120 | Extremism of the Attacked Body Under the Cancer’s Circumstances Where Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances Where
Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010224,
(doi: 10.20944/preprints202301.0224.v1).
2023 0119 | SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition Manuscript
In Neutrosophic SuperHyperGraphs
Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.35061.65767).
3701
2023 0118 | The Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition Manuscript
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi:
10.13140/RG.2.2.18494.15680).
2023 0117 | Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In Manuscript
The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023,(doi: 10.13140/RG.2.2.15897.70243).
2023 0116 | Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s Recognition Manuscript
in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named (Neutrosophic)
SuperHyperGraphs
Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Cancer’s
Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyperModels Named
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.32530.73922).
2023 0115 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s
Recognitions And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi:
10.20944/preprints202301.0105.v1).
2023 0114 | Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Manuscript
Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs
Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recognition
Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.30092.80004).
2023 0113 | Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in Manuscript
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic)
SuperHyperClique
Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions and Sub-
Regions in the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With
(Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 10.13140/RG.2.2.23172.19849).
2023 0112 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2023 0111 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0110 | Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic Failed Manuscript
SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of Neutrosophic
SuperHyperGraphs
3702
Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neutrosophic

Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the Form of
Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 10.13140/RG.2.2.17385.36968).
2022 0109 | 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph
Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” CERN
European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942.
https://oa.mg/work/10.5281/zenodo.6319942
2022 0108 | 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript
Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” CERN

European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN European
Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724.
https://oa.mg/work/10.13140/rg.2.2.35241.26724
2023 0107 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
Preprints 2023, 2023010044
2023 0106 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi:
10.20944/preprints202301.0043.v1).
2022 0105 | Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs Article
and Their Directions in Game Theory and Neutrosophic Super Hyper Classes
Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutrosophic
Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic Super Hyper
Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263.
2023 0104 | Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Manuscript
Recognition Titled (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Using the Tool As (Neutrosophic) Failed SuperHyperStable To
SuperHyperModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”,
2023 0103 | Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Manuscript

Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints
Henry Garrett,“Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”,
2023 0102 | (Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled Manuscript

(Neutrosophic) SuperHyperGraphs
Henry Garrett,“(Neutrosophic) SuperHyperStable on Cancer’s Recognition by
Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35774.77123).
3703
2022 0101 | Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic Manuscript
SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond
Henry Garrett,“Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”,
2022 0100 | (Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And (Neutrosophic) Manuscript
SuperHyperGraphs
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions And
(Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 10.13140/RG.2.2.29430.88642).
2022 0099 | Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling Manuscript
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs
Henry Garrett,“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic)
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”,
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 (doi:
10.20944/preprints202212.0549.v1).
2022 0098 | (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring (Neutrosophic) Manuscript

SuperHyperDefensive SuperHyperAlliances
Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions
Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022,
(doi: 10.13140/RG.2.2.19380.94084).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1).
2022 0097 | (Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and SuperHyperOffensive Manuscript

Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With (Neutrosophic) SuperHyperModeling
of Cancer’s Recognitions And Related (Neutrosophic) SuperHyperClasses

Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic)
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022,
2022120500 (doi: 10.20944/preprints202212.0500.v1).
2022 0096 | SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyperGraph With Manuscript

SuperHyperModeling of Cancer’s Recognitions
Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic
SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate
2022 (doi: 10.13140/RG.2.2.20993.12640).
3704
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript
and SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
2022 0095 | Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs Manuscript

And SuperHyperGraphs Alongside Applications in Cancer’s Treatments
Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic
SuperHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, Preprints 2022, 2022110576 (doi: 10.20944/preprints202211.0576.v1).
2022 0094 | SuperHyperDominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Manuscript

Their Directions in Game Theory and Neutrosophic SuperHyperClasses
Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic
SuperHyperGraphs And Their Directions in Game Theory and Neutrosophic
SuperHyperClasses”, ResearchGate 2022 (doi: 10.13140/RG.2.2.23324.56966).
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.22861.10727).
2022 0090 | Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on Manuscript
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)
Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph
(NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160).
2022 0089 | Basic Neutrosophic Notions Concerning Neutrosophic SuperHyperDominating and Manuscript
Neutrosophic SuperHyperResolving in Neutrosophic SuperHyperGraph
Henry Garrett, “Basic Neutrosophic Notions Concerning Neutrosophic
SuperHyperDominating and Neutrosophic SuperHyperResolving in Neutrosophic
SuperHyperGraph”, ResearchGate 2022 (doi: 10.13140/RG.2.2.29173.86244).
2022 0088 | Seeking Empty Subgraphs To Determine Different Measurements in Some Classes of Manuscript
Neutrosophic Graphs
3705
Henry Garrett, “Seeking Empty Subgraphs To Determine Different Measurements in Some

Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.30448.53766).
2022 0087 | Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Impacts of Isolated Vertices To Cover Other Vertices in Neutrosophic

Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.16185.44647).
2022 0086 | Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs”,
2022 0085 | Complete Connections Between Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Complete Connections Between Vertices in Neutrosophic Graphs”,

2022 0084 | Unique Distance Differentiation By Collection of Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Unique Distance Differentiation By Collection of Vertices in Neutrosophic

2022 0083 | Single Connection Amid Vertices From Two Given Sets Partitioning Vertex Set in Some Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Single Connection Amid Vertices From Two Given Sets Partitioning
Vertex Set in Some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32189.33764).
2022 0082 | Separate Joint-Sets Representing Separate Numbers Where Classes of Neutrosophic Graphs Manuscript
and Applications are Cases of Study
Henry Garrett, “Separate Joint-Sets Representing Separate Numbers Where Classes
of Neutrosophic Graphs and Applications are Cases of Study”, ResearchGate 2022 (doi:
10.13140/RG.2.2.22666.95686).
2022 0081 | Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic Graphs Manuscript
Henry Garrett, “Repetitive Joint-Sets Featuring Multiple Numbers For Neutrosophic

2022 0080 | Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic Graphs With Some Manuscript
Applications
Henry Garrett, “Dual-Resolving Numbers Excerpt from Some Classes of Neutrosophic
Graphs With Some Applications”, ResearchGate 2022 (doi: 10.13140/RG.2.2.14971.39200).
2022 0079 | Dual-Dominating Numbers in Neutrosophic Setting and Crisp Setting Obtained From Classes Manuscript
of Neutrosophic Graphs
Henry Garrett, “Dual-Dominating Numbers in Neutrosophic Setting and Crisp
Setting Obtained From Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.19925.91361).
2022 0078 | Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic Graphs Manuscript
3706
Henry Garrett, “Neutrosophic Path-Coloring Numbers BasedOn Endpoints In Neutrosophic

2022 0077 | Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes of Neutrosophic Manuscript
Graphs
Henry Garrett, “Neutrosophic Dominating Path-Coloring Numbers in New Visions of Classes
of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.32151.65445).
2022 0076 | Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges and Neutrosophic Manuscript
Cardinality of Edges With Some Applications from Real-World Problems
Henry Garrett, “Path Coloring Numbers of Neutrosophic Graphs Based on Shared Edges
and Neutrosophic Cardinality of Edges With Some Applications from Real-World Problems”,
2022 0075 | Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Collapsed Numbers in the Viewpoint of Neutrosophic Graphs”,

2022 0074 | Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic Edges Manuscript
Henry Garrett, “Bulky Numbers of Classes of Neutrosophic Graphs Based on Neutrosophic

Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.24204.18564).
2022 0073 | Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs Manuscript
Henry Garrett, “Dense Numbers and Minimal Dense Sets of Neutrosophic Graphs”,
2022 0072 | Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles Manuscript
Henry Garrett, “Connectivities of Neutrosophic Graphs in the terms of Crisp Cycles”,

2022 0071 | Strong Paths Defining Connectivities in Neutrosophic Graphs Manuscript
Henry Garrett, “Strong Paths Defining Connectivities in Neutrosophic Graphs”,

2022 0070 | Finding Longest Weakest Paths assigning numbers to some Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Longest Weakest Paths assigning numbers to some Classes of
Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
April 12, 2022 0069 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Article
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic

SuperHyperGraph”, Neutrosophic Sets and Systems 49 (2022) 531-561 (doi:
10.5281/zenodo.6456413). (http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
(https://digitalrepository.unm.edu/nss_journal/vol49/iss1/34).
Available at NSS, NSS Gallery, UNM Digital Repository, Twitter, ResearchGate, Scribd,
Academia, Zenodo, LinkedIn
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
3707
Henry Garrett, “Relations and Notions amid Hamiltonicity and Eulerian Notions in Some
Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi: 10.13140/RG.2.2.35579.59689).
2022 0067 | Eulerian Results In Neutrosophic Graphs With Applications Manuscript
Henry Garrett, “Eulerian Results In Neutrosophic Graphs With Applic- ations”,

2022 0066 | Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Hamiltonian Neutrosophic Cycles in Classes of Neutrosophic

2022 0065 | Extending Sets Type-Results in Neutrosophic Graphs Manuscript
Henry Garrett, “Extending Sets Type-Results in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.13317.01767).
2022 0064 | Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic Graphs Manuscript
Henry Garrett, “Some Polynomials Related to Numbers in Classes of (Strong) Neutrosophic

2022 0063 | Finding Shortest Sequences of Consecutive Vertices in Neutrosophic Graphs Manuscript
Henry Garrett, “Finding Shortest Sequences of Consecutive Vertices in Neutrosophic

2022 0062 | Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs Manuscript
Henry Garrett, “Neutrosophic Girth Based On Crisp Cycle in Neutrosophic Graphs”,

2022 0061 | e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “e-Matching Number and e-Matching Polynomials in Neutrosophic Graphs”,

2022 0060 | Matching Polynomials in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Polynomials in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.33630.72002).
2022 0059 | Some Results in Classes Of Neutrosophic Graphs Manuscript
Henry Garrett, “Some Results in Classes Of Neutrosophic Graphs”, Preprints 2022,

2022030248 (doi: 10.20944/preprints202203.0248.v1).
2022 0058 | Matching Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Matching Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18609.86882).
3708
2022 0057 | Fuzzy Dominating Number Based On Fuzzy Bridge And Applicaions Article
M. Hamidi, and M. Nikfar, “Fuzzy Dominating Number Based On Fuzzy

Bridge And Applicaions”, Fuzzy Systems and its Applications 4(2) (2022) 205-229
(https://doi.org/10.22034/jfsa.2022.306606.1092).
Oct 2018 0056 | The Effects of Mathematics on Computer Sciences Conference Article
M. Nikfar, “The Effects of Mathematics on Computer Sciences”, Second Conference

on the Education and Applications of Mathematics, Kermanshah, Iran, 2018
(https://en.civilica.com/doc/824659).
2022 0055 | (Failed) 1-clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Clique Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.14241.89449).
2022 0054 | Failed Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.36039.16800).
2022 0053 | Clique Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Clique Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.28338.68800).
2022 0052 | (Failed) 1-independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “(Failed) 1-Independent Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.30593.12643).
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, Preprints 2022,

2022020334 (doi: 10.20944/preprints202202.0334.v2)
2022 0051 | Failed Independent Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Independent Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.31196.05768).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, Preprints 2022, 2022020334 (doi:
10.20944/preprints202202.0334.v1).
2022 0050 | Independent Set in Neutrosophic Graphs Manuscript
Henry Garrett, “Independent Set in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17472.81925).
2022 0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs Manuscript

3709
Henry Garrett, “(Failed)1-Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.35241.26724).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, Preprints 2022,

2022020343 (doi: 10.20944/preprints202202.0343.v1).
2022 0048 | Failed Zero-Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Failed Zero-Forcing Number in Neutrosophic Graphs”, ResearchGate 2022

(doi: 10.13140/RG.2.2.24873.47209).
2022 0047 | Zero Forcing Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Zero Forcing Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.32265.93286).
2022 0046 | Quasi-Number in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Number in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.18470.60488).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in Neutrosophic Graphs”, Preprints 2022, 2022020100 (doi:

10.20944/preprints202202.0100.v1).
2022 0045 | Quasi-Degree in Neutrosophic Graphs Manuscript
Henry Garrett, “Quasi-Degree in ResearchGate 2022 (doi: 10.13140/RG.2.2.25460.01927).

2022 0044 | Co-Neighborhood in Neutrosophic Graphs Manuscript
Henry Garrett, “Co-Neighborhood in Neutrosophic Graphs”, ResearchGate 2022 (doi:

10.13140/RG.2.2.17687.44964).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
2022 0043 | Global Powerful Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Powerful Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.31784.24322).
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, Preprints 2022,
2022010429 (doi: 10.20944/preprints202201.0429.v1).
3710
2022 0042 | Global Offensive Alliance in Strong Neutrosophic Graphs Manuscript
Henry Garrett, “Global Offensive Alliance in Strong Neutrosophic Graphs”, ResearchGate

2022 (doi: 10.13140/RG.2.2.26541.20961).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, Preprints 2022, 2022010239 (doi: 10.20944/preprints202201.0239.v1).
2022 0041 | Three Types of Neutrosophic Alliances based on Connectedness and (Strong) Edges Manuscript
Henry Garrett, “Three Types of Neutrosophic Alliances based on Connectedness and (Strong)
Edges”, ResearchGate 2022 (doi: 10.13140/RG.2.2.18486.83521).
2022 0040 | Three types of neutrosophic alliances based of connectedness and (strong) edges (In-Progress) Manuscript
Henry Garrett, “Three types of neutrosophic alliances based of connectedness and (strong)
edges (In-Progress)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.27570.12480).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving and
(Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”, Preprints
2022, 2022010145 (doi: 10.20944/preprints202201.0145.v1).
2022 0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring Manuscript
Henry Garrett, “Closing Numbers and Super-Closing Numbers as (Dual)Resolving
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph”,
ResearchGate 2022 (doi: 10.13140/RG.2.2.18909.54244/1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”, Preprints

2022, 2022010027 (doi: 10.20944/preprints202201.0027.v1).
2022 0038 | Co-degree and Degree of classes of Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Co-degree and Degree of classes of Neutrosophic Hypergraphs”,

2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, Preprints 2021, 2021120448 (doi: 10.20944/preprints202112.0448.v1).
2021 0037 | Dimension and Coloring alongside Domination in Neutrosophic Hypergraphs Manuscript
Henry Garrett, “Dimension and Coloring alongside Domination in Neutrosophic

Hypergraphs”, ResearchGate 2021 (doi: 10.13140/RG.2.2.13070.28483).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript

3711
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, Preprints 2021,

2021120335 (doi: 10.20944/preprints202112.0335.v1).
2021 0036 | Different Types of Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Different Types of Neutrosophic Chromatic Number”, ResearchGate 2021

(doi: 10.13140/RG.2.2.19068.46723).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, Preprints 2021,

2021120226 (doi: 10.20944/preprints202112.0226.v1).
2021 0035 | Neutrosophic Chromatic Number Based on Connectedness Manuscript
Henry Garrett, “Neutrosophic Chromatic Number Based on Connectedness”, ResearchGate

2021 (doi: 10.13140/RG.2.2.18563.84001).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, Preprints 2021,
2021120177 (doi: 10.20944/preprints202112.0177.v1).
2021 0034 | Chromatic Number and Neutrosophic Chromatic Number Manuscript
Henry Garrett, “Chromatic Number and Neutrosophic Chromatic Number”, ResearchGate

2021 (doi: 10.13140/RG.2.2.36035.73766).
2021 0033 | Metric Dimension in fuzzy(neutrosophic) Graphs #12 Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs #12”, ResearchGate 2021

(doi: 10.13140/RG.2.2.20690.48322).

(doi: 10.13140/RG.2.2.29308.46725).

(doi: 10.13140/RG.2.2.21614.54085).

(doi: 10.13140/RG.2.2.34040.16648).

(doi: 10.13140/RG.2.2.19464.96007).
3712
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, ResearchGate 2021

(doi: 10.13140/RG.2.2.14667.72481).
2021 0028 | Metric Dimension in fuzzy(neutrosophic) Graphs-VII Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VII”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v7).
2021 0027 | Metric Dimension in fuzzy(neutrosophic) Graphs-VI Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-VI”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v6).
2021 0026 | Metric Dimension in fuzzy(neutrosophic) Graphs-V Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-V”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v5).
2021 0025 | Metric Dimension in fuzzy(neutrosophic) Graphs-IV Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-IV”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v4).
2021 0024 | Metric Dimension in fuzzy(neutrosophic) Graphs-III Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-III”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v3).
2021 0023 | Metric Dimension in fuzzy(neutrosophic) Graphs-II Manuscript
Henry Garrett, “Metric Dimension in fuzzy(neutrosophic) Graphs-II”, Preprints 2021,

2021110142 (doi: 10.20944/preprints202111.0142.v2).
2021 0022 | Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs Manuscript
Henry Garrett, “Metric Dimension in Fuzzy Graphs and Neutrosophic Graphs”, Preprints
2021, 2021110142 (doi: 10.20944/preprints202111.0142.v1)
2021 0021 | Valued Number And Set Manuscript
Henry Garrett, “Valued Number And Set”, Preprints 2021, 2021080229 (doi:
10.20944/preprints202108.0229.v1).
2021 0020 | Notion of Valued Set Manuscript
Henry Garrett, “Notion of Valued Set”, Preprints 2021, 2021070410 (doi:

10.20944/preprints202107.0410.v1).
2021 0019 | Set And Its Operations Manuscript
Henry Garrett, “Set And Its Operations”, Preprints 2021, 2021060508 (doi:
10.20944/preprints202106.0508.v1).
3713
2021 0018 | Metric Dimensions Of Graphs Manuscript
Henry Garrett, “Metric Dimensions Of Graphs”, Preprints 2021, 2021060392 (doi:

10.20944/preprints202106.0392.v1).
2021 0017 | New Graph Of Graph Manuscript
Henry Garrett, “New Graph Of Graph”, Preprints 2021, 2021060323 (doi:

10.20944/preprints202106.0323.v1).
2021 0016 | Numbers Based On Edges Manuscript
Henry Garrett, “Numbers Based On Edges”, Preprints 2021, 2021060315 (doi:

10.20944/preprints202106.0315.v1).
2021 0015 | Locating And Location Number Manuscript
Henry Garrett, “Locating And Location Number”, Preprints 2021, 2021060206 (doi:
10.20944/preprints202106.0206.v1).
2021 0014 | Big Sets Of Vertices Manuscript
Henry Garrett, “Big Sets Of Vertices”, Preprints 2021, 2021060189 (doi:

10.20944/preprints202106.0189.v1).
2021 0013 | Matroid And Its Outlines Manuscript
Henry Garrett, “Matroid And Its Outlines”, Preprints 2021, 2021060146 (doi:
10.20944/preprints202106.0146.v1).
2021 0012 | Matroid And Its Relations Manuscript
Henry Garrett, “Matroid And Its Relations”, Preprints 2021, 2021060080 (doi:
10.20944/preprints202106.0080.v1).
2021 0011 | Metric Number in Dimension Manuscript
Henry Garrett, “Metric Number in Dimension”, Preprints 2021, 2021060004 (doi:

10.20944/preprints202106.0004.v1).
2018 0010 | A Study on Domination in two Fuzzy Models Manuscript
M. Nikfar, “A Study on Domination in two Fuzzy Models”, Preprints 2018, 2018040119 (doi:
10.20944/preprints201804.0119.v2).
2019 0009 | Nikfar Domination Versus Others: Restriction, Extension Theorems and Monstrous Examples Manuscript
M. Nikfar, “Nikfar Domination Versus Others: Restriction, Extension Theorems and

Monstrous Examples”, Preprints 2019, 2019010024 (doi: 10.20944/preprints201901.0024.v3).
2019 0008 | Nikfar Dominations: Definitions, Theorems, and Connections Manuscript
M. Nikfar, “Nikfar Dominations: Definitions, Theorems, and Connections”, ResearchGate

2019 (doi: 10.13140/RG.2.2.28955.31526/1).
3714
2019 0007 | Nikfar Domination in Fuzzy Graphs Manuscript
M. Nikfar, “Nikfar Domination in Fuzzy Graphs”, Preprints 2019, 2019010024 (doi:

10.20944/preprints201901.0024.v2).

10.20944/preprints201901.0024.v2).
2018 0005 | The Results on Vertex Domination in Fuzzy Graphs Manuscript
M. Nikfar, “The Results on Vertex Domination in Fuzzy Graphs”, Preprints 2018, 2018040085
(doi: 10.20944/preprints201804.0085.v2).

10.20944/preprints201901.0024.v1).
2019 0003 | Nikfar Domination in Neutrosophic Graphs Manuscript
M. Nikfar, “Nikfar Domination in Neutrosophic Graphs”, Preprints 2019, 2019010025 (doi:

10.20944/preprints201901.0025.v1).
2018 0002 | Vertex Domination in t-Norm Fuzzy Graphs Manuscript
M. Nikfar, “Vertex Domination in t-Norm Fuzzy Graphs”, Preprints 2018, 2018040119 (doi:
10.20944/preprints201804.0119.v1).
2018 0001 | The Results on Vertex Domination in Fuzzy Graphs Manuscript
M. Nikfar, “The Results on Vertex Domination in Fuzzy Graphs”, Preprints 2018, 2018040085
(doi: 10.20944/preprints201804.0085.v1).
3715
Publications: Books
2023 0069 | SuperHyperMatching Amazon
ASIN : B0BSDPXX1P Publisher : Independently published (January 15, 2023) Language

: English Paperback : 582 pages ISBN-13 : 979-8373872683 Item Weight : 3.6 pounds
Dimensions : 8.5 x 1.37 x 11 inches
ASIN : B0BSDC1L66 Publisher : Independently published (January 16, 2023) Language
: English Hardcover : 548 pages ISBN-13 : 979-8373875424 Item Weight : 3.3 pounds
2023 0068 | Failed SuperHyperClique Amazon
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language

ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
2023 0067 | SuperHyperClique Amazon
ASIN : B0BRWK4S1Y Publisher : Independently published (January 8, 2023) Language

ASIN : B0BRM24YJX Publisher : Independently published (January 8, 2023) Language :
English Hardcover : 388 pages ISBN-13 : 979-8373041935 Item Weight : 2.36 pounds Dimensions
: 8.25 x 1.1 x 11 inches
2023 0066 | Failed SuperHyperStable Amazon
ASIN : B0BRNG7DC8 Publisher : Independently published (January 4, 2023) Language

ASIN : B0BRLVN39L Publisher : Independently published (January 4, 2023) Language :
: 8.25 x 0.91 x 11 inches
2023 0065 | SuperHyperStable Amazon
ASIN : B0BRDG5Z4Y Publisher : Independently published (January 2, 2023) Language

Dimensions : 8.27 x 0.7 x 11.69 inches
ASIN : B0BRJPG56M Publisher : Independently published (January 2, 2023) Language :
: 8.25 x 0.87 x 11 inches
2023 0064 | Failed SuperHyperForcing Amazon
ASIN : B0BRH5B4QM Publisher : Independently published (January 1, 2023) Language

ASIN : B0BRGX4DBJ Publisher : Independently published (January 1, 2023) Language :
: 8.25 x 0.98 x 11 inches
2022 0063 | SuperHyperForcing Amazon
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language
3716
2022 0062 | SuperHyperAlliances Amazon
ASIN : B0BR6YC3HG Publisher : Independently published (December 27, 2022) Language

ASIN : B0BR7CBTC6 Publisher : Independently published (December 27, 2022) Language :
: 8.25 x 0.64 x 11 inches
2022 0061 | SuperHyperGraphs Amazon
ASIN : B0BR1NHY4Z Publisher : Independently published (December 24, 2022) Language :

English Paperback : 117 pages ISBN-13 : 979-8371090133 Item Weight : 13 ounces Dimensions
: 8.5 x 0.28 x 11 inches
ASIN : B0BQXTHTXY Publisher : Independently published (December 24, 2022) Language :
English Hardcover : 117 pages ISBN-13 : 979-8371093240 Item Weight : 12.6 ounces Dimensions
: 8.25 x 0.47 x 11 inches
2022 0060 | Neut. SuperHyperEdges Amazon
ASIN : B0BNH11ZDY Publisher : Independently published (November 27, 2022) Language :

: 8.5 x 0.26 x 11 inches
ASIN : B0BNGZGPP6 Publisher : Independently published (November 27, 2022) Language :
: 8.25 x 0.45 x 11 inches
2022 0059 | Neutrosophic k-Number Amazon
ASIN : B0BF3P5X4N Publisher : Independently published (September 14, 2022) Language

ASIN : B0BF2XCDZM Publisher : Independently published (September 14, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0058 | Neutrosophic Schedule Amazon
ASIN : B0BBJWJJZF Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJLPWKH Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1.35 x 11 inches
2022 0057 | Neutrosophic Wheel Amazon
ASIN : B0BBJRHXXG Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBK3KG82 Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.65 x 11 inches
2022 0056 | Neutrosophic t-partite Amazon
ASIN : B0BBJLZCHS Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBJDFGJS Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.75 x 11 inches
2022 0055 | Neutrosophic Bipartite Amazon

3717
ASIN : B0BB5Z9GHW Publisher : Independently published (August 22, 2022) Language

ASIN : B0BBGG9RDZ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.72 x 11 inches
2022 0054 | Neutrosophic Star Amazon
ASIN : B0BB5ZHSSZ Publisher : Independently published (August 22, 2022) Language :

English Paperback : 215 pages ISBN-13 : 979-8847794374 Item Weight : 1.4 pounds Dimensions
: 8.5 x 0.51 x 11 inches
ASIN : B0BBC4BL9P Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 0.7 x 11 inches
2022 0053 | Neutrosophic Cycle Amazon
ASIN : B0BB62NZQK Publisher : Independently published (August 22, 2022) Language

ASIN : B0BB65QMKQ Publisher : Independently published (August 22, 2022) Language :
: 8.25 x 1 x 11 inches
2022 0052 | Neutrosophic Path Amazon
ASIN : B0BB67WCXL Publisher : Independently published (August 8, 2022) Language :

English Paperback : 315 pages ISBN-13 : 979-8847730570 Item Weight : 2 pounds Dimensions
: 8.5 x 0.74 x 11 inches
ASIN : B0BB5Z9FXL Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.93 x 11 inches
2022 0051 | Neutrosophic Complete Amazon
ASIN : B0BB6191KN Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB5RRQN7 Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 0.73 x 11 inches
2022 0050 | Neutrosophic Dominating Amazon
ASIN : B0BB5QV8WT Publisher : Independently published (August 8, 2022) Language

ASIN : B0BB61WL9M Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.03 x 11 inches
2022 0049 | Neutrosophic Resolving Amazon
ASIN : B0BBCJMRH8 Publisher : Independently published (August 8, 2022) Language

ASIN : B0BBCB6DFC Publisher : Independently published (August 8, 2022) Language :
: 8.25 x 1.06 x 11 inches
2022 0048 | Neutrosophic Stable Amazon

3718
ASIN : B0B7QGTNFW Publisher : Independently published (July 28, 2022) Language :

English Paperback : 133 pages ISBN-13 : 979-8842880348 Item Weight : 14.6 ounces Dimensions
: 8.5 x 0.32 x 11 inches
ASIN : B0B7QJWQ35 Publisher : Independently published (July 28, 2022) Language :
: 8.25 x 0.51 x 11 inches
2022 0047 | Neutrosophic Total Amazon
ASIN : B0B7GLB23F Publisher : Independently published (July 25, 2022) Language : English
Paperback : 137 pages ISBN-13 : 979-8842357741 Item Weight : 14.9 ounces Dimensions : 8.5
x 0.33 x 11 inches
ASIN : B0B6XVTDYC Publisher : Independently published (July 25, 2022) Language :
: 8.25 x 0.52 x 11 inches
2022 0046 | Neutrosophic Perfect Amazon
ASIN : B0B7CJHCYZ Publisher : Independently published (July 22, 2022) Language :

: 8.5 x 0.3 x 11 inches
ASIN : B0B7C732Z1 Publisher : Independently published (July 22, 2022) Language : English
Hardcover : 127 pages ISBN-13 : 979-8842028757 Item Weight : 13.6 ounces Dimensions : 8.25
x 0.49 x 11 inches
2022 0045 | Neutrosophic Joint Set Amazon
ASIN : B0B6L8WJ77 Publisher : Independently published (July 15, 2022) Language : English
Paperback : 139 pages ISBN-13 : 979-8840802199 Item Weight : 15 ounces Dimensions : 8.5 x
0.33 x 11 inches
ASIN : B0B6L9GJWR Publisher : Independently published (July 15, 2022) Language :
: 8.25 x 0.52 x 11 inches
August 30, 0044 | Neutrosophic Duality GLOBAL

2022 KNOWLEDGE -
Publishing
House&Amazon&Google
Scholar&UNM
Neutrosophic Duality, GLOBAL KNOWLEDGE - Publishing House:
GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131
United States. ISBN: 978-1-59973-743-0
Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE - Publishing
House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 978-1-59973-743-0
(http://fs.unm.edu/NeutrosophicDuality.pdf).
ASIN : B0B4SJ8Y44 Publisher : Independently published (June 22, 2022) Language : English
Paperback : 115 pages ISBN-13 : 979-8837647598 Item Weight : 12.8 ounces Dimensions : 8.5
x 0.27 x 11 inches
ASIN : B0B46B4CXT Publisher : Independently published (June 22, 2022) Language : English
Hardcover : 115 pages ISBN-13 : 979-8837649981 Item Weight : 12.5 ounces Dimensions : 8.25
x 0.46 x 11 inches
GLOBAL KNOWLEDGE - Publishing House: http://fs.unm.edu/NeutrosophicDuality.pdf
UNM: http://fs.unm.edu/NeutrosophicDuality.pdf
Google Scholar: https://books.google.com/books?id=dWWkEAAAQBAJ
Paperback: https://www.amazon.com/dp/B0B4SJ8Y44
Hardcover: https://www.amazon.com/dp/B0B46B4CXT
2022 0043 | Neutrosophic Path-Coloring Amazon
3719
ASIN : B0B3F2BZC4 Publisher : Independently published (June 7, 2022) Language : English

Paperback : 161 pages ISBN-13 : 979-8834894469 Item Weight : 1.08 pounds Dimensions : 8.5
x 0.38 x 11 inches
ASIN : B0B3FGPGQ3 Publisher : Independently published (June 7, 2022) Language :
: 8.25 x 0.57 x 11 inches
2022 0042 | Neutrosophic Density Amazon
ASIN : B0B19CDX7W Publisher : Independently published (May 15, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B0B14PLPGL Publisher : Independently published (May 15, 2022) Language :
: 8.25 x 0.53 x 11 inches
2022 0041 | Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Google Commerce Ltd
Publisher Infinite Study Seller Google Commerce Ltd Published on Apr 27, 2022 Pages
30 Features Original pages Best for web, tablet, phone, eReader Language English Genres
Antiques & Collectibles / Reference Content protection This content is DRM free GooglePlay
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph Front Cover Henry
Garrett Infinite Study, 27 Apr 2022 - Antiques & Collectibles - 30 pages GoogleBooks
Henry Garrett, “Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph”,
Neutrosophic Sets and Systems 49 (2022) 531-561 (doi: 893 10.5281/zenodo.6456413).
(http://fs.unm.edu/NSS/NeutrosophicSuperHyperGraph34.pdf).
2022 0040 | Neutrosophic Connectivity Amazon
ASIN : B09YQJG2ZV Publisher : Independently published (April 26, 2022) Language :

: 8.5 x 0.29 x 11 inches
ASIN : B09YQJG2DZ Publisher : Independently published (April 26, 2022) Language :
: 8.25 x 0.48 x 11 inches
2022 0039 | Neutrosophic Cycles Amazon
ASIN : B09X4KVLQG Publisher : Independently published (April 8, 2022) Language

ASIN : B09X4LZ3HL Publisher : Independently published (April 8, 2022) Language : English
Hardcover : 169 pages ISBN-13 : 979-8449144157 Item Weight : 1.09 pounds Dimensions : 8.25
x 0.59 x 11 inches
2022 0038 | Girth in Neutrosophic Graphs Amazon
ASIN : B09WQ5PFV8 Publisher : Independently published (March 29, 2022) Language

ASIN : B09WQQGXPZ Publisher : Independently published (March 29, 2022) Language :
: 8.25 x 0.58 x 11 inches
2022 0037 | Matching Number in Neutrosophic Graphs Amazon
ASIN : B09W7FT8GM Publisher : Independently published (March 22, 2022) Language

ASIN : B09W4HF99L Publisher : Independently published (March 22, 2022) Language :
English Hardcover : 153 pages ISBN-13 : 979-8437539057 Item Weight : 1 pounds Dimensions
: 8.25 x 0.55 x 11 inches
3720
2022 0036 | Clique Number in Neutrosophic Graph Amazon
ASIN : B09TV82Q7T Publisher : Independently published (March 7, 2022) Language

ASIN : B09TZBPWJG Publisher : Independently published (March 7, 2022) Language :
: 8.25 x 0.56 x 11 inches
2022 0035 | Independence in Neutrosophic Graphs Amazon
ASIN : B09TF227GG Publisher : Independently published (February 27, 2022) Language :

English Paperback : 149 pages ISBN-13 : 979-8424231681 Item Weight : 1 pounds Dimensions
: 8.5 x 0.35 x 11 inches
ASIN : B09TL1LSKD Publisher : Independently published (February 27, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0034 | Zero Forcing Number in Neutrosophic Graphs Amazon
ASIN : B09SW2YVKB Publisher : Independently published (February 18, 2022) Language :

: 8.5 x 0.35 x 11 inches
ASIN : B09SWLK7BG Publisher : Independently published (February 18, 2022) Language :
: 8.25 x 0.54 x 11 inches
2022 0033 | Neutrosophic Quasi-Order Amazon
ASIN : B09S3RXQ5C Publisher : Independently published (February 8, 2022) Language :

: 8.5 x 0.26 x 11 inches
ASIN : B09S232DQH Publisher : Independently published (February 8, 2022) Language :
: 8.25 x 0.43 x 11 inches
Jan 29, 2022 0032 | Beyond Neutrosophic Graphs E-

publishing&Amazon&Google
Scholar&UNM
Beyond Neutrosophic Graphs, E-publishing:
Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States
ISBN 978-1-59973-725-6
Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-
59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf).
ASIN : B0BBCQJQG5 Publisher : Independently published (August 8, 2022) Language
ASIN : B0BBC4BJZ5 Publisher : Independently published (August 8, 2022) Language : English
Hardcover : 257 pages ISBN-13 : 979-8847567497 Item Weight : 1.61 pounds Dimensions : 8.25
x 0.8 x 11 inches
E-publishing: Educational Publisher: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
UNM: http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf
Google Scholar:https://books.google.com/books?id=cWWkEAAAQBAJ
Paperback: https://www.amazon.com/gp/product/B0BBCQJQG5
Hardcover: https://www.amazon.com/Beyond-Neutrosophic-Graphs-Henry-
Garrett/dp/B0BBC4BJZ5
2022 0031 | Neutrosophic Alliances Amazon

3721
ASIN : B09RB5XLVB Publisher : Independently published (January 26, 2022) Language :
: 8.5 x 0.21 x 11 inches
ASIN : B09R39MTSW Publisher : Independently published (January 26, 2022) Language :

: 8.25 x 0.4 x 11 inches
2022 0030 | Neutrosophic Hypergraphs Amazon
ASIN : B09PMBKVD4 Publisher : Independently published (January 7, 2022) Language :

: 8.5 x 0.19 x 11 inches
ASIN : B09PP8VZ3D Publisher : Independently published (January 7, 2022) Language :
: 8.25 x 0.38 x 11 inches
2022 0029 | Collections of Articles Amazon
-
ASIN : B09PHHDDQK Publisher : Independently published (January 2, 2022) Language :
: 8.25 x 1.47 x 11 inches
2022 0028 | Collections of Math Amazon
-
ASIN : B09PHBWT5D Publisher : Independently published (January 1, 2022) Language :
: 8.25 x 1.28 x 11 inches
2022 0027 | Collections of US Amazon
-
ASIN : B09PHBT924 Publisher : Independently published (December 31, 2021) Language :
: 8.25 x 0.81 x 11 inches
2021 0026 | Neutrosophic Chromatic Number Amazon
ASIN : B09NRD25MG Publisher : Independently published (December 20, 2021) Language

: English Paperback : 67 pages ISBN-13 : 979-8787858174 Item Weight : 8.2 ounces Dimensions
: 8.5 x 0.16 x 11 inches Language : English
-
2021 0025 | Simple Ideas Amazon
ASIN : B09MYTN6NT Publisher : Independently published (December 9, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0024 | Neutrosophic Graphs Amazon
ASIN : B09MYXVNF9 Publisher : Independently published (December 7, 2021) Language

: English Paperback : 55 pages ISBN-13 : 979-8780775652 Item Weight : 7 ounces Dimensions
: 8.5 x 0.13 x 11 inches
-
2021 0023 | List Amazon
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
3722
2021 0022 | Theorems Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0021 | Dimension Amazon
ASIN : B09K2BBQG7 Publisher : Independently published (October 25, 2021) Language :

English Paperback : 55 pages ISBN-13 : 979-8753577146 Item Weight : 7 ounces Dimensions :
8.5 x 0.13 x 11 inches
-
2021 0020 | Beyond The Graph Theory Amazon
ASIN : B09KDZXGPR Publisher : Independently published (October 28, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
2021 0019 | Located Heart And Memories Amazon
ASIN : B09F14PL8T Publisher : Independently published (August 31, 2021) Language :

8.5 x 0.14 x 11 inches
-
2021 0018 | Number Graphs And Numbers Amazon
ASIN : B099BQRSF8 Publisher : Independently published (July 14, 2021) Language : English
Paperback : 32 pages ISBN-13 : 979-8537474135 Item Weight : 4.8 ounces Dimensions : 8.5 x
0.08 x 11 inches
-
2021 0017 | First Place Is Reserved Amazon
ASIN : B098CWD5PT Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.13 x 11 inches
-
2021 0016 | Detail-oriented Groups And Ideas Amazon
ASIN : B098CYYG3Q Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.17 x 11 inches
-
2021 0015 | Definition And Its Necessities Amazon
ASIN : B098DHRJFD Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.19 x 11 inches
-
2021 0014 | Words And Their Directionss Amazon
ASIN : B098CYS8G2 Publisher : Independently published (June 30, 2021) Language :

8.5 x 0.16 x 11 inches
-
2021 0013 | Tattooed Heart But Forever Amazon

3723
ASIN : B098CR8HM6 Publisher : Independently published (June 30, 2021) Language :

: 8.5 x 0.11 x 11 inches
-
2021 0012 | Metric Number In Dimension Amazon
ASIN : B0913597TV Publication date : March 24, 2021 Language : English File size : 28445
KB Text-to-Speech : Enabled Enhanced typesetting : Enabled X-Ray : Not Enabled Word
Wise : Not Enabled Print length : 48 pages Lending : Not Enabled Kindle
-
2021 0011 | Domination Theory And Beyond Amazon
ASIN : B098DMMZ87 Publisher : Independently published (June 30, 2021) Language

-
2021 0010 | Vital Glory Amazon
ASIN : B08PVNJYRM Publication date : December 6, 2020 Language : English File size
: 1544 KB Simultaneous device usage : Unlimited Text-to-Speech : Enabled Screen Reader :
Supported Enhanced typesetting : Enabled X-Ray : Not Enabled Word Wise : Enabled Print
length : 24 pages Lending : Enabled Kindle
-
2021 0009 | Análisis de modelos y orientación más allá AmazonUK&MoreBooks
Análisis de modelos y orientación más allá Planteamiento y problemas en dos modelos

Ediciones Nuestro Conocimiento (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59902-
2 ISBN-10:6203599026EAN:9786203599022Book language:Blurb/Shorttext:El enfoque para la
resolución de problemas es una selección obvia para hacer la investigación y el análisis de la
situación que puede provocar las perspectivas vagas que queremos no ser para extraer ideas
creativas y nuevas que queremos ser. Estudio simultáneamente dos modelos. Este estudio se
basa tanto en la investigación como en la discusión que el autor piensa que puede ser útil
para entender y hacer crecer nuestra fantası́a y la realidad juntas.Publishing house: Ediciones
Nuestro Conocimiento Website: https://sciencia-scripts.com By (author) : Henry Garrett
Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Dos modelos, optimización de rutas y transporte, Two Models, Optimizing Routes
and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/análisis-de-modelos-y-orientación-más-
allá/isbn/978-620-3-59902-2
Product details Publisher : Ediciones Nuestro Conocimiento (6 April 2021) Language :
Spanish ISBN-10 : 6203599026 ISBN-13 : 978-6203599022 Dimensions : 15 x 0.4 x 22 cm
Paperback:
https://www.amazon.co.uk/Análisis-modelos-orientación-allá-Planteamiento/dp/6203599026
2021 0008 | Анализ моделей и руководство за пределами Amazon&MoreBooks

3724
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-
лях Sciencia Scripts (2021-04-06) eligible for voucher ISBN-13: 978-620-3-59908-4 ISBN-
10:6203599085EAN:9786203599084Book language: Russian Blurb/Shorttext:Подход к реше-
нию проблем является очевидным выбором для проведения исследований и анализа си-
туации, которая может вызвать смутные перспективы, которыми мы не хотим быть для
извлечения творческих и новых идей, которыми мы хотим быть. Я одновременно изучаю
две модели. Это исследование основано как на исследовании, так и на обсуждении, кото-
рое, по мнению автора, может быть полезным для понимания и развития наших фантазий
и реальности вместе.Publishing house: Sciencia Scripts Website: https://sciencia-scripts.com
By (author) : Генри Гарретт Number of pages:68Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Две модели, оптимизация маршрутов и
транспорта, Two Models, Optimizing Routes and Transportation
MoreBooks
https://www.morebooks.shop/store/gb/book/анализ-моделей-и-руководство-за-
пределами/isbn/978-620-3-59908-4
Анализ моделей и руководство за пределами: Подход и проблемы в двух моделях

(Russian Edition) Publisher : Sciencia Scripts (April 6, 2021) Language : Russian Paperback :
68 pages ISBN-10 : 6203599085 ISBN-13 : 978-6203599084 Item Weight : 5.3 ounces Dimensions
: 5.91 x 0.16 x 8.66 inches
2021 0007 | Análise e Orientação de Modelos Além Amazon | MoreBooks |

Walmart
Análise e Orientação de Modelos Além Abordagem e Problemas em Dois Modelos Edições
Nosso Conhecimento (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59907-7 ISBN-
10:6203599077EAN:9786203599077Book language:Blurb/Shorttext:A abordagem para resolver
problemas é uma seleção óbvia para fazer pesquisa e análise da situação, que pode trazer
as perspectivas vagas que queremos não ser para extrair idéias criativas e novas idéias que
queremos ser. Eu estudo simultaneamente dois modelos. Este estudo é baseado tanto na
pesquisa como na discussão que o autor pensa que pode ser útil para compreender e fazer crescer
juntos a nossa fantasia e realidade.Publishing house: Edições Nosso Conhecimento Website:
https://sciencia-scripts.com By (author) : Henry Garrett Number of pages:64Published
on:2021-04-06Stock:Available Category: Mathematics Price:39.90 Keywords:Dois Modelos,
Otimização de Rotas e Transporte, Two Models, Optimizing Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/análise-e-orientação-de-modelos-
além/isbn/978-620-3-59907-7
Henry Garrett Análise e Orientação de Modelos Além (Paperback) About this item
Product details
A abordagem para resolver problemas é uma seleção óbvia para fazer pesquisa e análise da
situação, que pode trazer as perspectivas vagas que queremos não ser para extrair idéias
criativas e novas idéias que queremos ser. Eu estudo simultaneamente dois modelos. Este
estudo é baseado tanto na pesquisa como na discussão que o autor pensa que pode ser útil
para compreender e fazer crescer juntos a nossa fantasia e realidade. Análise e Orientação de
Modelos Além (Paperback) We aim to show you accurate product information. Manufacturers,
suppliers and others provide what you see here, and we have not verified it. See our disclaimer
Specifications
Language Portuguese Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 64 Author Henry Garrett Title Análise e Orientação de Modelos Além ISBN-13
9786203599077 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599077 Walmart
Análise e Orientação de Modelos Além: Abordagem e Problemas em Dois Modelos

(Portuguese Edition) Publisher : Edições Nosso Conhecimento (April 6, 2021) Language :
Portuguese Paperback : 64 pages ISBN-10 : 6203599077 ISBN-13 : 978-6203599077 Item Weight
: 3.67 ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0006 | Analizy modelowe i wytyczne wykraczaja˛ce poza Amazon&MoreBooks

3725
Analizy modelowe i wytyczne wykraczaja˛ce poza Podejście i problemy w dwóch
modelach Wydawnictwo Nasza Wiedza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-
59906-0 ISBN-10:6203599069EAN:9786203599060Book language:Blurb/Shorttext:Podejście do
rozwia˛zywania problemów jest oczywistym wyborem do prowadzenia badań i analizowania
sytuacji, które moga˛ wywo lywać niejasne perspektywy, których nie chcemy dla wydobycia
kreatywnych i nowych pomys lów, które chcemy. I jednocześnie studiować dwa modele.
Badanie to oparte jest zarówno na badaniach jak i dyskusji, które zdaniem autora moga˛
być przydatne do zrozumienia i rozwoju naszych fantazji i rzeczywistości razem.Publishing
house: Wydawnictwo Nasza Wiedza Website: https://sciencia-scripts.com By (author) : Henry
Garrett Number of pages:64Published on:2021-04-06Stock:Available Category: Mathematics
Price:39.90 Keywords:Dwa modele, optymalizacja tras i transportu, Two Models, Optimizing
Routes and Transportation
MoreBooks:
https://www.morebooks.shop/store/gb/book/analizy-modelowe-i-wytyczne-wykraczaja˛ce-
poza/isbn/978-620-3-59906-0
Analizy modelowe i wytyczne wykraczaja˛ce poza: Podejście i problemy w dwóch modelach
(Polish Edition) Publisher : Wydawnictwo Nasza Wiedza (April 6, 2021) Language : Polish
Paperback : 64 pages ISBN-10 : 6203599069 ISBN-13 : 978-6203599060 Item Weight : 3.67
ounces Dimensions : 5.91 x 0.15 x 8.66 inches
2021 0005 | Modelanalyses en begeleiding daarna Amazon&MoreBooks
Modelanalyses en begeleiding daarna Aanpak en problemen in twee modellen

Uitgeverij Onze Kennis (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59905-3
ISBN-10:6203599050EAN:9786203599053Book language:Blurb/Shorttext:De aanpak voor het
oplossen van problemen is een voor de hand liggende keuze voor het doen van onderzoek en het
analyseren van de situatie die de vage perspectieven kan oproepen die we niet willen zijn voor
het extraheren van creatieve en nieuwe ideeën die we willen zijn. Ik bestudeer tegelijkertijd twee
modellen. Deze studie is gebaseerd op zowel onderzoek als discussie waarvan de auteur denkt dat
ze nuttig kunnen zijn voor het begrijpen en laten groeien van onze fantasieën en de werkelijkheid
samen.Publishing house: Uitgeverij Onze Kennis Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Twee modellen, optimalisering van routes en transport,
Two Models, Optimizing Routes and Transportation
MoreBooks
Modelanalyses en begeleiding daarna: Aanpak en problemen in twee modellen (Dutch
Edition) Publisher : Uitgeverij Onze Kennis (April 6, 2021) Language : Dutch Paperback : 64
pages ISBN-10 : 6203599050 ISBN-13 : 978-6203599053 Item Weight : 3.99 ounces Dimensions
: 5.91 x 0.15 x 8.66 inches
2021 0004 | Analisi dei modelli e guida oltre Amazon | MoreBooks |

Walmart
3726
Analisi dei modelli e guida oltre Approccio e problemi in due modelli Edizioni
Sapienza (2021-04-06 ) eligible for voucher ISBN-13: 978-620-3-59904-6 ISBN-
10:6203599042EAN:9786203599046Book language:Blurb/Shorttext:L’approccio per risolvere
i problemi è una selezione ovvia per fare ricerca e analisi della situazione che può suscitare
le prospettive vaghe che non vogliamo essere per estrarre idee creative e nuove che vogliamo
essere. Studio contemporaneamente due modelli. Questo studio si basa sia sulla ricerca che
sulla discussione che l’autore pensa possa essere utile per capire e far crescere insieme la nostra
fantasia e la realtà.Publishing house: Edizioni Sapienza Website: https://sciencia-scripts.com
By (author) : Henry Garrett Number of pages:60Published on:2021-04-06Stock:Available
Category: Mathematics Price:39.90 Keywords:Due modelli, ottimizzazione dei percorsi e del
trasporto, Two Models, Optimizing Routes and Transportation
MoreBooks Henry Garrett Analisi dei modelli e guida oltre (Paperback) About this item
Product details
L’approccio per risolvere i problemi è una selezione ovvia per fare ricerca e analisi della
situazione che può suscitare le prospettive vaghe che non vogliamo essere per estrarre idee
creative e nuove che vogliamo essere. Studio contemporaneamente due modelli. Questo studio
si basa sia sulla ricerca che sulla discussione che l’autore pensa possa essere utile per capire e far
crescere insieme la nostra fantasia e la realtà. Analisi dei modelli e guida oltre (Paperback) We
aim to show you accurate product information. Manufacturers, suppliers and others provide
what you see here, and we have not verified it. See our disclaimer Specifications
Publisher KS Omniscriptum Publishing Book Format Paperback Number of Pages 60 Author
Henry Garrett Title Analisi dei modelli e guida oltre ISBN-13 9786203599046 Publication Date
April, 2021 Assembled Product Dimensions (L x W x H) 9.00 x 6.00 x 1.50 Inches ISBN-10
6203599042 Walmart
Analisi dei modelli e guida oltre: Approccio e problemi in due modelli (Italian Edition)
Publisher : Edizioni Sapienza (April 6, 2021) Language : Italian Paperback : 60 pages ISBN-10
: 6203599042 ISBN-13 : 978-6203599046 Item Weight : 3.53 ounces Dimensions : 5.91 x 0.14 x
8.66 inches
2021 0003 | Analyses de modèles et orientations au-delà Amazon | MoreBooks |

Walmart
Analyses de modèles et orientations au-delà Approche et problèmes dans deux
modèles Editions Notre Savoir (2021-04-06 ) eligible for voucher eligible for voucher
ISBN-13: 978-620-3-59903-9 ISBN-10:6203599034EAN:9786203599039Book language: French
Blurb/Shorttext:L’approche pour résoudre les problèmes est une sélection évidente pour faire
la recherche et l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne
voulons pas être pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie
simultanément deux modèles. Cette étude est basée à la fois sur la recherche et la discussion,
ce qui, selon l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité
ensemble.Publishing house: Editions Notre Savoir Website: https://sciencia-scripts.com By
(author) : Henry Garrett Number of pages:64Published on:2021-04-06Stock:Available Category:
Mathematics Price:39.90 Keywords:Two Models, Optimizing Routes and Transportation, Deux
modèles, optimisation des itinéraires et des transports
MoreBooks:
https://www.morebooks.shop/store/gb/book/analyses-de-modèles-et-orientations-au-
delà/isbn/978-620-3-59903-9
Henry Garrett Analyses de modèles et orientations au-delà (Paperback) About this item
Product details
L’approche pour résoudre les problèmes est une sélection évidente pour faire la recherche et
l’analyse de la situation qui peut éliciter les perspectives vagues que nous ne voulons pas être
pour extraire des idées créatives et nouvelles que nous voulons être. J’étudie simultanément
deux modèles. Cette étude est basée à la fois sur la recherche et la discussion, ce qui, selon
l’auteur, peut être utile pour comprendre et développer nos fantasmes et la réalité ensemble.
Analyses de modèles et orientations au-delà (Paperback) We aim to show you accurate product
information. Manufacturers, suppliers and others provide what you see here, and we have not
verified it. See our disclaimer Specifications
Language French Publisher KS Omniscriptum Publishing Book Format Paperback Number of
Pages 64 Author Henry Garrett Title Analyses de modèles et orientations au-delà ISBN-13
9786203599039 Publication Date April, 2021 Assembled Product Dimensions (L x W x H) 9.00
x 6.00 x 1.50 Inches ISBN-10 6203599034 Walmart
Analyses de modèles et orientations au-delà: Approche et problèmes dans deux modèles

(French Edition) Publisher : Editions Notre Savoir (April 6, 2021) Language : French Paperback
: 64 pages ISBN-10 : 6203599034 ISBN-13 : 978-6203599039 Item Weight : 3.67 ounces
Dimensions : 5.91 x 0.15 x 8.66 inches
3727
2021 0002 | Modell-Analysen und Anleitungen darüber hinaus Amazon | MoreBooks |
Walmart | eBay
eligible for voucher ISBN-13: 978-620-3-59901-5 ISBN-
10:6203599018EAN:9786203599015Book language: German Blurb/Shorttext:Die
Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann.Publishing house: Verlag
Unser Wissen Website: https://sciencia-scripts.com By (author) : Henry Garrett Number
of pages:68Published on:2021-04-06Stock:Available Category: Mathematics Price:39.90
Keywords:Zwei Modelle, Optimierung von Routen und Transport, Two Models, Optimizing
Routes and Transportation
MoreBooksHenry Garrett Modell-Analysen und Anleitungen darüber hinaus (Paperback)
About this item
Product details
Die Herangehensweise zur Lösung von Problemen ist eine offensichtliche Auswahl für die
Forschung und Analyse der Situation, die die vagen Perspektiven, die wir nicht sein wollen,
für die Extraktion von kreativen und neuen Ideen, die wir sein wollen, hervorbringen kann.
Ich studiere gleichzeitig zwei Modelle. Diese Studie basiert sowohl auf der Forschung als
auch auf der Diskussion, von der der Autor denkt, dass sie für das Verständnis und das
Zusammenwachsen unserer Fantasie und Realität nützlich sein kann. Modell-Analysen und
Anleitungen darüber hinaus (Paperback) We aim to show you accurate product information.
Manufacturers, suppliers and others provide what you see here, and we have not verified it.
See our disclaimer Specifications
Language German Publisher KS Omniscriptum Publishing Book Format Paperback Number
of Pages 68 Author Henry Garrett Title Modell-Analysen und Anleitungen darüber hinaus
ISBN-13 9786203599015 Publication Date April, 2021 Assembled Product Dimensions (L x W
x H) 9.00 x 6.00 x 1.50 Inches ISBN-10 6203599018
Walmart
Seller assumes all responsibility for this listing. Item specifics Condition: New: A new, unread,
unused book in perfect condition with no missing or damaged pages. See the ... Read
moreabout the condition ISBN: 9786203599015 EAN: 9786203599015 Publication Year: 2021
Type: Textbook Format: Paperback Language: German Publication Name: Modell-Analysen
Und Anleitungen Daruber Hinaus Item Height: 229mm Author: Henry Garrett Publisher:
Verlag Unser Wissen Item Width: 152mm Subject: Mathematics Item Weight: 113g Number of
Pages: 68 Pages About this product Product Information Die Herangehensweise zur Loesung
von Problemen ist eine offensichtliche Auswahl fur die Forschung und Analyse der Situation, die
die vagen Perspektiven, die wir nicht sein wollen, fur die Extraktion von kreativen und neuen
Ideen, die wir sein wollen, hervorbringen kann. Ich studiere gleichzeitig zwei Modelle. Diese
Studie basiert sowohl auf der Forschung als auch auf der Diskussion, von der der Autor denkt,
dass sie fur das Verstandnis und das Zusammenwachsen unserer Fantasie und Realitat nutzlich
sein kann. Product Identifiers Publisher Verlag Unser Wissen ISBN-13 9786203599015 eBay
Product ID (ePID) 11049032082 Product Key Features Publication Name Modell-Analysen
Und Anleitungen Daruber Hinaus Format Paperback Language German Subject Mathematics
Publication Year 2021 Type Textbook Author Henry Garrett Number of Pages 68 Pages
Dimensions Item Height 229mm Item Width 152mm Item Weight 113g Additional Product
Features Title_Author Henry Garrett
eBay
Modell-Analysen und Anleitungen darüber hinaus: Ansatz und Probleme in zwei Modellen
(German Edition) Publisher : Verlag Unser Wissen (April 6, 2021) Language : German
Paperback : 68 pages ISBN-10 : 6203599018 ISBN-13 : 978-6203599015 Item Weight : 3.99
ounces Dimensions : 5.91 x 0.16 x 8.66 inches Paperback
2021 0001 | Model Analyses and Guidance Beyond Amazon&MoreBooks

3728
Model Analyses and Guidance Beyond Approach and Problems in Two Models LAP
LAMBERT Academic Publishing (2020-12-02 ) eligible for voucher ISBN-13: 978-620-3-19506-
4 ISBN-10:6203195065EAN:9786203195064Book language: English Blurb/Shorttext:Approach
for solving problems is an obvious selection for doing research and analysis the situation
which may elicit the vague perspectives which we want not to be for extracting creative
and new ideas which we want to be. I simultaneously study two models. This study is based
both research and discussion which the author thinks that may be useful for understanding
and growing our fantasizing and reality together.Publishing house: LAP LAMBERT
Academic Publishing Website: https://www.lap-publishing.com/ By (author) : Henry Garrett
Number of pages:52Published on:2020-12-02Stock:Available Category: Mathematics Price:39.90
Keywords:Two Models, Optimizing Routes and Transportation
MoreBooks
Model Analyses and Guidance Beyond: Approach and Problems in Two Models Publisher :
LAP LAMBERT Academic Publishing (December 2, 2020) Language : English Paperback : 52
pages ISBN-10 : 6203195065 ISBN-13 : 978-6203195064 Item Weight : 3.39 ounces Dimensions
: 5.91 x 0.12 x 8.66 inches
3729
Participating in Seminars
I’ve participated in all virtual conferences which are listed below [Some of them without selective process].
–https://web.math.princeton.edu/ pds/onlinetalks/talks.html
...
Also, I’ve participated in following events [Some of them without selective process]:
-The Hidden NORMS seminar

-Talk Math With Your Friends (TMWYF)
-MATHEMATICS COLLOQUIUM: https://www.csulb.edu/mathematics-statistics/mathematics-colloquium
-Lathisms: Cafe Con Leche
-Big Math network
...
I’m in mailing list in following [Some of them without selective process] organizations:
-[Algebraic-graph-theory] AGT Seminar (lists-uwaterloo-ca)

-Combinatorics Lectures Online (https://web.math.princeton.edu/ pds/onlinetalks/talks.html)
-Women in Combinatorics
-CMSA-Seminar (unsw-au)
-OURFA2M2 Online Undergraduate Resource Fair for the Advancement and Alliance of Marginalized Mathematicians
...
3730
Social Accounts
I’ve listed my accounts below.
-My website [Covering all my contributions containing articles and books as free access to download with PDF
extension and more]: https://drhenrygarrett.wordpress.com
-Amazon [Some of my all books, here]: https://www.amzn.com/author/drhenrygarrett
-Twitter: @DrHenryGarrett (www.twitter.com/DrHenryGarrett)
– ResearchGate: https://www.researchgate.net/profile/Henry-Garrett-2
-Academia: https://independent.academia.edu/drhenrygarrett/
-Scribd: https://www.scribd.com/user/596815491/Henry-Garrett
-Scholar: https://scholar.google.com/citations?hl=enuser=SUjFCmcAAAAJviewo p = listw orkssortby = pubdate
− LinkedIn : https : //www.linkedin.com/in/drhenrygarrett/

3731
References
2017-2022 Dr. Henry Garrett WEBSITE
Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: DrHenryGarrett@gmail.com
2017-2022 Dr. Henry Garrett WEBSITE
Department of Mathematics, Independent Researcher, Manhattan, NY, USA.

E-mail address: HenryGarrettNY@gmail.com
DrHenryGarrett.wordpress.com · Twitter.com/DrHenryGarrett
3732

Super Hyper Join

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

Super Hyper Join

Uploaded by

Copyright:

Available Formats

SuperHyperJoin

Ideas | Approaches | Accessibility | Availability

Dr. Henry Garrett

5 New Ideas On Super connections By Hyper disconnections Of SuperHy-

8 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 49

10 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

11 The Extreme Departures on The Theoretical Results Toward Theoretical

12 The Surveys of Mathematical Sets On The Results But As The Initial

13 Extreme Applications in Cancer’s Extreme Recognition 99

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipartite

15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyperMul-

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 107

18 Neutrosophic SuperHyperJoin 113

19 New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

22 Applied Notions Under The Scrutiny Of The Motivation Of This Scientific

23 Neutrosophic Preliminaries Of This Scientific Research On the Redeemed

24 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

25 The Neutrosophic Departures on The Theoretical Results Toward Theor-

26 The Surveys of Mathematical Sets On The Results But As The Initial

27 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 183

28 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

29 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic Super-

Henry Garrett · Independent Researcher · Department of Mathematics ·

30 Wondering Open Problems But As The Directions To Forming The

31 Conclusion and Closing Remarks 191

32 Books’ Contributions 197

33 “SuperHyperGraph-Based Books”: | Featured Tweets 205

Henry Garrett · Independent Researcher · Department of Mathematics ·

1.1 Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of

4.1 Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of

4.2 Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.20The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHyperJoin

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHyperJoin 101

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme Super-

24.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

24.5 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

25.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

25.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

28.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

29.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

32.1 Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of

33.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . . 206

Henry Garrett · Independent Researcher · Department of Mathematics ·

33.9 “SuperHyperGraph-Based Books”: | Featured Tweets #68 . . . . . . . . . . . . . . . 214

Henry Garrett · Independent Researcher · Department of Mathematics ·

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

14.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

15.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 108

23.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

28.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

29.1 The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges

31.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . . 192

by two (Extreme/Neutrosophic) notions, namely, Extreme SuperHyperJoin and Neutrosophic 3

Notions, namely, a SuperHyperJoin and Neutrosophic SuperHyperJoin . Two different types 9

δ−SuperHyperJoin is a maximal of SuperHyperVertices with a maximum cardinality such that 27