Unequal Dimension Dominating in SuperHyperGraphs

Unequal Dimension
Dominating In
SuperHyperGraphs
Ideas | Approaches | Accessibility | Availability
Dr. Henry Garrett

Report | Exposition | References | Research #22 2023
Contents
Contents iii
List of Figures vi
List of Tables xi
1 ABSTRACT 1
2 Background 13
Bibliography 19
3 Acknowledgements 47
4 Cancer In Extreme SuperHyperGraph 49
5 Extreme Unequal Dimension Dominating 53
6 New Ideas On Super Dimity By Hyper Dimple Of Unequal Dimension

Dominating In Recognition of Cancer With (Neutrosophic) SuperHy-
perGraph 55
7 ABSTRACT 57
8 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 63
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 67
10 Extreme SuperHyperUnequal Dimension Dominating But As The Extensions

Excerpt From Dense And Super Forms 79
11 The Extreme Departures on The Theoretical Results Toward Theoretical

Motivations 121
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 131
13 Extreme Applications in Cancer’s Extreme Recognition 143
14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

ite as Extreme SuperHyperModel 145
15 Case 2: The Increasing Extreme Steps Toward Extreme SuperHyper-

Multipartite as Extreme SuperHyperModel 147
16 Wondering Open Problems But As The Directions To Forming The

Motivations 149
17 Conclusion and Closing Remarks 151
18 Extreme SuperHyperDuality But As The Extensions Excerpt From

Dense And Super Forms 153
19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

And Super Forms 167
20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

And Super Forms 195
22 Extreme SuperHyperConnected But As The Extensions Excerpt From

23 Background 223
Bibliography 229
24 Cancer In Neutrosophic SuperHyperGraph 255
25 Neutrosophic Unequal Dimension Dominating 259
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Unequal Dimension Dominating As Hyper Dimple On Super
Dimity 261
27 ABSTRACT 263
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 269

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 273
30 Neutrosophic SuperHyperUnequal Dimension Dominating But As The Exten-

sions Excerpt From Dense And Super Forms 285
31 The Neutrosophic Departures on The Theoretical Results Toward

Theoretical Motivations 329
32 The Surveys of Mathematical Sets On The Results But As The Initial

Motivation 341
33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 353
34 Case 1: The Initial Neutrosophic Steps Toward Neutrosophic SuperHy-

perBipartite as Neutrosophic SuperHyperModel 355
35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

SuperHyperMultipartite as Neutrosophic SuperHyperModel 357
36 Wondering Open Problems But As The Directions To Forming The

Motivations 359
37 Conclusion and Closing Remarks 361
38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

From Dense And Super Forms 419
43 Background 433
Bibliography 439
44 Books’ Contributions 465
45 “SuperHyperGraph-Based Books”: | Featured Tweets 477
46 CV 505

List of Figures
10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.3) . . . . . . . 85
10.10The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
vi

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

perUnequal Dimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . . . . 122
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.7) . . . . . . . . 124
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.9) . . . . . . . . 125
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnequal Dimension Dominating in the Example (42.0.11) . . . . . . . 127
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperUnequal Dimension Dominating in the Example (42.0.13) . . . . . . . . . . . . 129
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.15) . . 130
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

perUnequal Dimension Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

SuperHyperUnequal Dimension Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . 147
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
30.10The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 304
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

SuperHyperUnequal Dimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . 330
31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnequal Dimension Dominating in the Example (42.0.11) 335
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
SuperHyperUnequal Dimension Dominating in the Example (42.0.13) . . . . . . . . . . . . 337
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG294] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of
Unequal Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8088387). . . . . . . . . . 466
44.4 [HG295] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Unequal Dimension Dominating As Hyper Dimple On Super
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8088438). . . . . . . . . . . . . . . . . 468

44.7 [HG187b] Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8090194). . . . . . . . . . . . . . . . 473
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 478

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 479
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 480
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 486

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

Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.0.23) 76
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 77

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 146

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 148
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 152

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 356

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 358
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 362
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme Un- 1
equal Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Unequal Dimension 2
Dominating In SuperHyperGraphs” about some scientific research on Unequal Dimension 3

Dominating In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme 4
Unequal Dimension Dominating In SuperHyperGraphs and Neutrosophic Unequal Dimension 5
Dominating In SuperHyperGraphs. With scientific research on the basic scientific research 6
properties, the scientific research book starts to make Extreme Unequal Dimension Dominating 7
In SuperHyperGraphs theory and Neutrosophic Unequal Dimension Dominating In SuperHy- 8
perGraphs theory more (Extremely/Neutrosophicly) understandable. 9

10
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 11
Notions, namely, a Unequal Dimension Dominating In SuperHyperGraphs and Neutrosophic 12
Unequal Dimension Dominating In SuperHyperGraphs . Two different types of SuperHyper- 13
Definitions are debut for them but the scientific research goes further and the SuperHyperNotion, 14
SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. 15

The literature review is implemented in the whole of this research. For shining the elegancy 16
and the significancy of this research, the comparison between this SuperHyperNotion with 17
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 18
are followed by the examples and the instances thus the clarifications are driven with different 19
tools. The applications are figured out to make sense about the theoretical aspect of this 20
ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 21
out the challenges make sense about ongoing and upcoming research. The special case is 22
up. The cells are viewed in the deemed ways. There are different types of them. Some of 23
them are individuals and some of them are well-modeled by the group of cells. These types 24
are all officially called “SuperHyperVertex” but the relations amid them all officially called 25
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyper- 26
Graph” are chosen and elected to scientific research about “Cancer’s Recognition”. Thus 27
these complex and dense SuperHyperModels open up some avenues to scientific research on 28
theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 29
research. It’s also officially collected in the form of some questions and some problems. Assume 30
a SuperHyperGraph. Then δ−Unequal Dimension Dominating In SuperHyperGraphs is a 31
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 32
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 33
1
are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 34
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 35
is an δ−SuperHyperDefensive; a Neutrosophic δ−Unequal Dimension Dominating In Super- 36
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 37
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 38
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 39
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 40
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 41
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Unequal Dimension 42
Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to make a 43
Unequal Dimension Dominating In SuperHyperGraphs more understandable. For the sake of 44
having Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs, there’s a need 45
to “redefine” the notion of a “Unequal Dimension Dominating In SuperHyperGraphs ”. The 46

SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 47
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 48
Assume a Unequal Dimension Dominating In SuperHyperGraphs . It’s redefined a Neutrosophic 49
Unequal Dimension Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, 50
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 51
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 52
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 53
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 54
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 55
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 56
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 57
Unequal Dimension Dominating In SuperHyperGraphs . It’s the main. It’ll be disciplinary 58

to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 59
need to have all Unequal Dimension Dominating In SuperHyperGraphs until the Unequal 60
Dimension Dominating In SuperHyperGraphs, then it’s officially called a “Unequal Dimension 61
Dominating In SuperHyperGraphs” but otherwise, it isn’t a Unequal Dimension Dominating In 62
SuperHyperGraphs . There are some instances about the clarifications for the main definition 63
titled a “Unequal Dimension Dominating In SuperHyperGraphs ”. These two examples get 64

more scrutiny and discernment since there are characterized in the disciplinary ways of the 65
SuperHyperClass based on a Unequal Dimension Dominating In SuperHyperGraphs . For the 66
sake of having a Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs, there’s a 67
need to “redefine” the notion of a “Neutrosophic Unequal Dimension Dominating In SuperHy- 68
perGraphs” and a “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs ”. The 69

Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 72
if the intended Table holds. And a Unequal Dimension Dominating In SuperHyperGraphs 73
are redefined to a “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs” if 74
the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 75
Since there’s more ways to get Neutrosophic type-results to make a Neutrosophic Unequal 76
Dimension Dominating In SuperHyperGraphs more understandable. Assume a Neutrosophic 77
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 78
Thus SuperHyperPath, Unequal Dimension Dominating In SuperHyperGraphs, SuperHyperStar, 79

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 80

SuperHyperPath”, “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs”, 81
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 82
rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 83
SuperHyperGraph has a “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs” 84
where it’s the strongest [the maximum Neutrosophic value from all the Unequal Dimension 85
Dominating In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from 86
a Unequal Dimension Dominating In SuperHyperGraphs .] Unequal Dimension Dominating 87
In SuperHyperGraphs . A graph is a SuperHyperUniform if it’s a SuperHyperGraph and the 88
number of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyper- 89
Graph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one 90
SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s Unequal 91
Dimension Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 92

two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 93
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 94
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 95
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 96
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 97
sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s only one SuperVertex 98
as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 99
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 100
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 101
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 102
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 103
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 104
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 105
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 106
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 107
Recognition” and the results and the definitions will be introduced in redeemed ways. The 108
recognition of the cancer in the long-term function. The specific region has been assigned 109
by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer 110
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 111
since there are some determinacy, indeterminacy and neutrality about the moves and the 112
effects of the cancer on that region; this event leads us to choose another model [it’s said to be 113
Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s 114
done. There are some specific models, which are well-known and they’ve got the names, and 115
some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the 116
complex tracks and between complicated groups of cells could be fantasized by a Neutrosophic 117
SuperHyperPath(-/Unequal Dimension Dominating In SuperHyperGraphs, SuperHyperStar, 118
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 119
the longest Unequal Dimension Dominating In SuperHyperGraphs or the strongest Unequal 120
Dimension Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 121

the longest Unequal Dimension Dominating In SuperHyperGraphs, called Unequal Dimension 122
Dominating In SuperHyperGraphs, and the strongest Unequal Dimension Dominating In Super- 123
HyperGraphs, called Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs, some 124
general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths 125

have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 126
SuperHyperEdges to form any style of a Unequal Dimension Dominating In SuperHyperGraphs. 127
There isn’t any formation of any Unequal Dimension Dominating In SuperHyperGraphs but 128
literarily, it’s the deformation of any Unequal Dimension Dominating In SuperHyperGraphs. It, 129
literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and 130
Neutrosophic SuperHyperGraph theory are proposed. 131
Keywords: SuperHyperGraph, (Neutrosophic) Unequal Dimension Dominating In SuperHy- 132
perGraphs, Cancer’s Recognition 133
AMS Subject Classification: 05C17, 05C22, 05E45 134

135
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 136
Notion, namely, Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs . Two 137
different types of SuperHyperDefinitions are debut for them but the scientific research goes 138
further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that 139
are well-defined and well-reviewed. The literature review is implemented in the whole of this 140
research. For shining the elegancy and the significancy of this research, the comparison between 141
this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNum- 142
bers are featured. The definitions are followed by the examples and the instances thus the 143
clarifications are driven with different tools. The applications are figured out to make sense 144
about the theoretical aspect of this ongoing research. The “Cancer’s Neutrosophic Recognition” 145
are the under scientific research to figure out the challenges make sense about ongoing and 146
upcoming research. The special case is up. The cells are viewed in the deemed ways. There are 147
different types of them. Some of them are individuals and some of them are well-modeled by 148
the group of cells. These types are all officially called “SuperHyperVertex” but the relations 149
amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and 150
“Neutrosophic SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s 151
Neutrosophic Recognition”. Thus these complex and dense SuperHyperModels open up some 152
avenues to scientific research on theoretical segments and “Cancer’s Neutrosophic Recognition”. 153
Some avenues are posed to pursue this research. It’s also officially collected in the form of 154
some questions and some problems. Assume a SuperHyperGraph. Then an “δ−Unequal 155
Dimension Dominating In SuperHyperGraphs” is a maximal Unequal Dimension Dominating 156
In SuperHyperGraphs of SuperHyperVertices with maximum cardinality such that either of 157
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors 158
of s ∈ S : |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ, |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 159
Expression, holds if S is an “δ−SuperHyperOffensive”. And the second Expression, holds 160
if S is an “δ−SuperHyperDefensive”; a“Neutrosophic δ−Unequal Dimension Dominating In 161
SuperHyperGraphs” is a maximal Neutrosophic Unequal Dimension Dominating In SuperHy- 162
perGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 163
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 164
of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 165
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 166
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 167
δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Unequal Dimen- 168
sion Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to make 169
Unequal Dimension Dominating In SuperHyperGraphs more understandable. For the sake of 170

having Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs, there’s a need 171

to “redefine” the notion of “Unequal Dimension Dominating In SuperHyperGraphs ”. The 172
Assume a Unequal Dimension Dominating In SuperHyperGraphs . It’s redefined Neutrosophic 175
Unequal Dimension Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, 176
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 177
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 178
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 179
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 180
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 181
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 182
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on 183
Unequal Dimension Dominating In SuperHyperGraphs . It’s the main. It’ll be disciplinary 184
to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a 185
need to have all Unequal Dimension Dominating In SuperHyperGraphs until the Unequal 186
Dimension Dominating In SuperHyperGraphs, then it’s officially called “Unequal Dimension 187
Dominating In SuperHyperGraphs” but otherwise, it isn’t Unequal Dimension Dominating In 188
SuperHyperGraphs . There are some instances about the clarifications for the main definition 189
titled “Unequal Dimension Dominating In SuperHyperGraphs ”. These two examples get 190
more scrutiny and discernment since there are characterized in the disciplinary ways of the 191
SuperHyperClass based on Unequal Dimension Dominating In SuperHyperGraphs . For the 192
sake of having Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs, there’s a 193
need to “redefine” the notion of “Neutrosophic Unequal Dimension Dominating In SuperHy- 194
perGraphs” and “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs ”. The 195

Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 198
if the intended Table holds. And Unequal Dimension Dominating In SuperHyperGraphs 199
are redefined “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs” if the 200
intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since 201
there’s more ways to get Neutrosophic type-results to make Neutrosophic Unequal Dimension 202
Dominating In SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyper- 203
Graph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus 204
SuperHyperPath, Unequal Dimension Dominating In SuperHyperGraphs, SuperHyperStar, 205
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 206

SuperHyperPath”, “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs”, 207
“Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic Supe- 208
rHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A 209
SuperHyperGraph has “Neutrosophic Unequal Dimension Dominating In SuperHyperGraphs” 210
where it’s the strongest [the maximum Neutrosophic value from all Unequal Dimension Dom- 211
inating In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a 212
Unequal Dimension Dominating In SuperHyperGraphs .] Unequal Dimension Dominating In 213
SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 214
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. 215
There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one Super- 216

Vertex as intersection amid two given SuperHyperEdges with two exceptions; it’s Unequal 217
Dimension Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 218
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 219
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 220
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 221
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 222
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 223
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 224
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 225
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 226
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 227
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 228
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 229
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 230
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 231
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 232
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 233
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 234
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific 235
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 236
the move from the cancer is identified by this research. Sometimes the move of the cancer 237
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 238
about the moves and the effects of the cancer on that region; this event leads us to choose 239
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 240
on what’s happened and what’s done. There are some specific models, which are well-known 241
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves 242
and the traces of the cancer on the complex tracks and between complicated groups of cells 243
could be fantasized by a Neutrosophic SuperHyperPath(-/Unequal Dimension Dominating 244
In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 245
perHyperWheel). The aim is to find either the longest Unequal Dimension Dominating In 246
SuperHyperGraphs or the strongest Unequal Dimension Dominating In SuperHyperGraphs 247

in those Neutrosophic SuperHyperModels. For the longest Unequal Dimension Dominating 248
In SuperHyperGraphs, called Unequal Dimension Dominating In SuperHyperGraphs, and the 249
strongest Unequal Dimension Dominating In SuperHyperGraphs, called Neutrosophic Unequal 250
Dimension Dominating In SuperHyperGraphs, some general results are introduced. Beyond 251
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but 252
it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style 253
of a Unequal Dimension Dominating In SuperHyperGraphs. There isn’t any formation of any 254
Unequal Dimension Dominating In SuperHyperGraphs but literarily, it’s the deformation of any 255
Unequal Dimension Dominating In SuperHyperGraphs. It, literarily, deforms and it doesn’t 256
form. A basic familiarity with SuperHyperGraph theory and Neutrosophic SuperHyperGraph 257
theory are proposed. 258

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Unequal Dimension Dominating 259
In SuperHyperGraphs, Cancer’s Neutrosophic Recognition 260

262
Some scientific studies and scientific researches about neutrosophic graphs, are proposed 263
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 264
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 265
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 266
United State. This research book covers different types of notions and settings in neutrosophic 267
graph theory and neutrosophic SuperHyperGraph theory. 268
269
270
[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Edu- 271
cational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 272
978-1-59973-725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 273

[Ref] Henry Garrett, (2022). “Beyond Neutrosophic Graphs”, Ohio: E-publishing: Educational 274
Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 United States. ISBN: 978-1-59973- 275
725-6 (http://fs.unm.edu/BeyondNeutrosophicGraphs.pdf). 276
277
Also, some scientific studies and scientific researches about neutrosophic graphs, are pro- 278
posed as book in the following by Henry Garrett (2022) which is indexed by Google Scholar 279
and has more than 4060 readers in Scribd. It’s titled “Neutrosophic Duality” and published 280
by Florida: GLOBAL KNOWLEDGE - Publishing House 848 Brickell Ave Ste 950 Miami, 281
Florida 33131 United States. This research book presents different types of notions SuperHyper- 282
Resolving and Unequal Dimension Dominating In SuperHyperGraphs in the setting of duality 283
in neutrosophic graph theory and neutrosophic SuperHyperGraph theory. This research book 284
has scrutiny on the complement of the intended set and the intended set, simultaneously. It’s 285

smart to consider a set but acting on its complement that what’s done in this research book 286
which is popular in the terms of high readers in Scribd. 287

[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 288
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 289
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 290
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 291
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 292
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 293




CHAPTER 2 294
Background 295
There are some scientific researches covering the topic of this research. In what follows, there 296
are some discussion and literature reviews about them. 297
The seminal paper and groundbreaking article is titled “New Ideas In Recognition of Cancer 298
And Neutrosophic SuperHyperGraph As Hyper Tool On Super Toot” in Ref. [HG11s] by Henry 299
Garrett (2023). In this research article, a novel approach is implemented on SuperHyperGraph 300
and neutrosophic SuperHyperGraph based on general forms with introducing used neutrosophic 301
classes of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is 302
entitled “Current Trends in Mass Communication (CTMC)” with ISO abbreviation “Curr 303
Trends Mass Comm” in volume 2 and issue 1 with pages 32-55. 304
The seminal paper and groundbreaking article is titled “Some Super Hyper Degrees and Co- 305
Super Hyper Degrees on Neutrosophic Super Hyper Graphs And Super Hyper Graphs Alongside 306
Applications in Cancer’s Treatments” in Ref. [HG22s] by Henry Garrett (2023). In this 307
research article, a novel approach is implemented on SuperHyperGraph and neutrosophic Supe- 308
rHyperGraph based on fundamental notions and using vital tools in Cancer’s Treatments. It’s 309
published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques and 310
Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 311
Math” in volume 2 and issue 1 with pages 35-47. The research article studies deeply with 312
choosing directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough 313
toward independent results based on initial background and fundamental SuperHyperNumbers. 314
The seminal paper and groundbreaking article is titled “A Research on Cancer’s Recognition 315
and Neutrosophic Super Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets 316
as Hyper Covering Versus Super separations” in Ref. [HG33s] by Henry Garrett (2023). In 317
this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 318
SuperHyperGraph based on fundamental notions and using vital tools in Cancer’s Recognition. 319
It’s published in prestigious and fancy journal is entitled “Journal of Mathematical Techniques 320
and Computational Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput 321
The seminal paper and groundbreaking article is titled “Neutrosophic 1-Failed SuperHyperForcing 325
in the SuperHyperFunction to Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 326
Recognition and Beyond” in Ref. [HG44s] by Henry Garrett (2023). In this research article, a 327
novel approach is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based 328
13
on fundamental SuperHyperNumber and using neutrosophic SuperHyperClasses of neutrosophic 329

SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal of 330
Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO abbreviation 331
“J Math Techniques Comput Math” in volume 2 and issue 6 with pages 221-307. The research 332
article studies deeply with choosing directly neutrosophic SuperHyperGraph and SuperHyper- 333
Graph. It’s the breakthrough toward independent results based on initial background and 334
fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is titled 335
“Super Hyper Dominating and Super Hyper Resolving on Neutrosophic Super Hyper Graphs and 336
Their Directions in Game Theory and Neutrosophic Super Hyper Classes” in Ref. [HG55s] 337
by Henry Garrett (2022). In this research article, a novel approach is implemented on Super- 338
HyperGraph and neutrosophic SuperHyperGraph based on fundamental SuperHyperNumber 339
and using neutrosophic SuperHyperClasses of neutrosophic SuperHyperGraph. It’s published in 340
prestigious and fancy journal is entitled “Journal of Mathematical Techniques and Computa- 341
tional Mathematics(JMTCM)” with ISO abbreviation “J Math Techniques Comput Math” in 342
volume 1 and issue 3 with pages 242-263. The research article studies deeply with choosing 343
directly neutrosophic SuperHyperGraph and SuperHyperGraph. It’s the breakthrough toward 344
independent results based on initial background and fundamental SuperHyperNumbers. The 345
seminal paper and groundbreaking article is titled “neutrosophic co-degree and neutrosophic 346
degree alongside chromatic numbers in the setting of some classes related to neutrosophic hyper- 347
graphs” in Ref. [HG66s] by Henry Garrett (2023). In this research article, a novel approach 348
is implemented on SuperHyperGraph and neutrosophic SuperHyperGraph based on general 349
forms without using neutrosophic classes of neutrosophic SuperHyperGraph. It’s published 350
in prestigious and fancy journal is entitled “Journal of Current Trends in Computer Science 351
Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp Sci Res” in volume 2 352
and issue 1 with pages 16-24. The research article studies deeply with choosing neutrosophic 353
hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough toward inde- 354
pendent results based on initial background. The research article studies deeply with choosing 355
neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 356
toward independent results based on initial background. In some articles are titled “0039 | 357
Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring alongside 358
(Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry Garrett 359

(2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] by 360
Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 361
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in Ref. 362
[HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside The 363
Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 364
SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), 365
“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic 366
SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify 367
Separately The Cells and Affected Cells Toward The Totality Under Cancer’s Recognition By 368
New Multiple Definitions On the Sets Polynomials Alongside Numbers In The (Neutrosophic) 369
SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” 370

in Ref. [HG9] by Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer 371
In The Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 372
Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett 373
(2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 374

Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. 375

[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 376
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 377
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 378
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 379
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 380
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 381
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 382
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 383
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 384
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 385
(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 386
To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 387

Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 388
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 389
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 390
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 391
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 392
Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 393

Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 394
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 395
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 396
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 397
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 398
Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 399
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 400
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyper- 401
Dominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions 402
in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett 403
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recog- 404
nition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The 405
Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 406
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 407
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 408
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 409
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 410

Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 411
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 412
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 413
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 414
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 415
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 416
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 417
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 418
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 419
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 420

Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 421
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 422
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 423
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 424
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 425
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 426
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 427

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 428
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 429
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 430
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperModeling 431
in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry 432
Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and Neutro- 433
sophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), 434
“Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions Based on 435
Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. 436
[HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG66s; HG4; HG5; HG6; HG7; 437
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 438
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 439
HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 441
HG291; HG292; HG293; HG294; HG295], there are some endeavors to formalize the basic 459
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 460
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 461
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 462
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 465
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 466



HG186b; HG187b]. Two popular scientific research books in Scribd in the terms of high 476
readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 477
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 478
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 479
more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 480
by Dr. Henry Garrett. This research book covers different types of notions and settings in 481
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 482
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 483
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 484
has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 485
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 486
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 487
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 488
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 489
that what’s done in this research book which is popular in the terms of high readers in Scribd. 490
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the 491
notions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Supe- 492
rHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; 493
HG66s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; 494

HG287; HG288; HG289; HG290; HG291; HG292; HG293; HG294; HG295] alongside 515
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 516

HG186b; HG187b]. Two popular scientific research books in Scribd ,in the terms of high 531
readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 532

Bibliography 533
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 534
Graph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32- 535
55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of- 536

cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf) 537
HG22s [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 538
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 539
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 540
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 541
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 542
alongside-a.pdf) 543
HG33s [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 544
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 545
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 546
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 547
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 548
hamiltonian-sets-.pdf) 549
HG44s [4] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyper- 550
Function to Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic 551
Recognition and Beyond”, J Math Techniques Comput Math 2(6) (2023) 221- 552
307. (https://www.opastpublishers.com/open-access-articles/neutrosophic-1failed- 553
superhyperforcing-in-the-superhyperfunction-to-use-neutrosophic-superhypergraphs-on- 554
cancers-neutros.pdf) 555
HG55s [5] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 556
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 557
Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04) 558
HG66s [6] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 559
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 560
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 561
10.33140/JMTCM.01.03.09) 562
19
HG4 [7] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 563
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 564
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 565
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 566
https://oa.mg/work/10.5281/zenodo.6319942 567
HG5 [8] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 568
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 569
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 570
https://oa.mg/work/10.13140/rg.2.2.35241.26724 571
HG6 [9] Henry Garrett, “Extreme SuperHyperClique as the Firm Scheme of Confrontation under 572
Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs”, 573
Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 574
HG7 [10] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 575
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 576
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 577
10.20944/preprints202301.0282.v1). 578
HG8 [11] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 579
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 580
10.20944/preprints202301.0267.v1). 581
HG9 [12] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 582
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 583
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 584
on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 585
(doi: 10.20944/preprints202301.0265.v1). 586
HG10 [13] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 587
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 588
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 589
prints202301.0262.v1). 590
HG11 [14] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 591
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 592
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 593
HG12 [15] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 594
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 595
2023010224, (doi: 10.20944/preprints202301.0224.v1). 596
HG13 [16] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 597
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 598

prints202301.0105.v1). 599
HG14 [17] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 600
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 601

HG15 [18] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 603
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 604
Preprints 2023, 2023010044 605
HG16 [19] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 606
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 607
10.20944/preprints202301.0043.v1). 608
HG17 [20] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 609
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 610

HG19 [22] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 615
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 616
(doi: 10.20944/preprints202212.0549.v1). 617
HG20 [23] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 618
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 619
(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 620
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 621
HG21 [24] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 622
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 623
(doi: 10.20944/preprints202212.0500.v1). 624
HG22 [25] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 625
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 626
HG23 [26] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 628
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 629
HG295 [27] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 631
By Unequal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 632
(doi: 10.5281/zenodo.8088438). 633
HG294 [28] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal Dimension 634
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 635
2023, (doi: 10.5281/zenodo.8088387). 636
By Strict Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 638
10.5281/zenodo.8084436). 639

HG292 [30] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Strict Dimension 640
2023, (doi: 10.5281/zenodo.8084420). 642
By Reverse Strict Connective As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 644
10.5281/zenodo.8080100). 645
HG290 [32] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Strict Connective 646
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 647
10.5281/zenodo.8080068). 648
By Unequal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, 650
(doi: 10.5281/zenodo.8078445). 651
HG288 [34] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Unequal Connective 652
2023, (doi: 10.5281/zenodo.8078543). 654
By Strict Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 656
10.5281/zenodo.8076416). 657
HG286 [36] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Strict Connective 658
2023, (doi: 10.5281/zenodo.8076399). 660
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 662
(doi: 10.5281/zenodo.8072171). 663
HG284 [38] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 664
2023, (doi: 10.5281/zenodo.8072267). 666
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 668
10.5281/zenodo.8067384). 669
HG282 [40] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 670
2023, (doi: 10.5281/zenodo.8067409). 672
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 674
10.5281/zenodo.8061927). 675
HG280 [42] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 676
10.5281/zenodo.8062016). 678

By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 680
10.5281/zenodo.8057696). 681
HG278 [44] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 682
2023, (doi: 10.5281/zenodo.8057753). 684
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 686
10.5281/zenodo.8052893). 687
HG276 [46] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 688
2023, (doi: 10.5281/zenodo.8052925). 690
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 692
10.5281/zenodo.8051346). 693
HG274 [48] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 694
10.5281/zenodo.8051360). 696
HG273 [49] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 697
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 698
10.5281/zenodo.8025707). 699
HG272 [50] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 700
10.5281/zenodo.8027275). 702
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 704
odo.8017246). 705
HG270 [52] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 706
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 707
10.5281/zenodo.8020128). 708
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 710
odo.7978571). 711
HG268 [54] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 712
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 713
10.5281/zenodo.7978857). 714
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 716
10.5281/zenodo.7940830). 717

HG266 [56] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 718
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 719
10.5281/zenodo.7943578). 720
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 722
odo.7916595). 723
HG264 [58] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 724
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 725
odo.7923632). 726
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 728
(doi: 10.5281/zenodo.7904698). 729
HG262 [60] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 730
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 731
2023, (doi: 10.5281/zenodo.7904671). 732
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 734
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 735
HG260 [62] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 736
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 737
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 738
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 740
10.5281/zenodo.7871026). 741
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 743
2023, (doi: 10.5281/zenodo.7874647). 744
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 746
10.5281/zenodo.7857856). 747
HG256 [66] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 748
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 749
2023, (doi: 10.5281/zenodo.7857841). 750
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 752
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 755

Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 758
10.5281/zenodo.7853867). 759
HG252 [70] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 760
10.5281/zenodo.7853922). 762
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 764
(doi: 10.5281/zenodo.7851519). 765
HG250 [72] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 766
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 767
(doi: 10.5281/zenodo.7851550). 768
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 770
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 773
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 776
10.5281/zenodo.7834229). 777
HG246 [76] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 778
10.5281/zenodo.7834261). 780
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 782
10.5281/zenodo.7824560). 783
HG244 [78] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 784

(doi: 10.5281/zenodo.7824623). 786
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 788
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 791
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 794

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 796
2023, (doi: 10.5281/zenodo.7809365). 797
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 799
2023, (doi: 10.5281/zenodo.7809358). 800
HG238 [84] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 801
10.5281/zenodo.7809219). 803
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 805
10.5281/zenodo.7809328). 806
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 808
2023, (doi: 10.5281/zenodo.7806767). 809
HG235 [87] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 810
2023, (doi: 10.5281/zenodo.7806838). 812
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 814
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 815
HG233 [89] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 816
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 817
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 818
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 820
10.5281/zenodo.7799902). 821
HG231 [91] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 822
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 823
(doi: 10.5281/zenodo.7804218). 824
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 826
(doi: 10.5281/zenodo.7796334). 827
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 829
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 832
10.5281/zenodo.7791952). 833

HG225 [95] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 834
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 835
10.5281/zenodo.7791982). 836
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 838
10.5281/zenodo.7790026). 839
HG223 [97] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 840
10.5281/zenodo.7790052). 842
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 844
2023, (doi: 10.5281/zenodo.7787066). 845
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 847
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 848
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 850
10.5281/zenodo.7781476). 851
HG219 [101] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 852
10.5281/zenodo.7783082). 854
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 856
10.5281/zenodo.7777857). 857
HG217 [103] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 858
10.5281/zenodo.7779286). 860
HG215 [104] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 861
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 862
(doi: 10.5281/zenodo.7771831). 863
HG214 [105] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 864
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 865
2023, (doi: 10.5281/zenodo.7772468). 866
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 868
10.13140/RG.2.2.20913.25446). 869
HG212 [107] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 870
odo.7764916). 872

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 874
10.13140/RG.2.2.11770.98247). 875
HG210 [109] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 876
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 877
10.13140/RG.2.2.12400.12808). 878
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 880
2023, (doi: 10.13140/RG.2.2.22545.10089). 881
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 883
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 884
HG207 [112] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 885
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 886
10.13140/RG.2.2.11377.76644). 887
HG206 [113] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 888
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 889
10.13140/RG.2.2.23750.96329). 890
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 892
10.13140/RG.2.2.31366.24641). 893
HG204 [115] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 894
10.13140/RG.2.2.34721.68960). 896
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 898
2023, (doi: 10.13140/RG.2.2.30212.81289). 899
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 901
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 904
10.13140/RG.2.2.24288.35842). 905
HG200 [119] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 906
10.13140/RG.2.2.32467.25124). 908
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 910
10.13140/RG.2.2.31025.45925). 911

HG198 [121] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 912
10.13140/RG.2.2.17184.25602). 914
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 916
10.13140/RG.2.2.23423.28327). 917
HG196 [123] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 918
10.13140/RG.2.2.28456.44805). 920
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 922
10.13140/RG.2.2.23525.68320). 923
HG194 [125] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 924
10.13140/RG.2.2.20170.24000). 926
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 928
10.13140/RG.2.2.36475.59683). 929
HG192 [127] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 930
10.13140/RG.2.2.29764.71046). 932
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 934
2023, (doi: 10.13140/RG.2.2.18780.87683). 935
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 937
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 940
10.13140/RG.2.2.26134.01603). 941
HG188 [131] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 942
10.13140/RG.2.2.27392.30721). 944
HG187 [132] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 945
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 946
10.13140/RG.2.2.33028.40321). 947
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 949
10.13140/RG.2.2.21389.20966). 950

HG185 [134] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 951
10.13140/RG.2.2.16356.04489). 953
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 955
10.13140/RG.2.2.21756.21129). 956
HG183 [136] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 957
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 958
10.13140/RG.2.2.30983.68009). 959
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 961
10.13140/RG.2.2.28552.29445). 962
HG181 [138] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 963
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 964
(doi: 10.13140/RG.2.2.10936.21761). 965
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 967
10.13140/RG.2.2.35105.89447). 968
HG179 [140] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 969
(doi: 10.13140/RG.2.2.30072.72960). 971
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 973
10.13140/RG.2.2.31147.52003). 974
HG177 [142] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 975
10.13140/RG.2.2.32825.24163). 977
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 979
10.13140/RG.2.2.13059.58401). 980
HG175 [144] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 981
10.13140/RG.2.2.11172.14720). 983
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 985
2023, (doi: 10.13140/RG.2.2.22011.80165). 986
HG173 [146] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 987
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 988
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 989

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 991
2023, (doi: 10.13140/RG.2.2.10493.84962). 992
HG171 [148] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 993
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 995
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 997
2023, (doi: 10.13140/RG.2.2.19944.14086). 998
HG169 [150] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 999
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 1001
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 1003
(doi: 10.13140/RG.2.2.33103.76968). 1004
HG167 [152] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 1005
(doi: 10.13140/RG.2.2.23037.44003). 1007
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 1009
(doi: 10.13140/RG.2.2.35646.56641). 1010
HG165 [154] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 1011
10.13140/RG.2.2.18030.48967). 1013
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 1015
(doi: 10.13140/RG.2.2.13973.81121). 1016
HG163 [156] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 1017
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1018
2023, (doi: 10.13140/RG.2.2.34106.47047). 1019
HG162 [157] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 1020
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1021
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 1024
2023, (doi: 10.13140/RG.2.2.31956.88961). 1025
HG160 [159] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 1026
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1027
2023, (doi: 10.13140/RG.2.2.15179.67361). 1028

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1030
10.13140/RG.2.2.21510.45125). 1031
HG158 [161] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 1032
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1033
2023, (doi: 10.13140/RG.2.2.13121.84321). 1034
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1036
10.13140/RG.2.2.11758.69441). 1037
HG156 [163] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 1038
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1039
2023, (doi: 10.13140/RG.2.2.31891.35367). 1040
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1042
10.13140/RG.2.2.19360.87048). 1043
HG154 [165] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1044
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1045
10.13140/RG.2.2.32363.21286). 1046
HG153 [166] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1047
10.13140/RG.2.2.23266.81602). 1049
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1051
10.13140/RG.2.2.19911.37285). 1052
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1054
10.13140/RG.2.2.11050.90569). 1055
HG150 [169] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1056
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1057
2023, (doi: 10.13140/RG.2.2.17761.79206). 1058
HG149 [170] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1059
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1060
HG148 [171] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1062
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1063
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1064
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1066
(doi: 10.13140/RG.2.2.30182.50241). 1067

HG146 [173] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1068
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1069
HG145 [174] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1071
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1072
HG144 [175] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1074
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1075
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1076
HG143 [176] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1077
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1078
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1079
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1082
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1085
HG140 [179] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1086
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1087
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1088
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1091
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1094
HG137 [182] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1095
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1096
HG136 [183] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1098
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1099
2023, (doi: 10.13140/RG.2.2.17252.24968). 1100
HG135 [184] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1101
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1102
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1103
HG134 [185] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1104
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1105

HG132 [186] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1107
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1108
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1109
HG131 [187] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1110
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1111
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1112
HG130 [188] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1113
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1114
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1115

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1116
HG129 [189] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1117

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1118
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1119
HG128 [190] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1121
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1122

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1123
HG127 [191] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1124
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1125
2023,(doi: 10.13140/RG.2.2.36745.93289). 1126
HG126 [192] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1127
HG125 [193] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1130

10.20944/preprints202301.0282.v1). 1133
HG124 [194] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1134
10.20944/preprints202301.0267.v1).). 1136
(doi: 10.20944/preprints202301.0265.v1). 1141
HG122 [196] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1142
prints202301.0262.v1). 1145


2023010224, (doi: 10.20944/preprints202301.0224.v1). 1151
HG24 [199] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1152
Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1153

10.13140/RG.2.2.35061.65767). 1154
HG25 [200] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1155
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1156
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1157

10.13140/RG.2.2.18494.15680). 1158
HG26 [201] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1159
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1160
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1161

10.13140/RG.2.2.32530.73922). 1162
HG27 [202] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1163
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1164

cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1165
10.13140/RG.2.2.15897.70243). 1166

10.13140/RG.2.2.32530.73922). 1170

prints202301.0105.v1). 1173
HG28 [205] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1174
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1175
HG29 [206] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1177
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1178
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1179

10.13140/RG.2.2.23172.19849). 1180

HG30 [209] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1187
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1188
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1189

10.13140/RG.2.2.17385.36968). 1190
Preprints 2023, 2023010044 1193
10.20944/preprints202301.0043.v1). 1196
HG31 [212] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1197
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1198
2023, (doi: 10.13140/RG.2.2.28945.92007). 1199
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1204
10.13140/RG.2.2.35774.77123). 1205
HG35 [216] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1209
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1210

10.13140/RG.2.2.29430.88642). 1211
(doi: 10.20944/preprints202212.0549.v1). 1217
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1219
10.13140/RG.2.2.19380.94084). 1220

SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1228
(doi: 10.20944/preprints202212.0500.v1). 1231
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1233
10.13140/RG.2.2.20993.12640). 1234
HG952 [224] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1235

HG95 [225] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1238
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1239
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1240
HG37 [228] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1247
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1248

10.13140/RG.2.2.29173.86244). 1249
HG38 [229] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1250
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1251
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1252
HG187b [230] Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1253
Garrett, 2023 (doi: 10.5281/zenodo.8090194). 1254
HG186b [231] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1255
2023 (doi: 10.5281/zenodo.8086310). 1256
HG185b [232] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry Garrett, 1257
2023 (doi: 10.5281/zenodo.8080167). 1258

HG184b [233] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry 1259
HG183b [234] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1261
2023 (doi: 10.5281/zenodo.8076449). 1262
HG182b [235] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1263
HG181b [236] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1265
2023 (doi: 10.5281/zenodo.8067469). 1266
HG180b [237] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1267
(doi: 10.5281/zenodo.8062076). 1268
HG179b [238] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1269
HG178b [239] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1271
2023 (doi: 10.5281/zenodo.8052976). 1272
HG177b [240] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1273
(doi: 10.5281/zenodo.8051368). 1274
HG176b [241] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1275
(doi: 10.5281/zenodo.8027488). 1276
HG175b [242] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1277
10.5281/zenodo.8020181). 1278
HG174b [243] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1279
10.5281/zenodo.7978921). 1280
HG173b [244] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1281
odo.7943878). 1282
HG172b [245] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1283
10.5281/zenodo.7943871). 1284
HG171b [246] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1285
10.5281/zenodo.7923786). 1286
HG170b [247] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1287
2023 (doi: 10.5281/zenodo.7905287). 1288
HG169b [248] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1289

HG168b [249] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1291
2023 (doi: 10.5281/zenodo.7874677). 1292
HG167b [250] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1293
(doi: 10.5281/zenodo.7857906). 1294

HG166b [251] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1295
2023 (doi: 10.5281/zenodo.7856329). 1296
HG165b [252] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1297
10.5281/zenodo.7854561). 1298
HG164b [253] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1299
2023 (doi: 10.5281/zenodo.7851893). 1300
HG163b [254] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1301

HG162b [255] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1303
(doi: 10.5281/zenodo.7835063). 1304
HG161b [256] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1305
(doi: 10.5281/zenodo.7826705). 1306
HG160b [257] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1307
2023 (doi: 10.5281/zenodo.7820680). 1308
HG159b [258] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1309
10.5281/zenodo.7812750). 1310
HG158b [259] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1311
HG157b [260] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1313

HG156b [261] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1315
2023 (doi: 10.5281/zenodo.7807782). 1316
HG155b [262] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1317
2023 (doi: 10.5281/zenodo.7804449). 1318
HG154b [263] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1319

HG153b [264] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1321
(doi: 10.5281/zenodo.7792307). 1322
HG152b [265] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1323
(doi: 10.5281/zenodo.7790728). 1324
HG151b [266] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1325
2023 (doi: 10.5281/zenodo.7787712). 1326
HG150b [267] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1327
10.5281/zenodo.7783791). 1328
HG149b [268] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1329
10.5281/zenodo.7780123). 1330

HG148b [269] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1331
(doi: 10.5281/zenodo.7773119). 1332
HG147b [270] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1333
odo.7637762). 1334
HG146b [271] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1335
10.5281/zenodo.7766174). 1336
HG145b [272] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1337
10.5281/zenodo.7762232). 1338
HG144b [273] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1339
(doi: 10.5281/zenodo.7758601). 1340
HG143b [274] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1341
10.5281/zenodo.7754661). 1342
HG142b [275] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1343
10.5281/zenodo.7750995) . 1344
HG141b [276] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1345
(doi: 10.5281/zenodo.7749875). 1346
HG140b [277] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1347
10.5281/zenodo.7747236). 1348
HG139b [278] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1349
10.5281/zenodo.7742587). 1350
HG138b [279] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1351
(doi: 10.5281/zenodo.7738635). 1352
HG137b [280] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1353
10.5281/zenodo.7734719). 1354
HG136b [281] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1355
10.5281/zenodo.7730484). 1356
HG135b [282] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1357
(doi: 10.5281/zenodo.7730469). 1358
HG134b [283] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1359
10.5281/zenodo.7722865). 1360
HG133b [284] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1361
odo.7713563). 1362
odo.7709116). 1364
HG131b [286] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1365
10.5281/zenodo.7706415). 1366

HG130b [287] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1367
10.5281/zenodo.7706063). 1368
HG129b [288] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1369
10.5281/zenodo.7701906). 1370
HG128b [289] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1371
odo.7700205). 1372
HG127b [290] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7694876). 1374
HG126b [291] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1375
10.5281/zenodo.7679410). 1376
HG125b [292] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1377
10.5281/zenodo.7675982). 1378
HG124b [293] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1379
10.5281/zenodo.7672388). 1380
HG123b [294] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1381
odo.7668648). 1382
HG122b [295] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1383
10.5281/zenodo.7662810). 1384
HG121b [296] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1385
10.5281/zenodo.7659162). 1386
HG120b [297] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1387
odo.7653233). 1388
HG119b [298] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1389
odo.7653204). 1390
HG118b [299] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1391
odo.7653142). 1392
HG117b [300] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1393
odo.7653117). 1394
HG116b [301] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1395
HG115b [302] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1396
odo.7651687). 1397
HG114b [303] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1398
odo.7651619). 1399
HG113b [304] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1400
odo.7651439). 1401

HG112b [305] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1402
odo.7650729). 1403
HG111b [306] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1404
odo.7647868). 1405
HG110b [307] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1406
odo.7647017). 1407
HG109b [308] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1408
odo.7644894). 1409
HG108b [309] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1410
HG107b [310] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1411
odo.7632923). 1412
HG106b [311] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1413
odo.7623459). 1414
HG105b [312] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1415
10.5281/zenodo.7606416). 1416
HG104b [313] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1417
10.5281/zenodo.7606416). 1418
HG103b [314] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1419
odo.7606404). 1420
HG102b [315] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1421
10.5281/zenodo.7580018). 1422
HG101b [316] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1423
odo.7580018). 1424
odo.7580018). 1426
odo.7579929). 1428
HG98b [319] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1429
10.5281/zenodo.7563170). 1430
HG97b [320] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1431
odo.7563164). 1432
HG96b [321] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1433
odo.7563160). 1434
odo.7563160). 1436

HG94b [323] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1437
10.5281/zenodo.7563160). 1438
HG93b [324] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1439
10.5281/zenodo.7557063). 1440
HG92b [325] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1441
10.5281/zenodo.7557009). 1442
HG91b [326] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1443
10.5281/zenodo.7539484). 1444
HG90b [327] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1445
10.5281/zenodo.7523390). 1446
HG89b [328] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1447
10.5281/zenodo.7523390). 1448
HG88b [329] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1449
10.5281/zenodo.7523390). 1450
HG87b [330] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1451
odo.7574952). 1452
HG86b [331] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1453
10.5281/zenodo.7574992). 1454
odo.7523357). 1456
HG84b [333] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1457
10.5281/zenodo.7523357). 1458
HG83b [334] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1459
10.5281/zenodo.7504782). 1460
HG82b [335] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1461
10.5281/zenodo.7504782). 1462
HG81b [336] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1463
10.5281/zenodo.7504782). 1464
HG80b [337] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1465
10.5281/zenodo.7499395). 1466
HG79b [338] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1467
odo.7499395). 1468
HG78b [339] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1469
10.5281/zenodo.7499395). 1470
HG77b [340] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1471
10.5281/zenodo.7497450). 1472

HG76b [341] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1473
10.5281/zenodo.7497450). 1474
HG75b [342] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1475
10.5281/zenodo.7494862). 1476
HG74b [343] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1477
odo.7494862). 1478
HG73b [344] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1479
10.5281/zenodo.7494862). 1480
HG72b [345] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1481
10.5281/zenodo.7493845). 1482
HG71b [346] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1483
odo.7493845). 1484
HG70b [347] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1485
10.5281/zenodo.7493845). 1486
HG69b [348] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1487
odo.7539484). 1488
HG68b [349] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1489
odo.7523390). 1490
HG67b [350] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1491
odo.7523357). 1492
HG66b [351] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1493
odo.7504782). 1494
HG65b [352] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1495
odo.7499395). 1496
HG64b [353] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1497
odo.7497450). 1498
HG63b [354] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1499
odo.7494862). 1500
HG62b [355] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1501
odo.7493845). 1502
HG61b [356] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1503
odo.7480110). 1504
HG60b [357] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1505
odo.7378758). 1506
HG32b [358] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1507
odo.6320305). 1508

HG44b [359] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1509
odo.6677173). 1510

CHAPTER 3 1511
Acknowledgements 1512
The author is going to express his gratitude and his appreciation about the brains and their 1513
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1514
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1515 words of mind and th
to have the material and the contents which are only the way to flourish the minds, to grow minds of words, are too
1516
eligible to be in the stage
the notions, to advance the ways and to make the stable ways to be amid events and storms of 1517
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1518
ideas to be on the star lines of words and shining like stars, forever. 1519
47
CHAPTER 4 1520
Cancer In Extreme SuperHyperGraph 1521
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1522
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1523
as the consequences of the model, some parameters are used. The cells are under attack of this 1524
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1525
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1526
In the following, some Extreme steps are Extreme devised on this disease. 1527
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1528
function. 1529
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1530
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1531
effects of the cancer on that region; this event leads us to choose another model [it’s said 1534
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1535
what’s done. 1536
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1537
they’ve got the names, and some general Extreme models. The moves and the Extreme 1538
traces of the cancer on the complex tracks and between complicated groups of cells could be 1539
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1540
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1541
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1542
in those Extreme Extreme SuperHyperModels. 1543
Some cells have been faced with some attacks from the situation which is caused by the 1544
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1545
which in that, the cells could be labelled as some groups and some groups or individuals have 1546
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1547
the embedded situations, the individuals of cells and the groups of cells could be considered 1548
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1549
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1550
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1551
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1552
49
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1553
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1554
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1555
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1556
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1557
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1558
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1559

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1560
is going to figure out what’s going on this phenomenon. The special case of this disease is 1561
considered and as the consequences of the model, some parameters are used. The cells are 1562
under attack of this disease but the moves of the cancer in the special region are the matter of 1563
mind. The recognition of the cancer could help to find some treatments for this disease. The 1564
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1565
Recognition” and both bases are the background of this research. Sometimes the cancer has 1566
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1567
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1568
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1569
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1570
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1571
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1572
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 1573
and the long cycle of the move from the cancer is identified by this research. Sometimes the 1574
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 1575
and neutrality about the moves and the effects of the cancer on that region; this event leads 1576
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1577
perception on what’s happened and what’s done. There are some specific models, which 1578
are well-known and they’ve got the names, and some general models. The moves and the 1579
traces of the cancer on the complex tracks and between complicated groups of cells could 1580
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1581
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1582
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1583

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1584
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1585
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1586
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1587
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1588
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1589
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1590
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1591
based on the fixed groups of cells or the fixed groups of group of cells? 1592
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1593
messy and dense SuperHyperModels where embedded notions are illustrated? 1594
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1595
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1596
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1597

research has taken more motivations to define SuperHyperClasses and to find some connections 1598
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1599
instances and examples to make clarifications about the framework of this research. The general 1600
results and some results about some connections are some avenues to make key point of this 1601
research, “Cancer’s Recognition”, more understandable and more clear. 1602
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1603
on the modeling of the regions where are under the attacks of the cancer to recognize 1604
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1605
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1606
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1607
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1608
instances and literature reviews have taken the whole way through. In this scientific research, 1609
the literature reviews have fulfilled the lines containing the notions and the results. The 1610
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1611
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1612
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1613
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1614
of the moves of the cancer in the longest and strongest styles with the formation of the design 1615
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1616
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1617
out the background for the SuperHyperNotions. 1618

CHAPTER 5 1619
Extreme Unequal Dimension Dominating 1620
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1621
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1622
2023, (doi: 10.13140/RG.2.2.34953.52320). 1623

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1624
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1625
(doi: 10.13140/RG.2.2.33275.80161). 1626
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1627
10.13140/RG.2.2.11050.90569). 1629
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1630
10.13140/RG.2.2.17761.79206). 1632
10.13140/RG.2.2.19911.37285). 1635
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1636
10.13140/RG.2.2.23266.81602). 1638
10.13140/RG.2.2.19360.87048). 1641
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1642
10.13140/RG.2.2.32363.21286). 1644
10.13140/RG.2.2.11758.69441). 1647
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1648
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1649
10.13140/RG.2.2.31891.35367). 1650
10.13140/RG.2.2.21510.45125). 1653
53
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1654
10.13140/RG.2.2.13121.84321). 1656

CHAPTER 6 1657
New Ideas On Super Dimity By Hyper 1658
Dimple Of Unequal Dimension 1659
Dominating In Recognition of Cancer 1660
With (Neutrosophic) SuperHyperGraph 1661
55
CHAPTER 7 1662
ABSTRACT 1663
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal 1664

Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Unequal Dimension 1665
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1666
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperUnequal Dimension 1667
Dominating if the following expression is called Neutrosophic e-SuperHyperUnequal Dimension Dominating 1668
criteria holds 1669
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

And ∀Ea , Eb ∈ EN SHG , ∃Ec ∈ E 0 : d(Ea , Ec ) = d(Eb , Ec );
Neutrosophic re-SuperHyperUnequal Dimension Dominating if the following expression is called 1670

Neutrosophic e-SuperHyperUnequal Dimension Dominating criteria holds 1671

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 1672

SuperHyperUnequal Dimension Dominating if the following expression is called Neutrosophic v- 1673
SuperHyperUnequal Dimension Dominating criteria holds 1674
∀Va , ∃Vb ∈ V 0 : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed

And ∀Va , Vb ∈ VN SHG , ∃Vc ∈ V 0 : d(Va , Vc ) = d(Vb , Vc );
Neutrosophic rv-SuperHyperUnequal Dimension Dominating if the following expression is called 1675
Neutrosophic v-SuperHyperUnequal Dimension Dominating criteria holds 1676

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1677
HyperUnequal Dimension Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, 1678
Neutrosophic re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension 1679
Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating. ((Neutrosophic) SuperHy- 1680
perUnequal Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 1681
57
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 1682

E is called an Extreme SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic e- 1683
SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, Neut- 1684
rosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension 1685
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1686
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 1687
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 1688

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnequal Dimension 1689
Dominating; a Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic 1690
e-SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, 1691
Neutrosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal 1692
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1693
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1694

sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 1695
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1696
SuperHyperUnequal Dimension Dominating; an Extreme SuperHyperUnequal Dimension Dominating Super- 1697
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutro- 1698
sophic re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Domin- 1699
ating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme 1700
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Ex- 1701
treme coefficients defined as the Extreme number of the maximum Extreme cardinality of 1702
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 1703
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1704
form the Extreme SuperHyperUnequal Dimension Dominating; and the Extreme power is corresponded 1705
to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyper- 1706

Polynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic 1707
re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and 1708
Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 1709
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1710
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1711
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1712

cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1713
such that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; and the Neutrosophic 1714
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperUnequal Dimension 1715
Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic re- 1716
SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and 1717

Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme SuperHy- 1718
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1719
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1720
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1721
the Extreme SuperHyperUnequal Dimension Dominating; a Neutrosophic V-SuperHyperUnequal Dimension 1722
Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutrosophic Supe- 1725
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1726
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1727

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1728
the Neutrosophic SuperHyperUnequal Dimension Dominating; an Extreme V-SuperHyperUnequal Dimension 1729
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dom- 1730
inating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal 1731
Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for 1732
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1733
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 1734
ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 1735
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 1736
that they form the Extreme SuperHyperUnequal Dimension Dominating; and the Extreme power is 1737
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Dimension Dominating 1738
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, 1739

Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutro- 1741
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1742
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1743
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1744
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 1745
HyperVertices such that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; and 1746
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1747
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperUnequal Dimension 1748
Dominating and Neutrosophic SuperHyperUnequal Dimension Dominating. Two different types of Super- 1749
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 1750
The literature review is implemented in the whole of this research. For shining the elegancy and 1752
the significancy of this research, the comparison between this SuperHyperNotion with other 1753
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 1754
followed by the examples and the instances thus the clarifications are driven with different tools. 1755
The applications are figured out to make sense about the theoretical aspect of this ongoing 1756
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 1757
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 1758
deemed ways. There are different types of them. Some of them are individuals and some of them 1759
are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 1760
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHy- 1761
perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 1762
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 1763
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 1764
pursue this research. It’s also officially collected in the form of some questions and some problems. 1765
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperUnequal Dimension 1766
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1767
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1768
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1769
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1770
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnequal Dimension Dominating is 1771
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1772
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1773

HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1774

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1775
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1776
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1777
SuperHyperUnequal Dimension Dominating . Since there’s more ways to get type-results to make a 1778
SuperHyperUnequal Dimension Dominating more understandable. For the sake of having Neutrosophic 1779
SuperHyperUnequal Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHy- 1780
perUnequal Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 1781
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1782
position of labels to assign to the values. Assume a SuperHyperUnequal Dimension Dominating . It’s 1783
redefined a Neutrosophic SuperHyperUnequal Dimension Dominating if the mentioned Table holds, 1784
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1785
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1786
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1787
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1788
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 1789
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 1790
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1791
on a SuperHyperUnequal Dimension Dominating . It’s the main. It’ll be disciplinary to have the 1792
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1793
SuperHyperUnequal Dimension Dominating until the SuperHyperUnequal Dimension Dominating, then it’s offi- 1794
cially called a “SuperHyperUnequal Dimension Dominating” but otherwise, it isn’t a SuperHyperUnequal 1795
Dimension Dominating . There are some instances about the clarifications for the main definition 1796
titled a “SuperHyperUnequal Dimension Dominating ”. These two examples get more scrutiny and 1797
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 1798
based on a SuperHyperUnequal Dimension Dominating . For the sake of having a Neutrosophic Su- 1799
perHyperUnequal Dimension Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 1800
SuperHyperUnequal Dimension Dominating” and a “Neutrosophic SuperHyperUnequal Dimension Dominating 1801
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1802
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 1803
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 1804
rHyperGraph” if the intended Table holds. And a SuperHyperUnequal Dimension Dominating are 1805
redefined to a “Neutrosophic SuperHyperUnequal Dimension Dominating” if the intended Table holds. 1806
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1807
to get Neutrosophic type-results to make a Neutrosophic SuperHyperUnequal Dimension Dominating 1808
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1809
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperUnequal 1810
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 1811
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperUnequal Dimension 1812
Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 1813
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 1814
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperUnequal Dimension Dominating” where 1815

it’s the strongest [the maximum Neutrosophic value from all the SuperHyperUnequal Dimension 1816
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperUnequal 1817
Dimension Dominating .] SuperHyperUnequal Dimension Dominating . A graph is a SuperHyperUniform 1818
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1819

Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 1820
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 1821
with two exceptions; it’s SuperHyperUnequal Dimension Dominating if it’s only one SuperVertex as 1822
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1823
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1824
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1825
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1826
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 1827
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1828
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 1829
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 1830
the specific designs and the specific architectures. The SuperHyperModel is officially called 1831
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 1832

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 1833
and the common and intended properties between “specific” cells and “specific group” of cells 1834
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 1835
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 1836
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 1837
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1838
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1839
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1840
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1841
identified since there are some determinacy, indeterminacy and neutrality about the moves 1842
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1843
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1844

and what’s done. There are some specific models, which are well-known and they’ve got the 1845
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1846
cancer on the complex tracks and between complicated groups of cells could be fantasized 1847
by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Dimension Dominating, SuperHyperStar, 1848
the longest SuperHyperUnequal Dimension Dominating or the strongest SuperHyperUnequal Dimension 1850
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperUnequal Dimension 1851
Dominating, called SuperHyperUnequal Dimension Dominating, and the strongest SuperHyperUnequal Di- 1852
mension Dominating, called Neutrosophic SuperHyperUnequal Dimension Dominating, some general results 1853
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 1854
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1855
to form any style of a SuperHyperUnequal Dimension Dominating. There isn’t any formation of any 1856
SuperHyperUnequal Dimension Dominating but literarily, it’s the deformation of any SuperHyperUnequal 1857
Dimension Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 1858
rosophic SuperHyperUnequal Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic 1859
SuperHyperGraphs theory are proposed. 1860
Keywords: Neutrosophic SuperHyperGraph, SuperHyperUnequal Dimension Dominating, Cancer’s 1861
Neutrosophic Recognition 1862


CHAPTER 8 1864
Applied Notions Under The Scrutiny Of 1865
The Motivation Of This Scientific 1866
Research 1867
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1868
try to bring the motivations in the narrative ways. Some cells have been faced with some 1869
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1870
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1871
as some groups and some groups or individuals have excessive labels which all are raised from 1872
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1873
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1874
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1875
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1876
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1877
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1878
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1879
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1880
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1881
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1882
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1883
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1884
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1885
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1886
The special case of this disease is considered and as the consequences of the model, some 1887
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1888
the special region are the matter of mind. The recognition of the cancer could help to find some 1889
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1890
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1891
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1892
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1893
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1894
formation of the design and the architecture are formally called “ SuperHyperUnequal Dimension 1895
Dominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 1896
63
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 1897
recognition of the cancer in the long-term function. The specific region has been assigned by 1898
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1899
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1900
there are some determinacy, indeterminacy and neutrality about the moves and the effects of 1901
the cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1902
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1903
are some specific models, which are well-known and they’ve got the names, and some general 1904
models. The moves and the traces of the cancer on the complex tracks and between complicated 1905
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperUnequal Dimension 1906
Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1907
The aim is to find either the optimal SuperHyperUnequal Dimension Dominating or the Extreme 1908
SuperHyperUnequal Dimension Dominating in those Extreme SuperHyperModels. Some general results 1909
are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s 1910
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1911
SuperHyperEdges to form any style of a SuperHyperUnequal Dimension Dominating. There isn’t any 1912
formation of any SuperHyperUnequal Dimension Dominating but literarily, it’s the deformation of any 1913
SuperHyperUnequal Dimension Dominating. It, literarily, deforms and it doesn’t form. 1914
amount of SuperHyperUnequal Dimension Dominating” of either individual of cells or the groups of cells 1916
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperUnequal 1917
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 1918
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1919
messy and dense SuperHyperModels where embedded notions are illustrated? 1920
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1921
it motivates us to define different types of “ SuperHyperUnequal Dimension Dominating” and “Extreme 1922
SuperHyperUnequal Dimension Dominating” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1923

Then the research has taken more motivations to define SuperHyperClasses and to find some 1924
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1925
some instances and examples to make clarifications about the framework of this research. The 1926
general results and some results about some connections are some avenues to make key point of 1927
this research, “Cancer’s Recognition”, more understandable and more clear. 1928
The framework of this research is as follows. In the beginning, I introduce basic definitions 1929
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1930
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1931
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1932
review literature are applied to make sense about what’s going to figure out about the 1933
upcoming sections. The main definitions and their clarifications alongside some results 1934
about new notions, SuperHyperUnequal Dimension Dominating and Extreme SuperHyperUnequal Dimension 1935
Dominating, are figured out in sections “ SuperHyperUnequal Dimension Dominating” and “Extreme 1936
SuperHyperUnequal Dimension Dominating”. In the sense of tackling on getting results and in Unequal 1937
Dimension Dominating to make sense about continuing the research, the ideas of SuperHyperUniform 1938
and Extreme SuperHyperUniform are introduced and as their consequences, corresponded 1939
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 1940
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to origin of 1941

the notions, there are some smart steps toward the common notions to extend the new notions 1942
in new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results 1943
on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1944
about the general SuperHyperRelations and as concluding and closing section of theoretical 1945
research are contained in the section “General Results”. Some general SuperHyperRelations 1946
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1947
and discussed in the sections, “General Results”, “ SuperHyperUnequal Dimension Dominating”, 1948
“Extreme SuperHyperUnequal Dimension Dominating”, “Results on SuperHyperClasses” and “Results 1949
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1950
SuperHyperNotions to make sense about excellency of this research and going to figure out 1951
the word “best” as the description and adjective for this research as presented in section, 1952
“ SuperHyperUnequal Dimension Dominating”. The keyword of this research debut in the section 1953
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1954
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1955
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1956
are some scrutiny and discernment on what’s done and what’s happened in this research in 1957
the terms of “questions” and “problems” to make sense to figure out this research in featured 1958
style. The advantages and the limitations of this research alongside about what’s done in this 1959
research to make sense and to get sense about what’s figured out are included in the section, 1960
“Conclusion and Closing Remarks”. 1961

CHAPTER 9 1962
Extreme Preliminaries Of This Scientific 1963
Research On the Redeemed Ways 1964
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 1965
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 1966
2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 1967

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1968
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1969
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1970
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1971
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1972
ideas and their clarifications are addressed to Ref.[HG38]. 1973

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

Let X be a Unequal Dimension Dominating 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 [. 1976
Definition 9.0.2 (Single Valued Neutrosophic Set). (Ref.[HG11s],Definition 2.2,p.2).

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}.
67
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.[HG11s],Definition 2.5,p.2). 1977
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1978
where 1979
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 1980
(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); 1981
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1982
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 1983
0
1, 2, . . . , n ); 1984
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1985
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1986

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1987
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1988
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 . 1989
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1990
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1991
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1992
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1993

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1994
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1995
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1996
(NSHE) E. Thus, the ii0 th element of the Unequal Dimension Dominating of Neutrosophic 1997
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1998
are crisp sets. 1999

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

(Ref.[HG11s],Definition 2.7,p.3). 2001
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 2002
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 2003
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 2004
(i) If |Vi | = 1, then Vi is called vertex; 2005
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 2006
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 2007
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 2008
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 2009
SuperEdge; 2010
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 2011
SuperHyperEdge. 2012
If we choose different types of binary operations, then we could get hugely diverse types of 2013
general forms of Neutrosophic SuperHyperGraph (NSHG). 2014
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 2015

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 2016
x, y, z, w ∈ [0, 1]: 2017
(i) 1 ⊗ x = x; 2018
(ii) x ⊗ y = y ⊗ x; 2019
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 2020
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 2021

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)). 2022

where 2024

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 2025
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 2028
1, 2, . . . , n0 ); 2029
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2030
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2031
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2032
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 2033
0

SuperEdge; 2054
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 2057
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 2058
makes the patterns and regularities. 2059

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2060
of elements of SuperHyperEdges are the same. 2061
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2062
makes to have SuperHyperUniform more understandable. 2063
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2064
Classes as follows. 2065
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2066
two given SuperHyperEdges with two exceptions; 2067
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2068
SuperHyperEdges; 2069
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2070
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2071
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2072
in common; 2073
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2074
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2075
SuperHyperEdge in common; 2076
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2077
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2078
SuperVertex. 2079
Definition 9.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 2080
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2081
(i) Vi , Vi+1 ∈ Ei0 ; 2082
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2083
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2084
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2085
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2086
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2087
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2088
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2089
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 9.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

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

(Ref.[HG11s],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 2097
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2098
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2099
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2100
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2101
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2102

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a 2104
Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 2105
(ix) Neutrosophic t-Connective if T (E) ≥ maximum number of Neutrosophic t-strength 2106

of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi to 2107
Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s; 2108
(x) Neutrosophic i-Connective if I(E) ≥ maximum number of Neutrosophic i-strength 2109


(xi) Neutrosophic f-Connective if F (E) ≥ maximum number of Neutrosophic f-strength 2112

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2115
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2116
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2117
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal Dimension 2118

Dominating). 2119
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2121

or E 0 is called 2122
(i) Neutrosophic e-SuperHyperUnequal Dimension Dominating if the following expression is 2123

called Neutrosophic e-SuperHyperUnequal Dimension Dominating criteria holds 2124

(ii) Neutrosophic re-SuperHyperUnequal Dimension Dominating if the following expression is 2125

called Neutrosophic re-SuperHyperUnequal Dimension Dominating criteria holds 2126

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2127
(iii) Neutrosophic v-SuperHyperUnequal Dimension Dominating if the following expression is 2128
called Neutrosophic v-SuperHyperUnequal Dimension Dominating criteria holds 2129

(iv) Neutrosophic rv-SuperHyperUnequal Dimension Dominating if the following expression is 2130

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2132
(v) Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 2133

sophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimen- 2134
sion Dominating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv- 2135
SuperHyperUnequal Dimension Dominating. 2136

Definition 9.0.19. ((Neutrosophic) SuperHyperUnequal Dimension Dominating). 2137

(i) an Extreme SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic 2140

e-SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dom- 2141
inating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv- 2142
SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 2143
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2144

high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2145
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2146
form the Extreme SuperHyperUnequal Dimension Dominating; 2147
(ii) a Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 2148

SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 2151
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 2152
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2153
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 2154
form the Neutrosophic SuperHyperUnequal Dimension Dominating; 2155
(iii) an Extreme SuperHyperUnequal Dimension Dominating SuperHyperPolynomial if 2156

it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic re- 2157
SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, 2158
and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme 2159
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2160
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2161
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 2162
that they form the Extreme SuperHyperUnequal Dimension Dominating; and the Extreme power 2164
is corresponded to its Extreme coefficient; 2165
(iv) a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 2166

if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic re- 2167
and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutro- 2169
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2170

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 2171
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2172
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2173
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2174
SuperHyperUnequal Dimension Dominating; and the Neutrosophic power is corresponded to its 2175
Neutrosophic coefficient; 2176
(v) an Extreme V-SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 2177



high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2182
(vi) a Neutrosophic V-SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 2185

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 2189
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2190
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2191
that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; 2192
(vii) an Extreme V-SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 2193

of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2199

(viii) a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 2203

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2209
Neutrosophic coefficient. 2213
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnequal Dimension Dominating). 2214

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2215
(i) an δ−SuperHyperUnequal Dimension Dominating is a Neutrosophic kind of Neutrosophic 2216

SuperHyperUnequal Dimension Dominating such that either of the following expressions hold for 2217
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2218
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 2219
(29.1), holds if S is an δ−SuperHyperDefensive; 2220

Table 9.1: The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges
Belong to The Neutrosophic SuperHyperGraph Mentioned in the Definition (29.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
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
(ii) a Neutrosophic δ−SuperHyperUnequal Dimension Dominating is a Neutrosophic kind 2221

of Neutrosophic SuperHyperUnequal Dimension Dominating such that either of the following 2222
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2223
of s ∈ S : 2224
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 2225

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2226
For the sake of having a Neutrosophic SuperHyperUnequal Dimension Dominating, there’s a need to 2227
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2228
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 2229
there’s the usage of the position of labels to assign to the values. 2230
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2231
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2232
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2233
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2234
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2235

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2236
Thus Neutrosophic SuperHyperPath , SuperHyperUnequal Dimension Dominating, SuperHyperStar, 2237

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2238
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2239
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2240
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2241
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnequal Dimension 2242
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnequal 2243
Dimension Dominating more Neutrosophicly understandable. 2244
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperUnequal Dimension Dominating”. The 2246
2249

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

136TBL4

136TBL1
136DEF1 Definition 9.0.23. Assume a SuperHyperUnequal Dimension Dominating. It’s redefined a Neutro- 2250
sophic SuperHyperUnequal Dimension Dominating if the Table (29.3) holds. 2251

CHAPTER 10 2252
Extreme SuperHyper But As The Unequal Dimension Dominating 2253
Extensions Excerpt From Dense And 2254
Super Forms 2255
Definition 10.0.1. (Extreme event). 2256
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2257
is a probability Unequal Dimension Dominating. Any Extreme k-subset of A of V is called Extreme 2258
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2259
expression is called Extreme probability of A. 2260
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2261

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2262
is a probability Unequal Dimension Dominating. s Extreme k-events Ai , i ∈ I is called Extreme 2263

s-independent if the following expression is called Extreme s-independent criteria 2264
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Extreme k-events of A and B is called Extreme independent. The 2265
following expression is called Extreme independent criteria 2266
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2267

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2268
a probability Unequal Dimension Dominating. Any k-function Unequal Dimension Dominating like E is called 2269
Extreme k-Variable. If k = 2, then any 2-function Unequal Dimension Dominating like E is called 2270
Extreme Variable. 2271
The notion of independent on Extreme Variable is likewise. 2272
Definition 10.0.4. (Extreme Expectation). 2273
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2274
79
probability Unequal Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2275
Expectation if the following expression is called Extreme Expectation criteria 2276
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2277

a probability Unequal Dimension Dominating. an Extreme number is called Extreme Crossing if the 2279
following expression is called Extreme Crossing criteria 2280
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 10.0.6. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2281
S = (V, E) is a probability Unequal Dimension Dominating. Let m and n propose special Unequal Dimension 2282
Dominating. Then with m ≥ 4n, 2283
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be an Extreme random
k-subset of V obtained by choosing each SuperHyperVertex of G Extreme independently with
probability Unequal Dimension Dominating p := 4n/m, and set H := G[S] and H := G[S].
Define random variables X, Y, Z on V as follows: X is the Extreme number of SuperHyperVer-
tices, Y the Extreme number of SuperHyperEdges, and Z the Extreme number of crossings of H.
The trivial bound noted above, when applied to H, yields the inequality Z ≥ cr(H) ≥ Y − 3X.
By linearity of Extreme Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 2284
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2285
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2286
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let P be a SuperHyperSet of n 2287
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 2288
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2289
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2290

SuperHyperEdge are the segments between consecutive points on the SuperHyperLines which 2291
pass through at least k + 1 points of P. This Extreme SuperHyperGraph has at least kl 2292
SuperHyperEdges and Extreme crossing at most l choose two. Thus either kl < 4n, in which 2293
3
case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Extreme Crossing 2294
2 3
Lemma, and again l < 32n /k . 2295

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 2298
Then k < 5n4/3 . 2299
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2300
S = (V, E) is a probability Unequal Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle 2301
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2302
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2303
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2304

SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2305
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2306
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 2307
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2308

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2309
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2310
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2311
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2312
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2313
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let X be a nonnegative Extreme 2314
Variable and t a positive real number. Then 2315
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 2316
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2317
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let Xn be a nonnegative integer- 2318
valued variable in a probability Unequal Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2319
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2320
Proof. 2321
Consider S = (V, E) is a probability Unequal Dimension Dominating. A special SuperHyperGraph in 2323
Gn,p almost surely has stability number at most d2p−1 log ne. 2324

S = (V, E) is a probability Unequal Dimension Dominating. A special SuperHyperGraph in Gn,p is 2326
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2327
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2328
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2329
SuperHyperEdge of the Extreme SuperHyperGraph G. 2330
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2331
Extreme Variable for this Extreme Event. By equation, we have 2332
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .
Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 2333
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2334
X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 2335
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2336
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 2337
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2338
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2339
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2340
Definition 10.0.12. (Extreme Variance). 2341

probability Unequal Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2343
Variance if the following expression is called Extreme Variance criteria 2344
2
V x(E) = Ex((X − Ex(X)) ).
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let X be an Extreme Variable and 2346
let t be a positive real number. Then 2347
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2

S = (V, E) is a probability Unequal Dimension Dominating. Let X be an Extreme Variable and let t 2349
be a positive real number. Then 2350
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2351
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let Xn be an Extreme Variable in 2353
a probability Unequal Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2354
then 2355
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Unequal Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2357
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2358
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2359
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2361
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2362
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2363
S = (V, E) is a probability Unequal Dimension Dominating. As in the proof of related Theorem, the 2365
result is straightforward. 2366
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 2368
be as defined in previous Theorem. Then either: 2369
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2370
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2371
S = (V, E) is a probability Unequal Dimension Dominating. The latter is straightforward. 2373
Definition 10.0.17. (Extreme Threshold). 2374

a probability Unequal Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 2376
(one which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for 2377
P is a function f (n) such that: 2378
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2379
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2380

Definition 10.0.18. (Extreme Balanced). 2381

probability Unequal Dimension Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2383
there is a threshold function for the property of containing a copy of F as an Extreme 2384
SubSuperHyperGraph is called Extreme Balanced. 2385
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let F be a nonempty balanced 2387
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2388

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2389
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2392
the mentioned Extreme Figures in every Extreme items. 2393
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperUnequal 2394
Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2395
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2396
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2397
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2398
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2399
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2400
Extreme SuperHyperUnequal Dimension Dominating. 2401
C(N SHG)Extreme Unequal Dimension Dominating =

{}.
C(N SHG)Extreme Unequal Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Unequal Dimension Dominating =
{}.
C(N SHG)Extreme V-Unequal Dimension Dominating SuperHyperPolynomial
= 0z 0 .
2402
Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2404
E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2405

SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s only 2406
one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 2407
Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an Extreme 2408
endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given Extreme 2409

Figure 10.1: The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme
SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.3) 136NSHG1
{}.
= 0z 0 .
{}.
= 0z 0 .
2411

{}.
= 0z 0 .
{}.
= 0z 0 .
2414



{}.
= 0z 0 .
{}.
= 0z 0 .
2417

{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.

= z 7−c .
2420

{Ei }22
i=12 .
= z 3−a .
{Vi , V21 }10
i=1 .
= z 3−a .
2423

{EN SHG − {Ei }}.

= z 6−c .
{VN SHG − {Vi }}.
= z 7−c .
2426

{E1 , E2 }.
= z 3−a .
{VN SHG − {V1 , V11 }}.

= z 3−a .
2429

{E3i+1 , E23 }3i=0 .
= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
2432
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHy- 2433
perUnequal Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2434

{EN SHG − {E1 , E5 }}.



= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
2435

{EN SHG − {E1 , E6 }}.
= z 3−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
2438


{EN SHG − {E1 , E2 }}.
= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 5−a .
2441

{EN SHG − {E6 , E9 }}.
= z 2−a .


{VN SHG − {V1 , V5 }}.
= z 3−a .
2444

{E2 }.
= z 3−a .
{V1 }.
= z 5−a .
2447


{E3i+1 }1i=0 .
= z 3−a .
{V3i+1 }1i=0 .
= z 3−a .
2450

{E3i+1 }1i=0 .
= z 2−a .


{V2 , V17 , V7 }.
= z 2−a .
2453

{E3i+1 }1i=0 .
= z 2−a .


{V2 , V17 , V7 , V27 }.

= z 2−a .
2456

{E3i+2 }1i=0 .
= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
2459


{E3i+1 }3i=0 .
= z 2−a .
{V2i+1 }5i=0 .
= z 2−a .
2462

{EN SHG − {E1 }}.
= z 3−a .


{VN SHG − {V1 , {U2 , V2 , W2 }}.
= z 3−a .
2465

{E2 }.
= z |1−a| .
{V1 }.
= z |5−a| .
2468


{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
2471
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2472
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Unequal Dimension Dominating 2473
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2474
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2475

exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2476

SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.3) 95NHG1
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2477

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2478
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2479
quasi-R-Unequal Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2480
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2481
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Unequal Dimension Dominating, 2482
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2483
Proposition 10.0.23. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). If an

Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the Extreme
cardinality of the Extreme R-Unequal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Unequal Dimension Dominating 2484
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2485
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2486

SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.3) 95NHG2
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2487
of Extreme SuperHyperVertices are renamed to Extreme Unequal Dimension Dominating in some cases 2488
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2489
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2490
R-Unequal Dimension Dominating. 2491
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Unequal Dimension Dominating has, the least Extreme cardinality, the
lower sharp Extreme bound for Extreme cardinality, is the Extreme cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s an Extreme type-result-R-Unequal Dimension Dominating with the least Extreme cardinality, 2492
the lower sharp Extreme bound for cardinality. 2493
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2494
Then in the worst case, literally, 2495
C(N SHG)ExtremeQuasi−U nequalDimensionDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−U nequalDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−U nequalDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Unequal Dimension Dominating. In other words, the least cardinality, the 2496
lower sharp bound for the cardinality, of an Extreme type-result-Unequal Dimension Dominating is the 2497
cardinality of 2498

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−U nequalDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−U nequalDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Unequal Dimension Dominating
since neither amount of Extreme SuperHyperEdges nor amount of SuperHyperVertices where
amount refers to the Extreme number of SuperHyperVertices(-/SuperHyperEdges) more than
one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let us consider
the Extreme SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
This Extreme SuperHyperSet of the Extreme SuperHyperVertices has the eligibilities to propose
property such that there’s no Extreme SuperHyperVertex of an Extreme SuperHyperEdge is
common and there’s an Extreme SuperHyperEdge for all Extreme SuperHyperVertices but the
maximum Extreme cardinality indicates that these Extreme type-SuperHyperSets couldn’t give
us the Extreme lower bound in the term of Extreme sharpness. In other words, the Extreme
SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }}
of the Extreme SuperHyperVertices implies at least on-quasi-triangle style is up but sometimes

the Extreme SuperHyperSet
of the Extreme SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction

to the supposition on the connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Extreme
SuperHyperGraphs. Thus if we assume in the worst case, literally,
V \ V \ {aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
Is a quasi-R-Unequal Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a quasi-R-Unequal Dimension Dominating is the cardinality of
Then we’ve lost some connected loopless Extreme SuperHyperClasses of the connected loopless
Extreme SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-types but the

SuperHyperStable is only up in this quasi-R-Unequal Dimension Dominating. It’s the contradiction to

that fact on the generality. There are some counterexamples to deny this statement. One of
them comes from the setting of the graph titled path and cycle as the counterexamples-classes or
reversely direction star as the examples-classes, are well-known classes in that setting and they
could be considered as the examples-classes and counterexamples-classes for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Extreme SuperHyperSet has the necessary condition for the intended
definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of the main
definition but by the necessity of the pre-condition on the usage of the main definition.
The Extreme structure of the Extreme R-Unequal Dimension Dominating decorates the Extreme
SuperHyperVertices don’t have received any Extreme connections so as this Extreme style
implies different versions of Extreme SuperHyperEdges with the maximum Extreme cardinality
in the terms of Extreme SuperHyperVertices are spotlight. The lower Extreme bound is to
have the maximum Extreme groups of Extreme SuperHyperVertices have perfect Extreme
connections inside each of SuperHyperEdges and the outside of this Extreme SuperHyperSet
doesn’t matter but regarding the connectedness of the used Extreme SuperHyperGraph
arising from its Extreme properties taken from the fact that it’s simple. If there’s no
more than one Extreme SuperHyperVertex in the targeted Extreme SuperHyperSet, then
there’s no Extreme connection. Furthermore, the Extreme existence of one Extreme
SuperHyperVertex has no Extreme effect to talk about the Extreme R-Unequal Dimension Dominating.
Since at least two Extreme SuperHyperVertices involve to make a title in the Extreme
background of the Extreme SuperHyperGraph. The Extreme SuperHyperGraph is obvious
if it has no Extreme SuperHyperEdge but at least two Extreme SuperHyperVertices make
the Extreme version of Extreme SuperHyperEdge. Thus in the Extreme setting of non-
obvious Extreme SuperHyperGraph, there are at least one Extreme SuperHyperEdge. It’s
necessary to mention that the word “Simple” is used as Extreme adjective for the initial
Extreme SuperHyperGraph, induces there’s no Extreme appearance of the loop Extreme
version of the Extreme SuperHyperEdge and this Extreme SuperHyperGraph is said to be
loopless. The Extreme adjective “loop” on the basic Extreme framework engages one Extreme
SuperHyperVertex but it never happens in this Extreme setting. With these Extreme bases,
on an Extreme SuperHyperGraph, there’s at least one Extreme SuperHyperEdge thus there’s
at least an Extreme R-Unequal Dimension Dominating has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Unequal Dimension Dominating has the Extreme cardinality
at least an Extreme SuperHyperEdge. Assume an Extreme SuperHyperSet V \ V \ {z}. This
Extreme SuperHyperSet isn’t an Extreme R-Unequal Dimension Dominating since either the Extreme
SuperHyperGraph is an obvious Extreme SuperHyperModel thus it never happens since there’s
no Extreme usage of this Extreme framework and even more there’s no Extreme connection
inside or the Extreme SuperHyperGraph isn’t obvious and as its consequences, there’s an
Extreme contradiction with the term “Extreme R-Unequal Dimension Dominating” since the maximum
Extreme cardinality never happens for this Extreme style of the Extreme SuperHyperSet and
beyond that there’s no Extreme connection inside as mentioned in first Extreme case in the

forms of drawback for this selected Extreme SuperHyperSet. Let
Comes up. This Extreme case implies having the Extreme style of on-quasi-triangle Extreme
style on the every Extreme elements of this Extreme SuperHyperSet. Precisely, the Extreme
R-Unequal Dimension Dominating is the Extreme SuperHyperSet of the Extreme SuperHyperVertices
such that some Extreme amount of the Extreme SuperHyperVertices are on-quasi-triangle
Extreme style. The Extreme cardinality of the v SuperHypeSet
Is the maximum in comparison to the Extreme SuperHyperSet
But the lower Extreme bound is up. Thus the minimum Extreme cardinality of the maximum
Extreme cardinality ends up the Extreme discussion. The first Extreme term refers to the
Extreme setting of the Extreme SuperHyperGraph but this key point is enough since there’s an
Extreme SuperHyperClass of an Extreme SuperHyperGraph has no on-quasi-triangle Extreme
style amid some amount of its Extreme SuperHyperVertices. This Extreme setting of the
Extreme SuperHyperModel proposes an Extreme SuperHyperSet has only some amount Extreme
SuperHyperVertices from one Extreme SuperHyperEdge such that there’s no Extreme amount
of Extreme SuperHyperEdges more than one involving these some amount of these Extreme
SuperHyperVertices. The Extreme cardinality of this Extreme SuperHyperSet is the maximum
and the Extreme case is occurred in the minimum Extreme situation. To sum them up, the
Extreme SuperHyperSet
Has the maximum Extreme cardinality such that
Contains some Extreme SuperHyperVertices such that there’s distinct-covers-order-amount

Extreme SuperHyperEdges for amount of Extreme SuperHyperVertices taken from the Extreme
SuperHyperSet
It means that the Extreme SuperHyperSet of the Extreme SuperHyperVertices
Is an Extreme R-Unequal Dimension Dominating for the Extreme SuperHyperGraph as used Extreme
background in the Extreme terms of worst Extreme case and the common theme of the
lower Extreme bound occurred in the specific Extreme SuperHyperClasses of the Extreme
SuperHyperGraphs which are Extreme free-quasi-triangle.

Assume an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme number of the

Extreme SuperHyperVertices. Then every Extreme SuperHyperVertex has at least no Extreme
SuperHyperEdge with others in common. Thus those Extreme SuperHyperVertices have
the eligibles to be contained in an Extreme R-Unequal Dimension Dominating. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Unequal Dimension Dominating.
Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Extreme SuperHyperVertices of an Extreme SuperHyperEdge E ∈ EESHG:(V,E) . Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Extreme
SuperHyperVertices of the Extreme SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z
if and only if Zi and Zj are the Extreme SuperHyperVertices and there’s only and only one
Extreme SuperHyperEdge E ∈ EESHG:(V,E) between the Extreme SuperHyperVertices Zi and
Zj . The other definition for the Extreme SuperHyperEdge E ∈ EESHG:(V,E) in the terms of
Extreme R-Unequal Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Unequal Dimension Dominating but
with slightly differences in the maximum Extreme cardinality amid those Extreme type-
SuperHyperSets of the Extreme SuperHyperVertices. Thus the Extreme SuperHyperSet of the
Extreme SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Extreme cardinality ,

z
and
is formalized with mathematical literatures on the Extreme R-Unequal Dimension Dominating. Let
E
Zi ∼ Zj , be defined as Zi and Zj are the Extreme SuperHyperVertices belong to the Extreme
SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 2499
Extreme R-Unequal Dimension Dominating =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.

2500
Extreme R-Unequal Dimension Dominating =

Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Unequal Dimension Dominating where E ∈ EESHG:(V,E)

is fixed that means Ex = E ∈ EESHG:(V,E) . for all Extreme intended SuperHyperVertices but
in an Extreme Unequal Dimension Dominating, Ex = E ∈ EESHG:(V,E) could be different and it’s
not unique. To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). If
an Extreme SuperHyperEdge E ∈ EESHG:(V,E) has z Extreme SuperHyperVertices, then the
Extreme cardinality of the Extreme R-Unequal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Unequal Dimension Dominating 2501
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2502
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2503
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2504
number of Extreme SuperHyperVertices are renamed to Extreme Unequal Dimension Dominating in 2505
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2506
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2507
contained in an Extreme R-Unequal Dimension Dominating. 2508
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Extreme 2509
SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the Extreme 2510
optimal SuperHyperObject. It specially delivers some remarks on the Extreme SuperHyperSet of 2511
the Extreme SuperHyperVertices such that there’s distinct amount of Extreme SuperHyperEdges 2512
for distinct amount of Extreme SuperHyperVertices up to all taken from that Extreme Super- 2513
HyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of the Extreme 2514
SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or it doesn’t 2515

have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 2516
least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. Thus 2517
it forms an Extreme quasi-R-Unequal Dimension Dominating where the Extreme completion of the 2518
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Unequal Dimension 2519
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coin- 2520
cide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2521
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2522
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2523
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2524
Extreme style of the embedded Extreme R-Unequal Dimension Dominating. The interior types of the 2525
Extreme SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors 2526
are only affected by the interior Extreme SuperHyperVertices. The common connections, more 2527
precise and more formal, the perfect unique connections inside the Extreme SuperHyperSet for 2528
any distinct types of Extreme SuperHyperVertices pose the Extreme R-Unequal Dimension Dominating. 2529
Thus Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge 2530
and in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that 2531
Extreme SuperHyperEdge. In the embedded Extreme Unequal Dimension Dominating, there’s the 2532
usage of exterior Extreme SuperHyperVertices since they’ve more connections inside more 2533

than outside. Thus the title “exterior” is more relevant than the title “interior”. One Extreme 2534
SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet of the Extreme 2535
SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead 2536
on the optimal case implying the Extreme R-Unequal Dimension Dominating. The Extreme R-Unequal 2537
Dimension Dominating with the exclusion of the exclusion of all Extreme SuperHyperVertices in one 2538
Extreme SuperHyperEdge and with other terms, the Extreme R-Unequal Dimension Dominating with 2539
the inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2540
quasi-R-Unequal Dimension Dominating. To sum them up, in a connected non-obvious Extreme Super- 2541
HyperGraph ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2542
only the maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of 2543
any given Extreme quasi-R-Unequal Dimension Dominating minus all Extreme SuperHypeNeighbor to 2544
some of them but not all of them. In other words, there’s only an unique Extreme SuperHy- 2545
perEdge E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in an Extreme 2546
quasi-R-Unequal Dimension Dominating, minus all Extreme SuperHypeNeighbor to some of them but 2547
not all of them. 2548
The main definition of the Extreme R-Unequal Dimension Dominating has two titles. an Ex- 2549
treme quasi-R-Unequal Dimension Dominating and its corresponded quasi-maximum Extreme R- 2550
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2551
there’s an Extreme quasi-R-Unequal Dimension Dominating with that quasi-maximum Extreme Supe- 2552
rHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2553
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to 2554
take the collection of all the Extreme quasi-R-Unequal Dimension Dominatings for all Extreme numbers 2555
less than its Extreme corresponded maximum number. The essence of the Extreme Unequal 2556
Dimension Dominating ends up but this essence starts up in the terms of the Extreme quasi-R-Unequal 2557
Dimension Dominating, again and more in the operations of collecting all the Extreme quasi-R-Unequal 2558
Dimension Dominatings acted on the all possible used formations of the Extreme SuperHyperGraph 2559
to achieve one Extreme number. This Extreme number is 2560
considered as the equivalence class for all corresponded quasi-R-Unequal Dimension Dominatings. Let 2561
zExtreme Number , SExtreme SuperHyperSet and GExtreme Unequal Dimension Dominating be an Extreme num- 2562
ber, an Extreme SuperHyperSet and an Extreme Unequal Dimension Dominating. Then 2563
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Unequal Dimension Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Unequal Dimension Dominating is re-formalized 2564
and redefined as follows. 2565
GExtreme Unequal Dimension Dominating ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number
{SExtreme SuperHyperSet |
= zExtreme Number }.

To get more precise perceptions, the follow-up expressions propose another formal technical 2566
definition for the Extreme Unequal Dimension Dominating. 2567
GExtreme Unequal Dimension Dominating =

{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
∪zExtreme Number {SExtreme SuperHyperSet |
= zExtreme Number |
= max zExtreme Number }.
[zExtreme Number ]Extreme Class
In more concise and more convenient ways, the modified definition for the Extreme Unequal 2568
poses the upcoming expressions.
Dimension Dominating 2569

{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
To translate the statement to this mathematical literature, the formulae will be revised. 2570

= max zExtreme Number

= max |E| | E ∈ EESHG:(V,E) }.
And then, 2571


To get more visions in the closer look-up, there’s an overall overlook. 2572
GExtreme Unequal Dimension Dominating ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =


2573

{S ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

2574


2575


Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2576
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2577
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2578
It’s, literarily, another name for “Extreme Quasi-Unequal Dimension Dominating” but, precisely, it’s the 2579
generalization of “Extreme Quasi-Unequal Dimension Dominating” since “Extreme Quasi-Unequal Dimension 2580
Dominating” happens “Extreme Unequal Dimension Dominating” in an Extreme SuperHyperGraph as 2581

initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2582
“Extreme Unequal Dimension Dominating” in an Extreme SuperHyperGraph as initial framework and 2583
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2584
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2585
“Extreme Quasi-Unequal Dimension Dominating”, and “Extreme Unequal Dimension Dominating” are up. 2586
Thus, let 2587

zExtreme Number , NExtreme SuperHyperNeighborhood and 2588
GExtreme Unequal Dimension Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2589
and an Extreme Unequal Dimension Dominating and the new terms are up. 2590
GExtreme Unequal Dimension Dominating ∈ ∪zExtreme Number

[zExtreme Number ]Extreme Class =
∪zExtreme Number {NExtreme SuperHyperNeighborhood |
|NExtreme SuperHyperNeighborhood |Extreme Cardinality


{NExtreme SuperHyperNeighborhood
∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
|NExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number |
2591

∈ ∪zExtreme Number [zExtreme Number ]Extreme Class |
2592

And with go back to initial structure, 2593
GExtreme Unequal Dimension Dominating ∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =

2594

∈ ∪zExtreme Number [zExtreme Number ]Extreme Class =
= zExtreme Number |

2595


2596


Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Unequal Dimension Dominating if for any of
them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at
all minus all Extreme SuperHypeNeighbors to any amount of them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Extreme SuperHyperSet of Extreme SuperHyperVertices is the simple Extreme
type-SuperHyperSet of the Extreme R-Unequal Dimension Dominating.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,

Is the simple Extreme type-SuperHyperSet of the Extreme R-Unequal Dimension Dominating. The
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Unequal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph

ESHG : (V, E) is an Extreme type-SuperHyperSet with
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge amid some Extreme
SuperHyperVertices instead of all given by
Extreme Unequal Dimension Dominating is related to the Extreme SuperHyperSet of the Extreme
SuperHyperVertices,
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Unequal Dimension Dominating is up. The obvious simple Extreme

type-SuperHyperSet called the Extreme Unequal Dimension Dominating is an Extreme SuperHyperSet

includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Unequal Dimension Dominating is up. To sum them
up, the Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme R-Unequal Dimension

. Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Dominating
(V \ V \ {x, z}) ∪ {xy}

or
(V \ V \ {x, z}) ∪ {zy}
is an Extreme R-Unequal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such
that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices instead
of all given by that Extreme type-SuperHyperSet called the Extreme Unequal Dimension Dominating
and it’s an Extreme Unequal Dimension Dominating. Since it’s
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su-

perHyperVertices such that there’s no an Extreme SuperHyperEdge for some amount Extreme
SuperHyperVertices instead of all given by that Extreme type-SuperHyperSet called the Extreme
Unequal Dimension Dominating. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Unequal Dimension Dominating,

is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Unequal Dimension
, not:
Dominating
Is the Extreme SuperHyperSet, not:

does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2597
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2598
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2599
the 2600

“Extreme R-Unequal Dimension Dominating” 2601
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2602
Extreme R-Unequal Dimension Dominating, 2603
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only an Extreme free-triangle embedded SuperHyperModel and an
Extreme on-triangle embedded SuperHyperModel but also it’s an Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Unequal Dimension Dominating amid those obvious simple Extreme type-SuperHyperSets
of the Extreme Unequal Dimension Dominating, are
In a connected Extreme SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is an Extreme R-Unequal Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Unequal Dimension Dominating is the cardinality of
2604
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2605
Extreme SuperHyperVertices belong to any Extreme quasi-R-Unequal Dimension Dominating if for any 2606
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2607
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2608
all minus all Extreme SuperHypeNeighbors to any amount of them. 2609

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2610
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2611
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2612
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2613
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2614
R-Unequal Dimension Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2615
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2616
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2617
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2618
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Unequal Dimension Dominating. 2619
Since it doesn’t have 2620
2621

the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2622

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2623
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2624
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Supe- 2625
rHyperVertices but it isn’t an Extreme R-Unequal Dimension Dominating. Since it doesn’t do 2626
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2627
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2628
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2629
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2630
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2631
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2632
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2633
Thus the obvious Extreme R-Unequal Dimension Dominating, VESHE is up. The obvious simple 2634
Extreme type-SuperHyperSet of the Extreme R-Unequal Dimension Dominating, VESHE , is an Extreme 2635
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2636
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2637
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2638
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2639
S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2640

some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2641
ESHG : (V, E). Any Extreme R-Unequal Dimension Dominating only contains all interior Extreme 2642
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2643
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2644
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2645
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2646
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2647
The SuperHyperNotion, namely, Unequal Dimension Dominating, is up. There’s neither empty 2648
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2649
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2650
the Extreme Unequal Dimension Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2651
perEdges[SuperHyperVertices], 2652

|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−U nequalDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−U nequalDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Unequal Dimension Dominating. The Extreme 2653
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2654

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Unequal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph 2655

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2656
2657
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2658
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2659

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2660
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2661
Extreme SuperHyperSet. Thus the non-obvious Extreme Unequal Dimension Dominating is up. The 2662
obvious simple Extreme type-SuperHyperSet called the Extreme Unequal Dimension Dominating is an 2663
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2664
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2665

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2666
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Unequal Dimension 2667
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2668

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is the non-obvious simple Extreme type-SuperHyperSet of the Extreme Unequal Dimension Dominating. 2670
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2671

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Unequal Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph 2672
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2673

that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2674
that Extreme type-SuperHyperSet called the Extreme Unequal Dimension Dominating and it’s an 2675
Extreme Unequal Dimension Dominating. Since it’s 2676
2677
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2678
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2679

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2680
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2681
intended Extreme SuperHyperSet, 2682

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Unequal Dimension Dominating , 2683

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Is up. The obvious simple Extreme type-SuperHyperSet of the Extreme Unequal Dimension Dominating, 2684
not: 2685

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2686

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Extreme SuperHyperGraph 2687
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2688
SuperHyperSet called the 2689
“Extreme Unequal Dimension Dominating ” 2690
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2691
Extreme Unequal Dimension Dominating , 2692
is only and only 2693

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2694

CHAPTER 11 2695
The Extreme Departures on The 2696
Theoretical Results Toward Theoretical 2697
Motivations 2698
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2699
SuperHyperClasses. 2700
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2701

|E |
{E3i+2 }i=0ESHP .
| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
{V EXT ERN AL } ESHP
=z 2i+2 i=0 .
Proof. Let 2702
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2703
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
121
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

perUnequal Dimension Dominating in the Example (42.0.5) 136NSHG18a
...,
EXT ERN AL
E |EN SHG | , V |EN SHG |
3 3
be a longest path taken from a connected Extreme SuperHyperPath ESHP : (V, E). There’s a 2704
new way to redefine as 2705
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 2706
to ViEXT ERN AL in the literatures of SuperHyperUnequal Dimension Dominating. The latter is 2707
straightforward. 2708
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2709
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2710
(31.1), is the SuperHyperUnequal Dimension Dominating. 2711
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2712

|E |
{E3i+2 }i=0ESHP .


| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 2713
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2714
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Extreme SuperHyperCycle ESHC : (V, E). There’s a 2715

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2720
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2721
SuperHyperModel (31.2), is the Extreme SuperHyperUnequal Dimension Dominating. 2722

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

SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.7) 136NSHG19a
Proposition 11.0.5. Assume a connected Extreme SuperHyperStar ESHS : (V, E). Then 2723

{EN SHG − {E1 , E2 }}.
= z 3−a .
{VN SHG − {ViIN T ERN AL , CEN T ER}}.
= z 3−a .
Proof. Let 2724
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2725
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.9) 136NSHG20a
be a longest path taken a connected Extreme SuperHyperStar ESHS : (V, E). There’s a new 2726
way to redefine as 2727

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2731
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2732
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2733
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperUnequal 2734
Dimension Dominating. 2735
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2736

{EN SHG − {EPi , EPj }i6=j }.


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2737
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V|Pi |=minP ∈E |Pj | , E|Pi |=minPj ∈EN SHG |Pj | .
j N SHG
2738
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
E|Pi |=minPj ∈EN SHG |Pj | , V|Pi |=minP ∈E |Pj |
j N SHG
is a longest path taken from a connected Extreme SuperHyperBipartite ESHB : (V, E). There’s 2739
a new way to redefine as 2740

straightforward. Then there’s no at least one SuperHyperUnequal Dimension Dominating. Thus 2743
the notion of quasi may be up but the SuperHyperNotions based on SuperHyperUnequal Dimension 2744
Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2745
could have one SuperHyperVertex as the representative in the 2746
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperUnequal Dimension Dominating taken from a connected Extreme SuperHyper- 2747
Bipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 2748
SuperHyperPart SuperHyperEdges are attained in any solution 2749
P :

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

Extreme SuperHyperUnequal Dimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2750
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2751
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2752
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2753
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2754
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperUnequal Dimension Dominating. 2755
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2756
Then 2757

= z b−a .
= z b−a .

Proof. Let 2758
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2759
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
Multipartite ESHM : (V, E). There’s a new way to redefine as 2761

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 2766
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : 2768

(V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of-SuperHyperPart 2769
SuperHyperEdges are attained in any solution 2770
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2771

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

SuperHyperUnequal Dimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2773
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2774
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2775
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2776
the Extreme SuperHyperUnequal Dimension Dominating. 2777
∗
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ). 2778
Then, 2779

|E |
{E3i+2 }i=0ESHP ∪ E ∗ .
| min |E | |Ei |
{E3i+2 } ESHP ∪E ∗
=z i=0 .
|E |
EXT ERN AL
{V2i+2 }i=0ESHP ∪ V ∗ .
| min |E | |Vi |
{V EXT ERN AL } ESHP ∪V ∗
=z 2i+2 i=0 .
Proof. Let 2780
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

Extreme SuperHyperUnequal Dimension Dominating in the Extreme Example (42.0.15) 136NSHG23a
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
Wheel ESHW : (V, E). There’s a new way to redefine as 2782

straightforward. Then there’s at least one SuperHyperUnequal Dimension Dominating. Thus the notion 2785
of quasi isn’t up and the SuperHyperNotions based on SuperHyperUnequal Dimension Dominating 2786
could be applied. The unique embedded SuperHyperUnequal Dimension Dominating proposes some 2787
longest SuperHyperUnequal Dimension Dominating excerpt from some representatives. The latter is 2788
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2790
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2791
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2792
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2793
Extreme SuperHyperUnequal Dimension Dominating. 2794

CHAPTER 12 2795
The Surveys of Mathematical Sets On 2796
The Results But As The Initial Motivation 2797
For the SuperHyperUnequal Dimension Dominating, Extreme SuperHyperUnequal Dimension Dominating, and 2798
the Extreme SuperHyperUnequal Dimension Dominating, some general results are introduced. 2799
Remark 12.0.1. Let remind that the Extreme SuperHyperUnequal Dimension Dominating is “redefined” 2800
on the positions of the alphabets. 2801
Corollary 12.0.2. Assume Extreme SuperHyperUnequal Dimension Dominating. Then 2802
Extreme SuperHyperU nequalDimensionDominating =

{theSuperHyperU nequalDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nequalDimensionDominating
|ExtremecardinalityamidthoseSuperHyperU nequalDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2803
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2804
and the neutrality, for i = 1, 2, 3, respectively. 2805
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2806
alphabet. Then the notion of Extreme SuperHyperUnequal Dimension Dominating and SuperHyperUnequal 2807
Dimension Dominating coincide. 2808
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperUnequal 2810
Dimension Dominating if and only if it’s a SuperHyperUnequal Dimension Dominating. 2811
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnequal 2813
Dimension Dominating if and only if it’s a longest SuperHyperUnequal Dimension Dominating. 2814
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2815
identical letter of the alphabet. Then its Extreme SuperHyperUnequal Dimension Dominating is its 2816
SuperHyperUnequal Dimension Dominating and reversely. 2817
131
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperUnequal Dimension Dominating, 2818

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2819
identical letter of the alphabet. Then its Extreme SuperHyperUnequal Dimension Dominating is its 2820
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnequal 2822
isn’t well-defined if and only if its SuperHyperUnequal Dimension Dominating isn’t
well-defined. 2824
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2825

Extreme SuperHyperUnequal Dimension Dominating isn’t well-defined if and only if its SuperHyperUnequal 2826
Dimension Dominating isn’t well-defined. 2827

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2829
Extreme SuperHyperUnequal Dimension Dominating isn’t well-defined if and only if its SuperHyperUnequal 2830
Dimension Dominating isn’t well-defined. 2831
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperUnequal 2832
is well-defined if and only if its SuperHyperUnequal Dimension Dominating is well-
defined. 2834
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2835
Extreme SuperHyperUnequal Dimension Dominating is well-defined if and only if its SuperHyperUnequal 2836
Dimension Dominating is well-defined. 2837

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2839
Extreme SuperHyperUnequal Dimension Dominating is well-defined if and only if its SuperHyperUnequal 2840
Dimension Dominating is well-defined. 2841
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2842
(i) : the dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2843
(ii) : the strong dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2844
(iii) : the connected dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2845
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2846
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2847
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2848
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2849
(i) : the SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2850
(ii) : the strong SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2851
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2852
(iv) : the δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2853

(v) : the strong δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2854
(vi) : the connected δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2855
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2856

independent SuperHyperSet is 2857
(iii) : the connected SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2860
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2864

which is a SuperHyperUnequal Dimension Dominating/SuperHyperPath. Then V is a maximal 2865
(i) : SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2866
(ii) : strong SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2867
(iii) : connected SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2868
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2869
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2870
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2871
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2872
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2873
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2874
(i) : dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2875
(ii) : strong dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2876
(iii) : connected dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2877
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2878
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2879
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2880
which is a SuperHyperUnequal Dimension Dominating/SuperHyperPath. Then the number of 2883

(i) : the SuperHyperUnequal Dimension Dominating; 2884
(ii) : the SuperHyperUnequal Dimension Dominating; 2885
(iii) : the connected SuperHyperUnequal Dimension Dominating; 2886
(iv) : the O(ESHG)-SuperHyperUnequal Dimension Dominating; 2887
(v) : the strong O(ESHG)-SuperHyperUnequal Dimension Dominating; 2888
(vi) : the connected O(ESHG)-SuperHyperUnequal Dimension Dominating. 2889
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2890
coincide. 2891

which is a SuperHyperWheel. Then the number of 2893
(i) : the dual SuperHyperUnequal Dimension Dominating; 2894
(ii) : the dual SuperHyperUnequal Dimension Dominating; 2895
(iii) : the dual connected SuperHyperUnequal Dimension Dominating; 2896
(iv) : the dual O(ESHG)-SuperHyperUnequal Dimension Dominating; 2897
(v) : the strong dual O(ESHG)-SuperHyperUnequal Dimension Dominating; 2898
(vi) : the connected dual O(ESHG)-SuperHyperUnequal Dimension Dominating. 2899
coincide. 2901

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2903
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2904
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2905
is a 2906
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2910
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2911
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2912


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2915
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2916
SuperHyperPart is a 2917
(iv) : δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2921
(v) : strong δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2922
(vi) : connected δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2923

SuperHyperMultipartite. Then Then the number of 2926
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2933
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2934
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2936
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2937
(iv) : SuperHyperUnequal Dimension Dominating; 2941
(v) : strong 1-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2942
(vi) : connected 1-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2943

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2944
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2945
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2946
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2947

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 2948
t>
2
(iv) : ( O(ESHG:(V,E))
2 + 1)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2952
(v) : strong ( O(ESHG:(V,E))

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

2 + 1)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2954
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2955
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2956
dual 2957
(iv) : 0-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2961
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2964
perComplete. Then there’s no independent SuperHyperSet. 2965
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2966
HyperUnequal Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2967
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2968
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2972
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 2973
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 2974

Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2975
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 2976
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 2977
t>
2
setting of a dual 2978


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2985
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2986
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2987
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2988
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2989
SuperHyperDefensive SuperHyperUnequal Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2990
(i) v ∈ Ns (x); 2991
(ii) vx ∈ E. 2992
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2993
SuperHyperDefensive SuperHyperUnequal Dimension Dominating, then 2994
(i) S is SuperHyperUnequal Dimension Dominating set; 2995
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2996
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2997
(i) Γ ≤ O; 2998
(ii) Γs ≤ On . 2999
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 3000
connected. Then 3001
(i) Γ ≤ O − 1; 3002
(ii) Γs ≤ On − Σ3i=1 σi (x). 3003
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 3004
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperUnequal 3005
Dimension Dominating; 3006

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 3007
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 3008
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 3009
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 3011
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnequal Dimension 3012
Dominating; 3013
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 3014
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3015
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3016
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperUnequal Dimension Dominating. Then 3018
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnequal 3019
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 3021
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 3022
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 3023
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperUnequal Dimension Dominating. Then 3025

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3029
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3030
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3032
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnequal Dimension Dominating; 3033
(ii) Γ = 1; 3034
(iii) Γs = Σ3i=1 σi (c); 3035
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnequal Dimension Dominating. 3036
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3037

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3038
SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 3039
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3040
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3041
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3042
SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 3043
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3044
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperUnequal Dimension 3045
Dominating; 3046
(ii) Γ = b n2 c + 1; 3047
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 3048
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperUnequal 3049
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3051
bnc
2
Dominating; 3053
(ii) Γ = b n2 c; 3054

bnc ; 3055
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive SuperHy- 3056
perUnequal Dimension Dominating. 3057
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 3058

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 3059
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperUnequal 3060

Dimension Dominating for N SHF; 3061
(ii) Γ = m for N SHF : (V, E); 3062
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3063
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnequal 3064
Dimension Dominating for N SHF : (V, E). 3065
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3066
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3067

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHy- 3068
perUnequal Dimension Dominating for N SHF; 3069
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3070

b n c+1 for N SHF : (V, E); 3071
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=12
are only a dual maximal SuperHyperUnequal Dimension 3072
Dominating for N SHF : (V, E). 3073
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 3074

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3075
bnc
Dominating for N SHF : (V, E); 3077
(ii) Γ = b n2 c for N SHF : (V, E); 3078

bnc for N SHF : (V, E); 3079
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnequal Dimension Dominating 3080
for N SHF : (V, E). 3081
following statements hold; 3083
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3084

SuperHyperUnequal Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperUnequal 3085
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Su- 3087

perHyperUnequal Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnequal 3088
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3092
SuperHyperUnequal Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperUnequal 3093


perHyperUnequal Dimension Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnequal 3096
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 3098

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

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

Proposition 12.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Extreme 3108

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

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 3114

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

SuperHyperGraph which is a SuperHyperComplete. Then following statements hold; 3119
(i) ∀a ∈ S, |Ns (a) ∩ S| b O−12 c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3122
(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an (O − 1)-SuperHyperDefensive 3124

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


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

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


SuperHyperGraph which is SuperHyperUnequal Dimension Dominating. Then following statements hold; 3139
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperUnequal 3140
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3142

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 3144

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


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

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

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


CHAPTER 13 3158
Extreme Applications in Cancer’s 3159
Extreme Recognition 3160
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3161
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3162
as the consequences of the model, some parameters are used. The cells are under attack of this 3163
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3164
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3165
In the following, some Extreme steps are Extreme devised on this disease. 3166
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3167
function. 3168
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3169
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3170
effects of the cancer on that region; this event leads us to choose another model [it’s said 3173
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3174
what’s done. 3175
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3176
they’ve got the names, and some general Extreme models. The moves and the Extreme 3177
traces of the cancer on the complex tracks and between complicated groups of cells could 3178
be fantasized by an Extreme SuperHyperPath(-/SuperHyperUnequal Dimension Dominating, 3179
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3180
aim is to find either the Extreme SuperHyperUnequal Dimension Dominating or the Extreme 3181
SuperHyperUnequal Dimension Dominating in those Extreme Extreme SuperHyperModels. 3182
143
CHAPTER 14 3183
Case 1: The Initial Extreme Steps 3184
Toward Extreme SuperHyperBipartite 3185
as Extreme SuperHyperModel 3186
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3187
is Extreme highlighted and Extreme featured. 3188
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3189
partite is obtained. 3190
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3191
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperUnequal Dimension Dominating 136NSHGaa21aa
145
Belong to The Extreme SuperHyperBipartite

136TBLaa21aa
result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperBipartite 3192

ESHB : (V, E), in the Extreme SuperHyperModel (34.1), is the Extreme SuperHy- 3193

CHAPTER 15 3195
Case 2: The Increasing Extreme Steps 3196
Toward Extreme 3197
SuperHyperMultipartite as Extreme 3198
SuperHyperModel 3199
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3200
ite is Extreme highlighted and Extreme featured. 3201
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3202
partite is obtained. 3203
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3204
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

147
Belong to The Extreme SuperHyperMultipartite

136TBLaa22aa
of the Extreme SuperHyperVertices of the connected Extreme SuperHyperMultipartite 3205

ESHM : (V, E), in the Extreme SuperHyperModel (35.1), is the Extreme SuperHy- 3206

CHAPTER 16 3208
Wondering Open Problems But As The 3209
Directions To Forming The Motivations 3210
In what follows, some “problems” and some “questions” are proposed. 3211
The SuperHyperUnequal Dimension Dominating and the Extreme SuperHyperUnequal Dimension Dominating 3212
are defined on a real-world application, titled “Cancer’s Recognitions”. 3213
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3214
recognitions? 3215
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperUnequal Dimension 3216
and the Extreme SuperHyperUnequal Dimension Dominating?
Dominating 3217
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3218
them? 3219
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnequal 3220
and the Extreme SuperHyperUnequal Dimension Dominating?
Problem 16.0.5. The SuperHyperUnequal Dimension Dominating and the Extreme SuperHyperUnequal 3222
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperUnequal Dimension Dominating, are there else? 3224
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3225
Numbers types-results? 3226
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3227
the multiple types of SuperHyperNotions? 3228
149
CHAPTER 17 3229
Conclusion and Closing Remarks 3230
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3231
research are illustrated. Some benefits and some advantages of this research are highlighted. 3232
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3233
In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnequal Dimension 3234
Dominating. For that sake in the second definition, the main definition of the Extreme 3235
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3236
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperUnequal 3237
Dimension Dominating, finds the convenient background to implement some results based on that. 3238
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3239
on the modeling of the regions where are under the attacks of the cancer to recognize this 3240
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 3241
the SuperHyperNotion, SuperHyperUnequal Dimension Dominating, the new SuperHyperClasses and 3242
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 3243
SuperHyperUnequal Dimension Dominating and the Extreme SuperHyperUnequal Dimension Dominating. The 3244
clarifications, instances and literature reviews have taken the whole way through. In this 3245
research, the literature reviews have fulfilled the lines containing the notions and the results. 3246
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 3247
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3248
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 3249
and the architecture are formally called “ SuperHyperUnequal Dimension Dominating” in the themes of 3252
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 3253
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 3254
for this research are, figured out, pointed out and spoken out. 3255
151
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperUnequal Dimension Dominating
3. Extreme SuperHyperUnequal Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3256
Extreme SuperHyperDuality But As The 3257
Super Forms 3259
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3260

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider an Extreme 3261
SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 or E 0 is called 3262
(i) Extreme e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3263

Va ∈ Ei , Ej ; 3264
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3265
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3266
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3267
Vi , Vj ∈ Ea ; 3268
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3269
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3270
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3271
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3272

SuperHyperDuality. 3273
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3274

SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called 3276
(i) an Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3277

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3279
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3280
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3281
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3282
Extreme SuperHyperDuality; 3283
153
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3284

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3285
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3286
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3287
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3288
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3289
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3290

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3291
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3292
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3293
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3294
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3295
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3297
coefficient; 3298
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3299

Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3306
coefficient; 3307
(v) an Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3308

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3310
cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence of 3312
(vi) a Extreme R-SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3315

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3317
the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 3318

SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHyperEdges and 3319
Extreme SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3320
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either 3321

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3322
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3323


that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 3328
to its Extreme coefficient; 3329
(viii) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3330

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3335
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3336
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3337
Extreme coefficient. 3338
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3339
mentioned Extreme Figures in every Extreme items. 3340
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3341
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3342
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3343
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3344
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3345
C(N SHG)Extreme SuperHyperDuality = {E4 }.

C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperDuality = {V4 }.
C(N SHG)Extreme R-SuperHyperDuality SuperHyperPolynomial = 3z.
• On the Figure (30.2), the Extreme SuperHyperNotion, namely, Extreme SuperHyper- 3349
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3350
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3351
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3352
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3353
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3354
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3355


ality, is up. The Extreme Algorithm is Extremely straightforward. 3357

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

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

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

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

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


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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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


3 × 3z 2 .



(2 × 1 × 2) + (2 × 4 × 5)z.

(1 × 1 × 2)z.


(2 × 2 × 2)z.
C(N SHG)Extreme SuperHyperDuality = {E3i+1i=03 }.

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



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

C(N SHG)Extreme SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperDuality
= {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 3399
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

The term “EXTERNAL” implies |N (ViEXT ERN AL )| ≥ |N (Vj )| where Vj is corresponded to 3402
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3403
(31.1), is the SuperHyperDuality. 3406
C(N SHG)Extreme SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperDuality


.
Proof. Let 3408
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3415
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3425
C(N SHG)Extreme Quasi-SuperHyperDuality

= {Ei ∈ EPi ESHG:(V,E) , |Pi ESHG:(V,E) | = 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) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
= {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 3427
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmin i |Pi
ESHG:(V,E) ∈P ESHG:(V,E) |+1

to ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3431
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3432
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3433
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3434
representative in the 3435
P :
V1EXT ERN AL , E1 ,

V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Emini |Pi ESHG:(V,E) ∈P ESHG:(V,E) | , Vmini |Pi
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperBipartite ESHB : 3436

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperDuality. 3444
Then 3446

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
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 3447
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3448

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3452
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3453
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperDuality. 3465
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3466
C(N SHG)Extreme Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
Extreme Cardinality
|z.
C(N SHG)Extreme R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 3467
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Extreme Cardinality +1
ESHG:(V,E) Extreme Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Extreme SuperHyperWheel ESHW : 3468

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

∃!Ez∗ ∈ EESHG:(V,E)
∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 3473
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3474
Extreme SuperHyperDuality. 3480

CHAPTER 19 3481
Extreme SuperHyperJoin But As The 3482
Super Forms 3484
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3485

(i) Extreme e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3488

Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 3489
(ii) Extreme re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 3490
Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = 3491

|Ej |Extreme CARDINALITY ; 3492
(iii) Extreme v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 3493

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3496
|Vj |Extreme CARDINALITY ; 3497
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3498
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3499
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3500

(i) an Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3503

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3504
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3505
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3506
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3507
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3508
167
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3509

C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme car- 3511
dinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 3512
that they form the Extreme SuperHyperJoin; 3514
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3515

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3516
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3517
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3518
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3519
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3520
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3521
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3522
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3523

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3527
(v) an Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3531


SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3535
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3536
(vi) a Extreme R-SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3537

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3539
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3540
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3542
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3543
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3544

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3547

(viii) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3551

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3555
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient. 3558
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperJoin, 3561
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3562
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3563
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3564

SuperHyperJoin. 3568
C(N SHG)Extreme SuperHyperJoin = {E4 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperJoin = {V1 , V2 , V4 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z 3 .
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 3570
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3571
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3572
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3573
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3574
V3 , is excluded in every given Extreme SuperHyperJoin. 3575

is up. The Extreme Algorithm is Extremely straightforward. 3577


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 .

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperJoin = {V5 }.
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial = z.
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 }.
C(N SHG)Extreme SuperHyperJoin = {E15 , E16 , E17 }.

C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .

4 × 5 × 5z 3 .

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

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

4 × 5 × 5z 3 .

3 × 3z 2 .

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

3 × 3z 2 .




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

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

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

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

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


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

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

C(N SHG)Extreme SuperHyperJoin =

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperJoin

.
Proof. Let 3619
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. 3623
(31.1), is the SuperHyperJoin. 3626

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


.
Proof. Let 3628
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3635
C(N SHG)Extreme Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)Extreme R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.
Proof. Let 3637



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3645
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
i
i=|P ESHG:(V,E) |
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.
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 3647
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperJoin. The latter is straightforward. Then there’s 3651
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3652
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3653
SuperHyperPart could have one SuperHyperVertex as the representative in the 3654
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3655

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperJoin. 3663
Then 3665

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 |
Extreme Cardinality
Proof. Let 3666
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperMultipartite ESHM : 3667


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3672
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperJoin. 3683

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

.
Proof. Let 3685
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

is a longest SuperHyperJoin taken from a connected Extreme SuperHyperWheel ESHW : (V, E). 3686
There’s a new way to redefine as 3687

at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 3690
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 3691
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 3692
Extreme SuperHyperJoin. 3697

CHAPTER 20 3698
Extreme SuperHyperPerfect But As The 3699
Super Forms 3701
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3702

(i) Extreme e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 3705

Va ∈ Ei , Ej ; 3706
(ii) Extreme re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 3707

Va ∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3708
(iii) Extreme v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3709

Vi , Vj ∈ Ea ; 3710
(iv) Extreme rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 3711

Vi , Vj ∈ Ea ; and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3712
(v) Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3713

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3714
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3715

(i) an Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3718

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3719
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3720
Extreme SuperHyperPerfect; 3724
181
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3725

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect 3726
SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3730
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3731

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3732
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3733
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3738
coefficient; 3739
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3740

Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3747
coefficient; 3748
(v) an Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3749

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3751
(vi) a Extreme R-SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, 3756

SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is 3758

Extreme SuperHyperVertices such that they form the Extreme SuperHyperPerfect; 3761
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either 3762

of Extreme e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v- 3763
SuperHyperPerfect, and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme 3764


that they form the Extreme SuperHyperPerfect; and the Extreme power is corresponded 3769
(viii) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3771

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3776
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3777
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3778
Extreme coefficient. 3779
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3782
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3783
SuperHyperPerfect. 3789
C(N SHG)Extreme SuperHyperPerfect = {E4 }.

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperPerfect = {V4 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial = 3z.
Perfect, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3791
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3792
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3796


fect, is up. The Extreme Algorithm is Extremely straightforward. 3798

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

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

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

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

C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .


3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .
C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V3i+13i=0 , V15 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .

3 × 4 × 4z 3 .

3 × 2z 2 .

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


3 × 3z 2 .



C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V2 , V7 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .

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


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

C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .



C(N SHG)Extreme R-Quasi-SuperHyperPerfect = {V3 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperPerfect SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

C(N SHG)Extreme SuperHyperPerfect =

= {Ei }i=1 3
.
C(N SHG)Extreme SuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)Extreme R-SuperHyperPerfect

.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 3840
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3844
(31.1), is the SuperHyperPerfect. 3847
C(N SHG)Extreme SuperHyperPerfect =

= {Ei }i=1 3
.
= 3z 3 .
C(N SHG)Extreme R-SuperHyperPerfect


.
C(N SHG)Extreme R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 3849
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperPerfect. 3856
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 3858



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3866
C(N SHG)Extreme Quasi-SuperHyperPerfect

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}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

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


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 3872
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3873
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3874
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3877

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperPerfect. 3885

Then 3887

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}.
C(N SHG)Extreme Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 3888
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperMultipartite 3889



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3892
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3893
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3894
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
the Extreme SuperHyperPerfect. 3906
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Extreme R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 3908

is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperWheel ESHW : 3909


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 3912
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 3913
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 3914
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 3915
Extreme SuperHyperPerfect. 3921

CHAPTER 21 3922
Extreme SuperHyperTotal But As The 3923
Super Forms 3925
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3926
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3929
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3930

Ei , Ej ; and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3931
(iii) Extreme v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3932
(iv) Extreme rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that Vi , Vj ∈ Ea ; 3933

and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3934
(v) Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3935

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3936
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3937

(i) an Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3940

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3941
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3944
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3945
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3946

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3947
195

SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3951
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme 3952
e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3953

treme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : 3954
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3955
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3956
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3957
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3959
(iv) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3960

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3961
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3963
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3964
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3965
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3967
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3968

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3969
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3972
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3973
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3974

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3975
and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3976
SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3979
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Ex- 3980

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3981
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3982
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3985
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3986
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3987
coefficient; 3988
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3989

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3990

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3992
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3993
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3994
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3996
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3999
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 4000
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 4001
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 4002
SuperHyperTotal. 4006
C(N SHG)Extreme Quasi-SuperHyperTotal = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 3z.
is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 are some empty 4008
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 4009
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 4010
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 4011
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 4012
V3 , is excluded in every given Extreme SuperHyperTotal. 4013



C(N SHG)Extreme Quasi- = {E4 , E2 }.

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

C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.
C(N SHG)Extreme SuperHyperTotal = {Ei+19i=0 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .
C(N SHG)Extreme SuperHyperTotal = {E12 , E13 , E14 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-SuperHyperTotal = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial = z 3 .

C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial =
3 × 4 × 4z 3 .

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial 10z 10 .

C(N SHG)Extreme R-SuperHyperTotal = {Vi+19i=0 }.

3 × 4 × 4z 3 .
C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme R-SuperHyperTotal = {V1 , V5 }.
C(N SHG)Extreme SuperHyperTotal = {E1 , E2 }.

C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1





4 × 3z 3 .

C(N SHG)Extreme R-SuperHyperTotal = {V1 , V2 , V6 , V17 }.
4 × 3z 4 .

2 × 4 × 3z 4 .

C(N SHG)Extreme R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .


C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
C(N SHG)Extreme R-SuperHyperTotal SuperHyperPolynomial
= |(|V | − 1)z 2 .


C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .
C(N SHG)Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
C(N SHG)Extreme SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Extreme Cardinality .
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2

Proof. Let 4057
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4061
(31.1), is the SuperHyperTotal. 4064
C(N SHG)Extreme SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Extreme Cardinality .
= (|EESHG:(V,E) |Extreme Cardinality − 1)
z |EESHG:(V,E) |Extreme Cardinality −2 .
C(N SHG)Extreme R-SuperHyperTotal
|E |Extreme Cardinality −2
= {ViEXT ERN AL }i=1ESHG:(V,E) .
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z |EESHG:(V,E) |Extreme Cardinality −2
Proof. Let 4066
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Extreme Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1


SuperHyperModel (31.2), is the Extreme SuperHyperTotal. 4073
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|Extreme Cardinality |z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 4075
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperTotal. 4083

C(N SHG)Extreme SuperHyperTotal

= {Ea ∈ EPi ESHG:(V,E) ,
i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
= {VaEXT ERN AL ∈ VPEXT
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. Then there’s 4089
no at least one SuperHyperTotal. Thus the notion of quasi may be up but the SuperHyperNotions 4090
based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 4091
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperBipartite ESHB : 4093
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperTotal. 4101
Then 4103

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4104
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 4105



based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 4110
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperTotal. 4121
∗
C(N SHG)Extreme SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)| Extreme Cardinality
|z 2 .
C(N SHG)Extreme R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
(|VESHG:(V,E)|Extreme Cardinality |) choose (|VESHG:(V,E)|Extreme Cardinality | − 1)
z2.
Proof. Let 4123
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 4124



at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 4128
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 4129
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 4130
Extreme SuperHyperTotal. 4136

CHAPTER 22 4137
Extreme SuperHyperConnected But As 4138
The Extensions Excerpt From Dense And 4139
Super Forms 4140
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4141

(i) Extreme e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 4144

(ii) Extreme re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 4146
that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |Extreme CARDINALITY = 4147

|Ej |Extreme CARDINALITY ; 4148
(iii) Extreme v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 4149

(iv) Extreme rv-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 4151

that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 4152
|Vj |Extreme CARDINALITY ; 4153
(v) Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4154

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4155
SuperHyperConnected. 4156
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4157
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4160

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4162
209
Extreme SuperHyperConnected; 4166
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4167

SuperHyperConnected and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) 4169
is the maximum Extreme cardinality of the Extreme SuperHyperEdges of an Extreme 4170
Extreme SuperHyperVertices such that they form the Extreme SuperHyperConnected; 4172
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4173

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4174
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4175
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4176
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4177
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4178
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4179
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4180
corresponded to its Extreme coefficient; 4181
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4182


(v) an Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected,4191

Extreme SuperHyperConnected; 4197
(vi) a Extreme R-SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4198

is the maximum Extreme cardinality of the Extreme SuperHyperVertices of an Extreme 4201
(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either 4204

of Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4205

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

contains the Extreme coefficients defined as the Extreme number of the maximum 4208
SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 4211
Extreme power is corresponded to its Extreme coefficient; 4212
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4213

cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 4218

corresponded to its Extreme coefficient. 4221
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperCon- 4224
nected, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 4225

C(N SHG)Extreme SuperHyperConnected = {E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme R-SuperHyperConnected = {V4 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 3z.
Connected, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and 4233
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 4234
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4238


nected, is up. The Extreme Algorithm is Extremely straightforward. 4240

C(N SHG)Extreme SuperHyperConnected = {E1 , E2 , E4 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V4 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = 15z 2 .

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Extreme Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+19i=0 }.

C(N SHG)Extreme R-SuperHyperConnected = {V12 , V13 , V14 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z.

C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial =
3 × 4 × 4z 3 .

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Extreme R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .
Connected, is up. The Extreme Algorithm is Extremely straightforward. 4254

3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = 2z 4 .
C(N SHG)Extreme SuperHyperConnected = {E1 , E2 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial = z 5 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E9 , E6 }.

C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.



C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V2 , V3 , V4 }.

4 × 3z 3 .

C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , V2 , V6 , V17 }.
C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial =
4 × 3z 4 .

2 × 4 × 3z 4 .


C(N SHG)Extreme R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.

C(N SHG)Extreme R-Quasi-SuperHyperConnected SuperHyperPolynomial
= 3 × 6z 3 .

C(N SHG)Extreme Quasi-SuperHyperConnected =

|EESHG:(V,E) |
Extreme Cardinality
−2
= {Ei }i=1 .
C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Extreme −2
=z Cardinality .
C(N SHG)Extreme R-Quasi-SuperHyperConnected
= {ViEXT ERN AL }i=1 Cardinality
.
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality
Proof. Let 4282
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4286
(31.1), is the SuperHyperConnected. 4289
C(N SHG)Extreme Quasi-SuperHyperConnected =

−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Extreme Cardinality − 1)
z Cardinality .
C(N SHG)Extreme R-Quasi-SuperHyperConnected

.
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Extreme Cardinality z ESHG:(V,E) Extreme Cardinality
Proof. Let 4291
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Extreme Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Extreme Cardinality −1 .

SuperHyperModel (31.2), is the Extreme SuperHyperConnected. 4298
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Extreme Cardinality z.
C(N SHG)Extreme R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 4300



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4308
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

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

ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. Then 4314
there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 4315
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 4316
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4319

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4320
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4327
Then 4329
C(N SHG)Extreme Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Extreme V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Extreme Cardinality
Proof. Let 4330
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4331


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 4335
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 4336
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 4337
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperConnected. 4348
∗
C(N SHG)Extreme SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Extreme Cardinality |z.
C(N SHG)Extreme V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Extreme V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 4350
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4351

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4354
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4355
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4356
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4357
some representatives. The latter is straightforward. 4358
Extreme SuperHyperConnected. 4363

CHAPTER 23 4364
Background 4365
223










HG291; HG292; HG293], there are some endeavors to formalize the basic SuperHyper- 4529
Notions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific re- 4530
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4531



HG179b; HG180b; HG181b; HG182b; HG183b; HG184b; HG185b; HG186b]. Two 4545
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 4546
ively, on neutrosophic science is on [HG32b; HG44b]. 4547

HG287; HG288; HG289; HG290; HG291; HG292; HG293] alongside scientific re- 4585


Bibliography 4603

10.33140/JMTCM.01.03.09) 4626
229
10.20944/preprints202301.0282.v1). 4648
10.20944/preprints202301.0267.v1). 4651
(doi: 10.20944/preprints202301.0265.v1). 4656
prints202301.0262.v1). 4660
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4666

prints202301.0105.v1). 4669

Preprints 2023, 2023010044 4675
10.20944/preprints202301.0043.v1). 4678

(doi: 10.20944/preprints202212.0549.v1). 4687
(doi: 10.20944/preprints202212.0500.v1). 4694
10.5281/zenodo.8084436). 4703
2023, (doi: 10.5281/zenodo.8084420). 4706
10.5281/zenodo.8080100). 4709

10.5281/zenodo.8080068). 4712
(doi: 10.5281/zenodo.8078445). 4715
2023, (doi: 10.5281/zenodo.8078543). 4718
10.5281/zenodo.8076416). 4721
2023, (doi: 10.5281/zenodo.8076399). 4724
(doi: 10.5281/zenodo.8072171). 4727
2023, (doi: 10.5281/zenodo.8072267). 4730
10.5281/zenodo.8067384). 4733
2023, (doi: 10.5281/zenodo.8067409). 4736
10.5281/zenodo.8061927). 4739
10.5281/zenodo.8062016). 4742
10.5281/zenodo.8057696). 4745
2023, (doi: 10.5281/zenodo.8057753). 4748

10.5281/zenodo.8052893). 4751
2023, (doi: 10.5281/zenodo.8052925). 4754
10.5281/zenodo.8051346). 4757
10.5281/zenodo.8051360). 4760
10.5281/zenodo.8025707). 4763
10.5281/zenodo.8027275). 4766
odo.8017246). 4769
10.5281/zenodo.8020128). 4772
odo.7978571). 4775
10.5281/zenodo.7978857). 4778
10.5281/zenodo.7940830). 4781
10.5281/zenodo.7943578). 4784
odo.7916595). 4787

odo.7923632). 4790
(doi: 10.5281/zenodo.7904698). 4793
2023, (doi: 10.5281/zenodo.7904671). 4796
10.5281/zenodo.7871026). 4805
2023, (doi: 10.5281/zenodo.7874647). 4808
10.5281/zenodo.7857856). 4811
2023, (doi: 10.5281/zenodo.7857841). 4814
10.5281/zenodo.7853867). 4823
10.5281/zenodo.7853922). 4826

(doi: 10.5281/zenodo.7851519). 4829
(doi: 10.5281/zenodo.7851550). 4832
10.5281/zenodo.7834229). 4841
10.5281/zenodo.7834261). 4844
10.5281/zenodo.7824560). 4847
(doi: 10.5281/zenodo.7824623). 4850

2023, (doi: 10.5281/zenodo.7809365). 4861
2023, (doi: 10.5281/zenodo.7809358). 4864

10.5281/zenodo.7809219). 4867
10.5281/zenodo.7809328). 4870
2023, (doi: 10.5281/zenodo.7806767). 4873
2023, (doi: 10.5281/zenodo.7806838). 4876
10.5281/zenodo.7799902). 4885
(doi: 10.5281/zenodo.7804218). 4888
(doi: 10.5281/zenodo.7796334). 4891
10.5281/zenodo.7791952). 4897
10.5281/zenodo.7791982). 4900
10.5281/zenodo.7790026). 4903

10.5281/zenodo.7790052). 4906
2023, (doi: 10.5281/zenodo.7787066). 4909
10.5281/zenodo.7781476). 4915
10.5281/zenodo.7783082). 4918
10.5281/zenodo.7777857). 4921
10.5281/zenodo.7779286). 4924
(doi: 10.5281/zenodo.7771831). 4927
2023, (doi: 10.5281/zenodo.7772468). 4930
10.13140/RG.2.2.20913.25446). 4933
odo.7764916). 4936
10.13140/RG.2.2.11770.98247). 4939
10.13140/RG.2.2.12400.12808). 4942

2023, (doi: 10.13140/RG.2.2.22545.10089). 4945
10.13140/RG.2.2.11377.76644). 4951
10.13140/RG.2.2.23750.96329). 4954
10.13140/RG.2.2.31366.24641). 4957
10.13140/RG.2.2.34721.68960). 4960
2023, (doi: 10.13140/RG.2.2.30212.81289). 4963
10.13140/RG.2.2.24288.35842). 4969
10.13140/RG.2.2.32467.25124). 4972
10.13140/RG.2.2.31025.45925). 4975
10.13140/RG.2.2.17184.25602). 4978
10.13140/RG.2.2.23423.28327). 4981

10.13140/RG.2.2.28456.44805). 4984
10.13140/RG.2.2.23525.68320). 4987
10.13140/RG.2.2.20170.24000). 4990
10.13140/RG.2.2.36475.59683). 4993
10.13140/RG.2.2.29764.71046). 4996
2023, (doi: 10.13140/RG.2.2.18780.87683). 4999
10.13140/RG.2.2.26134.01603). 5005
10.13140/RG.2.2.27392.30721). 5008
10.13140/RG.2.2.33028.40321). 5011
10.13140/RG.2.2.21389.20966). 5014
10.13140/RG.2.2.16356.04489). 5017
10.13140/RG.2.2.21756.21129). 5020

10.13140/RG.2.2.30983.68009). 5023
10.13140/RG.2.2.28552.29445). 5026
(doi: 10.13140/RG.2.2.10936.21761). 5029
10.13140/RG.2.2.35105.89447). 5032
(doi: 10.13140/RG.2.2.30072.72960). 5035
10.13140/RG.2.2.31147.52003). 5038
10.13140/RG.2.2.32825.24163). 5041
10.13140/RG.2.2.13059.58401). 5044
10.13140/RG.2.2.11172.14720). 5047
2023, (doi: 10.13140/RG.2.2.22011.80165). 5050
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 5053
2023, (doi: 10.13140/RG.2.2.10493.84962). 5056
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 5059

2023, (doi: 10.13140/RG.2.2.19944.14086). 5062
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 5065
(doi: 10.13140/RG.2.2.33103.76968). 5068
(doi: 10.13140/RG.2.2.23037.44003). 5071
(doi: 10.13140/RG.2.2.35646.56641). 5074
10.13140/RG.2.2.18030.48967). 5077
(doi: 10.13140/RG.2.2.13973.81121). 5080
2023, (doi: 10.13140/RG.2.2.34106.47047). 5083
2023, (doi: 10.13140/RG.2.2.31956.88961). 5089
2023, (doi: 10.13140/RG.2.2.15179.67361). 5092
10.13140/RG.2.2.21510.45125). 5095
2023, (doi: 10.13140/RG.2.2.13121.84321). 5098

10.13140/RG.2.2.11758.69441). 5101
2023, (doi: 10.13140/RG.2.2.31891.35367). 5104
10.13140/RG.2.2.19360.87048). 5107
10.13140/RG.2.2.32363.21286). 5110
10.13140/RG.2.2.23266.81602). 5113
10.13140/RG.2.2.19911.37285). 5116
10.13140/RG.2.2.11050.90569). 5119
2023, (doi: 10.13140/RG.2.2.17761.79206). 5122
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5128
(doi: 10.13140/RG.2.2.30182.50241). 5131

2023, (doi: 10.13140/RG.2.2.17252.24968). 5164
2023010396 (doi: 10.20944/preprints202301.0396.v1). 5173
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5176


2023,(doi: 10.13140/RG.2.2.36745.93289). 5190

10.20944/preprints202301.0282.v1). 5197
10.20944/preprints202301.0267.v1).). 5200
(doi: 10.20944/preprints202301.0265.v1). 5205
prints202301.0262.v1). 5209
2023010224, (doi: 10.20944/preprints202301.0224.v1). 5215


10.13140/RG.2.2.35061.65767). 5218
10.13140/RG.2.2.18494.15680). 5222

10.13140/RG.2.2.32530.73922). 5226
10.13140/RG.2.2.15897.70243). 5230
10.13140/RG.2.2.32530.73922). 5234
prints202301.0105.v1). 5237

10.13140/RG.2.2.23172.19849). 5244

10.13140/RG.2.2.17385.36968). 5254

Preprints 2023, 2023010044 5257

10.20944/preprints202301.0043.v1). 5260
2023, (doi: 10.13140/RG.2.2.28945.92007). 5263
10.13140/RG.2.2.35774.77123). 5269

10.13140/RG.2.2.29430.88642). 5275
(doi: 10.20944/preprints202212.0549.v1). 5281

10.13140/RG.2.2.19380.94084). 5284

(doi: 10.20944/preprints202212.0500.v1). 5295
10.13140/RG.2.2.20993.12640). 5298


10.13140/RG.2.2.29173.86244). 5313
2023 (doi: 10.5281/zenodo.8086310). 5318
2023 (doi: 10.5281/zenodo.8080167). 5320
2023 (doi: 10.5281/zenodo.8076449). 5324
2023 (doi: 10.5281/zenodo.8067469). 5328
(doi: 10.5281/zenodo.8062076). 5330

2023 (doi: 10.5281/zenodo.8052976). 5334
(doi: 10.5281/zenodo.8051368). 5336
(doi: 10.5281/zenodo.8027488). 5338
10.5281/zenodo.8020181). 5340
10.5281/zenodo.7978921). 5342
odo.7943878). 5344
10.5281/zenodo.7943871). 5346
10.5281/zenodo.7923786). 5348
2023 (doi: 10.5281/zenodo.7905287). 5350

2023 (doi: 10.5281/zenodo.7874677). 5354
(doi: 10.5281/zenodo.7857906). 5356
2023 (doi: 10.5281/zenodo.7856329). 5358
10.5281/zenodo.7854561). 5360
2023 (doi: 10.5281/zenodo.7851893). 5362

(doi: 10.5281/zenodo.7835063). 5366

(doi: 10.5281/zenodo.7826705). 5368
2023 (doi: 10.5281/zenodo.7820680). 5370
10.5281/zenodo.7812750). 5372


2023 (doi: 10.5281/zenodo.7807782). 5378
2023 (doi: 10.5281/zenodo.7804449). 5380

(doi: 10.5281/zenodo.7792307). 5384
(doi: 10.5281/zenodo.7790728). 5386
2023 (doi: 10.5281/zenodo.7787712). 5388
10.5281/zenodo.7783791). 5390
10.5281/zenodo.7780123). 5392
(doi: 10.5281/zenodo.7773119). 5394
odo.7637762). 5396
10.5281/zenodo.7766174). 5398
10.5281/zenodo.7762232). 5400
(doi: 10.5281/zenodo.7758601). 5402

10.5281/zenodo.7754661). 5404
10.5281/zenodo.7750995) . 5406
(doi: 10.5281/zenodo.7749875). 5408
10.5281/zenodo.7747236). 5410
10.5281/zenodo.7742587). 5412
(doi: 10.5281/zenodo.7738635). 5414
10.5281/zenodo.7734719). 5416
10.5281/zenodo.7730484). 5418
(doi: 10.5281/zenodo.7730469). 5420
10.5281/zenodo.7722865). 5422
odo.7713563). 5424
odo.7709116). 5426
10.5281/zenodo.7706415). 5428
10.5281/zenodo.7706063). 5430
10.5281/zenodo.7701906). 5432
odo.7700205). 5434
10.5281/zenodo.7694876). 5436
10.5281/zenodo.7679410). 5438

10.5281/zenodo.7675982). 5440
10.5281/zenodo.7672388). 5442
odo.7668648). 5444
10.5281/zenodo.7662810). 5446
10.5281/zenodo.7659162). 5448
odo.7653233). 5450
odo.7653204). 5452
odo.7653142). 5454
odo.7653117). 5456
odo.7651687). 5459
odo.7651619). 5461
odo.7651439). 5463
odo.7650729). 5465
odo.7647868). 5467
odo.7647017). 5469
odo.7644894). 5471

odo.7632923). 5474
odo.7623459). 5476
10.5281/zenodo.7606416). 5478
10.5281/zenodo.7606416). 5480
odo.7606404). 5482
10.5281/zenodo.7580018). 5484
odo.7580018). 5486
odo.7580018). 5488
odo.7579929). 5490
10.5281/zenodo.7563170). 5492
odo.7563164). 5494
odo.7563160). 5496
odo.7563160). 5498
10.5281/zenodo.7563160). 5500
10.5281/zenodo.7557063). 5502
10.5281/zenodo.7557009). 5504
10.5281/zenodo.7539484). 5506
10.5281/zenodo.7523390). 5508

10.5281/zenodo.7523390). 5510
10.5281/zenodo.7523390). 5512
odo.7574952). 5514
10.5281/zenodo.7574992). 5516
odo.7523357). 5518
10.5281/zenodo.7523357). 5520
10.5281/zenodo.7504782). 5522
10.5281/zenodo.7504782). 5524
10.5281/zenodo.7504782). 5526
10.5281/zenodo.7499395). 5528
odo.7499395). 5530
10.5281/zenodo.7499395). 5532
10.5281/zenodo.7497450). 5534
10.5281/zenodo.7497450). 5536
10.5281/zenodo.7494862). 5538
odo.7494862). 5540
10.5281/zenodo.7494862). 5542
10.5281/zenodo.7493845). 5544

odo.7493845). 5546
10.5281/zenodo.7493845). 5548
odo.7539484). 5550
odo.7523390). 5552
odo.7523357). 5554
odo.7504782). 5556
odo.7499395). 5558
odo.7497450). 5560
odo.7494862). 5562
odo.7493845). 5564
odo.7480110). 5566
odo.7378758). 5568
odo.6320305). 5570
odo.6677173). 5572

CHAPTER 24 5573
Cancer In Neutrosophic 5574
SuperHyperGraph 5575
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5576
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5577
disease is considered and as the consequences of the model, some parameters are used. The cells 5578
are under attack of this disease but the moves of the cancer in the special region are the matter 5579
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5580
treatments for this Neutrosophic disease. 5581
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5582
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5583
term Neutrosophic function. 5584
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5585
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5586
move from the cancer is identified by this research. Sometimes the move of the cancer 5587
about the moves and the effects of the cancer on that region; this event leads us to 5589
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5590
perception on what’s happened and what’s done. 5591
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5592
known and they’ve got the names, and some general Neutrosophic models. The moves 5593
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5594
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5595
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5596
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5597
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5598
Models. 5599
Some cells have been faced with some attacks from the situation which is caused by the 5600
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5601
which in that, the cells could be labelled as some groups and some groups or individuals have 5602
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5603
the embedded situations, the individuals of cells and the groups of cells could be considered 5604
255
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5605
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5606
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5607
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5608
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5609
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5610
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5611
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5612
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5613
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5614
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5615
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5616
out what’s going on this phenomenon. The special case of this disease is considered and as the 5617
consequences of the model, some parameters are used. The cells are under attack of this disease 5618
but the moves of the cancer in the special region are the matter of mind. The recognition of 5619
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5620
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5621
both bases are the background of this research. Sometimes the cancer has been happened on the 5622
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5623
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5624
in the forms of alliances’ styles with the formation of the design and the architecture are 5625
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5626
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5627
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5628
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5629
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5630
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5631
names, and some general models. The moves and the traces of the cancer on the complex tracks 5635
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5636
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5637
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5638
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5639
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5640
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5641
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5642
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5643
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5644
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5646
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5647
based on the fixed groups of cells or the fixed groups of group of cells? 5648
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5649

these messy and dense SuperHyperModels where embedded notions are illustrated? 5650
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Neutrosophic 5652

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5653
Then the research has taken more motivations to define SuperHyperClasses and to find some 5654
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5655
some instances and examples to make clarifications about the framework of this research. The 5656
general results and some results about some connections are some avenues to make key point of 5657
this research, “Cancer’s Recognition”, more understandable and more clear. 5658
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5659
research on the modeling of the regions where are under the attacks of the cancer to 5660
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5661
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5662
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5663
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5664

instances and literature reviews have taken the whole way through. In this scientific research, 5665
the literature reviews have fulfilled the lines containing the notions and the results. The 5666
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5667
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5669
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5670
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5671
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5672
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5673
to figure out the background for the SuperHyperNotions. 5674

CHAPTER 25 5675
Neutrosophic Unequal Dimension 5676
Dominating 5677
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5678
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5679
2023, (doi: 10.13140/RG.2.2.34953.52320). 5680
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5681
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5682
(doi: 10.13140/RG.2.2.33275.80161). 5683
10.13140/RG.2.2.11050.90569). 5686
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5687
10.13140/RG.2.2.17761.79206). 5689
10.13140/RG.2.2.19911.37285). 5692
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5693
10.13140/RG.2.2.23266.81602). 5695
10.13140/RG.2.2.19360.87048). 5698
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5699
10.13140/RG.2.2.32363.21286). 5701
10.13140/RG.2.2.11758.69441). 5704
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5705
10.13140/RG.2.2.31891.35367). 5707
259

10.13140/RG.2.2.21510.45125). 5710
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5711
10.13140/RG.2.2.13121.84321). 5713

CHAPTER 26 5714
New Ideas In Recognition of Cancer And 5715
Neutrosophic SuperHyperGraph By 5716
Unequal Dimension Dominating As Hyper 5717
Dimple On Super Dimity 5718
261
CHAPTER 27 5719
ABSTRACT 5720
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal 5721

Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Unequal Dimension 5722
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5723
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperUnequal Dimension 5724
Dominating if the following expression is called Neutrosophic e-SuperHyperUnequal Dimension Dominating 5725
criteria holds 5726

Neutrosophic re-SuperHyperUnequal Dimension Dominating if the following expression is called 5727

Neutrosophic e-SuperHyperUnequal Dimension Dominating criteria holds 5728

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; Neutrosophic v- 5729

SuperHyperUnequal Dimension Dominating if the following expression is called Neutrosophic v- 5730
SuperHyperUnequal Dimension Dominating criteria holds 5731

Neutrosophic rv-SuperHyperUnequal Dimension Dominating if the following expression is called 5732
Neutrosophic v-SuperHyperUnequal Dimension Dominating criteria holds 5733

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5734
HyperUnequal Dimension Dominating if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, 5735
Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating. ((Neutrosophic) SuperHy- 5737
perUnequal Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5738
263
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 5739

E is called an Extreme SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic e- 5740
SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, Neut- 5741
rosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension 5742
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5743
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 5744
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5745

and Extreme SuperHyperVertices such that they form the Extreme SuperHyperUnequal Dimension 5746
Dominating; a Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic 5747
e-SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, 5748
Neutrosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal 5749
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 5750
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5751

sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 5752
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5753
SuperHyperUnequal Dimension Dominating; an Extreme SuperHyperUnequal Dimension Dominating Super- 5754
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutro- 5755
sophic re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Domin- 5756
ating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme 5757
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Ex- 5758
treme coefficients defined as the Extreme number of the maximum Extreme cardinality of 5759
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 5760
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5761
form the Extreme SuperHyperUnequal Dimension Dominating; and the Extreme power is corresponded 5762
to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyper- 5763

Polynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic 5764
re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and 5765
Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 5766
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5767
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5768
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5769

cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5770
such that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; and the Neutrosophic 5771
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperUnequal Dimension 5772

Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for an Extreme SuperHy- 5775
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5776
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5777
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5778
the Extreme SuperHyperUnequal Dimension Dominating; a Neutrosophic V-SuperHyperUnequal Dimension 5779
Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutrosophic Supe- 5782
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5783
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5784

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5785
the Neutrosophic SuperHyperUnequal Dimension Dominating; an Extreme V-SuperHyperUnequal Dimension 5786
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dom- 5787
inating, Neutrosophic re-SuperHyperUnequal Dimension Dominating, Neutrosophic v-SuperHyperUnequal 5788
Dimension Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for 5789
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5790
that they form the Extreme SuperHyperUnequal Dimension Dominating; and the Extreme power is 5794
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperUnequal Dimension Dominating 5795
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, 5796

Dominating, and Neutrosophic rv-SuperHyperUnequal Dimension Dominating and C(N SHG) for a Neutro- 5798
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5799
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5800
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5801
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 5802
HyperVertices such that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; and 5803
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5804
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperUnequal Dimension 5805
Dominating and Neutrosophic SuperHyperUnequal Dimension Dominating. Two different types of Super- 5806
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 5807
The literature review is implemented in the whole of this research. For shining the elegancy and 5809
the significancy of this research, the comparison between this SuperHyperNotion with other 5810
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 5811
followed by the examples and the instances thus the clarifications are driven with different tools. 5812
The applications are figured out to make sense about the theoretical aspect of this ongoing 5813
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 5814
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 5815
deemed ways. There are different types of them. Some of them are individuals and some of them 5816
are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 5817
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHy- 5818
perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 5819
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 5820
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 5821
pursue this research. It’s also officially collected in the form of some questions and some problems. 5822
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperUnequal Dimension 5823
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5824
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5825
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5826
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5827
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperUnequal Dimension Dominating is 5828
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5829
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5830

HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5831

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5832
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5833
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5834
SuperHyperUnequal Dimension Dominating . Since there’s more ways to get type-results to make a 5835
SuperHyperUnequal Dimension Dominating more understandable. For the sake of having Neutrosophic 5836
SuperHyperUnequal Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHy- 5837
perUnequal Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 5838
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5839
position of labels to assign to the values. Assume a SuperHyperUnequal Dimension Dominating . It’s 5840
redefined a Neutrosophic SuperHyperUnequal Dimension Dominating if the mentioned Table holds, 5841
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5842
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5843
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5844
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5845
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5846
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5847
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5848
on a SuperHyperUnequal Dimension Dominating . It’s the main. It’ll be disciplinary to have the 5849
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5850
SuperHyperUnequal Dimension Dominating until the SuperHyperUnequal Dimension Dominating, then it’s offi- 5851
cially called a “SuperHyperUnequal Dimension Dominating” but otherwise, it isn’t a SuperHyperUnequal 5852
Dimension Dominating . There are some instances about the clarifications for the main definition 5853
titled a “SuperHyperUnequal Dimension Dominating ”. These two examples get more scrutiny and 5854
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 5855
based on a SuperHyperUnequal Dimension Dominating . For the sake of having a Neutrosophic Su- 5856
perHyperUnequal Dimension Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 5857
SuperHyperUnequal Dimension Dominating” and a “Neutrosophic SuperHyperUnequal Dimension Dominating 5858
”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5859
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5860
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 5861
rHyperGraph” if the intended Table holds. And a SuperHyperUnequal Dimension Dominating are 5862
redefined to a “Neutrosophic SuperHyperUnequal Dimension Dominating” if the intended Table holds. 5863
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5864
to get Neutrosophic type-results to make a Neutrosophic SuperHyperUnequal Dimension Dominating 5865
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5866
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperUnequal 5867
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 5868
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperUnequal Dimension 5869
Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 5870
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 5871
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperUnequal Dimension Dominating” where 5872

it’s the strongest [the maximum Neutrosophic value from all the SuperHyperUnequal Dimension 5873
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperUnequal 5874
Dimension Dominating .] SuperHyperUnequal Dimension Dominating . A graph is a SuperHyperUniform 5875
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5876

Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 5877
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 5878
with two exceptions; it’s SuperHyperUnequal Dimension Dominating if it’s only one SuperVertex as 5879
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5880
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5881
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5882
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5883
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 5884
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5885
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 5886
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 5887
the specific designs and the specific architectures. The SuperHyperModel is officially called 5888
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 5889

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 5890
and the common and intended properties between “specific” cells and “specific group” of cells 5891
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 5892
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 5893
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 5894
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5895
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5896
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5897
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5898
identified since there are some determinacy, indeterminacy and neutrality about the moves 5899

names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5903
cancer on the complex tracks and between complicated groups of cells could be fantasized 5904
by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Dimension Dominating, SuperHyperStar, 5905
the longest SuperHyperUnequal Dimension Dominating or the strongest SuperHyperUnequal Dimension 5907
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperUnequal Dimension 5908
Dominating, called SuperHyperUnequal Dimension Dominating, and the strongest SuperHyperUnequal Di- 5909
mension Dominating, called Neutrosophic SuperHyperUnequal Dimension Dominating, some general results 5910
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 5911
Dimension Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 5915
rosophic SuperHyperUnequal Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic 5916
SuperHyperGraphs theory are proposed. 5917
Keywords: Neutrosophic SuperHyperGraph, SuperHyperUnequal Dimension Dominating, Cancer’s 5918


CHAPTER 28 5921
Applied Notions Under The Scrutiny Of 5922
The Motivation Of This Scientific 5923
Research 5924
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5925
try to bring the motivations in the narrative ways. Some cells have been faced with some 5926
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5927
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5928
as some groups and some groups or individuals have excessive labels which all are raised from 5929
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5930
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5931
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5932
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5933
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5934
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5935
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5936
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5937
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5938
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5939
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5940
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5941
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5942
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5943
case of this disease is considered and as the consequences of the model, some parameters are used. 5944
The cells are under attack of this disease but the moves of the cancer in the special region are the 5945
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5946
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5947
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5948
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5950
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5951
architecture are formally called “ SuperHyperUnequal Dimension Dominating” in the themes of jargons 5952
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5953
269
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5954
function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 5955
and the long cycle of the move from the cancer is identified by this research. Sometimes the 5956
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 5957
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5958
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5959
perception on what’s happened and what’s done. There are some specific models, which are 5960
well-known and they’ve got the names, and some general models. The moves and the traces of 5961
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5962
by a Neutrosophic SuperHyperPath (-/SuperHyperUnequal Dimension Dominating, SuperHyperStar, 5963
the optimal SuperHyperUnequal Dimension Dominating or the Neutrosophic SuperHyperUnequal Dimension 5965
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5966
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5967
Dimension Dominating. It, literarily, deforms and it doesn’t form. 5971
amount of SuperHyperUnequal Dimension Dominating” of either individual of cells or the groups of cells 5973
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperUnequal 5974
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5975
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5976
these messy and dense SuperHyperModels where embedded notions are illustrated? 5977
Thus it motivates us to define different types of “ SuperHyperUnequal Dimension Dominating” and 5979
“Neutrosophic SuperHyperUnequal Dimension Dominating” on “SuperHyperGraph” and “Neutrosophic 5980

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5981
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5982
motivates us to get some instances and examples to make clarifications about the framework of 5983
this research. The general results and some results about some connections are some avenues to 5984
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5985
The framework of this research is as follows. In the beginning, I introduce basic definitions 5986
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5987
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5988
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5989
review literature are applied to make sense about what’s going to figure out about the 5990
upcoming sections. The main definitions and their clarifications alongside some results 5991
about new notions, SuperHyperUnequal Dimension Dominating and Neutrosophic SuperHyperUnequal 5992
Dimension Dominating, are figured out in sections “ SuperHyperUnequal Dimension Dominating” and 5993
“Neutrosophic SuperHyperUnequal Dimension Dominating”. In the sense of tackling on getting 5994
results and in Unequal Dimension Dominating to make sense about continuing the research, the 5995
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5996
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5997
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5998

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5999
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 6000
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 6001
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 6002
and as concluding and closing section of theoretical research are contained in the section “General 6003
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 6004
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 6005
“ SuperHyperUnequal Dimension Dominating”, “Neutrosophic SuperHyperUnequal Dimension Dominating”, 6006
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There 6007
are curious questions about what’s done about the SuperHyperNotions to make sense about 6008
excellency of this research and going to figure out the word “best” as the description and adjective 6009
for this research as presented in section, “ SuperHyperUnequal Dimension Dominating”. The keyword 6010
of this research debut in the section “Applications in Cancer’s Recognition” with two cases and 6011
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 6012
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 6013
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 6014
happened in this research in the terms of “questions” and “problems” to make sense to figure 6015
out this research in featured style. The advantages and the limitations of this research alongside 6016
about what’s done in this research to make sense and to get sense about what’s figured out are 6017
included in the section, “Conclusion and Closing Remarks”. 6018

CHAPTER 29 6019
Neutrosophic Preliminaries Of This 6020
Scientific Research On the Redeemed 6021
Ways 6022
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 6023
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 6024

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 6025
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 6026
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 6027
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 6028
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 6029
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 6030

ideas and their clarifications are addressed to Ref.[HG38]. 6031
In this subsection, the basic material which is used in this scientific research, is presented. Also, 6032
the new ideas and their clarifications are elicited. 6033
Definition 29.0.1 (Neutrosophic Set). (Ref.[HG11s],Definition 2.1,p.1).

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 [. 6034
Definition 29.0.2 (Single Valued Neutrosophic Set). (Ref.[HG11s],Definition 2.2,p.2).

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}.
273

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 29.0.5 (Neutrosophic SuperHyperGraph (NSHG)). (Ref.[HG11s],Definition 6035
2.5,p.2). 6036
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 6037
S = (V, E), where 6038
1, 2, . . . , n0 ); 6043
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6044
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6045

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 6046
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 6047
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 . 6048



SuperEdge; 6069
If we choose different types of binary operations, then we could get hugely diverse types of 6072
general forms of Neutrosophic SuperHyperGraph (NSHG). 6073
Definition 29.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 6074

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 6075
x, y, z, w ∈ [0, 1]: 6076
(i) 1 ⊗ x = x; 6077
(ii) x ⊗ y = y ⊗ x; 6078
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 6079
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 6080

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 29.0.10. (General Forms of Neutrosophic SuperHyperGraph (NSHG)). 6081

where 6083

1, 2, . . . , n0 ); 6088
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6089
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6090
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 6091
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 6092
0

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutrosophic 6105
SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of Neutro- 6106
sophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 6107
SuperEdge; 6113
This SuperHyperModel is too messy and too dense. Thus there’s a need to have some 6116
restrictions and conditions on SuperHyperGraph. The special case of this SuperHyperGraph 6117
makes the patterns and regularities. 6118

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 6119
of elements of SuperHyperEdges are the same. 6120
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6121
makes to have SuperHyperUniform more understandable. 6122
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6123
Classes as follows. 6124
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6125
two given SuperHyperEdges with two exceptions; 6126
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6127
SuperHyperEdges; 6128
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6129
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6130
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6131
in common; 6132
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6133
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6134
SuperHyperEdge in common; 6135
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6136
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6137
SuperVertex. 6138
Definition 29.0.14. Let a pair S = (V, E) be a Neutrosophic SuperHyperGraph (NSHG) S. Then

a sequence of Neutrosophic SuperHyperVertices (NSHV) and Neutrosophic SuperHyperEdges
(NSHE)
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs
is called a Neutrosophic SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex 6139
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6140
(i) Vi , Vi+1 ∈ Ei0 ; 6141
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6142
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6143
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6144
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6145
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6146
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6147
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6148
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

Definition 29.0.15. (Characterization of the Neutrosophic SuperHyperPaths).

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). a Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
could be characterized as follow-up items. 6150
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6151
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6152
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6153
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6154
perPath . 6155
Definition 29.0.16 (Neutrosophic Strength of the Neutrosophic SuperHyperPaths).

(Ref.[HG11s],Definition 5.3,p.7).
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). A Neutrosophic
V1 , E1 , V2 , E2 , V3 , . . . , Vs−1 , Es−1 , Vs ,
have 6156
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6157
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6158
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6159
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6160
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6161

(ix) Neutrosophic t-Connective if T (E) ≥ maximum number of Neutrosophic t-strength 6165

(x) Neutrosophic i-Connective if I(E) ≥ maximum number of Neutrosophic i-strength 6168


(xi) Neutrosophic f-Connective if F (E) ≥ maximum number of Neutrosophic f-strength 6171

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6174
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6175
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6176
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperUnequal Dimension 6177

Dominating). 6178

(i) Neutrosophic e-SuperHyperUnequal Dimension Dominating if the following expression is 6182

called Neutrosophic e-SuperHyperUnequal Dimension Dominating criteria holds 6183

(ii) Neutrosophic re-SuperHyperUnequal Dimension Dominating if the following expression is 6184

called Neutrosophic re-SuperHyperUnequal Dimension Dominating criteria holds 6185

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6186
(iii) Neutrosophic v-SuperHyperUnequal Dimension Dominating if the following expression is 6187

(iv) Neutrosophic rv-SuperHyperUnequal Dimension Dominating if the following expression is 6189

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6191
(v) Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 6192


Definition 29.0.19. ((Neutrosophic) SuperHyperUnequal Dimension Dominating). 6196

(i) an Extreme SuperHyperUnequal Dimension Dominating if it’s either of Neutrosophic 6199

e-SuperHyperUnequal Dimension Dominating, Neutrosophic re-SuperHyperUnequal Dimension Dom- 6200
inating, Neutrosophic v-SuperHyperUnequal Dimension Dominating, and Neutrosophic rv- 6201

(ii) a Neutrosophic SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 6207

form the Neutrosophic SuperHyperUnequal Dimension Dominating; 6214
(iii) an Extreme SuperHyperUnequal Dimension Dominating SuperHyperPolynomial if 6215

it’s either of Neutrosophic e-SuperHyperUnequal Dimension Dominating, Neutrosophic re- 6216
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6221
(iv) a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 6225


(v) an Extreme V-SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 6236



high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 6241
(vi) a Neutrosophic V-SuperHyperUnequal Dimension Dominating if it’s either of Neutro- 6244

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 6248
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6249
that they form the Neutrosophic SuperHyperUnequal Dimension Dominating; 6251
(vii) an Extreme V-SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 6252


(viii) a Neutrosophic SuperHyperUnequal Dimension Dominating SuperHyperPolynomial 6262

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperUnequal Dimension Dominating). 6273

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6274
(i) an δ−SuperHyperUnequal Dimension Dominating is a Neutrosophic kind of Neutrosophic 6275

SuperHyperUnequal Dimension Dominating such that either of the following expressions hold for 6276
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6277
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 6278
(29.1), holds if S is an δ−SuperHyperDefensive; 6279


136TBL3
(ii) a Neutrosophic δ−SuperHyperUnequal Dimension Dominating is a Neutrosophic kind 6280

of Neutrosophic SuperHyperUnequal Dimension Dominating such that either of the following 6281
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6282
of s ∈ S : 6283
|S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 136EQN3
|S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. 136EQN4
The Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperOffensive. And 6284

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6285
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6287
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 6288
there’s the usage of the position of labels to assign to the values. 6289
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6290
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6291
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6292
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6293
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6294

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6295
Thus Neutrosophic SuperHyperPath , SuperHyperUnequal Dimension Dominating, SuperHyperStar, 6296

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6297
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6298
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6299
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6300
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperUnequal Dimension 6301
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperUnequal 6302
Dimension Dominating more Neutrosophicly understandable. 6303
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperUnequal Dimension Dominating”. The 6305
6308

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

136TBL4

136TBL1
136DEF1 Definition 29.0.23. Assume a SuperHyperUnequal Dimension Dominating. It’s redefined a Neutro- 6309
sophic SuperHyperUnequal Dimension Dominating if the Table (29.3) holds. 6310

CHAPTER 30 6311
Neutrosophic SuperHyper But Unequal Dimension Dominating 6312
As The Extensions Excerpt From Dense 6313
And Super Forms 6314
Definition 30.0.1. (Neutrosophic event). 6315

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6316
is a probability Unequal Dimension Dominating. Any Neutrosophic k-subset of A of V is called 6317
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6318
Neutrosophic event. The following expression is called Neutrosophic probability of 6319

A. 6320
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6321

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6322
a probability Unequal Dimension Dominating. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 6323
s-independent if the following expression is called Neutrosophic s-independent criteria 6324
Y
E(∩i∈I Ai ) = P (Ai ).
i∈I
And if s = 2, then Neutrosophic k-events of A and B is called Neutrosophic independent. 6325

The following expression is called Neutrosophic independent criteria 6326
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 6327

is a probability Unequal Dimension Dominating. Any k-function Unequal Dimension Dominating like E is called 6329
Neutrosophic k-Variable. If k = 2, then any 2-function Unequal Dimension Dominating like E is 6330
called Neutrosophic Variable. 6331
The notion of independent on Neutrosophic Variable is likewise. 6332
285
Definition 30.0.4. (Neutrosophic Expectation). 6333

is a probability Unequal Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6335
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6336
criteria 6337
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6338

is a probability Unequal Dimension Dominating. A Neutrosophic number is called Neutrosophic 6340

Crossing if the following expression is called Neutrosophic Crossing criteria 6341
Cr(S) = min{Number of Crossing in a Plane Embedding of S}.
Lemma 30.0.6. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6342
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let m and n propose special Unequal 6343
Dimension Dominating. Then with m ≥ 4n, 6344
Proof. Consider a planar embedding G of G with cr(G) crossings. Let S be a Neutrosophic

random k-subset of V obtained by choosing each SuperHyperVertex of G Neutrosophic
independently with probability Unequal Dimension Dominating p := 4n/m, and set H := G[S] and
H := G[S].
Define random variables X, Y, Z on V as follows: X is the Neutrosophic number of
SuperHyperVertices, Y the Neutrosophic number of SuperHyperEdges, and Z the Neutrosophic
number of crossings of H. The trivial bound noted above, when applied to H, yields the
inequality Z ≥ cr(H) ≥ Y − 3X. By linearity of Neutrosophic Expectation,
E(Z) ≥ E(Y ) − 3E(X).
Now E(X) = pn, E(Y ) = p2 m (each SuperHyperEdge having some SuperHyperEnds) and
E(Z) = p4 cr(G) (each crossing being defined by some SuperHyperVertices). Hence
p4 cr(G) ≥ p2 m − 3pn.
Dividing both sides by p4 , we have: 6345
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6346
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6347
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6349
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6350

Proof. Form a Neutrosophic SuperHyperGraph G with SuperHyperVertex SuperHyperSet P 6351

whose SuperHyperEdge are the segments between consecutive points on the SuperHyperLines 6352
which pass through at least k + 1 points of P. This Neutrosophic SuperHyperGraph has at least 6353
kl SuperHyperEdges and Neutrosophic crossing at most l choose two. Thus either kl < 4n, in 6354
3
which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic 6355
Crossing Lemma, and again l < 32n2 /k 3 . 6356

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6359
Then k < 5n4/3 . 6360
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6361
S = (V, E) is a probability Unequal Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle 6362
around each SuperHyperPoint of P. Let ni be the P Neutrosophic number of these P SuperHyper- 6363
Circles passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . 6364
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6365
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6366
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6367
n−1
X
e(H) = ini = 2k − n1 − 2n2 ≥ 2k − 2n.
i=3
Some SuperHyperPairs of SuperHyperVertices of H might be joined by some parallel 6368
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6369

so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6370
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6371
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6372
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6373
k < 4n4/3 + n < 5n4/3 . 6374
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6375
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let X be a nonnegative 6376
Neutrosophic Variable and t a positive real number. Then 6377
E(X)
P (X ≥ t) ≤ .
t
Proof.
X X
E(X) = {X(a)P (a) : a ∈ V } ≥ {X(a)P (a) : a ∈ V, X(a) ≥ t}
X X
{tP (a) : a ∈ V, X(a) ≥ t} = t {P (a) : a ∈ V, X(a) ≥ t}
tP (X ≥ t).
Dividing the first and last members by t yields the asserted inequality. 6378

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6379
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let Xn be a nonnegative integer- 6380
valued variable in a probability Unequal Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6381
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6382
Proof. 6383
Consider S = (V, E) is a probability Unequal Dimension Dominating. A special SuperHyperGraph in 6385
Gn,p almost surely has stability number at most d2p−1 log ne. 6386
S = (V, E) is a probability Unequal Dimension Dominating. A special SuperHyperGraph in Gn,p is 6388
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6389
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6390
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6391
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6392
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6393
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6394
E(XS ) = P (XS = 1) = P (AS ) = (1 − p)(k+1)choose2 .

Let X be the number of stable SuperHyperSets of cardinality k + 1 in G. Then 6395
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6396

X
E(X) = {E(XS ) : S ⊆ V, |S| = k + 1} = (n choose k+1)(1 − p)(k+1)choose2 .
We bound the right-hand side by invoking two elementary inequalities: 6397
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6398
nk+1 e−p)(k+1)choose2 ne−pk/2k+1

E(X) ≤ =
(k + 1)! (k + 1)!
Suppose now that k = d2p−1 log ne. Then k ≥ 2p−1 log n, so ne−pk/2 ≤ 1. Because k grows at 6399
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6400
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6401
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6402
Definition 30.0.12. (Neutrosophic Variance). 6403
is a probability Unequal Dimension Dominating. A Neutrosophic k-Variable E has a number is 6405
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 6406
criteria 6407
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Unequal Dimension Dominating. Let X be a Neutrosophic Variable 6409
and let t be a positive real number. Then 6410
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Unequal Dimension Dominating. Let X be a Neutrosophic Variable and let 6412
t be a positive real number. Then 6413
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6414
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let Xn be a Neutrosophic Variable 6416
in a probability Unequal Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6417
then 6418
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Unequal Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6420
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6421
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6422
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6424
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6425
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6426
S = (V, E) is a probability Unequal Dimension Dominating. As in the proof of related Theorem, the 6428
result is straightforward. 6429
Consider S = (V, E) is a probability Unequal Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 6431
be as defined in previous Theorem. Then either: 6432
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6433
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6434

Definition 30.0.17. (Neutrosophic Threshold). 6437

is a probability Unequal Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 6439
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6440
for P is a function f (n) such that: 6441
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6442
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6443
Definition 30.0.18. (Neutrosophic Balanced). 6444
is a probability Unequal Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. 6446
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6447
SubSuperHyperGraph is called Neutrosophic Balanced. 6448
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6449

(V, E). Consider S = (V, E) is a probability Unequal Dimension Dominating. Let F be a nonempty 6450
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6451
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6452
SubSuperHyperGraph. 6453
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6456
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6457
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6458
SuperHyperUnequal Dimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6459

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6460
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6461
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6462
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6463
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6464
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6465

Neutrosophic SuperHyperUnequal Dimension Dominating. 6466
C(N SHG)Neutrosophic Unequal Dimension Dominating =

{}.
C(N SHG)Neutrosophic Unequal Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Unequal Dimension Dominating =
{}.
C(N SHG)Neutrosophic V-Unequal Dimension Dominating SuperHyperPolynomial
= 0z 0 .
6467

Figure 30.1: The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example (42.0.3) 136NSHG1

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6470
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6471
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6472
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6473
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6474
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperUnequal Dimension 6475

Dominating. 6476

{}.
= 0z 0 .
{}.
= 0z 0 .
6477



{}.
= 0z 0 .
{}.
= 0z 0 .
6481


{}.
= 0z 0 .




{}.
= 0z 0 .
6485




{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.
= z 7−c .
6489


{Ei }22
i=12 .



= z 3−a .
{Vi , V21 }10
i=1 .
= z 3−a .
6493


{EN SHG − {Ei }}.
= z 6−c .
{VN SHG − {Vi }}.


= z 7−c .
6497


{E1 , E2 }.
= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
6501



{E3i+1 , E23 }3i=0 .

= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
6505


{EN SHG − {E1 , E5 }}.
= z 3−a .
{VN SHG − {V1 , V11 }}.


= z 3−a .
6509


{EN SHG − {E1 , E6 }}.
= z 3−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
6513






{EN SHG − {E1 , E2 }}.
= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 5−a .
6517


{EN SHG − {E6 , E9 }}.
= z 2−a .



{VN SHG − {V1 , V5 }}.
= z 3−a .
6521


{E2 }.
= z 3−a .
{V1 }.
= z 5−a .
6525




{E3i+1 }1i=0 .
= z 3−a .
{V3i+1 }1i=0 .
= z 3−a .
6529




{E3i+1 }1i=0 .
= z 2−a .
{V2 , V17 , V7 }.
= z 2−a .
6533


{E3i+1 }1i=0 .
= z 2−a .



{V2 , V17 , V7 , V27 }.
= z 2−a .
6537


{E3i+2 }1i=0 .
= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
6541






{E3i+1 }3i=0 .
= z 2−a .
{V2i+1 }5i=0 .
= z 2−a .
6545


{EN SHG − {E1 }}.
= z 3−a .



{VN SHG − {V1 , {U2 , V2 , W2 }}.
= z 3−a .
6549


{E2 }.
= z |1−a| .
{V1 }.
= z |5−a| .


Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG1
6553


{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .


Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
6557
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6558
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Unequal Dimension 6559
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6560
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6561
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6562
of them. 6563
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6564

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6565
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6566
Neutrosophic quasi-R-Unequal Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to 6567
some of them but not all of them. In other words, there’s only an unique Neutrosophic 6568
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6569
an Neutrosophic quasi-R-Unequal Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to 6570
some of them but not all of them. 6571
Proposition 30.0.23. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). If

a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic SuperHyperVertices, then
the Neutrosophic cardinality of the Neutrosophic R-Unequal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Unequal Dimension 6572
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6573
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6574
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6575
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6576
Neutrosophic Unequal Dimension Dominating in some cases but the maximum number of the Neutrosophic 6577
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6578

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Unequal Dimension 6579
Dominating. 6580
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Unequal Dimension Dominating has, the least Neutrosophic
cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality, is the Neutrosophic
cardinality of
V \ V \ {aE , bE 0 , cE 00 , cE 000 }E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
If there’s a Neutrosophic type-result-R-Unequal Dimension Dominating with the least Neutrosophic 6581
cardinality, the lower sharp Neutrosophic bound for cardinality. 6582
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6583
(V, E). Then in the worst case, literally, 6584
C(N SHG)N eutrosophicQuasi−U nequalDimensionDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−U nequalDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−U nequalDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Unequal Dimension Dominating. In other words, the least cardinality, the 6585
lower sharp bound for the cardinality, of a Neutrosophic type-result-Unequal Dimension Dominating is 6586
the cardinality of 6587

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−U nequalDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−U nequalDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial = z 5 .
Proof. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E). The
SuperHyperSet of the SuperHyperVertices V \ V \ {z} isn’t a quasi-R-Unequal Dimension Dominating
since neither amount of Neutrosophic SuperHyperEdges nor amount of SuperHyperVertices
where amount refers to the Neutrosophic number of SuperHyperVertices(-/SuperHyperEdges)
more than one to form any kind of SuperHyperEdges or any number of SuperHyperEdges. Let
us consider the Neutrosophic SuperHyperSet
V \ V \ {aE , bE , cE , . . . , aE 0 , bE 0 , cE 0 , . . .}E,E 0 ={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .

This Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices has the eligibilities

to propose property such that there’s no Neutrosophic SuperHyperVertex of a Neutrosophic
SuperHyperEdge is common and there’s an Neutrosophic SuperHyperEdge for all Neutrosophic
SuperHyperVertices but the maximum Neutrosophic cardinality indicates that these Neutro-
sophic type-SuperHyperSets couldn’t give us the Neutrosophic lower bound in the term of
Neutrosophic sharpness. In other words, the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices implies at least on-quasi-triangle style is up but

sometimes the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices is free-quasi-triangle and it doesn’t make a contradiction

to the supposition on the connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Thus the minimum case never happens in the generality of the connected loopless Neutrosophic
SuperHyperGraphs. Thus if we assume in the worst case, literally,
Is a quasi-R-Unequal Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a quasi-R-Unequal Dimension Dominating is the cardinality of
Then we’ve lost some connected loopless Neutrosophic SuperHyperClasses of the connected
loopless Neutrosophic SuperHyperGraphs titled free-triangle, on-triangle, and their quasi-
types but the SuperHyperStable is only up in this quasi-R-Unequal Dimension Dominating. It’s the
contradiction to that fact on the generality. There are some counterexamples to deny this
statement. One of them comes from the setting of the graph titled path and cycle as the
counterexamples-classes or reversely direction star as the examples-classes, are well-known classes
in that setting and they could be considered as the examples-classes and counterexamples-classes
for the tight bound of
Let V \ V \ {z} in mind. There’s no necessity on the SuperHyperEdge since we need at least
two SuperHyperVertices to form a SuperHyperEdge. It doesn’t withdraw the principles of the
main definition since there’s no condition to be satisfied but the condition is on the existence of
the SuperHyperEdge instead of acting on the SuperHyperVertices. In other words, if there’s a
SuperHyperEdge, then the Neutrosophic SuperHyperSet has the necessary condition for the
intended definition to be applied. Thus the V \ V \ {z} is withdrawn not by the conditions of
the main definition but by the necessity of the pre-condition on the usage of the main definition.
The Neutrosophic structure of the Neutrosophic R-Unequal Dimension Dominating decorates the
Neutrosophic SuperHyperVertices don’t have received any Neutrosophic connections so as
this Neutrosophic style implies different versions of Neutrosophic SuperHyperEdges with

the maximum Neutrosophic cardinality in the terms of Neutrosophic SuperHyperVertices

are spotlight. The lower Neutrosophic bound is to have the maximum Neutrosophic
groups of Neutrosophic SuperHyperVertices have perfect Neutrosophic connections inside
each of SuperHyperEdges and the outside of this Neutrosophic SuperHyperSet doesn’t
matter but regarding the connectedness of the used Neutrosophic SuperHyperGraph arising
from its Neutrosophic properties taken from the fact that it’s simple. If there’s no more
than one Neutrosophic SuperHyperVertex in the targeted Neutrosophic SuperHyperSet,
then there’s no Neutrosophic connection. Furthermore, the Neutrosophic existence of one
Neutrosophic SuperHyperVertex has no Neutrosophic effect to talk about the Neutrosophic
R-Unequal Dimension Dominating. Since at least two Neutrosophic SuperHyperVertices involve
to make a title in the Neutrosophic background of the Neutrosophic SuperHyperGraph.
The Neutrosophic SuperHyperGraph is obvious if it has no Neutrosophic SuperHyperEdge
but at least two Neutrosophic SuperHyperVertices make the Neutrosophic version of
Neutrosophic SuperHyperEdge. Thus in the Neutrosophic setting of non-obvious Neutrosophic
SuperHyperGraph, there are at least one Neutrosophic SuperHyperEdge. It’s necessary to
mention that the word “Simple” is used as Neutrosophic adjective for the initial Neutrosophic
SuperHyperGraph, induces there’s no Neutrosophic appearance of the loop Neutrosophic version
of the Neutrosophic SuperHyperEdge and this Neutrosophic SuperHyperGraph is said to be
loopless. The Neutrosophic adjective “loop” on the basic Neutrosophic framework engages one
Neutrosophic SuperHyperVertex but it never happens in this Neutrosophic setting. With these
Neutrosophic bases, on a Neutrosophic SuperHyperGraph, there’s at least one Neutrosophic
SuperHyperEdge thus there’s at least a Neutrosophic R-Unequal Dimension Dominating has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Unequal
Dimension Dominating has the Neutrosophic cardinality at least a Neutrosophic SuperHyperEdge.
Assume a Neutrosophic SuperHyperSet V \ V \ {z}. This Neutrosophic SuperHyperSet isn’t a

Neutrosophic R-Unequal Dimension Dominating since either the Neutrosophic SuperHyperGraph is an
obvious Neutrosophic SuperHyperModel thus it never happens since there’s no Neutrosophic
usage of this Neutrosophic framework and even more there’s no Neutrosophic connection
inside or the Neutrosophic SuperHyperGraph isn’t obvious and as its consequences, there’s a
Neutrosophic contradiction with the term “Neutrosophic R-Unequal Dimension Dominating” since the
maximum Neutrosophic cardinality never happens for this Neutrosophic style of the Neutrosophic
SuperHyperSet and beyond that there’s no Neutrosophic connection inside as mentioned in first
Neutrosophic case in the forms of drawback for this selected Neutrosophic SuperHyperSet. Let
Comes up. This Neutrosophic case implies having the Neutrosophic style of on-quasi-triangle
Neutrosophic style on the every Neutrosophic elements of this Neutrosophic SuperHyperSet.
Precisely, the Neutrosophic R-Unequal Dimension Dominating is the Neutrosophic SuperHyperSet of
the Neutrosophic SuperHyperVertices such that some Neutrosophic amount of the Neutrosophic
SuperHyperVertices are on-quasi-triangle Neutrosophic style. The Neutrosophic cardinality of
the v SuperHypeSet
Is the maximum in comparison to the Neutrosophic SuperHyperSet


But the lower Neutrosophic bound is up. Thus the minimum Neutrosophic cardinality of the
maximum Neutrosophic cardinality ends up the Neutrosophic discussion. The first Neutrosophic
term refers to the Neutrosophic setting of the Neutrosophic SuperHyperGraph but this key
point is enough since there’s a Neutrosophic SuperHyperClass of a Neutrosophic SuperHy-
perGraph has no on-quasi-triangle Neutrosophic style amid some amount of its Neutrosophic
SuperHyperVertices. This Neutrosophic setting of the Neutrosophic SuperHyperModel proposes
a Neutrosophic SuperHyperSet has only some amount Neutrosophic SuperHyperVertices from
one Neutrosophic SuperHyperEdge such that there’s no Neutrosophic amount of Neutrosophic
SuperHyperEdges more than one involving these some amount of these Neutrosophic SuperHy-
perVertices. The Neutrosophic cardinality of this Neutrosophic SuperHyperSet is the maximum
and the Neutrosophic case is occurred in the minimum Neutrosophic situation. To sum them
up, the Neutrosophic SuperHyperSet
Has the maximum Neutrosophic cardinality such that

Contains some Neutrosophic SuperHyperVertices such that there’s distinct-covers-order-amount

Neutrosophic SuperHyperEdges for amount of Neutrosophic SuperHyperVertices taken from
the Neutrosophic SuperHyperSet
It means that the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices

Is a Neutrosophic R-Unequal Dimension Dominating for the Neutrosophic SuperHyperGraph as used

Neutrosophic background in the Neutrosophic terms of worst Neutrosophic case and the common
theme of the lower Neutrosophic bound occurred in the specific Neutrosophic SuperHyperClasses
of the Neutrosophic SuperHyperGraphs which are Neutrosophic free-quasi-triangle.
Assume a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has z Neutrosophic number of
the Neutrosophic SuperHyperVertices. Then every Neutrosophic SuperHyperVertex has at
least no Neutrosophic SuperHyperEdge with others in common. Thus those Neutrosophic
SuperHyperVertices have the eligibles to be contained in a Neutrosophic R-Unequal Dimension
Dominating. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Unequal Dimension Dominating. Formally, consider
V \ (V \ {aE , bE , cE , . . . , zE }).
Are the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) .
Thus
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z.
where the ∼ isn’t an equivalence relation but only the symmetric relation on the Neutrosophic
SuperHyperVertices of the Neutrosophic SuperHyperGraph. The formal definition is as follows.
Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z

if and only if Zi and Zj are the Neutrosophic SuperHyperVertices and there’s only and only one
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) between the Neutrosophic SuperHyperVertices
Zi and Zj . The other definition for the Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) in the
terms of Neutrosophic R-Unequal Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Unequal Dimension Dominating but
with slightly differences in the maximum Neutrosophic cardinality amid those Neutrosophic type-
SuperHyperSets of the Neutrosophic SuperHyperVertices. Thus the Neutrosophic SuperHyperSet
of the Neutrosophic SuperHyperVertices,
max |{Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}|Neutrosophic cardinality ,

z
and
is formalized with mathematical literatures on the Neutrosophic R-Unequal Dimension Dominating.

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6588
Neutrosophic R-Unequal Dimension Dominating =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6589
Neutrosophic R-Unequal Dimension Dominating =

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Unequal Dimension Dominating where E ∈

EESHG:(V,E) is fixed that means Ex = E ∈ EESHG:(V,E) . for all Neutrosophic intended
SuperHyperVertices but in a Neutrosophic Unequal Dimension Dominating, Ex = E ∈ EESHG:(V,E)
could be different and it’s not unique. To sum them up, in a connected Neutrosophic
SuperHyperGraph ESHG : (V, E). If a Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E)
has z Neutrosophic SuperHyperVertices, then the Neutrosophic cardinality of the Neutrosophic
R-Unequal Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Unequal Dimension 6590
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6591

the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6592
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6593
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6594
rosophic Unequal Dimension Dominating in some cases but the maximum number of the Neutrosophic 6595
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6596
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Unequal Dimension 6597
Dominating. 6598
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6599
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6600
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6601
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6602
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6603
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6604
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6605
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6606
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6607
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6608
Neutrosophic quasi-R-Unequal Dimension Dominating where the Neutrosophic completion of the Neut- 6609
rosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Unequal Dimension 6610
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6611
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6612
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6613
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6614
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6615
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Unequal Dimension 6616
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6617
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic Su- 6618
perHyperVertices. The common connections, more precise and more formal, the perfect unique 6619
connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutrosophic 6620
SuperHyperVertices pose the Neutrosophic R-Unequal Dimension Dominating. Thus Neutrosophic 6621
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6622
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6623
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Unequal Dimension Dominating, there’s 6624
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6625
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6626
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6627
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6628
exploring to lead on the optimal case implying the Neutrosophic R-Unequal Dimension Dominating. The 6629
Neutrosophic R-Unequal Dimension Dominating with the exclusion of the exclusion of all Neutrosophic 6630
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6631
sophic R-Unequal Dimension Dominating with the inclusion of all Neutrosophic SuperHyperVertices in 6632
one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Unequal Dimension Dominating. To sum 6633

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6634
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6635
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6636
quasi-R-Unequal Dimension Dominating minus all Neutrosophic SuperHypeNeighbor to some of them 6637

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6638
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6639
quasi-R-Unequal Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them 6640
but not all of them. 6641
The main definition of the Neutrosophic R-Unequal Dimension Dominating has two titles. a Neut- 6642
rosophic quasi-R-Unequal Dimension Dominating and its corresponded quasi-maximum Neutrosophic 6643
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6644
number, there’s a Neutrosophic quasi-R-Unequal Dimension Dominating with that quasi-maximum 6645
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6646
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6647
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Unequal 6648
Dimension Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded max- 6649
imum number. The essence of the Neutrosophic Unequal Dimension Dominating ends up but this essence 6650
starts up in the terms of the Neutrosophic quasi-R-Unequal Dimension Dominating, again and more in 6651
the operations of collecting all the Neutrosophic quasi-R-Unequal Dimension Dominatings acted on the 6652
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6653
number. This Neutrosophic number is 6654
considered as the equivalence class for all corresponded quasi-R-Unequal Dimension Dominatings. 6655
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Unequal Dimension Dominating be 6656
a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Unequal Dimension 6657
Dominating. Then 6658
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Unequal Dimension Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Unequal Dimension Dominating is re- 6659
formalized and redefined as follows. 6660
GNeutrosophic Unequal Dimension Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number
{SNeutrosophic SuperHyperSet |
= zNeutrosophic Number }.
To get more precise perceptions, the follow-up expressions propose another formal technical 6661
definition for the Neutrosophic Unequal Dimension Dominating. 6662
GNeutrosophic Unequal Dimension Dominating =

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {SNeutrosophic SuperHyperSet |


= zNeutrosophic Number |
= max zNeutrosophic Number }.
[zNeutrosophic Number ]Neutrosophic Class
In more concise and more convenient ways, the modified definition for the Neutrosophic Unequal 6663
poses the upcoming expressions.

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6665

= max zNeutrosophic Number

And then, 6666


To get more visions in the closer look-up, there’s an overall overlook. 6667
GNeutrosophic Unequal Dimension Dominating ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6668

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6669


6670


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6671
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6672
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6673
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Unequal 6674
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Unequal Dimension 6675
Dominating” since “Neutrosophic Quasi-Unequal Dimension Dominating” happens “Neutrosophic Unequal 6676
Dimension Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background but 6677
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Unequal Dimension Domin- 6678
ating” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6679
since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6680
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6681
Quasi-Unequal Dimension Dominating”, and “Neutrosophic Unequal Dimension Dominating” are up. 6682
Thus, let 6683

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6684
GNeutrosophic Unequal Dimension Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6685
Neighborhood and a Neutrosophic Unequal Dimension Dominating and the new terms are up. 6686
GNeutrosophic Unequal Dimension Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6687

{NNeutrosophic SuperHyperNeighborhood

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6688

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6689

And with go back to initial structure, 6690
GNeutrosophic Unequal Dimension Dominating ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6691

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6692


6693


Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Unequal Dimension Dominating
if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, some interior
Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors with no
Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount of
them.
To make sense with the precise words in the terms of “R-’, the follow-up illustrations are coming
up.
The following Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices is the simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Dimension Dominating.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Dimension Dominating.

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Unequal Dimension Dominating C(ESHG) for an Neutrosophic SuperHy-

perGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by

Neutrosophic Unequal Dimension Dominating is related to the Neutrosophic SuperHyperSet of

the Neutrosophic SuperHyperVertices,
There’s not only one Neutrosophic SuperHyperVertex inside the intended Neutrosophic
SuperHyperSet. Thus the non-obvious Neutrosophic Unequal Dimension Dominating is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Unequal Dimension Dominating is
a Neutrosophic SuperHyperSet includes only one Neutrosophic SuperHyperVertex. But the
Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Neutrosophic SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Dimension Dominating is up. To
sum them up, the Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Unequal Dimen-

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
sion Dominating
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Unequal Dimension Dominating C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices
instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Unequal
Dimension Dominating and it’s an Neutrosophic Unequal Dimension Dominating. Since it’s
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge for some
amount Neutrosophic SuperHyperVertices instead of all given by that Neutrosophic type-
SuperHyperSet called the Neutrosophic Unequal Dimension Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Unequal Dimension Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal

, not:
Dimension Dominating

Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6694
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6695
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6696
type-SuperHyperSet called the 6697
“Neutrosophic R-Unequal Dimension Dominating” 6698
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6699
Neutrosophic R-Unequal Dimension Dominating, 6700
is only and only
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyper-

Modeling. It’s also, not only a Neutrosophic free-triangle embedded SuperHyperModel and a
Neutrosophic on-triangle embedded SuperHyperModel but also it’s a Neutrosophic stable em-
bedded SuperHyperModel. But all only non-obvious simple Neutrosophic type-SuperHyperSets
of the Neutrosophic R-Unequal Dimension Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Unequal Dimension Dominating, are
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E).

To sum them up, assume a connected loopless Neutrosophic SuperHyperGraph ESHG : (V, E).
Then in the worst case, literally,
is a Neutrosophic R-Unequal Dimension Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of a Neutrosophic R-Unequal Dimension Dominating is the cardinality
of
6701
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6702
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Unequal Dimension 6703
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6704
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6705
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6706
amount of them. 6707
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6708
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6709
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6710

Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6711
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6712
SuperHyperVertices. Consider there’s a Neutrosophic R-Unequal Dimension Dominating with the 6713
least cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a 6714
connected Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet 6715
of the Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of 6716
the Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to 6717

have some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Unequal 6718
Dimension Dominating. Since it doesn’t have 6719
6720
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6721
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6722
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6723

rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6724
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Unequal 6725
Dimension Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s 6726
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6727
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6728
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6729

titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6730
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6731
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6732
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6733
Neutrosophic R-Unequal Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type- 6734
SuperHyperSet of the Neutrosophic R-Unequal Dimension Dominating, VESHE , is a Neutrosophic Supe- 6735
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6736
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6737
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6738
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6739
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 6740
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, 6741

in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Unequal 6742
Dimension Dominating only contains all interior Neutrosophic SuperHyperVertices and all exterior 6743
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6744
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6745
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6746

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6747
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6748
The SuperHyperNotion, namely, Unequal Dimension Dominating, is up. There’s neither empty SuperHy- 6749
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6750
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6751
the Neutrosophic Unequal Dimension Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6752
SuperHyperEdges[SuperHyperVertices], 6753

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.

C(N SHG)N eutrosophicQuasi−U nequalDimensionDominatingSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−U nequalDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−U nequalDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal Dimension Dominating. 6754
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6755

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Unequal Dimension Dominating C(ESHG) for an Neutrosophic SuperHyper- 6756

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6757
6758
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6760
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6761
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6762
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6763
non-obvious Neutrosophic Unequal Dimension Dominating is up. The obvious simple Neutrosophic 6764
type-SuperHyperSet called the Neutrosophic Unequal Dimension Dominating is a Neutrosophic Su- 6765
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6766
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6767

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHyper- 6768
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal 6769
Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6770

SuperHyperEdges[SuperHyperVertices], 6771

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal 6772
. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Unequal Dimension Dominating C(ESHG) for an Neutrosophic SuperHyperGraph 6775
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6776
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6777

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Unequal Dimension Dominating 6778
and it’s an Neutrosophic Unequal Dimension Dominating. Since it’s 6779
6780
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6782
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6783

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6784
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6785

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .

Thus the non-obvious Neutrosophic Unequal Dimension Dominating , 6786

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is up. The obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Unequal Dimension 6787
, not:
Dominating 6788

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Neutrosophic SuperHyperSet, not: 6789

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Does includes only less than three SuperHyperVertices in a connected Neutrosophic Super- 6790
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6791
Neutrosophic type-SuperHyperSet called the 6792
“Neutrosophic Unequal Dimension Dominating ” 6793
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6794
Neutrosophic ,
Unequal Dimension Dominating 6795

is only and only 6796

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6797

CHAPTER 31 6798
The Neutrosophic Departures on The 6799
Theoretical Results Toward Theoretical 6800
Motivations 6801
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6802
Neutrosophic SuperHyperClasses. 6803
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6804

|E |
{E3i+2 }i=0ESHP .
| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 6805
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6806
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
329
Figure 31.1: a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperPath ESHP : (V, E). 6807

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6812
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6813
SuperHyperModel (31.1), is the SuperHyperUnequal Dimension Dominating. 6814
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6815

|E |
{E3i+2 }i=0ESHP .


| min |E | |Ei |
{E3i+2 } ESHP
=z i=0 .
EXT ERN AL |E |
{V2i+2 }i=0ESHP .
| min |E | |Vi |
=z 2i+2 i=0 .
Proof. Let 6816
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6817
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
3 3
be a longest path taken from a connected Neutrosophic SuperHyperCycle ESHC : (V, E). 6818

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6823
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6824
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperUnequal Dimension Dominating. 6825
6826

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

Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6827

{EN SHG − {E1 , E2 }}.
= z 3−a .
{VN SHG − {ViIN T ERN AL , CEN T ER}}.
= z 3−a .
Proof. Let 6828
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6829
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example (42.0.9) 136NSHG20a
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6830

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6835
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6836
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6837
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6838
the Neutrosophic SuperHyperUnequal Dimension Dominating. 6839
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6840

Then 6841

= z b−a .
= z b−a .
Proof. Let 6842
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6843
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG
is a longest path taken from a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6844

Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6850
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperUnequal Dimension Dominating in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperUnequal Dimension Dominating taken from a connected Neutrosophic 6852

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6853
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6854
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6856
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6857
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6858

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6859
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6860
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6862
Then 6863


= z b−a .
= z b−a .
Proof. Let 6864
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6865
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
...,
EXT ERN AL
j N SHG

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

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6872
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6874
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6875
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6879
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6880
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6881
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6882
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperUnequal Dimension 6883
Dominating. 6884
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6885
Then, 6886

|E |
{E3i+2 }i=0ESHP ∪ E ∗ .
| min |E | |Ei |
{E3i+2 } ESHP ∪E ∗
=z i=0 .
|E |
EXT ERN AL
{V2i+2 }i=0ESHP ∪ V ∗ .

| min |E | |Vi |
{V EXT ERN AL } ESHP ∪V ∗
=z 2i+2 i=0 .
Proof. Let 6887
P :
CEN T ER, E2∗
6888
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 6890

straightforward. Then there’s at least one SuperHyperUnequal Dimension Dominating. Thus the notion 6893
of quasi isn’t up and the SuperHyperNotions based on SuperHyperUnequal Dimension Dominating 6894
could be applied. The unique embedded SuperHyperUnequal Dimension Dominating proposes some 6895
longest SuperHyperUnequal Dimension Dominating excerpt from some representatives. The latter is 6896
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6898
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6899
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6900
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6901
SuperHyperModel (31.6), is the Neutrosophic SuperHyperUnequal Dimension Dominating. 6902

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperUnequal Dimension Dominating in the Neutrosophic Example
(42.0.15) 136NSHG23a

CHAPTER 32 6903
The Surveys of Mathematical Sets On 6904
The Results But As The Initial Motivation 6905
For the SuperHyperUnequal Dimension Dominating, Neutrosophic SuperHyperUnequal Dimension Dominating, 6906
and the Neutrosophic SuperHyperUnequal Dimension Dominating, some general results are introduced. 6907
6908
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperUnequal Dimension Dominating is 6909
“redefined” on the positions of the alphabets. 6910
Corollary 32.0.2. Assume Neutrosophic SuperHyperUnequal Dimension Dominating. Then 6911
N eutrosophic SuperHyperU nequalDimensionDominating =

{theSuperHyperU nequalDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperU nequalDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperU nequalDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6912
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6913
the neutrality, for i = 1, 2, 3, respectively. 6914
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6915
of the alphabet. Then the notion of Neutrosophic SuperHyperUnequal Dimension Dominating and 6916
SuperHyperUnequal Dimension Dominating coincide. 6917
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6918
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6919

SuperHyperUnequal Dimension Dominating if and only if it’s a SuperHyperUnequal Dimension Dominating. 6920
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6921
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperUnequal 6922
Dimension Dominating if and only if it’s a longest SuperHyperUnequal Dimension Dominating. 6923
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6924

identical letter of the alphabet. Then its Neutrosophic SuperHyperUnequal Dimension Dominating is its 6925
341
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Dimension Dominating, 6927

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6928
identical letter of the alphabet. Then its Neutrosophic SuperHyperUnequal Dimension Dominating is its 6929
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6931
perUnequal Dimension Dominating isn’t well-defined if and only if its SuperHyperUnequal Dimension Dominating 6932
isn’t well-defined. 6933
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6934

its Neutrosophic SuperHyperUnequal Dimension Dominating isn’t well-defined if and only if its 6935
SuperHyperUnequal Dimension Dominating isn’t well-defined. 6936
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Dimension Domin- 6937

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then
ating 6938
its Neutrosophic SuperHyperUnequal Dimension Dominating isn’t well-defined if and only if its SuperHy- 6939
perUnequal Dimension Dominating isn’t well-defined. 6940
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6941
perUnequal Dimension Dominating is well-defined if and only if its SuperHyperUnequal Dimension Dominating is 6942
well-defined. 6943
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6944
its Neutrosophic SuperHyperUnequal Dimension Dominating is well-defined if and only if its SuperHy- 6945
perUnequal Dimension Dominating is well-defined. 6946
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperUnequal Dimension Domin- 6947
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then

ating 6948
its Neutrosophic SuperHyperUnequal Dimension Dominating is well-defined if and only if its SuperHy- 6949
perUnequal Dimension Dominating is well-defined. 6950
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6951
(i) : the dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6952
(ii) : the strong dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6953
(iii) : the connected dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6954
(iv) : the δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6955
(v) : the strong δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6956
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 6957
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6958
(iii) : the connected defensive SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6961

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 6965

independent SuperHyperSet is 6966
(iii) : the connected SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6969
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6973

Graph which is a SuperHyperUnequal Dimension Dominating/SuperHyperPath. Then V is a maximal 6974
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6978
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6979
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6980
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6982

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6983
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6987
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6988
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 6989
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6991

perGraph which is a SuperHyperUnequal Dimension Dominating/SuperHyperPath. Then the number 6992
of 6993

(i) : the SuperHyperUnequal Dimension Dominating; 6994
(ii) : the SuperHyperUnequal Dimension Dominating; 6995
(iii) : the connected SuperHyperUnequal Dimension Dominating; 6996
(iv) : the O(ESHG)-SuperHyperUnequal Dimension Dominating; 6997
(v) : the strong O(ESHG)-SuperHyperUnequal Dimension Dominating; 6998
(vi) : the connected O(ESHG)-SuperHyperUnequal Dimension Dominating. 6999
coincide. 7001

Graph which is a SuperHyperWheel. Then the number of 7003
(i) : the dual SuperHyperUnequal Dimension Dominating; 7004
(ii) : the dual SuperHyperUnequal Dimension Dominating; 7005
(iii) : the dual connected SuperHyperUnequal Dimension Dominating; 7006
(iv) : the dual O(ESHG)-SuperHyperUnequal Dimension Dominating; 7007
(v) : the strong dual O(ESHG)-SuperHyperUnequal Dimension Dominating; 7008
(vi) : the connected dual O(ESHG)-SuperHyperUnequal Dimension Dominating. 7009
coincide. 7011
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 7012

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 7013
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 7014
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 7015
SuperHyperVertices is a 7016
O(ESHG)
O(ESHG)
O(ESHG)


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 7024
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 7025
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 7026
SuperHyperPart is a 7027
(iv) : δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 7031
(v) : strong δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 7032
(vi) : connected δ-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 7033
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 7035

plete SuperHyperMultipartite. Then Then the number of 7036
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 7043
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 7044
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 7046
connected component is |V − S| if there’s a SuperHyperSet which is a dual 7047
(iv) : SuperHyperUnequal Dimension Dominating; 7051

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 7054
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 7055
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 7056
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 7057

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 7058
t>
2


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 7065
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 7066
of dual 7067
(iv) : 0-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 7071

SuperHyperComplete. Then there’s no independent SuperHyperSet. 7075
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is Super- 7076
HyperUnequal Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 7077
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 7078
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 7082
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating; 7083
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperUnequal Dimension Dominating. 7084


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


Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 7095
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 7096
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 7097
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 7098
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7099
a dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such 7100

that 7101
(i) v ∈ Ns (x); 7102
(ii) vx ∈ E. 7103
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7104

a dual SuperHyperDefensive SuperHyperUnequal Dimension Dominating, then 7105
(i) S is SuperHyperUnequal Dimension Dominating set; 7106
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 7107
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 7108
(i) Γ ≤ O; 7109
(ii) Γs ≤ On . 7110
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 7111
connected. Then 7112
(i) Γ ≤ O − 1; 7113
(ii) Γs ≤ On − Σ3i=1 σi (x). 7114
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 7115


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 7119
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7120
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7122
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperUnequal Dimension 7123
Dominating; 7124
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7125
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7126
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7127
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperUnequal Dimension Dominating. Then 7129
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperUnequal 7130
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7132
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7133
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7134
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperUnequal Dimension Dominating. Then 7136

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7140
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7141
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7143
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperUnequal Dimension Dominating; 7144
(ii) Γ = 1; 7145
(iii) Γs = Σ3i=1 σi (c); 7146

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperUnequal Dimension Dominating. 7147
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7148
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 7149
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 7151
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 7152
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 7153
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7155
b n c+1
2
Dominating; 7157
(ii) Γ = b n2 c + 1; 7158

b n c+1 ; 7159
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperUnequal 7160
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7162
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperUnequal Dimension 7163
Dominating; 7164
(ii) Γ = b n2 c; 7165

bnc ; 7166
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive SuperHy- 7167
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 7169

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7170
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperUnequal 7171
Dimension Dominating for N SHF; 7172
(ii) Γ = m for N SHF : (V, E); 7173
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7174
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperUnequal 7175
Dimension Dominating for N SHF : (V, E). 7176

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7177

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7178
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHy- 7179
perUnequal Dimension Dominating for N SHF; 7180
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 7181

b n c+1 for N SHF : (V, E); 7182
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperUnequal Dimension 7183
Dominating for N SHF : (V, E). 7184
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7185
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7186
bnc
Dominating for N SHF : (V, E); 7188
(ii) Γ = b n2 c for N SHF : (V, E); 7189

bnc for N SHF : (V, E); 7190
S={vi }i=1
bnc
2
are only dual maximal SuperHyperUnequal Dimension Dominating 7191
for N SHF : (V, E). 7192
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7195

SuperHyperUnequal Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperUnequal 7196

perHyperUnequal Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperUnequal 7199
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7203

SuperHyperUnequal Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperUnequal 7204

perHyperUnequal Dimension Dominating, then S is a dual s-SuperHyperPowerful SuperHyperUnequal 7207
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7209

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7219
(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7223

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an V-SuperHyperDefensive 7225
(iv) ∀a ∈ V \ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is a dual V-SuperHyperDefensive 7227


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

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


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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperUnequal 7251
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7253

(iii) ∀a ∈ S, |Ns (a) ∩ V \ S| = 0 if ESHG : (V, E) is an 2-SuperHyperDefensive 7255

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


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

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

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


CHAPTER 33 7269
Neutrosophic Applications in Cancer’s 7270
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7272
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7273
disease is considered and as the consequences of the model, some parameters are used. The cells 7274
are under attack of this disease but the moves of the cancer in the special region are the matter 7275
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7276
treatments for this Neutrosophic disease. 7277
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7278
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7279
term Neutrosophic function. 7280
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7281
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7282
move from the cancer is identified by this research. Sometimes the move of the cancer 7283
about the moves and the effects of the cancer on that region; this event leads us to 7285
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7286
perception on what’s happened and what’s done. 7287
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7288
known and they’ve got the names, and some general Neutrosophic models. The moves 7289
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7290
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperUnequal 7291
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 7292
perHyperWheel). The aim is to find either the Neutrosophic SuperHyperUnequal Dimension 7293
Dominating or the Neutrosophic SuperHyperUnequal Dimension Dominating in those Neutrosophic 7294
Neutrosophic SuperHyperModels. 7295
353
CHAPTER 34 7296
Case 1: The Initial Neutrosophic Steps 7297
Toward Neutrosophic 7298
SuperHyperBipartite as Neutrosophic 7299
SuperHyperModel 7300
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7301
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7302
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

355
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7303
perBipartite is obtained. 7304
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7305
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7306
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7307
(34.1), is the Neutrosophic SuperHyperUnequal Dimension Dominating. 7308

CHAPTER 35 7309
Case 2: The Increasing Neutrosophic 7310
Steps Toward Neutrosophic 7311
SuperHyperMultipartite as 7312
Neutrosophic SuperHyperModel 7313
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7314
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7315
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7316
perMultipartite is obtained. 7317
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7318
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

357
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 7319

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7320
Neutrosophic SuperHyperUnequal Dimension Dominating. 7321

CHAPTER 36 7322
Wondering Open Problems But As The 7323
Directions To Forming The Motivations 7324
In what follows, some “problems” and some “questions” are proposed. 7325
The SuperHyperUnequal Dimension Dominating and the Neutrosophic SuperHyperUnequal Dimension 7326
Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 7327
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7328
recognitions? 7329
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperUnequal Dimension 7330
and the Neutrosophic SuperHyperUnequal Dimension Dominating?
Dominating 7331
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7332
them? 7333
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperUnequal 7334
and the Neutrosophic SuperHyperUnequal Dimension Dominating?
Problem 36.0.5. The SuperHyperUnequal Dimension Dominating and the Neutrosophic SuperHyperUnequal 7336
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperUnequal Dimension Dominating, are there else? 7338
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7339
Numbers types-results? 7340
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7341
the multiple types of SuperHyperNotions? 7342
359
CHAPTER 37 7343
Conclusion and Closing Remarks 7344
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7345
research are illustrated. Some benefits and some advantages of this research are highlighted. 7346
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7347
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperUnequal 7348
Dimension Dominating. For that sake in the second definition, the main definition of the Neutrosophic 7349
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 7350
for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHy- 7351
perUnequal Dimension Dominating, finds the convenient background to implement some results based on 7352
that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7353
research on the modeling of the regions where are under the attacks of the cancer to recognize 7354
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7355
on the SuperHyperNotion, SuperHyperUnequal Dimension Dominating, the new SuperHyperClasses 7356
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7357
SuperHyperUnequal Dimension Dominating and the Neutrosophic SuperHyperUnequal Dimension Dominating. 7358
The clarifications, instances and literature reviews have taken the whole way through. In this 7359
research, the literature reviews have fulfilled the lines containing the notions and the results. 7360
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7361
and the architecture are formally called “ SuperHyperUnequal Dimension Dominating” in the themes of 7366
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7367
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7368
for this research are, figured out, pointed out and spoken out. 7369
361
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperUnequal Dimension Dominating
3. Neutrosophic SuperHyperUnequal Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7370
Neutrosophic SuperHyperDuality But As 7371
Super Forms 7373
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7374

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7378

Va ∈ Ei , Ej ; 7379
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7380

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7381
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7382

Vi , Vj ∈ Ea ; 7383
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7384

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7385
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7386

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7387
sophic rv-SuperHyperDuality. 7388
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7389

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7392

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7394
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7395
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7396
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7397
363
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7399

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7401
form the Neutrosophic SuperHyperDuality; 7405
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7406
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7407

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7408
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7409
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7411
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7413
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7415

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7417
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7418
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7423
coefficient; 7424
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7425

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7427
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7428
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7429
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7430
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7432

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7433
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7434
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7435
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7436
that they form the Neutrosophic SuperHyperDuality; 7438
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7439

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7440
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7441

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7443
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7446
power is corresponded to its Extreme coefficient; 7447
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7448

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7450

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7456
coefficient. 7457
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7458
the mentioned Neutrosophic Figures in every Neutrosophic items. 7459

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7461
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7462
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7463
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7464
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7465
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7466
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7467
C(N SHG)Neutrosophic SuperHyperDuality = {E4 }.

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

E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 is a Neutrosophic 7471
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7472
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7473
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7474
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7475

every given Neutrosophic SuperHyperDuality. 7476




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

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


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

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

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

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

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

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


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





(2 × 1 × 2) + (2 × 4 × 5)z.



(1 × 1 × 2)z.


(2 × 2 × 2)z.

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

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







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

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Y |EESHG:(V,E) |Neutrosophic Cardinality
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z 3 .
Proof. Let 7520
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


SuperHyperModel (31.1), is the SuperHyperDuality. 7527
C(N SHG)Neutrosophic SuperHyperDuality =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperDuality SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperDuality

.
Proof. Let 7529
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7536
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperDuality SuperHyperPolynomial
= |i | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.

Proof. Let 7538


the Neutrosophic SuperHyperDuality. 7547
Then 7549
C(N SHG)Neutrosophic Quasi-SuperHyperDuality

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
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 7550
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7556
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7559

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7560
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7569

(V, E). Then 7570

i
X
i
i=|P ESHG:(V,E) |
ESHG:(V,E)
∈P ESHG:(V,E) |
z min |Pi
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 |
Proof. Let 7571
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7572


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7576
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7577
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7589
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7590
Then, 7591
C(N SHG)Neutrosophic Quasi-SuperHyperDuality = {E ∗ ∈ EESHG:(V,E)

∗
}.
= |i | Ei∗ ∈ EESHG:(V,E)|
∗
|z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperDuality SuperHyperPolynomial = z.
Proof. Let 7592
P :
...,
∗ EXT ERN AL
E|E ∗ | , V|E ∗ |Neutrosophic Cardinality +1
ESHG:(V,E) Neutrosophic Cardinality ESHG:(V,E)
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperWheel 7593


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7598
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7599
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7605

CHAPTER 39 7606
Neutrosophic SuperHyperJoin But As 7607
Super Forms 7609
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7610

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7614
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7616

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7617
|Ej |NEUTROSOPHIC CARDINALITY ; 7618
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7619

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7621

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7622
|Vj |NEUTROSOPHIC CARDINALITY ; 7623
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7624

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7625
rv-SuperHyperJoin. 7626
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7627

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

377

Extreme SuperHyperJoin; 7636
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7637

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7639
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7640
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7641
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7642
Neutrosophic SuperHyperJoin; 7643
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7644

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7645
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7646
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7651
coefficient; 7652
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7653

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7654
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7655
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7656
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7657
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7658
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7659

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

Extreme SuperHyperJoin; 7668
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7669

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7671
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7672
Neutrosophic SuperHyperJoin; 7675

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7676

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7678

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7683
its Extreme coefficient; 7684
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7685

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7687
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7688

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7689
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7690
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7693
coefficient. 7694
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7698

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7699

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

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


every given Neutrosophic SuperHyperJoin. 7713




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 .


C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperJoin = {V5 }.
C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial = z.

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 }.

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

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

C(N SHG)Neutrosophic R-SuperHyperJoin SuperHyperPolynomial =
4 × 5 × 5z 3 .


4 × 5 × 5z 3 .

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

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


4 × 5 × 5z 3 .

3 × 3z 2 .



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


3 × 3z 2 .





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



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


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

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

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




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



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

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperJoin SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperJoin

.
Proof. Let 7757
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3


SuperHyperModel (31.1), is the SuperHyperJoin. 7764

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

.
Proof. Let 7766
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7773
C(N SHG)Neutrosophic Quasi-SuperHyperJoin = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic Quasi-SuperHyperJoin SuperHyperPolynomial
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperJoin SuperHyperPolynomial = z.

Proof. Let 7775


the Neutrosophic SuperHyperJoin. 7784
Then 7786
C(N SHG)Neutrosophic Quasi-SuperHyperJoin

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 |
Proof. Let 7787
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


(V, E). Then 7806

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 |
Proof. Let 7807
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7808


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7813
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperJoin. 7824

Then, 7826

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

.
Proof. Let 7827
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7828


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7832
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7833
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7834
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7839

CHAPTER 40 7840
Neutrosophic SuperHyperPerfect But As 7841
Super Forms 7843
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7844

(i) Neutrosophic e-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃!Ej ∈ E 0 , such that 7848

Va ∈ Ei , Ej ; 7849
(ii) Neutrosophic re-SuperHyperPerfect if ∀Ei ∈ EESHG:(V,E) \E 0 , ∃!Ej ∈ E 0 , such that 7850

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7851
(iii) Neutrosophic v-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7852

Vi , Vj ∈ Ea ; 7853
(iv) Neutrosophic rv-SuperHyperPerfect if ∀Vi ∈ VESHG:(V,E) \ V 0 , ∃!Vj ∈ V 0 , such that 7854

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7855
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7856

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7857
rv-SuperHyperPerfect. 7858
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7859

(i) an Extreme SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7862

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7864
391
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7869

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7871
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7872
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7873
form the Neutrosophic SuperHyperPerfect; 7875
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7876

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7877
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7878
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7881
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7885

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7887
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7893
coefficient; 7894
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7895

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7897
(vi) a Neutrosophic R-SuperHyperPerfect if it’s either of Neutrosophic e- 7902

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7903
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7904
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7905
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7906
that they form the Neutrosophic SuperHyperPerfect; 7908
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7909

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7911

(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7918

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7920

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7926
coefficient. 7927

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7931

C(N SHG)Neutrosophic SuperHyperPerfect = {E4 }.

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


every given Neutrosophic SuperHyperPerfect. 7946





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

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


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

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

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

C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect = {V3 , V6 , V8 }.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial =
3 × 4 × 4z 3 .


3 × 4 × 4z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect = {E3i+13i=0 , E23 }.

C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V3i+13i=0 , V15 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 3z 5 .


3 × 4 × 4z 3 .


3 × 2z 2 .


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



3 × 3z 2 .






C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V2 , V7 , V17 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial =
(1 × 5 × 5) + (1 × 2 + 1)z 3 .


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



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

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

C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V2i+1i=05 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial = 2z 6 .





C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect = {V3 , V6 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperPerfect SuperHyperPolynomial
= 10 × 6 + 10 × 6 + 12 × 6 + 12 × 6z 2 .

C(N SHG)Neutrosophic SuperHyperPerfect =

= {Ei }i=1 3
.
C(N SHG)Neutrosophic SuperHyperPerfect SuperHyperPolynomial
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect

.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 7990
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.1), is the SuperHyperPerfect. 7997
C(N SHG)Neutrosophic SuperHyperPerfect =

= {Ei }i=1 3
.
= 3z 3 .
C(N SHG)Neutrosophic R-SuperHyperPerfect


.
C(N SHG)Neutrosophic R-SuperHyperPerfect SuperHyperPolynomial
Proof. Let 7999
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperPerfect. 8006
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 8008



the Neutrosophic SuperHyperPerfect. 8017
Then 8019
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect

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}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8020
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then 8024
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 8025
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 8026
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 8029

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

(V, E). Then 8040

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}.
C(N SHG)Neutrosophic Quasi-SuperHyperPerfect SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8041
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperMultipartite 8042



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 8045
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 8046
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 8047
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperPerfect. 8059
Then, 8061
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic R-SuperHyperPerfect = {CEN T ER ∈ VESHG:(V,E) }.
Proof. Let 8062

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 8063


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 8066
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 8067
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 8068
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 8069
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 8075

CHAPTER 41 8076
Neutrosophic SuperHyperTotal But As 8077
Super Forms 8079
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 8080

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8084

Va ∈ Ei , Ej ; 8085
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8086

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8087
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8088

Vi , Vj ∈ Ea ; 8089
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8090

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8091
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8092

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 8093
rv-SuperHyperTotal. 8094
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 8095

(i) an Extreme SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8098

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8100
Extreme SuperHyperTotal; 8104
405
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8105

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8107
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 8108
Neutrosophic SuperHyperTotal; 8111
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 8112
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 8113

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 8114
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 8119
coefficient; 8120
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8121
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8122

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8123
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8125
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8126
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8127
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8128
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8129
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8130

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8132
Extreme SuperHyperTotal; 8136
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8137

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8139
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 8140
Neutrosophic SuperHyperTotal; 8143
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8144

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8145
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8146

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8151
its Extreme coefficient; 8152
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8153
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8154

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8155
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8157
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8158
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8159
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8160
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8161

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8165

C(N SHG)Neutrosophic Quasi-SuperHyperTotal = {E4 }.

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


every given Neutrosophic SuperHyperTotal. 8180




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

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


C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = z.

C(N SHG)Neutrosophic SuperHyperTotal = {Ei+19i=0 }.

C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial = 20z 10 .




3 × 4 × 4z 3 .


C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {Vi+19i=0 }.


3 × 4 × 4z 3 .

C(N SHG)Extreme SuperHyperTotal = {E1 , E6 , E7 , E8 }.



C(N SHG)Extreme R-SuperHyperTotal = {V1 , Vii68=4,5,6 }.
i=1









4 × 3z 3 .


4 × 3z 4 .


2 × 4 × 3z 4 .



C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal = {Vi+2i=011 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperTotal SuperHyperPolynomial = 11z 10 .


C(N SHG)Extreme R-SuperHyperTotal = {V1 , V }.
= |(|V | − 1)z 2 .

C(N SHG)Neutrosophic SuperHyperTotal = {E1 , E2 }.

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


C(N SHG)Extreme R-Quasi-SuperHyperTotal = {V3 , V10 , V6 }.
C(N SHG)Extreme R-Quasi-SuperHyperTotal SuperHyperPolynomial
= 3 × 6z 3 .

C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic SuperHyperTotal SuperHyperPolynomial
= z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2
Proof. Let 8224
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 8231
C(N SHG)Neutrosophic SuperHyperTotal =

|E | −2
= {Ei }i=1ESHG:(V,E) Neutrosophic Cardinality .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z |EESHG:(V,E) |Neutrosophic Cardinality −2 .
C(N SHG)Neutrosophic R-SuperHyperTotal
|E | −2
= {ViEXT ERN AL }i=1ESHG:(V,E) Neutrosophic Cardinality .
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z |EESHG:(V,E) |Neutrosophic Cardinality −2

Proof. Let 8233
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E |E|EESHG:(V,E) |Neutrosophic Cardinality −1 .
, V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperTotal. 8240
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.

= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality |z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.
Proof. Let 8242


the Neutrosophic SuperHyperTotal. 8251
Then 8253
C(N SHG)Neutrosophic SuperHyperTotal

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8254
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8260
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8262

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8273

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic Quasi-SuperHyperTotal SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8274
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8275


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8280
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperTotal. 8291
Then, 8293
∗
C(N SHG)Neutrosophic SuperHyperTotal = {Ei , Ej ∈ EESHG:(V,E) }.
∗
= |i(i − 1) | Ei ∈ EESHG:(V,E)|Neutrosophic Cardinality
|z 2 .
C(N SHG)Neutrosophic R-SuperHyperTotal = {CEN T ER, Vj ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperTotal SuperHyperPolynomial =
(|VESHG:(V,E)|Neutrosophic Cardinality |) choose (|VESHG:(V,E)|Neutrosophic Cardinality | − 1)
z2.

Proof. Let 8294
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8295


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8299
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8300
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8301
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8307

CHAPTER 42 8308
Neutrosophic SuperHyperConnected But 8309
As The Extensions Excerpt From Dense 8310
And Super Forms 8311
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8312

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8316
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8317
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8318

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8319
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8320
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8321

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8324
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8325
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8326
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8327
rosophic rv-SuperHyperConnected. 8328
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8329

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8332
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8333
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8334
419
form the Extreme SuperHyperConnected; 8338
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8339

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8340
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8341
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8342
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8343
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8344

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8345
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8346
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8347

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8348
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8349
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8350
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8355

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8356
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8357
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8358
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8359
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8360
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8361

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8362
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8363
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8365

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8367
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8368
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8369
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8370
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8371
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8372

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8374
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8375
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8376
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8377
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8378

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8379

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8382
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8383

and the Extreme power is corresponded to its Extreme coefficient; 8387
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8388

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8391
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8392
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8393
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8394

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8395
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8396
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8400
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8401
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8403
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8404

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8405
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8406
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8407
C(N SHG)Neutrosophic SuperHyperConnected = {E4 }.

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

every given Neutrosophic SuperHyperConnected. 8415


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

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {V1 , V4 }.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial = 15z 2 .

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial = 4z.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
C(N SHG)Neutrosophic Quasi-SuperHyperConnected = {Ei+19i=0 }.

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 20z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+19i=0 }.


C(N SHG)Extreme R-SuperHyperConnected SuperHyperPolynomial = z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E4 }.

C(N SHG)Extreme Quasi-SuperHyperConnected SuperHyperPolynomial = z.
3 × 4 × 4z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial 10z 10 .
C(N SHG)Neutrosophic R-SuperHyperConnected = {Vi+119
i=11
, V22 }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = 20z 10 .

3 × 4 × 4z 3 .
C(N SHG)Extreme Quasi-SuperHyperConnected = {E1 , E6 , E7 , E8 }.

C(N SHG)Extreme SuperHyperConnected = {E1 , E2 }.

C(N SHG)Extreme SuperHyperConnected SuperHyperPolynomial = 5z 2 .
C(N SHG)Extreme R-Quasi-SuperHyperConnected = {V1 , Vii68=4,5,6 }.
i=1


C(N SHG)Extreme R-SuperHyperConnected = {V1 , V5 }.



4 × 3z 3 .

4 × 3z 4 .


2 × 4 × 3z 4 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial = 11z 10 .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected = {Vi+2i=011 }.


C(N SHG)Extreme Quasi-SuperHyperConnected = {E3 , E4 }.

= 3 × 6z 3 .

C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
C(N SHG)Neutrosophic Quasi-SuperHyperConnected SuperHyperPolynomial
|EESHG:(V,E) |Neutrosophic −2
=z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected
.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 8459
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

SuperHyperModel (31.1), is the SuperHyperConnected. 8466
C(N SHG)Neutrosophic Quasi-SuperHyperConnected =

|EESHG:(V,E) |
−2
= {Ei }i=1 .
= (|EESHG:(V,E) |Neutrosophic Cardinality − 1)
z Cardinality .
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected

.
C(N SHG)Neutrosophic R-Quasi-SuperHyperConnected SuperHyperPolynomial
|E | −2
Y
= |V EXT ERN AL ESHG:(V,E) |Neutrosophic Cardinality z ESHG:(V,E) Neutrosophic Cardinality
Proof. Let 8468
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...,
E|EESHG:(V,E) |Neutrosophic Cardinality −1 , V EXT ERN AL |EESHG:(V,E) |Neutrosophic Cardinality −1 .

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperConnected. 8475
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.

C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |EESHG:(V,E) |Neutrosophic Cardinality z.
C(N SHG)Neutrosophic R-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic R-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 8477



the Neutrosophic SuperHyperConnected. 8486
Then 8488
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8489
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but the 8494
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8495
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8498

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8509
C(N SHG)Neutrosophic Quasi-SuperHyperConnected

i
ESHG:(V,E)
∈P ESHG:(V,E) |
= z min |Pi
i
C(N SHG)Neutrosophic V-SuperHyperConnected
i
ERN AL
ESHG:(V,E) , Vb
EXT ERN AL
∈ VPEXT
i
ERN AL
ESHG:(V,E) , i 6= j}.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial

X X
EXT ERN AL |
Proof. Let 8510
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8511


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8515
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8516
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8517
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperConnected. 8528
Then, 8530
∗
C(N SHG)Neutrosophic SuperHyperConnected = {Ei ∈ EESHG:(V,E) }.
C(N SHG)Neutrosophic SuperHyperConnected SuperHyperPolynomial
= |i | Ei ∈ |E ∗ ESHG:(V,E) |Neutrosophic Cardinality |z.
C(N SHG)Neutrosophic V-SuperHyperConnected = {CEN T ER ∈ VESHG:(V,E) }.
C(N SHG)Neutrosophic V-SuperHyperConnected SuperHyperPolynomial = z.
Proof. Let 8531
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8532


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8535
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8536
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8537
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8538
some representatives. The latter is straightforward. 8539
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8544

CHAPTER 43 8545
Background 8546
433










HG291; HG292; HG293], there are some endeavors to formalize the basic SuperHyper- 8710
Notions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific re- 8711




HG287; HG288; HG289; HG290; HG291; HG292; HG293] alongside scientific re- 8766


Bibliography 8784

10.33140/JMTCM.01.03.09) 8813
439
10.20944/preprints202301.0282.v1). 8829
10.20944/preprints202301.0267.v1). 8832
(doi: 10.20944/preprints202301.0265.v1). 8837
prints202301.0262.v1). 8841
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8847

prints202301.0105.v1). 8850

Preprints 2023, 2023010044 8856
10.20944/preprints202301.0043.v1). 8859

(doi: 10.20944/preprints202212.0549.v1). 8868
(doi: 10.20944/preprints202212.0500.v1). 8875
10.5281/zenodo.8084436). 8884
2023, (doi: 10.5281/zenodo.8084420). 8887
10.5281/zenodo.8080100). 8890

10.5281/zenodo.8080068). 8893
(doi: 10.5281/zenodo.8078445). 8896
2023, (doi: 10.5281/zenodo.8078543). 8899
10.5281/zenodo.8076416). 8902
2023, (doi: 10.5281/zenodo.8076399). 8905
(doi: 10.5281/zenodo.8072171). 8908
2023, (doi: 10.5281/zenodo.8072267). 8911
10.5281/zenodo.8067384). 8914
2023, (doi: 10.5281/zenodo.8067409). 8917
10.5281/zenodo.8061927). 8920
10.5281/zenodo.8062016). 8923
10.5281/zenodo.8057696). 8926
2023, (doi: 10.5281/zenodo.8057753). 8929

10.5281/zenodo.8052893). 8932
2023, (doi: 10.5281/zenodo.8052925). 8935
10.5281/zenodo.8051346). 8938
10.5281/zenodo.8051360). 8941
10.5281/zenodo.8025707). 8944
10.5281/zenodo.8027275). 8947
odo.8017246). 8950
10.5281/zenodo.8020128). 8953
odo.7978571). 8956
10.5281/zenodo.7978857). 8959
10.5281/zenodo.7940830). 8962
10.5281/zenodo.7943578). 8965
odo.7916595). 8968

odo.7923632). 8971
(doi: 10.5281/zenodo.7904698). 8974
2023, (doi: 10.5281/zenodo.7904671). 8977
10.5281/zenodo.7871026). 8986
2023, (doi: 10.5281/zenodo.7874647). 8989
10.5281/zenodo.7857856). 8992
2023, (doi: 10.5281/zenodo.7857841). 8995
10.5281/zenodo.7853867). 9004
10.5281/zenodo.7853922). 9007

(doi: 10.5281/zenodo.7851519). 9010
(doi: 10.5281/zenodo.7851550). 9013
10.5281/zenodo.7834229). 9022
10.5281/zenodo.7834261). 9025
10.5281/zenodo.7824560). 9028
(doi: 10.5281/zenodo.7824623). 9031

2023, (doi: 10.5281/zenodo.7809365). 9042
2023, (doi: 10.5281/zenodo.7809358). 9045

10.5281/zenodo.7809219). 9048
10.5281/zenodo.7809328). 9051
2023, (doi: 10.5281/zenodo.7806767). 9054
2023, (doi: 10.5281/zenodo.7806838). 9057
10.5281/zenodo.7799902). 9066
(doi: 10.5281/zenodo.7804218). 9069
(doi: 10.5281/zenodo.7796334). 9072
10.5281/zenodo.7791952). 9078
10.5281/zenodo.7791982). 9081
10.5281/zenodo.7790026). 9084

10.5281/zenodo.7790052). 9087
2023, (doi: 10.5281/zenodo.7787066). 9090
10.5281/zenodo.7781476). 9096
10.5281/zenodo.7783082). 9099
10.5281/zenodo.7777857). 9102
10.5281/zenodo.7779286). 9105
(doi: 10.5281/zenodo.7771831). 9108
2023, (doi: 10.5281/zenodo.7772468). 9111
10.13140/RG.2.2.20913.25446). 9114
odo.7764916). 9117
10.13140/RG.2.2.11770.98247). 9120
10.13140/RG.2.2.12400.12808). 9123

2023, (doi: 10.13140/RG.2.2.22545.10089). 9126
10.13140/RG.2.2.11377.76644). 9132
10.13140/RG.2.2.23750.96329). 9135
10.13140/RG.2.2.31366.24641). 9138
10.13140/RG.2.2.34721.68960). 9141
2023, (doi: 10.13140/RG.2.2.30212.81289). 9144
10.13140/RG.2.2.24288.35842). 9150
10.13140/RG.2.2.32467.25124). 9153
10.13140/RG.2.2.31025.45925). 9156
10.13140/RG.2.2.17184.25602). 9159
10.13140/RG.2.2.23423.28327). 9162

10.13140/RG.2.2.28456.44805). 9165
10.13140/RG.2.2.23525.68320). 9168
10.13140/RG.2.2.20170.24000). 9171
10.13140/RG.2.2.36475.59683). 9174
10.13140/RG.2.2.29764.71046). 9177
2023, (doi: 10.13140/RG.2.2.18780.87683). 9180
10.13140/RG.2.2.26134.01603). 9186
10.13140/RG.2.2.27392.30721). 9189
10.13140/RG.2.2.33028.40321). 9192
10.13140/RG.2.2.21389.20966). 9195
10.13140/RG.2.2.16356.04489). 9198
10.13140/RG.2.2.21756.21129). 9201

10.13140/RG.2.2.30983.68009). 9204
10.13140/RG.2.2.28552.29445). 9207
(doi: 10.13140/RG.2.2.10936.21761). 9210
10.13140/RG.2.2.35105.89447). 9213
(doi: 10.13140/RG.2.2.30072.72960). 9216
10.13140/RG.2.2.31147.52003). 9219
10.13140/RG.2.2.32825.24163). 9222
10.13140/RG.2.2.13059.58401). 9225
10.13140/RG.2.2.11172.14720). 9228
2023, (doi: 10.13140/RG.2.2.22011.80165). 9231
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9234
2023, (doi: 10.13140/RG.2.2.10493.84962). 9237
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9240

2023, (doi: 10.13140/RG.2.2.19944.14086). 9243
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9246
(doi: 10.13140/RG.2.2.33103.76968). 9249
(doi: 10.13140/RG.2.2.23037.44003). 9252
(doi: 10.13140/RG.2.2.35646.56641). 9255
10.13140/RG.2.2.18030.48967). 9258
(doi: 10.13140/RG.2.2.13973.81121). 9261
2023, (doi: 10.13140/RG.2.2.34106.47047). 9264
2023, (doi: 10.13140/RG.2.2.31956.88961). 9270
2023, (doi: 10.13140/RG.2.2.15179.67361). 9273
10.13140/RG.2.2.21510.45125). 9276
2023, (doi: 10.13140/RG.2.2.13121.84321). 9279

10.13140/RG.2.2.11758.69441). 9282
2023, (doi: 10.13140/RG.2.2.31891.35367). 9285
10.13140/RG.2.2.19360.87048). 9288
10.13140/RG.2.2.32363.21286). 9291
10.13140/RG.2.2.23266.81602). 9294
10.13140/RG.2.2.19911.37285). 9297
10.13140/RG.2.2.11050.90569). 9300
2023, (doi: 10.13140/RG.2.2.17761.79206). 9303
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9309
(doi: 10.13140/RG.2.2.30182.50241). 9312

2023, (doi: 10.13140/RG.2.2.17252.24968). 9345
2023010396 (doi: 10.20944/preprints202301.0396.v1). 9354
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9357


2023,(doi: 10.13140/RG.2.2.36745.93289). 9371

10.20944/preprints202301.0282.v1). 9378
10.20944/preprints202301.0267.v1).). 9381
(doi: 10.20944/preprints202301.0265.v1). 9386
prints202301.0262.v1). 9390
2023010224, (doi: 10.20944/preprints202301.0224.v1). 9396


10.13140/RG.2.2.35061.65767). 9399
10.13140/RG.2.2.18494.15680). 9403

10.13140/RG.2.2.32530.73922). 9407
10.13140/RG.2.2.15897.70243). 9411
10.13140/RG.2.2.32530.73922). 9415
prints202301.0105.v1). 9418

10.13140/RG.2.2.23172.19849). 9425

10.13140/RG.2.2.17385.36968). 9435

Preprints 2023, 2023010044 9438

10.20944/preprints202301.0043.v1). 9441
2023, (doi: 10.13140/RG.2.2.28945.92007). 9444
10.13140/RG.2.2.35774.77123). 9450

10.13140/RG.2.2.29430.88642). 9456
(doi: 10.20944/preprints202212.0549.v1). 9462

10.13140/RG.2.2.19380.94084). 9465

(doi: 10.20944/preprints202212.0500.v1). 9476
10.13140/RG.2.2.20993.12640). 9479


10.13140/RG.2.2.29173.86244). 9494
2023 (doi: 10.5281/zenodo.8086310). 9499
2023 (doi: 10.5281/zenodo.8080167). 9501
2023 (doi: 10.5281/zenodo.8076449). 9505
2023 (doi: 10.5281/zenodo.8067469). 9509
(doi: 10.5281/zenodo.8062076). 9511

2023 (doi: 10.5281/zenodo.8052976). 9515
(doi: 10.5281/zenodo.8051368). 9517
(doi: 10.5281/zenodo.8027488). 9519
10.5281/zenodo.8020181). 9521
10.5281/zenodo.7978921). 9523
odo.7943878). 9525
10.5281/zenodo.7943871). 9527
10.5281/zenodo.7923786). 9529
2023 (doi: 10.5281/zenodo.7905287). 9531

2023 (doi: 10.5281/zenodo.7874677). 9535
(doi: 10.5281/zenodo.7857906). 9537
2023 (doi: 10.5281/zenodo.7856329). 9539
10.5281/zenodo.7854561). 9541
2023 (doi: 10.5281/zenodo.7851893). 9543

(doi: 10.5281/zenodo.7835063). 9547

(doi: 10.5281/zenodo.7826705). 9549
2023 (doi: 10.5281/zenodo.7820680). 9551
10.5281/zenodo.7812750). 9553


2023 (doi: 10.5281/zenodo.7807782). 9559
2023 (doi: 10.5281/zenodo.7804449). 9561

(doi: 10.5281/zenodo.7792307). 9565
(doi: 10.5281/zenodo.7790728). 9567
2023 (doi: 10.5281/zenodo.7787712). 9569
10.5281/zenodo.7783791). 9571
10.5281/zenodo.7780123). 9573
(doi: 10.5281/zenodo.7773119). 9575
odo.7637762). 9577
10.5281/zenodo.7766174). 9579
10.5281/zenodo.7762232). 9581
(doi: 10.5281/zenodo.7758601). 9583

10.5281/zenodo.7754661). 9585
10.5281/zenodo.7750995) . 9587
(doi: 10.5281/zenodo.7749875). 9589
10.5281/zenodo.7747236). 9591
10.5281/zenodo.7742587). 9593
(doi: 10.5281/zenodo.7738635). 9595
10.5281/zenodo.7734719). 9597
10.5281/zenodo.7730484). 9599
(doi: 10.5281/zenodo.7730469). 9601
10.5281/zenodo.7722865). 9603
odo.7713563). 9605
odo.7709116). 9607
10.5281/zenodo.7706415). 9609
10.5281/zenodo.7706063). 9611
10.5281/zenodo.7701906). 9613
odo.7700205). 9615
10.5281/zenodo.7694876). 9617
10.5281/zenodo.7679410). 9619

10.5281/zenodo.7675982). 9621
10.5281/zenodo.7672388). 9623
odo.7668648). 9625
10.5281/zenodo.7662810). 9627
10.5281/zenodo.7659162). 9629
odo.7653233). 9631
odo.7653204). 9633
odo.7653142). 9635
odo.7653117). 9637
odo.7651687). 9640
odo.7651619). 9642
odo.7651439). 9644
odo.7650729). 9646
odo.7647868). 9648
odo.7647017). 9650
odo.7644894). 9652

odo.7632923). 9655
odo.7623459). 9657
10.5281/zenodo.7606416). 9659
10.5281/zenodo.7606416). 9661
odo.7606404). 9663
10.5281/zenodo.7580018). 9665
odo.7580018). 9667
odo.7580018). 9669
odo.7579929). 9671
10.5281/zenodo.7563170). 9673
odo.7563164). 9675
odo.7563160). 9677
odo.7563160). 9679
10.5281/zenodo.7563160). 9681
10.5281/zenodo.7557063). 9683
10.5281/zenodo.7557009). 9685
10.5281/zenodo.7539484). 9687
10.5281/zenodo.7523390). 9689

10.5281/zenodo.7523390). 9691
10.5281/zenodo.7523390). 9693
odo.7574952). 9695
10.5281/zenodo.7574992). 9697
odo.7523357). 9699
10.5281/zenodo.7523357). 9701
10.5281/zenodo.7504782). 9703
10.5281/zenodo.7504782). 9705
10.5281/zenodo.7504782). 9707
10.5281/zenodo.7499395). 9709
odo.7499395). 9711
10.5281/zenodo.7499395). 9713
10.5281/zenodo.7497450). 9715
10.5281/zenodo.7497450). 9717
10.5281/zenodo.7494862). 9719
odo.7494862). 9721
10.5281/zenodo.7494862). 9723
10.5281/zenodo.7493845). 9725

odo.7493845). 9727
10.5281/zenodo.7493845). 9729
odo.7539484). 9731
odo.7523390). 9733
odo.7523357). 9735
odo.7504782). 9737
odo.7499395). 9739
odo.7497450). 9741
odo.7494862). 9743
odo.7493845). 9745
odo.7480110). 9747
odo.7378758). 9749
odo.6320305). 9751
odo.6677173). 9753

CHAPTER 44 9754
Books’ Contributions 9755
“Books’ Contributions”: | Featured Threads 9756

The following references are cited by chapters. 9757
9758
[Ref294 9759
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal Dimension 9760
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 9761
(doi: 10.5281/zenodo.8088387). 9762
9763
[Ref295] 9764
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9765
By Unequal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 9766
10.5281/zenodo.8088438). 9767
9768
The links to the contributions of this scientific research book are listed below. 9769
[HG294] 9770
(doi: 10.5281/zenodo.8088387). 9773
9774
[TITLE] “New Ideas On Super Dimity By Hyper Dimple Of Unequal Dimension Dom- 9775
inating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9776

9777
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9778
https://www.researchgate.net/publication/371905718 9779
9780
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9781
https://www.scribd.com/document/655823129 9782
9783
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9784
https://zenodo.org/record/8088387 9785
9786
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9787
https://www.academia.edu/103961789 9788
465
Figure 44.1: [HG294] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Unequal
Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8088387).
9789
[ADDRESSED CITATION] 9790
(doi: 10.5281/zenodo.8088387). 9793
[ASSIGNED NUMBER] #294 Article 9794
[DATE] June 2023 9795

[DOI] 10.5281/zenodo.8088387 9796
[LICENSE] CC BY-NC-ND 4.0 9797
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9798
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9799
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9800
9801
[HG295] 9802
10.5281/zenodo.8088438). 9805
9806
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9807

Unequal Dimension Dominating As Hyper Dimple On Super Dimity” 9808
9809
https://www.researchgate.net/publication/371906367 9811
9812
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9813


Figure 44.4: [HG295] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Unequal Dimension Dominating As Hyper Dimple On Super Dimity”,
https://www.scribd.com/document/655830517 9814
9815
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9816
9818
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9819
https://www.academia.edu/103962976 9820
9821
10.5281/zenodo.8088438). 9825
[ASSIGNED NUMBER] #295 Article 9826
[DATE] June 2023 9827
[DOI] 10.5281/zenodo.8088438 9828
[LICENSE] CC BY-NC-ND 4.0 9829

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9830
[AVAILABLE AT TWITTER’S IDS] 9831
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9832
googlebooks GooglePlay 9833
9834
[ASSIGNED NUMBER] | Book #187 9835

HG187b
Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9837
2023 (doi: 10.5281/zenodo.8090194). 9838


[TITLE] Unequal Dimension Dominating In SuperHyperGraphs 9839

#Latest_Updates 9840
#The_Links 9841
9845
9847
#The_Links 9848
9849
[ASSIGNED NUMBER] | Book #187 9850

9851
[TITLE] Unequal Dimension Dominating In SuperHyperGraphs 9852
9853
9857
– 9858
9859
[PUBLISHER] 9860
(Paperback): https://www.amazon.com/dp/- 9861
(Hardcover): https://www.amazon.com/dp/- 9862

(Kindle Edition): https://www.amazon.com/dp/- 9863
9864
– 9865
9866
[ISBN] 9867
(Paperback): - 9868
(Hardcover): - 9869
(Kindle Edition): CC BY-NC-ND 4.0 9870
(EBook): CC BY-NC-ND 4.0 9871
9872
– 9873
9874
[PRINT LENGTH] 9875
(Paperback): - pages 9876
(Hardcover): - pages 9877
(Kindle Edition): - pages 9878
(E-Book): - pages 9879
9880
– 9881
9882
9884

#The_Links 9885
9886
https://www.researchgate.net/publication/- 9888
9889
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9890
https://drhenrygarrett.wordpress.com/2023/07/22/ 9891
Unequal-Dimension-Dominating-In-SuperHyperGraphs/ 9892
9893
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9894
https://www.scribd.com/document/- 9895
9896
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9897
https://www.academia.edu/- 9898
9899
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9900
9902
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9903
https://books.google.com/books/about?id=- 9904
9905
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9906
https://play.google.com/store/books/details?id=- 9907

[TITLE] Unequal Dimension Dominating In SuperHyperGraphs (Published Version) 9908

9909
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9910
9911
https://drhenrygarrett.wordpress.com/2023/07/22/ 9912
Unequal-Dimension-Dominating-In-SuperHyperGraphs/ 9913
9914
– 9915
9916
[POSTED BY] Dr. Henry Garrett 9917
9918
[DATE] June 028, 2023 9919

9920
[POSTED IN] 187 | Unequal Dimension Dominating In SuperHyperGraphs 9921
9922
[TAGS] 9923
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9924
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9925
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9926
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9927
neutrosophic SuperHyperGraphs, Neutrosophic Unequal Dimension Dominating In SuperHyper- 9928
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9929
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9930
scientific research Articles, scientific research Book, scientific research Chapter, scientific research 9931
Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyper- 9932

Graph Theory, SuperHyperGraphs, Unequal Dimension Dominating In SuperHyperGraphs, 9933
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9934
In this scientific research book, there are some scientific research chapters on “Extreme Un- 9935
equal Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Unequal Dimension 9936
Dominating In SuperHyperGraphs” about some scientific research on Unequal Dimension 9937
Dominating In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme 9938

Unequal Dimension Dominating In SuperHyperGraphs and Neutrosophic Unequal Dimension 9939
Dominating In SuperHyperGraphs. With scientific research on the basic scientific research 9940
properties, the scientific research book starts to make Extreme Unequal Dimension Dom- 9941
inating In SuperHyperGraphs theory and Neutrosophic Unequal Dimension Dominating In 9942
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9943

HG187b1.png
Figure 44.7: [HG187b] Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8090194).

HG1875b2.png


HG187b3.png


CHAPTER 45 9944
“SuperHyperGraph-Based Books”: | 9945
Featured Tweets 9946
“SuperHyperGraph-Based Books”: | Featured Tweets 9947
477
Figure 45.1: “SuperHyperGraph-Based Books”: | Featured Tweets

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

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
























CHAPTER 46 9948
CV 9949
505
9950
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
Dec 2022 Award: Selected as a Reviewer @SciencePG
Award: Selected as Reviewer to Journal of American Journal of Computer

Science and Technology, Science Publishing Group, USA, @SciencePG:
https://www.sciencepublishinggroup.com/journal/index?journalid=303
American Journal of Computer Science and Technology, Science Publishing Group, USA,
@SciencePG
My name and affiliation is listed on the journal’s reviewer page:
http://www.sciencepg.com/journal/peerreviewers?journalid=303.
My name and affiliation is listed on the journal’s personal
page:https://membership.sciencepg.com/DrHenryGarrett
PDF: https://drhenrygarrett.files.wordpress.com/2023/04/certificate_for_reviewer.pdf
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 Membership; PDF: https://drhenrygarrett.files.wordpress.com/2023/02/neutrosophicdiploma-
henry-garrett.pdf
9951
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)
9952
Publications: Articles
2023 283 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8067384).
@ResearchGate: https://www.researchgate.net/publication/371756020
@Scribd: https://www.scribd.com/document/654568722
@ZENODO_ORG: https://zenodo.org/record/8067384
@academia: https://www.academia.edu/103685293
PAGE @facebook: https://www.facebook.com/DrHenryGarrett/posts/
pfbid02PVuRN6wHWsY52awEgDL88yFLdCN6dJtUEezqWcu8ryHhuRZSqWmSUrxpCSshV5KXl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:ugcPost:7077411062093946880/
2023 282 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.8067409).
pfbid0Fk4y4Y5kzep1nfAECg7k6MKiMjgcUNZZhvNiAxPgRPEXYX8wNGjcyQoizDseD8pDl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077410014478368769/
2023 281 Manuscript

By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi:
10.5281/zenodo.8061927).
pfbid02AY6rhhhenA7z75Qjv8GEDSoaRcMAfDcKmtxpzm3dyxt1KsVBMoKqxYJ9PegscNKwl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:share:7077059574163238912/
2023 280 Manuscript
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.8062016).
pfbid0dcDVKSnXYKg63EH6PbqG9u1dLReL1haZ8ouxYdLaPpmYFPJK7HrMeGsNHoheTMGjl
2023 279 Manuscript

9953

By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8057696).
pfbid0kHUWk75MYJXth1QP7ieYJjdmUh8KcQovZaC6SeeqncD3Smc6ZFWSwVrGDg8QJgH5l
@LinkedIn: https://www.linkedin.com/posts/drhenrygarrett_279-
henry-garrett-new-ideas-in-recognition-activity-7076691352930930688-
sjGq?utm_source=share&utm_medium=member_desktop
2023 278 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective
(doi: 10.5281/zenodo.8057753).
pfbid02JgSBu1Hp92uwoPnorUiVijLAnd2rP5LeronqPJAGVgK299cDGTQqJtr3nwqY2g1Rl
@LinkedIn: https://www.linkedin.com/feed/update/urn:li:activity:7076690695343755264/
2023 277 Manuscript

By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8052893).
pfbid02StvDe1ZQn2U3yVANyR2Qj597ZzBbj6haYsxscFoW92jFFG2zw1VLQ27qwvisBepjl
2023 276 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective
(doi: 10.5281/zenodo.8052925).
pfbid031F9WncGQKv9GpFZT9kbWtWawNgvs7awguQ6QyGAyHAoBqiZYzkgUjXRniePoqdw6l
9954
2023 275 Manuscript

By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi:
10.5281/zenodo.8051346).
pfbid028zmPpymc1oLLo41hh4h7eLMDaqhUtZnQSKgAxtJcZfgdfcoxpNQ6EZzyTFU9Wer5l
2023 274 Manuscript
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating
10.5281/zenodo.8051360).
pfbid032eqV8CopkBw2jfKW5wKDwmEny91xXzFrmiNXAEoqu6DrdscS5zXndHyFcahXpABgl
2023 241 Manuscript

As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32-55.
(https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf)
PDF: https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of-
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf
Abstract:https://www.opastpublishers.com/peer-review/new-ideas-in-recognition-of-cancer-
and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Citation: https://www.opastpublishers.com/citation/new-ideas-in-recognition-of-cancer-and-
neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot-5648.html
Volume:https://www.opastpublishers.com/journal/current-trends-in-mass-
communication/articles-in-press
pfbid024qjfw3bJE3zrFcxB114Ha3VNoqf5nh2itoKqufzyiYaVDQ1t6pH1KJ3SkivPUWQKl
2023 273 Manuscript

9955
By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi:
10.5281/zenodo.8025707).
pfbid0R5XYMJk3w6At94ARQVBRPeiWXiv9f9FKfLdUj4pUZw5WiTxjpQMF9hr1KTkKGEZ6l
2023 272 Manuscript
Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating
10.5281/zenodo.8027275).
pfbid02gs2zNHRgs5n6gGayqoknBWAkoFutW5uaNvG85hSjDXnM5J5nuU8F2FDNAZNkrBtQl
2023 271 Manuscript

By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zenodo.8017246).
pfbid0vR23GhKEjdnNoiNT5hCsnhcMwg55b6CpT4q6AZ6MJc4kYjxSXgkJM51jioYLJwmDl
2023 270 Manuscript
Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In Recognition of
Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8020128).
pfbid0bi1wyfJX4bdof4TG6R5GRPPKFxHGAiaWvuJZnXL6tKhdeC4PouPCo2BETDsT6m7sl
2023 269 Manuscript

9956
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zenodo.7978571).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0EMgDPr8Qr64cgQYNYob7DFjAwa4yzDvtBd5Hwu8Bju6MT937XntZkeShiJL3wtYGl
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7068500820371091456/
2023 268 Manuscript
Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7978857).
PAGE @facebook : https://www.facebook.com/DrHenryGarrett/posts/
pfbid0768FmYrMLfn7EnrUBPaPsZFoWzQw4aXR62EZWkhdXfHMUje7JBDCoQarigrzGiaFl
2023 267 Manuscript

By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi:
10.5281/zenodo.7940830).
@facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid0DHRP72yTvULtizh241w9p2VhGMpXdXdH89rwUgnY7dqzJyqxgAjiSsaawZnY6Pzcl&id
=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=pf
bid073cCSMu2PvsXjbnXE3PvkfsJW2oECsC9FhcraEnqky9jrNhHmCJ3khAfZy5VeMKal&id
=105165509175944
2023 266 Manuscript

9957
Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges
10.5281/zenodo.7943578).
bid02DM8fDU6YDVKLTCXVpPguYUVcfUkiZwFzjENTP5qiygR8uSGAFtMWjikiM5pMyTLxl&id
=100090667441909
bid05K2QshnbNBcMJPa3RZC19oPc4FV79qmkqHBmtL4Yz2wWdyK5uZwoEVYXCseWv1Sdl&id
=105165509175944
2023 265 Manuscript

By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zenodo.7916595).
bid02ZtwTiY3Ldtd42QNGMwdjVCJaoALf6gyDQ4HL96mMmj6gWgfAWWr51WSZkG6iAWtCl&id
=100090667441909
bid02MyRNN1RJMoD27xHe1pz6WCiEu39rbv7r8GfwdnByEePJF6nAiRgYGtk2fkG3CFQSl&id
=105165509175944
2023 264 Manuscript
Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap

10.5281/zenodo.7923632).
bid032NKnZqrpam2B6YXb3rEpW8AXE9KbAQ15iALaCK7haHfiED3YpdiUT7giYGywZHkHl&id
=100090667441909
bid021XcoJg9VxpzxeRgHG848UdaRbNE7PnusfwFTbRNeLrg19LZtDRun7gYDvjPi8Bbkl&id
=105165509175944
2023 263 Manuscript

9958
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7904698).
bid0q4qz8wvNRRUHPXHnouaJLhzaEiFR3sAPVVXAktBaqnBDrWQKgM8t7s5g6L5up1gCl&id
=100090667441909
bid0KMQDXt65fJngQfkfvQrnkuiSmKybzkUpbaz2vtbuDz5B7aeM4ZcUB1o2uawhswDCl&id
=105165509175944
2023 262 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7904671).
bid022MLnimgoywbh7Nm1t4YfNPsPfhx7T5pMDzA425NPf6SNwbvpJp7VZ9EueYAWUL16l&id
=100090667441909
bid02sGHvQEoCQ7ytHFh9JS5ravEkdDbdh1wRsheCw5g3SCoJAPBrgcRPKmPvkKGTTqA9l&id
=105165509175944
2023 261 Manuscript

By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
bid02Auhe8fKPai12fQr4JzH9wbp1qLQCVtGUbq6J4FBmpjNs7sx69NGgAXmLEmX3mZDCl&id
=100090667441909
bid0muouzWdCK94uH1LTk4drVvuvPZ4bR9yq8vvwquEYZoSseHFw7VbaRKDZTERuE7QYl&id
=105165509175944
2023 260 Manuscript

9959
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Hfz856s7ZBz5zxPcWvbAgsLF2Hu6Ky6yUj6VgSkdhRm95xBUXDd2SqiywRYkJFztl&id
=100090667441909
bid0qMfT6A9fPc2Fw1C2UTYhRVXuvU1gXJtTqEDxCj169gNDyLKGuqDem1NzDVqFbb9al&id
=105165509175944
2023 259 Manuscript

By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7871026).
bid0y6Hv8C1KYCz7GGfSSjw8W7oeD5P1CPmbMPPUZSPAvP4vftLCXs5CKAfBKcg1XVnSl&id
=100090667441909
bid02wNaiihPpfkg9DufyDVqM4fzFSe88Yp2xKWyreYrfD5hQETbU7UJzoxni9YVCmqBel&id
=105165509175944
2023 258 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Cycle-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7874647).
bid0nNzjMDKU3XMaJ9Hr3oYruSs2259aa4BybrANdEivV7TmrDe64WgvM3mtGMk5BCdyl&id
=100090667441909
bid0G5v1QVPVWQDEUu6PqDJovggdpCprYk513VjqpfAoqQ4DsAuzgx2jf28Wea4qhnDRl&id
=105165509175944
2023 257 Manuscript

9960
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7857856).
bid02KNUykkJYt8Bc7BEXH865F5YETnRorocET2VHPC7hqELMrSru5pjX1V9Eh3MtECd8l&id
=100090667441909
bid0knpZ5z8BJZSsj7TnL2qDfJ2dLtwDFt1PnMnTPVhQFudLmHLkv771E94AXJprBL8Xl&id
=105165509175944
2023 256 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7857841).
bid08iMYYsQKk7fVdCjhScLTv2JTk6ERXXJ9SBtaKcsNXGqJ79H5UdJiGJAUg5kSSDCjl&id
=100090667441909
bid0T7zYr9h5V87m78eTsswzk7NUcPwHUaSUqErCN4FMcZN89ZkRFVnaPMn2cuzbFboHl&id
=105165509175944
2023 255 Manuscript

By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7855661).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid0sC8jkawi5dU1zj1UuTYnNLwMAowhbmonN2F87pc1QAQxRwUY3KanJY2BZ6N2f7mbl&id
=105165509175944
@LinkedIn : https://www.linkedin.com/feed/update/urn:li:ugcPost:7055646779198820352
2023 254 Manuscript

9961
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
bid02Pk4uksX2stX7AUx6jgCaLYWE1rCRNVszGyKUtBmT5F4genjUtrD8nRgwd45R3PJyl&id
=100090667441909
bid02yKq9WgrcBpuMDxqzhr9qMmT5T1byGrCxHBGugZ7oqHvgUeM61tKrqbq7Ewd4bwZjl&id
=105165509175944
2023 253 Manuscript

By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7853867).
bid031iRCrdyWTAQZxnppfp9iwnsHF4Vd15MyiiNkGjJrPhRXKL6nTGXWBRaYWVCA6A8gl&id
=100090667441909
bid02ExpaJbYr3pVjorCGEuXW22QKCYBMDtWSobYdiucosq69upuF968AwgAQ7Zr1Lrh9l&id
=105165509175944
2023 252 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-

10.5281/zenodo.7853922).
bid0F26gh8jMB6kwyjj8n2Gm1kdxFsC4mNw6S5Y2DqgRCxq63riJdUTuGNHBSq2KSv7Ul&id
=100090667441909
bid0oNL1Gy5SZVrdfxiAHsi1MYCLoQozKXAkkzZNfDvvSLMyoxZ93P7vQCyeSXzGRQsYl&id
=105165509175944
2023 251 Manuscript

9962
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7851519).
bid0HgJWLq8vMPMA8ktU5ZXQ3oTgmv2fhyk26qrPs3GMAvsVGSF7UKwAGCciNTEHV33Yl&id
=100090667441909
bid0nu8k62sMimbCiFvbeQ7jbbPXAtoHmEs4jYTago6hSZLYRNYXH9upiKxgsHDn21o6l&id
=105165509175944
2023 250 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path-

(doi: 10.5281/zenodo.7851550).
bid07iFfA7KpVRvKbQruEVGzK3m2wQkxXvQwrAS2SPiVHjtCzAVRk2aJsGGmuQbVw2mxl&id
=100090667441909
bid025JFAw4ratfahU4VHcxfaf5G6dT9swBnBJDwp3Q5wNhhPSoercdtA535gPN48eGmLl&id
=105165509175944
2023 249 Manuscript

By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”,
bid0t5u3Ti8Umd1TniGVRg78L8RtbropVif7mWFkKT3twSArxhx4qEJ6xH3DVTMVsapLl&id
=100090667441909
bid02JdLpwHLy92LqMiRQnJ1YwFFPAbwEmLS6SXwJFotGmA249dqwhR5g8836Pm3C18jUl&id
=105165509175944
2023 248 Manuscript

9963
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
bid0Cv7Ko3mnffB7xPfZsTTVRKGLVLfGnqzquEemtcEpp3Zr2EAKf3e1p6eJGDmQmvfxl&id
=100090667441909
bid0n73h7GjN7Dmwit5hyVfR5TSPVjFLajmkFmRkH636gJTLVzELHvszZFSWQNmJPC8rl&id
=105165509175944
2023 247 Manuscript

By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7834229).
2023 246 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7834261).
2023 245 Manuscript

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
2023 244 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path-

Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7824623).
9964
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7819579).
2023 241 Manuscript

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236).
2023 240 Manuscript

By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 2023,
(doi: 10.5281/zenodo.7809365).
2023 239 Manuscript

By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 2023,
(doi: 10.5281/zenodo.7809358).
2023 238 Manuscript

9965
By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi:
10.5281/zenodo.7809328).
2023 237 Manuscript
Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-

Cut In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7809219).
2023 236 Manuscript

By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023,
(doi: 10.5281/zenodo.7806767).
2023 235 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type-

Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo
2023, (doi: 10.5281/zenodo.7806838).
2023 234 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic

SuperHyperGraph By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress
On Super Decompensation”, Zenodo 2023, (doi: 10.5281/zenodo.7804238).
2023 233 Manuscript

9966
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress
Of Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228).
2023 232 Manuscript

By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7799902).
2023 231 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type-

Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7804218).
2023 230 Manuscript

By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7796334).
2023 229 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Cycle-

(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

9967
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”,
2023 227 Manuscript

Of Hamiltonian-Cycle-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 226 Manuscript

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7791952).
2023 225 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-

10.5281/zenodo.7791982).
2023 224 Manuscript

By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7790026).
2023 223 Manuscript

9968
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-
(doi: 10.5281/zenodo.7790052).
2023 222 Manuscript

By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7787066).
2023 221 Manuscript

Of Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic)
2023 220 Manuscript

By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi:
10.5281/zenodo.7781476).
2023 219 Manuscript
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-

10.5281/zenodo.7783082).
2023 218 Manuscript

9969
By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7777857).
2023 217 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor

10.5281/zenodo.7779286).
2023 216 Article
Henry Garrett, “A Research on Cancers Recognition and Neutrosophic Super

Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Covering
Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 136-148.
(https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets-
.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
Abstract:https://www.opastpublishers.com/peer-review/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Citation: https://www.opastpublishers.com/citation/a-research-on-cancers-recognition-
and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-hamiltonian-sets–
5309.html
Volume:https://www.opastpublishers.com/journal/journal-of-mathematics-
techniques/articles-in-press
JMTCM: https://www.opastpublishers.com/open-access-articles/a-research-on-cancers-
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and-
hamiltonian-sets-.pdf
@ZENODOO RG : https : //zenodo.org/record/7774581
2023 215 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph By

Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, (doi:
10.5281/zenodo.7771831).
@Scribd: https://www.scribd.com/document/-
9970
2023 214 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace-

Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7772468).
2023 213 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.20913.25446).
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

10.5281/zenodo.7764916).
2023 211 Manuscript

By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11770.98247).
2023 210 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.12400.12808).
2023 209 Manuscript

9971
Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22545.10089).
2023 208 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564).
2023 207 Manuscript

Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 207 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic

SuperHyperGraph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.11377.76644).
2023 206 Manuscript
Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In

Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23750.96329).
2023 205 Manuscript

9972
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31366.24641).
2023 204 Manuscript
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor

10.13140/RG.2.2.34721.68960).
2023 203 Manuscript

By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30212.81289).
2023 202 Manuscript

Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 201 Manuscript

By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi:
10.13140/RG.2.2.24288.35842).
2023 200 Manuscript

9973
Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In
10.13140/RG.2.2.32467.25124).
2023 199 Manuscript

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31025.45925).
2023 198 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor

10.13140/RG.2.2.17184.25602).
2023 197 Manuscript

By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23423.28327).
2023 196 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions

10.13140/RG.2.2.28456.44805).
2023 195 Manuscript

9974
By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23525.68320).
2023 194 Manuscript
Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In

10.13140/RG.2.2.20170.24000).
2023 193 Manuscript

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi:
10.13140/RG.2.2.36475.59683).
2023 192 Manuscript
Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors

10.13140/RG.2.2.29764.71046).
2023 191 Manuscript

By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.18780.87683).
2023 190 Manuscript

9975
Clique-Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 189 Manuscript

By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi:
10.13140/RG.2.2.26134.01603).
2023 188 Manuscript
Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In

10.13140/RG.2.2.27392.30721).
2023 187 Manuscript

SuperHyperGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33028.40321).
2023 186 Manuscript

By List-Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21389.20966).
2023 185 Manuscript

9976
Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In
10.13140/RG.2.2.16356.04489).
2023 184 Manuscript

SuperHyperGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.21756.21129).
2023 183 Manuscript
Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In

Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30983.68009).
2023 182 Manuscript

By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.28552.29445).
2023 181 Manuscript
Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity

10.13140/RG.2.2.10936.21761).
2023 180 Manuscript

9977
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35105.89447).
2023 179 Manuscript
Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity

10.13140/RG.2.2.30072.72960).
2023 178 Manuscript

By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi:
10.13140/RG.2.2.31147.52003).
2023 177 Manuscript
Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition

10.13140/RG.2.2.32825.24163).
2023 176 Manuscript

By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13059.58401).
2023 175 Manuscript

9978
Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In
10.13140/RG.2.2.11172.14720).
2023 174 Manuscript

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.22011.80165).
2023 173 Manuscript
Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)-

Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate
2023, (doi: 10.13140/RG.2.2.30819.84003).
2023 172 Manuscript

By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate
2023, (doi: 10.13140/RG.2.2.10493.84962).
2023 171 Manuscript
Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge-

2023, (doi: 10.13140/RG.2.2.13849.29280).
2023 170 Manuscript

9979
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.19944.14086).
2023 169 Manuscript
Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK-

2023, (doi: 10.13140/RG.2.2.23299.58404).
2023 168 Manuscript

By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, (doi:
10.13140/RG.2.2.33103.76968).
2023 167 Manuscript
Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number

10.13140/RG.2.2.23037.44003).
2023 166 Manuscript

SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, (doi:
10.13140/RG.2.2.35646.56641).
2023 165 Manuscript

9980
Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder
10.13140/RG.2.2.18030.48967).
2023 164 Manuscript

By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, (doi:
10.13140/RG.2.2.13973.81121).
2023 163 Manuscript
Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of

SuperHyperColoring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 162 Manuscript
Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection

of SuperHyperDefensive In Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023, (doi: 10.13140/RG.2.2.13397.09446).
2023 161 Manuscript

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.31956.88961).
2023 160 Manuscript

9981
Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDimension
10.13140/RG.2.2.15179.67361).
2023 159 Manuscript

By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.21510.45125).
2023 158 Manuscript
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating

10.13140/RG.2.2.13121.84321).
2023 157 Manuscript

By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11758.69441).
2023 156 Manuscript
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of

SuperHyperConnected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”,
2023 155 Manuscript

By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19360.87048).
2023 154 Manuscript

9982
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.32363.21286).
2023 153 Manuscript
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect

In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi:
10.13140/RG.2.2.23266.81602).
2023 152 Manuscript

By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi:
10.13140/RG.2.2.19911.37285).
@Scribd: https://www.researchgate.net/publication/368537004
2023 151 Manuscript

By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi:
10.13140/RG.2.2.11050.90569).
2023 150 Manuscript
Henry Garrett, “New Ideas On Super connections By Hyper disconnections

Of SuperHyperJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”,
2023 149 Manuscript
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions

Of SuperHyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 148 Manuscript

9983
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate
2023, (doi: 10.13140/RG.2.2.33275.80161).
2023 147 Manuscript
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, (doi:
10.13140/RG.2.2.30182.50241).
2023 146 Manuscript
Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of

Path SuperHyperColoring In Cancer’s Neutrosophic Recognition and Neutrosophic
2023 145 Manuscript
Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s

Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”,
2023 144 Manuscript
Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super Resistances

In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate
2023, (doi:10.13140/RG.2.2.16800.05123).
2023 143 Manuscript
Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super
separations-VI”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482).
@WordPress: -
2023 142 Manuscript

9984
separations-V”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809).
@WordPress: -
@Scribd:https://www.scribd.com/document/624023778
2023 141 Manuscript

separations-IV”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960).
@WordPress: -
2023 140 Manuscript
Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph

separations-III”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040).
@WordPress: -
2023 139 Manuscript

separations-II”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125).
@WordPress: -
2023 138 Manuscript

separations-I”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089).
@WordPress: -
2023 137 Manuscript
Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition

As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”,
@WordPress: -
2023 136 Manuscript

9985
Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph

By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 2023,
(doi: 10.13140/RG.2.2.17252.24968).
@WordPress: -
2023 135 Manuscript
Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the

Criteria of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525).
@WordPress: -
2023 134 Manuscript
Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and

Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”,
ResearchGate 2023,(doi: 10.13140/RG.2.2.34583.24485).
@WordPress: -
2023 Article133 (JMTCM) Article
Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neutrosophic
Super Hyper Graphs And Super Hyper Graphs Alongside Applications in Cancer’s
Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47.
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf)
The links to PDF, its abstract, its citation and the volume are as follows.
PDF:https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-
and-cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a.pdf
Abstract:https://www.opastpublishers.com/peer-review/some-super-hyper-degrees-and-
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-
alongside-a-5009.html
Citation:https://www.opastpublishers.com/citation/some-super-hyper-degrees-and-cosuper-
hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs-alongside-a-
5009.html
Volume:https://www.opastpublishers.com/table-contents/jmtcm-volume-2-issue-1-year-2023
2023 132 Manuscript
Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and

(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023,
2023010396 (doi: 10.20944/preprints202301.0396.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0396/v1
@ZENODO_ORG:https://zenodo.org/record/7559540
2023 131 Manuscript

9986
Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic

SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1).
@WordPress: -
@PrePrints_ORG: https://www.preprints.org/manuscript/202301.0395/v1
2023 130 Manuscript
Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s

Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204).
@WordPress: -
2023 129 Manuscript
Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects In The
Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, ResearchGate
2023, (doi: 10.13140/RG.2.2.12818.73925).
@WordPress: -
2023 128 Manuscript
Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible

Neutrosophic SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic
SuperHyperGraph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960).
@WordPress: -
2023 127 Manuscript
Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s

Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate
2023,(doi: 10.13140/RG.2.2.36745.93289).
@WordPress: -
@ResearchGate:https://www.researchgate.net/publication/367336398
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
9987
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).
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).
9988
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”,
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
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
9989
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 Article105 (JMTCM) Article
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. (doi: 10.33140/JMTCM.01.03.09).
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).
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”,
9990
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).
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”,
9991
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 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04).
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
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
9992
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
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
9993
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).
2022 0068 | Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Manuscript
Neutrosophic Graphs
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
9994
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).
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).
9995
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
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).
9996
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).
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).
9997
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
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

9998
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).
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).
9999
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).
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).
10000
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).
10001
Publications: Books
2023 165 | Eulerian-Cycle-Cut In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[HG165b] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7854561).
@googlebooks:https://books.google.com/books/about?id=sC 6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=sC 6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Cycle-Cut-In-
SuperHyperGraphs/
@academia:https://www.academia.edu/100571830
@facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid029xYJouTtSjWQw4FwaCDMEgcSWh5WvnP3pfyiTkDS8TJpbDKKJTKHe5UiXRYUwxLGl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid=
pfbid0AN8aQ92UF62oKMQkXbjNk9uUGJbUPPr7KPeLbZno7NVb2dY37Bw6Js6VzuN7hd7Tl&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
PAGE @facebook : https://www.facebook.com/permalink.php?story_fbid
=pfbid0TRuHKgYpDZa6x1fvUsnNM9d5G7geLfniMbQswpM9dw4cmDrSq3zTzwhz1grRGT3vl&
id=105165509175944
=pfbid02kYx18Z6SHgkwgrCMbBtWPFNWknwshRtbuVfEMaqmwjuZEDZvuScszfEW9VREQtGAl&
id=100090667441909
pfbid02jxz6Wm1dQeQSGQX3PqTyzUveZnDf74FpYLsQETAj9gtFRPQrtaoickwAHhnGW31Jl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2SFNF5P
(Hardcover): https://www.amazon.com/dp/B0C2SD1ZP2
(Kindle Edition): https://www.amazon.com/dp/B0C38ZRRWP
ISBN
(Paperback): 9798392185535
(Hardcover): 9798392185559
(Kindle Edition): CC BY-NC-ND 4.0
Other Publishers: @googlebooks @GooglePlay @AmazonKindle
Available at @WordPress @ResearchGate @Scribd @academia @ZENODO_ORG @Twitter
@facebook @LinkedIn @Amazon @googlebooks @GooglePlay @AmazonKindle
2023 164 | Eulerian-Type-Path-Neighbor In SuperHyperGraphs Amazon

10002
[HG164b] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7851893).
@googlebooks:https://books.google.com/books/about?id=2si6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=2si6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Neighbor-In-SuperHyperGraphs/
=pfbid02oLuaPsj7DumHemiCyN4UGShNF55NsrLLxLb2CV71eswsmV2um5oNW4AMi3Hp5oWkl&
id=100090667441909
pfbid037CDfPAcaAZWwCgPXVzurLEJxrucoLB9i9x97TxuivuA2DVYbtuDxXAjZNhWFwsfal&
id=105165509175944
=pfbid02ac6oipwkoUNSh3BUPVYX8v1wVSpimkuBWfuRNobWzvrjRBa6Sf8z8Zj4SgwKVdxxl&
id=100090667441909
=pfbid0tW9HKAxeYoodoqdAY9H5HzvVJxxcd1rRij2BYBnSHcHMKiKMP8GaPjrkyF9AkZdTl&
id=105165509175944
=pfbid0Jx27AsDtqjGy5jJikBH7hLctakc6zhinzY2Ski83ugJjkdW66yLkaDe4aavuVWEfl&
id=100090667441909
pfbid0KnWV8rKq32uxKTyfLLvox9KyTKqLEnG2a6CAdNvy2RSohvwsWhcs8NnSBVevJwoFl&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S47JSK
(Hardcover): https://www.amazon.com/dp/B0C2S6B4LC
(Kindle Edition): https://www.amazon.com/dp/B0C37PMVMG
ISBN
(Paperback): 9798392080557
(Hardcover): 9798392080595
2023 163 | Eulerian-Type-Path-Decomposition In SuperHyperGraphs Amazon

10003
[HG163b] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019).
@googlebooks:https://books.google.com/books/about?id=Wo-6EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Wo-6EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-
Decomposition-In-SuperHyperGraphs/
=pfbid02dfEom5qzwQVmyHqwDg6ZFaSwZjcyDUUhP8HKi5ndxdZC3V57drPnL2aAR6s5N8xil&
id=100090667441909
pfbid02Pec8K2rzwUFqwXJs7QQKqVAXFdH1bsAWiKEaHY98jvroHYaTdk4kFtzhH7jzTJnTl&
id=105165509175944
=pfbid0hWnwqAgpjzRf4VjxGw1XMLYKfvrcrti7gou2BDYbMLLdrEBNVQdD3cNKduYxheBil&
id=100090667441909
=pfbid02AWRqicZsrFBzWJGb9PEucJHz3NTSSmQV7JmpUrBndvog8gwsPptxgAjFQzEAKmFml&
id=105165509175944
=pfbid0G3HjsGstqBG3aAWWHrkHYp1jqWLPB7VcoFvocW8tfE9uCH8mKk7szNSARKQ5SuJil&
id=100090667441909
pfbid0drhxRazVrHCzSsRowCtfUghXXqPTCtPgmu2qK2kZ4Hv26QNUcecA1FzKRpmGhyC1l&
id=105165509175944
(Paperback): https://www.amazon.com/dp/B0C2S3GFBC
(Hardcover): https://www.amazon.com/dp/B0C2RWP157
(Kindle Edition): https://www.amazon.com/dp/B0C33HB2F2
ISBN
(Paperback): 9798391955542
(Hardcover): 9798391955573
2023 162 | Eulerian-Type-Path-Cut In SuperHyperGraphs Amazon

10004
[HG162b] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7835063).
@googlebooks:https://books.google.com/books/about?id=hNq5EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hNq5EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/07/22/Eulerian-Type-Path-Cut-In-
SuperHyperGraphs/
=pfbid02QpCtXYV6EyMwdgWzZhwz7ucrMBUnrkNi8qY8GQAuAA7QVphvGRwc7VhgdmaPxXSSl&
id=100090667441909
pfbid02hWgTEoUV2V4fCjGJ9LXzz5qeMMWxrAkjCQtcYUH9eYapVsoR2LUu1E5qwa81kHZYl&
id=105165509175944
=pfbid0vyXwm6jEJHKZ4x74feiDHpNppxtF4CSK9Hv5G3gxsa3mpebkbnHmx37kfXuYjTD2l&
id=100090667441909
=pfbid02S2UberG9S2SDjRusSiyuhiN6EzxZgxoU8wBd1UXewdVhaPgFTb5ePAD3R7AiXG4l&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_link-isbn-activity
-7053710939254071297-e5rI?utm_source=share&utm_medium=member_desktop
=pfbid02w8pHq6yunC9qBnZhj7gyBVgDwgRZUaxMahmp7nE3cyDj9MgnP49Tm38RJYYX3wgYl&
id=100090667441909
pfbid02pJegzpHXtB51DZtURQKHmGoC2UN6kLGF2wtd3GmePX2bx3oetLvRwd34DXZbpFAl&
id=105165509175944
@LinkedIn : https://www.linkedin.com/posts/drhenrygarrett_hg162b-henry-garrett
-eulerian-type-path-cut-activity-7053711526511136768-dJZu?
utm_source=share
utm_medium=member_desktop
(Paperback): https://www.amazon.com/dp/B0C2PV14BR
(Hardcover): https://www.amazon.com/dp/B0C1J3B8ZL
(Kindle Edition): https://www.amazon.com/dp/B0C1J3HQ3X
ISBN
(Paperback): 9798391601487
(Hardcover): 9798391601456
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon

10005
[HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7826705).
@googlebooks:https://books.google.com/books/about?id=7165EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=7165EAAAQBAJ
@ResearchGate: https://www.researchgate.net/publication/7165EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1JGPMNW
(Hardcover): https://www.amazon.com/dp/B0C1JK3LLJ
(Kindle Edition): https://www.amazon.com/dp/B0C2FRDG48
ISBN
(Paperback): 9798391250159
(Hardcover): 9798391250234
2023 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=v624EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=v624EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-
(Paperback): https://www.amazon.com/dp/B0C1J2GSGV
(Hardcover): https://www.amazon.com/dp/B0C1J3J883
(Kindle Edition): https://www.amazon.com/dp/B0C285TBWX
ISBN
(Paperback): 9798391056140
(Hardcover): 9798391056164
2023 159 | Eulerian-Path-Cut In SuperHyperGraphs Amazon

10006
[HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7812750).
@googlebooks:https://books.google.com/books/about?id=kju4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=kju4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Eulerian-Path-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1MWPX
(Hardcover): https://www.amazon.com/dp/B0C1J3D9N8
(Kindle Edition): https://www.amazon.com/dp/B0C24LRF5P
ISBN
(Paperback): 9798390777978
(Hardcover): 9798390778005
2023 158 | Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs Amazon
[HG158b] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=CDW4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=CDW4EAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1J1XL69
(Hardcover): https://www.amazon.com/dp/B0C1JCTBCM
(Kindle Edition): https://www.amazon.com/dp/B0C1XWFPFS
ISBN
(Paperback): 9798390730676
(Hardcover): 9798390730690
2023 157 | Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs Amazon

10007
[HG157b] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Nhu4EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Nhu4EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JK83H9
(Hardcover): https://www.amazon.com/dp/B0C1J3J6GZ
(Kindle Edition): https://www.amazon.com/dp/B0C1VXHLYJ
ISBN
(Paperback): 9798390583968
(Hardcover): 9798390584002
2023 156 | Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs Amazon
[HG156b] Henry Garrett, “”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7807782).
@googlebooks:https://books.google.com/books/about?id=pu-3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=pu-3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Type-Cycle-
Cut-In-SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C1J1PBHJ
(Hardcover): https://www.amazon.com/dp/B0C1HVLC8V
(Kindle Edition): https://www.amazon.com/dp/B0C1SZJYH8
ISBN
(Paperback): 9798390476758
(Hardcover): 9798390476789
2023 155 | SuperHyperDuality Amazon

10008
[HG155b] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=u7u3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u7u3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C1JGKRC1
(Hardcover): https://www.amazon.com/dp/B0C1JK3J6K
(Kindle Edition): https://www.amazon.com/dp/B0C1SNGH8L
ISBN
(Paperback): 9798390457139
(Hardcover): 9798390460924
2023 154 | Hamiltonian-Cycle-Decomposition In SuperHyperGraphs Amazon
[HG154b] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr.
@googlebooks:https://books.google.com/books/about?id=Xy23EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Xy23EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-
(Paperback): https://www.amazon.com/dp/B0C123F3F3
(Hardcover): https://www.amazon.com/dp/B0C12773L1
(Kindle Edition): https://www.amazon.com/dp/B0C1BZYCGW
ISBN
(Paperback): 9798389932234
(Hardcover): 9798389932319

10009
[HG153b] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7792307).
@googlebooks:https://books.google.com/books/about?id=4By3EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=4By3EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cycle-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C12DH1TZ
(Hardcover): https://www.amazon.com/dp/B0C12JFJGM
(Kindle Edition): https://www.amazon.com/dp/B0C18V22Y2
ISBN
(Paperback): 9798389815193
(Hardcover): 9798389815209
2023 152 | Hamiltonian-Neighbor In SuperHyperGraphs Amazon
[HG152b] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7790728).
@googlebooks:https://books.google.com/books/about?id=hA63EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=hA63EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0C128T8FP
(Hardcover): https://www.amazon.com/dp/B0C12DHG8K
(Kindle Edition): https://www.amazon.com/dp/B0C16YJ5KL
ISBN
(Paperback): 9798389655539
(Hardcover): 9798389655638
2023 151 | Hamiltonian-Decomposition In SuperHyperGraphs Amazon

10010
[HG151b] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry
@googlebooks:https://books.google.com/books/about?id=84u2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=84u2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-
(Paperback): https://www.amazon.com/dp/B0C12D3JBS
(Hardcover): https://www.amazon.com/dp/B0C12D3K6P
(Kindle Edition): https://www.amazon.com/dp/B0C147QGJC
ISBN
(Paperback): 9798389394353
(Hardcover): 9798389394629
2023 150 | Hamiltonian-Cut In SuperHyperGraphs Amazon
[HG150b] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7783791).
@googlebooks:https://books.google.com/books/about?id=3Gy2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=3Gy2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Hamiltonian-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPJTY4
(Hardcover): https://www.amazon.com/dp/B0C12528LZ
(Kindle Edition): https://www.amazon.com/dp/B0BZYLS8NZ
ISBN
(Paperback): 9798389221505
(Hardcover): 9798389222076
2023 149 | Trace-Neighbor In SuperHyperGraphs Amazon

10011
[HG149b] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7780123).
@googlebooks:https://books.google.com/books/about?id=Tie2EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=Tie2EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPDKDF
(Hardcover): https://www.amazon.com/dp/B0BZFP49GT
(Kindle Edition): https://www.amazon.com/dp/B0BZVLWRSD
ISBN
(Paperback): 9798389040786
(Hardcover): 9798389040946
2023 148 | Trace-Decomposition In SuperHyperGraphs Amazon
[HG148b] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7773119).
@googlebooks:https://books.google.com/books/about?id=y8a1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=y8a1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZFPFVRT
(Hardcover): https://www.amazon.com/dp/B0BZFP491Q
(Kindle Edition): https://www.amazon.com/dp/B0BZP8555H
ISBN
(Paperback): 9798388702937
(Hardcover): 9798388702999

10012
[HG147b] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7637762).
@googlebooks:https://books.google.com/books/about?id=jLCtEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jLCtEAAAQBAJ
@WordPress: https://drhenrygar rett.wordpress.com/2023/02/14/superhyperduality
(Paperback): https://www.amazon.com/dp/B0BVPMX6C4
(Hardcover): https://www.amazon.com/dp/B0BVNTYX6M
(Kindle Edition): https://www.amazon.com/dp/-
ISBN
(Paperback): 9798377344674
(Hardcover): 9798377346043
(Kindle Edition): -
2023 146 | Trace-Cut In SuperHyperGraphs Amazon
[HG146b] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7766174).
@googlebooks:https://books.google.com/books/about?id=8oW1EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8oW1EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Trace-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZJ5ZL59
(Hardcover): https://www.amazon.com/dp/B0BZFJ46Q6
(Kindle Edition): https://www.amazon.com/dp/B0BZF75SF2
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388338693
2023 145 | Edge-Decomposition In SuperHyperGraphs Amazon

10013
[HG145b] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7762232).
@googlebooks:https://books.google.com/books/about?id=q021EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q021EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBY449B
(Hardcover): https://www.amazon.com/dp/B0BZFCBXYR
(Kindle Edition): https://www.amazon.com/dp/B0BZCP4DSW
ISBN
(Paperback): 9798388172235
(Hardcover): 9798388173157
2023 144 | Edge-Decomposition In SuperHyperGraphs Amazon
[HG144b] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7758601).
@googlebooks:https://books.google.com/books/about?id=5Pm0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5Pm0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZBGNQTR
(Hardcover): https://www.amazon.com/dp/B0BZ6SNCXJ
(Kindle Edition): https://www.amazon.com/dp/B0BZ7WZF48
ISBN
(Paperback): 9798388014078
(Hardcover): 9798388014962
2023 143 | Edge-Cut In SuperHyperGraphs Amazon

10014
[HG143b] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7754661).
@googlebooks:https://books.google.com/books/about?id=L u0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=L u0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BZ324MLT
(Hardcover): https://www.amazon.com/dp/B0BZ34DF21
(Kindle Edition): https://www.amazon.com/dp/B0BZ3Z9J8W
ISBN
(Paperback): 9798387863837
(Hardcover): 9798387865688
2023 142 | Vertex-Neighbor In SuperHyperGraphs Amazon
[HG142b] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7750995).
@googlebooks:https://books.google.com/books/about?id=5JO0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5JO0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR8YN3V
(Hardcover): https://www.amazon.com/dp/B0BYRL26L7
(Kindle Edition): https://www.amazon.com/dp/B0BYYW89VD
ISBN
(Paperback): 9798387725944
(Hardcover): 9798387727511
2023 141 | Vertex-Decomposition In SuperHyperGraphs Amazon

10015
[HG141b] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7749875).
@googlebooks:https://books.google.com/books/about?id=-oS0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=-oS0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR862GV
(Hardcover): https://www.amazon.com/dp/B0BYR7TZXZ
(Kindle Edition): https://www.amazon.com/dp/B0BYX3144B
ISBN
(Paperback): 9798387614910
(Hardcover): 9798387616792
2023 140 | Vertex-Cut In SuperHyperGraphs Amazon
[HG140b] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7747236).
@googlebooks:https://books.google.com/books/about?id=fmC0EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=fmC0EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRC9P2F
(Hardcover): https://www.amazon.com/dp/B0BYR7YKMC
(Kindle Edition): https://www.amazon.com/dp/B0BYX1HCTN
ISBN
(Paperback): 9798387610660
(Hardcover): 9798387611964
2023 139 | Stable-Neighbor In SuperHyperGraphs Amazon

10016
[HG139b] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7742587).
@googlebooks:https://books.google.com/books/about?id=5y60EAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=5y60EAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Neighbor-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR5PWBJ
(Hardcover): https://www.amazon.com/dp/B0BYRBV5KL
(Kindle Edition): https://www.amazon.com/dp/B0BYVK1CCH
ISBN
(Paperback): 9798387498947
(Hardcover): 9798387510786
2023 138 | Stable-Decompositions In SuperHyperGraphs Amazon
[HG138b] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7738635).
@googlebooks:https://books.google.com/books/about?id=q-CzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=q-CzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYR86GDV
(Hardcover): https://www.amazon.com/dp/B0BYR5GCRQ
(Kindle Edition): https://www.amazon.com/dp/B0BYVFCRJ3
ISBN
(Paperback): 9798387492839
(Hardcover): 9798387495489
2023 137 | Stable-Cut In SuperHyperGraphs Amazon

10017
[HG137b] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7734719).
@googlebooks:https://books.google.com/books/about?id=oKmzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=oKmzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Stable-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYRNDT1Z
(Hardcover): https://www.amazon.com/dp/B0BYR5GF4P
(Kindle Edition): https://www.amazon.com/dp/B0BYS8MJD6
ISBN
(Paperback): 9798387367335
(Hardcover): 9798387369513
2023 136 | Clique-Neighbors In SuperHyperGraphs Amazon
[HG136b] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7730484).
@googlebooks:https://books.google.com/books/about?id=NXyzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=NXyzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Neighbors-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM8JSFJ
(Hardcover): https://www.amazon.com/dp/B0BYLPSR1C
(Kindle Edition): https://www.amazon.com/dp/B0BYBQK51T
ISBN
(Paperback): 9798386938741
(Hardcover): 9798386938772
2023 135 | Clique-Decompositions In SuperHyperGraphs Amazon

10018
[HG135b] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7730469).
@googlebooks:https://books.google.com/books/about?id=D3yzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=D3yzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Decompositions-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYM1CV3S
(Hardcover): https://www.amazon.com/dp/B0BYLXRXTJ
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386938598
(Hardcover): 9798386938635
2023 134 | Clique-Cut In SuperHyperGraphs Amazon
[HG134b] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7722865).
@googlebooks:https://books.google.com/books/about?id=BEuzEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=BEuzEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Clique-Cut-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BYLPSHS5
(Hardcover): https://www.amazon.com/dp/B0BYM4QTKG
(Kindle Edition): https://www.amazon.com/dp/B0BY5R8ZGJ
ISBN
(Paperback): 9798386709860
(Hardcover): 9798386709891
2023 133 | Space In SuperHyperGraphs Amazon

10019
[HG133b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7713563).
@googlebooks:https://books.google.com/books/about?id=je-yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=je-yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/List-Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNPGDB5
(Hardcover): https://www.amazon.com/dp/B0BXNCSNBJ
(Kindle Edition): https://www.amazon.com/dp/B0BXYYCS5H
ISBN
(Paperback): 9798386468965
(Hardcover): 9798386469030
2023 0132 | Space In SuperHyperGraphs Amazon
[HG132b] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7709116).
@googlebooks:https://books.google.com/books/about?id=M56yEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=M56yEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Space-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 131 | Edge-Connectivity In SuperHyperGraphs Amazon

10020
[HG131b] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7706415).
@googlebooks:https://books.google.com/books/about?id=9XKyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=9XKyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Edge-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXNDNSNQ
(Hardcover): https://www.amazon.com/dp/B0BXN418BY
(Kindle Edition): https://www.amazon.com/dp/B0BXQTPCWV
ISBN
(Paperback): 9798386227593
(Hardcover): 9798386229306
2023 130 | Vertex-Connectivity In SuperHyperGraphs Amazon
[HG130b] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7706063).
@googlebooks:https://books.google.com/books/about?id=12myEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=12myEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Vertex-Connectivity-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN7F5VZ
(Hardcover): https://www.amazon.com/dp/B0BXN6NP8X
(Kindle Edition): https://www.amazon.com/dp/B0BXR1ZMKJ
ISBN
(Paperback): 9798386225056
(Hardcover): 9798386225872
2023 129 | Tree-Decomposition In SuperHyperGraphs Amazon

10021
[HG129b] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett,
2023 (doi: 10.5281/zenodo.7701906).
@googlebooks:https://books.google.com/books/about?id=FBmyEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=FBmyEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/04/22/Tree-Decomposition-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BXN4X4MD
(Hardcover): https://www.amazon.com/dp/B0BXNK5C1D
(Kindle Edition): https://www.amazon.com/dp/B0BXM1FT1M
ISBN
(Paperback): 9798386069155
(Hardcover): 9798386070076
2023 128 | Chord In SuperHyperGraphs Amazon
[HG128b] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7700205).
@googlebooks:https://books.google.com/books/about?id=mfSxEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=mfSxEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/Chord-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW3HR3CT
(Hardcover): https://www.amazon.com/dp/B0BW2KMGVJ
(Kindle Edition): https://www.amazon.com/dp/B0BXJYTWD3
ISBN
(Paperback): 9798385981755
(Hardcover): 9798385984046
2023 127 | (i,j)-Domination In SuperHyperGraphs Amazon

10022
[HG127b] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7694876).
@googlebooks:https://books.google.com/books/about?id=QoexEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=QoexEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/04/22/(i,j)-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2GWHR4
(Hardcover): https://www.amazon.com/dp/B0BW3HG682
(Kindle Edition): https://www.amazon.com/dp/B0BXDK4WLM
ISBN
(Paperback): 9798385701025
(Hardcover): 9798385701797
2023 0126 | Edge-Domination In SuperHyperGraphs Amazon
[HG126b] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7679410).
@googlebooks:https://books.google.com/books/about?id=PEiwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=PEiwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/28/Edge-Domination-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2QM56Q
(Hardcover): https://www.amazon.com/dp/B0BW3GJNWL
(Kindle Edition): https://www.amazon.com/dp/B0BWWXGLX6
ISBN
(Paperback): 9798379089597
(Hardcover): 9798379090531
2023 0125 | K-Domination In SuperHyperGraphs Amazon

10023
[HG125b] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7675982).
@googlebooks:https://books.google.com/books/about?id=WyKwEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=WyKwEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/27/K-Number-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW35YC1H
(Hardcover): https://www.amazon.com/dp/B0BW35YC1Z
(Kindle Edition): https://www.amazon.com/dp/B0BWT68375
ISBN
(Paperback): 9798378898794
(Hardcover): 9798378899913
2023 124 | K-Number In SuperHyperGraphs Amazon
[HG124b] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7672388).
@googlebooks:https://books.google.com/books/about?id=TtCvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TtCvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/K-Number-In-
SuperHyperGraphs/
@Scribd: https://www.scribd.com/document/- @ZENODO_ORG:
https://zenodo.org/record/7672388
(Paperback): https://www.amazon.com/dp/B0BW32LV1S
(Hardcover): https://www.amazon.com/dp/B0BW31GSZB
(Kindle Edition): https://www.amazon.com/dp/B0BWR36VFF
ISBN
(Paperback): 9798378775477
(Hardcover): 9798378776733
2023 123 | Order In SuperHyperGraphs Amazon

10024
[HG123b] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7668648).
@googlebooks:https://books.google.com/books/about?id=U56vEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=U56vEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/25/Order-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW2KJKJD
(Hardcover): https://www.amazon.com/dp/B0BW2BSXTG
(Kindle Edition): https://www.amazon.com/dp/B0BWMKNH7H
ISBN
(Paperback): 9798378647705
(Hardcover): 9798378648146
2023 122 | Coloring In SuperHyperGraphs Amazon
[HG122b] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7662810).
@googlebooks:https://books.google.com/books/about?id=jGavEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=jGavEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Coloring-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW28MKQP
(Hardcover): https://www.amazon.com/dp/B0BW35Y9YW
(Kindle Edition): https://www.amazon.com/dp/B0BWN81GT3
ISBN
(Paperback): 9798378499175
(Hardcover): 9798378499717
2023 121 || “Dimension In SuperHyperGraphs” Amazon

10025
[HG9121b] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7659162).
@googlebooks:https://books.google.com/books/about?id=nAOvEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=nAOvEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/22/Dimension-In-
SuperHyperGraphs/
(Paperback): https://www.amazon.com/dp/B0BW38DB6M
(Hardcover): https://www.amazon.com/dp/B0BW2KMB1J
(Kindle Edition): https://www.amazon.com/dp/B0BWCW6KJL
ISBN
(Paperback): 9798378343188
(Hardcover): 9798378343812
2023 120 || “Cancer In SuperHyperGraphs” Amazon
[HG120b] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653233).
@googlebooks:https://books.google.com/books/about?id=ZdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=ZdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/Cancer-in-
SuperHyperGraphs/
@Scribd:https://www.scribd.com/document/-
|| Cancer in SuperHyperGraphs
Link (Paperback): https://www.amazon.com/dp/B0BW3BK14G
(Hardcover): https://www.amazon.com/dp/B0BW2K9GPL (Kindle Edition):
https://www.amazon.com/dp/B0BW6JCNY1
ISBN (Paperback): 9798378064847 (Hardcover): 9798378065530 (Kindle Edition): CC BY-NC-
ND 4.0
2023 0119 || “SuperHyperWheel” Amazon

10026
[HG119b] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653204).
SuperHyperWheel
@googlebooks:https://books.google.com/books/about?id=S9muEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=S9muEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperWheel/
|| SuperHyperWheel
Link (Paperback): https://www.amazon.com/dp/B0BW2BX6X1
(Hardcover): https://www.amazon.com/dp/B0BW23H1M2 (Kindle Edition):
https://www.amazon.com/dp/B0BW6H5TVG
ND 4.0
2023 0118 || “SuperHyperMultipartite” Amazon
[HG118b] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653142).
SuperHyperMultipartite
@googlebooks:https://books.google.com/books/about?id=SdmuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=SdmuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperMultipartite/
|| SuperHyperMultipartite
Link (Paperback): https://www.amazon.com/dp/B0BW358WXN
(Hardcover): https://www.amazon.com/dp/B0BW2CR178 (Kindle Edition):
https://www.amazon.com/dp/B0BW6FTXNH
ND 4.0
2023 0117 || “SuperHyperBipartite” Amazon

10027
[HG117b] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653117).
SuperHyperBipartite
@googlebooks:https://books.google.com/books/about?id=s9iuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=s9iuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperBipartite/
|| SuperHyperBipartite
Link (Paperback): https://www.amazon.com/dp/B0BW267JRF
(Hardcover): https://www.amazon.com/dp/B0BW2ZSL9D (Kindle Edition):
https://www.amazon.com/dp/B0BW6G294W
ND 4.0
2023 0116 || “SuperHyperStar” Amazon
[HG116b] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7653089).
SuperHyperStar
@googlebooks:https://books.google.com/books/about?id=8deuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=8deuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/19/SuperHyperStar/
|| SuperHyperStar
Link (Paperback): https://www.amazon.com/dp/B0BW2XKM25
(Hardcover): https://www.amazon.com/dp/B0BW2RKDDX (Kindle Edition):
https://www.amazon.com/dp/B0BW6CTTXM
ND 4.0
2023 0115 || “SuperHyperCycle” Amazon

10028
[HG115b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651687).
SuperHyperCycle
@googlebooks:https://books.google.com/books/about?id=u8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=u8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperCycle/
|| SuperHyperCycle
Link (Paperback): https://www.amazon.com/dp/B0BW2XKLRW
(Hardcover): https://www.amazon.com/dp/B0BW2R9SSF (Kindle Edition):
https://www.amazon.com/dp/B0BW5G2J68
ND 4.0
2023 0114 || “SuperHyperPath” Amazon
[HG114b] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651619).
SuperHyperPath
@googlebooks:https://books.google.com/books/about?id=t8SuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=t8SuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperPath/
|| SuperHyperPath
Link (Paperback): https://www.amazon.com/dp/B0BW2B6DPZ
(Hardcover): https://www.amazon.com/dp/B0BW2B6DP3 (Kindle Edition):
https://www.amazon.com/dp/B0BW5D6T17
ND 4.0
2023 0113 || “SuperHyperDomination” Amazon

10029
[HG113b] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7651439).
SuperHyperDomination
@googlebooks:https://books.google.com/books/about?id=scSuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=scSuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDomination/
|| SuperHyperDomination
Link (Paperback): https://www.amazon.com/dp/B0BW2R9STC
(Hardcover): https://www.amazon.com/dp/B0BW3BJZRF (Kindle Edition):
https://www.amazon.com/dp/B0BW5FPZC8
ND 4.0
2023 0112 || “SuperHyperDominating” Amazon
[HG112b] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7650729).
SuperHyperDominating
@googlebooks:https://books.google.com/books/about?id=17uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=17uuEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/18/SuperHyperDominating/
|| SuperHyperDominating
Link (Paperback): https://www.amazon.com/dp/B0BW2K99NB (Hardcover):
https://www.amazon.com/dp/B0BW2PWT1G (Kindle Edition):
https://www.amazon.com/dp/B0BW4SFRXP
ISBN (Paperback): 9798377922339 (Hardcover): 9798377923053 (Kindle Edition): CC BY-
NC-ND 4.0
2023 0111 || “SuperHyperConnected” Amazon

10030
[HG111b] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647868).
SuperHyperConnected
@googlebooks:https://books.google.com/books/about?id=AmquEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=AmquEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/02/17/SuperHyperConnected/
|| SuperHyperConnected
Link (Paperback): https://www.amazon.com/dp/B0BW2LMPN5
(Hardcover): https://www.amazon.com/dp/B0BW358DDG (Kindle Edition):
https://www.amazon.com/dp/B0BW2ZBHG7
ND 4.0
2023 0110 || “SuperHyperTotal” Amazon
[HG110b] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7647017).
SuperHyperTotal
@googlebooks:https://books.google.com/books/about?id=81uuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=81uuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/17/superhypertotal/
|| SuperHyperTotal
Link (Paperback): https://www.amazon.com/dp/B0BW35VNQS
(Hardcover): https://www.amazon.com/dp/B0BW2CQZJZ (Kindle Edition):
https://www.amazon.com/dp/B0BW1TZTPX
ND 4.0
2023 0109 || “SuperHyperPerfect” Amazon

10031
[HG109b] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7644894).
SuperHyperPerfect
@googlebooks:https://books.google.com/books/about?id=JymuEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=JymuEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/16/SuperHyperPerfect/
|| SuperHyperPerfect
Link (Paperback): https://www.amazon.com/dp/B0BVSXB7TC
(Hardcover): https://www.amazon.com/dp/B0BVT8FRC2 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6CGKZ
ND 4.0
2023 0108 || “SuperHyperJoin” Amazon
[HG108b] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7641880).
SuperHyperJoin
@googlebooks:https://books.google.com/books/about?id=TeStEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=TeStEAAAQBAJ
@WordPress: https://drhenrygarrett.wordpress.com/2023/02/15/superhyperjoin/
|| SuperHyperJoin
Link (Paperback): https://www.amazon.com/dp/B0BVT7HJ1K
(Hardcover): https://www.amazon.com/dp/B0BVSXX9W5 (Kindle Edition):
https://www.amazon.com/dp/B0BVY6P9KC
ND 4.0
2023 0107 || “Path SuperHyperColoring” Amazon
[HG107b] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7632923).
|| Path SuperHyperColoring
@googlebooks: https://books.google.com/books/about?id=o3ytEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=o3ytEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BVDRFXXF (Hardcover):
https://www.amazon.com/dp/B0BVDMJ5MJ (Kindle Edition):
ND 4.0
10032
2023 0106 || “SuperHyperDensity” Amazon
[HG106b] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7623459).
|| SuperHyperDensity
Link (Paperback): https://www.amazon.com/dp/B0BV49Y61R (Hardcover):
https://www.amazon.com/dp/B0BV4DYQZL (Kindle Edition):
ND 4.0
@googlebooks: https://books.google.com/books/about?id=HdusEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=HdusEAAAQBAJ
2023 0105 || “Neutrosophic SuperHyperConnectivities” Amazon
[HG105b] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023.
Link (Paperback): https://www.amazon.com/dp/B0BTXCX57J (Hardcover):

https://www.amazon.com/dp/B0BTRXKGTX (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=YeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=YeurEAAAQBAJ
2023 Book 104 || “Extreme SuperHyperConnectivities” Amazon
[HG104b] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606416).
Link (Paperback): https://www.amazon.com/dp/B0BTRYB2S4 (Hardcover):

https://www.amazon.com/dp/B0BTT6VT96 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=X-urEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=X-urEAAAQBAJ
2023 Book 103 || “SuperHyperConnectivities” Amazon

10033
[HG103b] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7606404).
CC BY-NC-ND 4.0
@googlebooks:https://books.google.com/books/about?id=UeurEAAAQBAJ
@GooglePlay:https://play.google.com/store/books/details?id=UeurEAAAQBAJ
2023 Book 102 || “Neutrosophic SuperHyperCycle” Amazon
[HG102b] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT6ZXQ8V (Hardcover):

https://www.amazon.com/dp/B0BT7DZTBW (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=OCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=OCeqEAAAQBAJ
@WordPress: -
2023 Book 101 || “Extreme SuperHyperCycle” Amazon
[HG101b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=MCeqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=MCeqEAAAQBAJ
@WordPress: -
2023 Book 100 || “Extreme SuperHyperCycle” Amazon
[HG100b] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7580018).
Link (Paperback): https://www.amazon.com/dp/B0BT7HS2CD (Hardcover):

https://www.amazon.com/dp/B0BT75DHQ2 (Kindle Edition):
ND 4.0
2023 Book 99 || “SuperHyperCycle” Amazon

10034
[HG99b] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7579929).
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=LieqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=LieqEAAAQBAJ
@WordPress: -
2023 0098 | Neutrosophic SuperHyperGirth Amazon
[HG98b] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563170).
https://amazon.com/dp/B0BSV66BWV
https://amazon.com/dp/B0BSV7CZH4
9798374731323
9798374736922
CC BY-NC-ND 4.0
@googlebooks: http://books.google.com/books/about?id=yL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yL-qEAAAQBAJ
@WordPress: -
@Scribd: -
2023 0097 | Extreme SuperHyperGirth Amazon
[HG97b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563164).
https://www.amazon.com/dp/B0BSJPZV9J
https://www.amazon.com/dp/B0BSJPYVWJ
9798374731309
9798374736915
CC BY-NC-ND 4.0
@WordPress: -
@ResearchGate: https://www.researchgate.net/publication/367351526E xtremeS uperHyperGirth
@Scribd: -
2023 0096 | “SuperHyperGirth” Amazon

10035
[HG96b] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
https://www.amazon.com/dp/B0BSLKY69Q
https://www.amazon.com/dp/B0BT3S4ZP5
9798374731361
9798374736854
CC BY-NC-ND 4.0
@WordPress: -
2023 0095 | “Extreme SuperHyperGirth” Amazon
[HG95b] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=vL-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vL-qEAAAQBAJ
2023 0094 | “Overlook On SuperHyperGirth” Amazon
[HG94b] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7563160).
@googlebooks: http://books.google.com/books/about?id=rr-qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=rr-qEAAAQBAJ
2023 0093 | “Neutrosophic SuperHyperMatching” Amazon
[HG93b] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557063).
@googlebooks: http://books.google.com/books/about?id=6bmqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=6bmqEAAAQBAJ
https://www.amazon.com/dp/B0BSJPZT7B https://www.amazon.com/dp/B0BSR4XZH5
9798374564273 9798374564792 CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0092 | “Extreme SuperHyperMatching” Amazon

10036
[HG92b] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7557009).
@googlebooks: http://books.google.com/books/about?id=47mqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=47mqEAAAQBAJ
https://www.amazon.com/dp/B0BSJDJSN7
https://www.amazon.com/dp/B0BSLKWW3F
9798374564266
9798374564785
CC BY-NC-ND 4.0
@Scribd: -
@WordPress: -
2023 0091 | “Overlook On SuperHyperMatching” Amazon
[HG91b] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: http://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
2023 0090 | “Neutrosophic Failed SuperHyperClique” Amazon
[HG90b] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=h7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=h7qqEAAAQBAJ
2023 0089 | “Extreme Failed SuperHyperClique” Amazon
[HG89b] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=gbqqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gbqqEAAAQBAJ
2023 0088 | “Overlook On Failed SuperHyperClique” Amazon
[HG88b] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7523390).
@googlebooks: http://books.google.com/books/about?id=e7qqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=e7qqEAAAQBAJ
2023 0087 | “Extreme SuperHyperClique” Amazon

10037
[HG87b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574952).
Link (Paperback): https://www.amazon.com/dp/B0BT6WSZLD (Hardcover):

https://www.amazon.com/dp/B0BT743MW2 (Kindle Edition): ISBN (Paperback):
9798375140049 (Hardcover): 9798375141510 (Kindle Edition): CC BY-NC-ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=52 pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
@WordPress: -
2023 0086 | “Neutrosophic SuperHyperClique” Amazon
[HG86b] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7574992).
@googlebooks: http://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
Link (Paperback): https://www.amazon.com/dp/B0BT6RD41C (Hardcover):
https://www.amazon.com/dp/B0BT733BB2 (Kindle Edition):
ND 4.0
CC BY-NC-ND 4.0
@googlebooks: https://books.google.com/books/about?id=7f2pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=7f2pEAAAQBAJ
@WordPress: -
2023 0085 | “Extreme SuperHyperClique” Amazon
[HG85b] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=52 pEAAAQBAJ

@GooglePlay: https://play.google.com/store/books/details?id=52 pEAAAQBAJ
2023 0084 | “Overlook On SuperHyperClique” Amazon
[HG84b] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
@googlebooks: http://books.google.com/books/about?id=Cf6pEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Cf6pEAAAQBAJ
10038
2023 0083 | “Neutrosophic Failed SuperHyperStable” Amazon
[HG83b] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=cLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cLuqEAAAQBAJ
2023 0082 | “Extreme Failed SuperHyperStable” Amazon
[HG82b] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=aruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=aruqEAAAQBAJ
2023 0081 | “Overlook On Failed SuperHyperStable” Amazon
[HG81b] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7504782).
@googlebooks: http://books.google.com/books/about?id=YruqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=YruqEAAAQBAJ
2023 0080 | “Neutrosophic SuperHyperStable” Amazon
[HG80b] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=gLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=gLyqEAAAQBAJ
2023 0079 | “Extreme SuperHyperStable” Amazon
[HG79b] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=CryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=CryqEAAAQBAJ
2023 0078 | “Overlook On SuperHyperStable” Amazon
[HG78b] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
@googlebooks: http://books.google.com/books/about?id=hLuqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=hLuqEAAAQBAJ
2023 0077 | Neutrosophic Failed SuperHyperForcing Amazon

10039
“Neutrosophic Failed SuperHyperForcing”
[HG77b] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023
(doi: 10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=yLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=yLyqEAAAQBAJ
2023 0076 | Extreme Failed SuperHyperForcing Amazon
[HG76b] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
“Extreme Failed SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=wLyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=wLyqEAAAQBAJ
2023 0075 | Neutrosophic SuperHyperForcing Amazon
[HG75b] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Neutrosophic SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=5LyqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=5LyqEAAAQBAJ
2023 0074 | Extreme SuperHyperForcing Amazon
[HG74b] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Extreme SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=3ryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=3ryqEAAAQBAJ
2023 0073 | Overlook On SuperHyperForcing Amazon
[HG73b] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
“Overlook On SuperHyperForcing”
@googlebooks: http://books.google.com/books/about?id=zryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=zryqEAAAQBAJ
2023 0072 | Neutrosophic SuperHyperAlliances Amazon

10040
[HG72b] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Neutrosophic SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=cr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=cr2qEAAAQBAJ
2023 0071 | Extreme SuperHyperAlliances Amazon
[HG71b] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Extreme SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=ZL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=ZL2qEAAAQBAJ
2023 0070 | Overlook On SuperHyperAlliances Amazon
[HG70b] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
“Overlook On SuperHyperAlliances”
@googlebooks: http://books.google.com/books/about?id=Sr2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=Sr2qEAAAQBAJ
2023 0069 | SuperHyperMatching Amazon
[HG69b] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7539484).
@googlebooks: https://books.google.com/books/about?id=kC-oEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=kC-oEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/16/superhypermatching-
published-version/
Link
(Paperback): https://www.amazon.com/dp/B0BSDPXX1P
(Hardcover): https://www.amazon.com/dp/B0BSDC1L66
(Kindle Edition):
ISBN
(Paperback): 9798373872683
(Hardcover): 9798373875424
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
10041
2023 0068 | Failed SuperHyperClique Amazon
[HG68b] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523390).
https://www.amazon.com/dp/B0BRZ67NYN
https://www.amazon.com/dp/B0BRYZTK24
9798373274227
9798373277273
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/11/failed-superhyperclique-
published-version
ASIN : B0BRZ67NYN Publisher : Independently published (January 10, 2023) Language
ASIN : B0BRYZTK24 Publisher : Independently published (January 10, 2023) Language
: English Hardcover : 460 pages ISBN-13 : 979-8373277273 Item Weight : 2.78 pounds
2023 0067 | SuperHyperClique Amazon
[HG67b] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7523357).
https://www.amazon.com/dp/B0BRWK4S1Y
https://www.amazon.com/dp/B0BRM24YJX
9798373040471
9798373041935
@ZENODOO RG : zenodo.org/record/7523357
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/10/superhyperclique-published-
version-2/
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

10042
[HG66b] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7504782).
https://www.amazon.com/dp/B0BRNG7DC8
https://www.amazon.com/dp/B0BRLVN39L
9798372597976
9798372599765
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/06/failed-superhyperstable-
published-version/
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
[HG65b] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7499395).
https://www.amazon.com/dp/B0BRDG5Z4Y
https://www.amazon.com/dp/B0BRJPG56M
9798372248519
9798372252011
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/03/superhyperstable-published-
version/
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

10043
[HG64b] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7497450).
@googlebooks: http://books.google.com/books/about?id=vryqEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=vryqEAAAQBAJ
https://www.amazon.com/dp/B0BRH5B4QM
https://www.amazon.com/dp/B0BRGX4DBJ
9798372123649
9798372124509
@WordPress:https://drhenrygarrett.wordpress.com/2023/01/01/failed-superhyperforcing-
published-version/
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
[HG63b] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7494862).
ASIN : B0BRDG1KN1 Publisher : Independently published (December 30, 2022) Language

ASIN : B0BRDFFQMF Publisher : Independently published (December 30, 2022) Language :
: 8.25 x 0.86 x 11 inches
https://www.amazon.com/dp/B0BRDG1KN1 https://www.amazon.com/dp/B0BRDFFQMF
9798371873347 9798371874092
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/30/superhyperforcing-
published-versian/
2022 0062 | SuperHyperAlliances Amazon

10044
[HG62b] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7493845).
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
https://www.amazon.com/dp/B0BR6YC3HG https://www.amazon.com/dp/B0BR7CBTC6
9798371488343 9798371494849
@WordPress:https://drhenrygarrett.wordpress.com/2022/12/28/superhyperalliances-
published-version/
2022 0061 | SuperHyperGraphs Amazon
[HG61b] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7480110).
@googlebooks: http://books.google.com/books/about?id=iL2qEAAAQBAJ
@GooglePlay: https://play.google.com/store/books/details?id=iL2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wor
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
Link (Paperback): https://www.amazon.com/dp/B0BR1NHY4Z (Hardcover):
https://www.amazon.com/dp/B0BQXTHTXY (Kindle Edition):
ND 4.0
2022 0060 | Neut. SuperHyperEdges Amazon

10045
[HG60b] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.7378758).
@GooglePlay: https://play.google.com/store/books/details?id=rr2qEAAAQBAJ
@WordPress:https://drhenrygarrett.wordpress.com/2022/11/29/neut-superhyperedges-
published-version/
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
Link (Paperback): https://www.amazon.com/dp/B0BNH11ZDY (Hardcover):
https://www.amazon.com/dp/B0BNGZGPP6
ND 4.0
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

10046
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

10047
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
[HG44b] H. Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6677173).
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
10048
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
10049
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
[HG32b] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi:
10.5281/zenodo.6320305).
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

10050
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

10051
ASIN : B09M554XCL Publisher : Independently published (November 20, 2021) Language :

: 8.5 x 0.12 x 11 inches
-
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
-
10052
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
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

10053
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

10054
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
10055
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
10056
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
A uthorHenryGarrett
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

10057
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
10058
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
...
10059
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=SUjFCmcAAAAJview_op=list_workssortby=pubdate
-LinkedIn: https://www.linkedin.com/in/drhenrygarrett/
10060
Certificate of Reviewer
Reference: AJCST Date: December 11, 2022
The certificate is awarded to
Henry Garrett, Department of Mathematics, City University of New York, New York, United States
In recognition of the appointment as a Reviewer of American Journal of Computer Science and Technology(AJCST)
ISSN Print: 2640-0111; ISSN Online: 2640-012X
https://www.sciencepg.com/j/ajcst
from December 11, 2022 to December 11, 2024
10061
10062
10063
Henry Garrett
01/23/2022
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
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
10117

Unequal Dimension Dominating in SuperHyperGraphs

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

Unequal Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Unequal Dimension

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 49

5 Extreme Unequal Dimension Dominating 53

6 New Ideas On Super Dimity By Hyper Dimple Of Unequal Dimension

8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

10 Extreme SuperHyperUnequal Dimension Dominating But As The Extensions

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 143

14 Case 1: The Initial Extreme Steps Toward Extreme SuperHyperBipart-

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

16 Wondering Open Problems But As The Directions To Forming The

17 Conclusion and Closing Remarks 151

18 Extreme SuperHyperDuality But As The Extensions Excerpt From

19 Extreme SuperHyperJoin But As The Extensions Excerpt From Dense

20 Extreme SuperHyperPerfect But As The Extensions Excerpt From

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

22 Extreme SuperHyperConnected But As The Extensions Excerpt From

24 Cancer In Neutrosophic SuperHyperGraph 255

25 Neutrosophic Unequal Dimension Dominating 259

26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

28 Applied Notions Under The Scrutiny Of The Motivation Of This

Henry Garrett · Independent Researcher · Department of Mathematics ·

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

30 Neutrosophic SuperHyperUnequal Dimension Dominating But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 353

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

35 Case 2: The Increasing Neutrosophic Steps Toward Neutrosophic

36 Wondering Open Problems But As The Directions To Forming The

37 Conclusion and Closing Remarks 361

38 Neutrosophic SuperHyperDuality But As The Extensions Excerpt From

39 Neutrosophic SuperHyperJoin But As The Extensions Excerpt From

40 Neutrosophic SuperHyperPerfect But As The Extensions Excerpt From

41 Neutrosophic SuperHyperTotal But As The Extensions Excerpt From

42 Neutrosophic SuperHyperConnected But As The Extensions Excerpt

44 Books’ Contributions 465

45 “SuperHyperGraph-Based Books”: | Featured Tweets 477

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

11.1 an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.7 [HG187b] Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”.

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 478

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 . . . . . . . . . . . . . . . . . . . . . 152