Reverse Strict Dimension Dominating in SuperHyperGraphs

Reverse Strict 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 Reverse Strict Dimension Dominating 53
6 New Ideas On Super Dimity By Hyper Dimple Of Reverse Strict

Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph 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 SuperHyperReverse Strict Dimension Dominating But As The Exten-

sions 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 257
25 Neutrosophic Reverse Strict Dimension Dominating 261
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

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

Scientific Research 271

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 275
30 Neutrosophic SuperHyperReverse Strict Dimension Dominating But As The

Extensions Excerpt From Dense And Super Forms 287
31 The Neutrosophic Departures on The Theoretical Results Toward

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

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

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

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

Motivations 361
37 Conclusion and Closing Remarks 363
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 421
43 Background 435
Bibliography 441
44 Books’ Contributions 469
45 “SuperHyperGraph-Based Books”: | Featured Tweets 481
46 CV 509

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

SuperHyperReverse Strict 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-

perReverse Strict Dimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . 122
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Strict Dimension Dominating in the Example (42.0.11) . . . . . 127
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperReverse Strict Dimension Dominating in the Example (42.0.13) . . . . . . . . . . 129
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Strict Dimension Dominating in the Extreme Example (42.0.15) 130
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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

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

Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 293
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296


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


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

31.2 a Neutrosophic SuperHyperCycle Associated to the Neutrosophic Notions of
(42.0.7) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334
31.3 a Neutrosophic SuperHyperStar Associated to the Neutrosophic Notions of
(42.0.9) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335
31.4 Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic
Notions of Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Example
(42.0.11) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337
31.5 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic
31.6 a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic No-
tions of Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic
Example (42.0.15) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341
34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG296] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of
Reverse Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8092766). . . . . . . . . . 470
44.4 [HG297] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Strict Dimension Dominating As Hyper Dimple On
Super Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8092796). . . . . . . . . . . . . 472

44.7 [HG188b] Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyper-
Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8092816). . . . . . . . . . 477
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 482

45.2 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 483
45.3 “SuperHyperGraph-Based Books”: | Featured Tweets #69 . . . . . . . . . . . . . . 484
45.10“SuperHyperGraph-Based Books”: | Featured Tweets #67 . . . . . . . . . . . . . . 490

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) 285

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 358

Belong to The Neutrosophic SuperHyperMultipartite . . . . . . . . . . . . . . . . . 360
37.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 364
xi
CHAPTER 1
ABSTRACT
In this scientific research book, there are some scientific research chapters on “Extreme 1
Reverse Strict Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Reverse 2
Strict Dimension Dominating In SuperHyperGraphs” about some scientific research on Reverse 3

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

understandable. 10
11
In the some chapters, in some researches, new setting is introduced for new SuperHy- 12
perNotions, namely, a Reverse Strict Dimension Dominating In SuperHyperGraphs and 13
Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs . Two different 14
types of SuperHyperDefinitions are debut for them but the scientific research goes further 15
and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are 16
well-defined and well-reviewed. The literature review is implemented in the whole of this research. 17
For shining the elegancy and the significancy of this research, the comparison between this 18
SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are 19
featured. The definitions are followed by the examples and the instances thus the clarifications 20
are driven with different tools. The applications are figured out to make sense about the 21
theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the under scientific 22
research to figure out the challenges make sense about ongoing and upcoming research. The 23
special case is up. The cells are viewed in the deemed ways. There are different types of 24
them. Some of them are individuals and some of them are well-modeled by the group of 25
cells. These types are all officially called “SuperHyperVertex” but the relations amid them all 26
officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic 27

SuperHyperGraph” are chosen and elected to scientific research about “Cancer’s Recognition”. 28
Thus these complex and dense SuperHyperModels open up some avenues to scientific research 29
on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 30
research. It’s also officially collected in the form of some questions and some problems. Assume 31
a SuperHyperGraph. Then δ−Reverse Strict Dimension Dominating In SuperHyperGraphs 32
is a maximal of SuperHyperVertices with a maximum cardinality such that either of the 33
1
following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : 34

there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 35
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S is 36
an δ−SuperHyperDefensive; a Neutrosophic δ−Reverse Strict Dimension Dominating In Super- 37
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 38
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 39
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 40
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 41
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 42
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Reverse Strict 43
Dimension Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 44
make a Reverse Strict Dimension Dominating In SuperHyperGraphs more understandable. For 45
the sake of having Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs, 46

there’s a need to “redefine” the notion of a “Reverse Strict Dimension Dominating In SuperHy- 47
perGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 48
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 49
to assign to the values. Assume a Reverse Strict Dimension Dominating In SuperHyperGraphs 50
. It’s redefined a Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs 51
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 52
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the 53
key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 54
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 55
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 56
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 57
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 58
of SuperHyperGraph based on a Reverse Strict Dimension Dominating In SuperHyperGraphs 59
. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 60
of SuperHyperClass. If there’s a need to have all Reverse Strict Dimension Dominating In 61
SuperHyperGraphs until the Reverse Strict Dimension Dominating In SuperHyperGraphs, 62
then it’s officially called a “Reverse Strict Dimension Dominating In SuperHyperGraphs” but 63
otherwise, it isn’t a Reverse Strict Dimension Dominating In SuperHyperGraphs . There are 64

some instances about the clarifications for the main definition titled a “Reverse Strict Dimension 65
Dominating In SuperHyperGraphs ”. These two examples get more scrutiny and discernment 66
since there are characterized in the disciplinary ways of the SuperHyperClass based on a Reverse 67
Strict Dimension Dominating In SuperHyperGraphs . For the sake of having a Neutrosophic 68
Reverse Strict Dimension Dominating In SuperHyperGraphs, there’s a need to “redefine” 69

the notion of a “Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs” 70
and a “Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs ”. The 71
SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 72
alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. 73
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if 74
the intended Table holds. And a Reverse Strict Dimension Dominating In SuperHyperGraphs 75
are redefined to a “Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs” 76
if the intended Table holds. It’s useful to define “Neutrosophic” version of SuperHyperClasses. 77
Since there’s more ways to get Neutrosophic type-results to make a Neutrosophic Reverse Strict 78
Dimension Dominating In SuperHyperGraphs more understandable. Assume a Neutrosophic 79

SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table 80

holds. Thus SuperHyperPath, Reverse Strict Dimension Dominating In SuperHyperGraphs, 81
SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are 82
“Neutrosophic SuperHyperPath”, “Neutrosophic Reverse Strict Dimension Dominating In 83
SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 84
“Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended 85
Table holds. A SuperHyperGraph has a “Neutrosophic Reverse Strict Dimension Dominating 86

In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value from all the 87
Reverse Strict Dimension Dominating In SuperHyperGraphs amid the maximum value amid 88
all SuperHyperVertices from a Reverse Strict Dimension Dominating In SuperHyperGraphs .] 89
Reverse Strict Dimension Dominating In SuperHyperGraphs . A graph is a SuperHyperUniform 90
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 91
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 92

SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 93
with two exceptions; it’s Reverse Strict Dimension Dominating In SuperHyperGraphs if it’s only 94
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only 95
one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only 96
one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 97
forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s 98
only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, 99
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 100
only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex 101
has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes 102
the specific designs and the specific architectures. The SuperHyperModel is officially called 103
“SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The 104

“specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” 105
and the common and intended properties between “specific” cells and “specific group” of cells 106
are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of 107
determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this 108
case the SuperHyperModel is called “Neutrosophic”. In the future research, the foundation will 109
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 110
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 111
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 112
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 113
identified since there are some determinacy, indeterminacy and neutrality about the moves 114
and the effects of the cancer on that region; this event leads us to choose another model [it’s 115
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 116
and what’s done. There are some specific models, which are well-known and they’ve got the 117
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 118
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 119
Neutrosophic SuperHyperPath(-/Reverse Strict Dimension Dominating In SuperHyperGraphs, 120
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim 121

is to find either the longest Reverse Strict Dimension Dominating In SuperHyperGraphs or the 122
strongest Reverse Strict Dimension Dominating In SuperHyperGraphs in those Neutrosophic 123
SuperHyperModels. For the longest Reverse Strict Dimension Dominating In SuperHyper- 124
Graphs, called Reverse Strict Dimension Dominating In SuperHyperGraphs, and the strongest 125

Reverse Strict Dimension Dominating In SuperHyperGraphs, called Neutrosophic Reverse Strict 126
Dimension Dominating In SuperHyperGraphs, some general results are introduced. Beyond 127
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 128
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 129
Reverse Strict Dimension Dominating In SuperHyperGraphs. There isn’t any formation of any 130
Reverse Strict Dimension Dominating In SuperHyperGraphs but literarily, it’s the deformation 131
of any Reverse Strict Dimension Dominating In SuperHyperGraphs. It, literarily, deforms 132
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 133
SuperHyperGraph theory are proposed. 134
Keywords: SuperHyperGraph, (Neutrosophic) Reverse Strict Dimension Dominating In 135
SuperHyperGraphs, Cancer’s Recognition 136

AMS Subject Classification: 05C17, 05C22, 05E45 137
138
In the some chapters, in some researches, new setting is introduced for new SuperHyper- 139
Notion, namely, Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs . 140

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

SuperHyperGraphs” is a maximal Neutrosophic Reverse Strict Dimension Dominating In Supe- 165
rHyperGraphs of SuperHyperVertices with maximum Neutrosophic cardinality such that either 166
of the following expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 167
of s ∈ S : |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ, |S ∩ N (s)|N eutrosophic < 168
|S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a “Neutrosophic 169
δ−SuperHyperOffensive”. And the second Expression, holds if S is a “Neutrosophic 170

δ−SuperHyperDefensive”. It’s useful to define “Neutrosophic” version of Reverse Strict 171

Dimension Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to 172
make Reverse Strict Dimension Dominating In SuperHyperGraphs more understandable. For 173
the sake of having Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs, 174
there’s a need to “redefine” the notion of “Reverse Strict Dimension Dominating In SuperHy- 175
perGraphs ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels 176
from the letters of the alphabets. In this procedure, there’s the usage of the position of labels 177
to assign to the values. Assume a Reverse Strict Dimension Dominating In SuperHyperGraphs 178
. It’s redefined Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs 179
if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, 180
HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the 181
key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values 182
of The SuperVertices&The maximum Values of Its Vertices”, “The Values of The Edges&The 183
maximum Values of Its Vertices”, “The Values of The HyperEdges&The maximum Values of 184
Its Vertices”, “The Values of The SuperHyperEdges&The maximum Values of Its Endpoints”. 185
To get structural examples and instances, I’m going to introduce the next SuperHyperClass 186
of SuperHyperGraph based on Reverse Strict Dimension Dominating In SuperHyperGraphs 187
. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind 188
of SuperHyperClass. If there’s a need to have all Reverse Strict Dimension Dominating In 189
SuperHyperGraphs until the Reverse Strict Dimension Dominating In SuperHyperGraphs, then 190
it’s officially called “Reverse Strict Dimension Dominating In SuperHyperGraphs” but otherwise, 191
it isn’t Reverse Strict Dimension Dominating In SuperHyperGraphs . There are some instances 192
about the clarifications for the main definition titled “Reverse Strict Dimension Dominating 193
In SuperHyperGraphs ”. These two examples get more scrutiny and discernment since there 194
are characterized in the disciplinary ways of the SuperHyperClass based on Reverse Strict 195
Dimension Dominating In SuperHyperGraphs . For the sake of having Neutrosophic Reverse 196
Strict Dimension Dominating In SuperHyperGraphs, there’s a need to “redefine” the notion of 197
“Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs” and “Neutrosophic 198
Reverse Strict Dimension Dominating In SuperHyperGraphs ”. The SuperHyperVertices and the 199
SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 200
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 201
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. 202
And Reverse Strict Dimension Dominating In SuperHyperGraphs are redefined “Neutrosophic 203
Reverse Strict Dimension Dominating In SuperHyperGraphs” if the intended Table holds. It’s 204
useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways to 205
get Neutrosophic type-results to make Neutrosophic Reverse Strict Dimension Dominating In 206
SuperHyperGraphs more understandable. Assume a Neutrosophic SuperHyperGraph. There 207
are some Neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, 208
Reverse Strict Dimension Dominating In SuperHyperGraphs, SuperHyperStar, SuperHyperBi- 209
partite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, 210
“Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs”, “Neutrosophic 211
SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPart- 212

ite”, and “Neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph 213
has “Neutrosophic Reverse Strict Dimension Dominating In SuperHyperGraphs” where it’s the 214
strongest [the maximum Neutrosophic value from all Reverse Strict Dimension Dominating 215
In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from a Reverse 216

Strict Dimension Dominating In SuperHyperGraphs .] Reverse Strict Dimension Dominating In 217

SuperHyperGraphs . A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 218
of elements of SuperHyperEdges are the same. Assume a Neutrosophic SuperHyperGraph. 219
There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex 220
as intersection amid two given SuperHyperEdges with two exceptions; it’s Reverse Strict 221
Dimension Dominating In SuperHyperGraphs if it’s only one SuperVertex as intersection amid 222
two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection 223
amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection 224
amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has 225
no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as 226
intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate 227
sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as 228
intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge 229
with any common SuperVertex. The SuperHyperModel proposes the specific designs and 230
the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and 231
“Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific 232
group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended 233
properties between “specific” cells and “specific group” of cells are SuperHyperModeled as 234
“SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, 235
and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel 236
is called “Neutrosophic”. In the future research, the foundation will be based on the “Cancer’s 237
Neutrosophic Recognition” and the results and the definitions will be introduced in redeemed 238
ways. The Neutrosophic recognition of the cancer in the long-term function. The specific region 239
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 240
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 241
identified since there are some determinacy, indeterminacy and neutrality about the moves 242
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 246
cancer on the complex tracks and between complicated groups of cells could be fantasized by a 247
Neutrosophic SuperHyperPath(-/Reverse Strict Dimension Dominating In SuperHyperGraphs, 248
is to find either the longest Reverse Strict Dimension Dominating In SuperHyperGraphs or the 250
strongest Reverse Strict Dimension Dominating In SuperHyperGraphs in those Neutrosophic 251
SuperHyperModels. For the longest Reverse Strict Dimension Dominating In SuperHyper- 252
Graphs, called Reverse Strict Dimension Dominating In SuperHyperGraphs, and the strongest 253
Reverse Strict Dimension Dominating In SuperHyperGraphs, called Neutrosophic Reverse Strict 254
Dimension Dominating In SuperHyperGraphs, some general results are introduced. Beyond 255
that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s 256
not enough since it’s essential to have at least three SuperHyperEdges to form any style of a 257
Reverse Strict Dimension Dominating In SuperHyperGraphs. There isn’t any formation of any 258
Reverse Strict Dimension Dominating In SuperHyperGraphs but literarily, it’s the deformation 259
of any Reverse Strict Dimension Dominating In SuperHyperGraphs. It, literarily, deforms 260
and it doesn’t form. A basic familiarity with SuperHyperGraph theory and Neutrosophic 261
SuperHyperGraph theory are proposed. 262

Keywords: Neutrosophic SuperHyperGraph, Neutrosophic Reverse Strict Dimension Domin- 263
ating In SuperHyperGraphs, Cancer’s Neutrosophic Recognition 264

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

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




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

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

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

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

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

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

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

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

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

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

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



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

HG297] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 521


HG184b; HG185b; HG186b; HG187b; HG188b]. Two popular scientific research books 536
in Scribd ,in the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is 537
on [HG32b; HG44b]. 538

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

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

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

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

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

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

By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 686
10.5281/zenodo.8061927). 687
HG280 [44] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 688
10.5281/zenodo.8062016). 690
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 692
10.5281/zenodo.8057696). 693
HG278 [46] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 694
2023, (doi: 10.5281/zenodo.8057753). 696
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 698
10.5281/zenodo.8052893). 699
HG276 [48] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 700
2023, (doi: 10.5281/zenodo.8052925). 702
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 704
10.5281/zenodo.8051346). 705
HG274 [50] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 706
10.5281/zenodo.8051360). 708
HG273 [51] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 709
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 710
10.5281/zenodo.8025707). 711
HG272 [52] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 712
10.5281/zenodo.8027275). 714
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 716
odo.8017246). 717
HG270 [54] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 718
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 719
10.5281/zenodo.8020128). 720
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 722
odo.7978571). 723

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

By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 764
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 767
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 770
10.5281/zenodo.7853867). 771
HG252 [72] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 772
10.5281/zenodo.7853922). 774
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 776
(doi: 10.5281/zenodo.7851519). 777
HG250 [74] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 778
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 779
(doi: 10.5281/zenodo.7851550). 780
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 782
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 785
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 788
10.5281/zenodo.7834229). 789
HG246 [78] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 790
10.5281/zenodo.7834261). 792
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 794
10.5281/zenodo.7824560). 795
HG244 [80] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 796
(doi: 10.5281/zenodo.7824623). 798
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 800

Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 803
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 806
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 808
2023, (doi: 10.5281/zenodo.7809365). 809
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 811

2023, (doi: 10.5281/zenodo.7809358). 812
HG238 [86] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 813
10.5281/zenodo.7809219). 815
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 817
10.5281/zenodo.7809328). 818
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 820

2023, (doi: 10.5281/zenodo.7806767). 821
HG235 [89] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 822
2023, (doi: 10.5281/zenodo.7806838). 824
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 826
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 827
HG233 [91] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 828
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 829
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 830
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 832
10.5281/zenodo.7799902). 833
HG231 [93] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 834
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 835
(doi: 10.5281/zenodo.7804218). 836
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 838
(doi: 10.5281/zenodo.7796334). 839

By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 841
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 844
10.5281/zenodo.7791952). 845
HG225 [97] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 846
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 847
10.5281/zenodo.7791982). 848
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 850
10.5281/zenodo.7790026). 851
HG223 [99] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 852
10.5281/zenodo.7790052). 854
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 856
2023, (doi: 10.5281/zenodo.7787066). 857
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 859
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 860
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 862
10.5281/zenodo.7781476). 863
HG219 [103] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 864
10.5281/zenodo.7783082). 866
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 868
10.5281/zenodo.7777857). 869
HG217 [105] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 870
10.5281/zenodo.7779286). 872
HG215 [106] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 873
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 874
(doi: 10.5281/zenodo.7771831). 875
HG214 [107] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 876
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 877
2023, (doi: 10.5281/zenodo.7772468). 878

By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 880
10.13140/RG.2.2.20913.25446). 881
HG212 [109] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 882
odo.7764916). 884
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 886
10.13140/RG.2.2.11770.98247). 887
HG210 [111] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 888
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 889
10.13140/RG.2.2.12400.12808). 890
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 892
2023, (doi: 10.13140/RG.2.2.22545.10089). 893
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 895
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 896
HG207 [114] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 897
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 898
10.13140/RG.2.2.11377.76644). 899
HG206 [115] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 900
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 901
10.13140/RG.2.2.23750.96329). 902
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 904
10.13140/RG.2.2.31366.24641). 905
HG204 [117] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 906
10.13140/RG.2.2.34721.68960). 908
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 910
2023, (doi: 10.13140/RG.2.2.30212.81289). 911
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 913
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 916
10.13140/RG.2.2.24288.35842). 917

HG200 [121] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 918
10.13140/RG.2.2.32467.25124). 920
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 922
10.13140/RG.2.2.31025.45925). 923
HG198 [123] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 924
10.13140/RG.2.2.17184.25602). 926
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 928
10.13140/RG.2.2.23423.28327). 929
HG196 [125] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 930
10.13140/RG.2.2.28456.44805). 932
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 934
10.13140/RG.2.2.23525.68320). 935
HG194 [127] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 936
10.13140/RG.2.2.20170.24000). 938
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 940
10.13140/RG.2.2.36475.59683). 941
HG192 [129] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 942
10.13140/RG.2.2.29764.71046). 944
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 946
2023, (doi: 10.13140/RG.2.2.18780.87683). 947
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 949
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 952
10.13140/RG.2.2.26134.01603). 953
HG188 [133] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 954
10.13140/RG.2.2.27392.30721). 956

HG187 [134] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 957
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 958
10.13140/RG.2.2.33028.40321). 959
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 961
10.13140/RG.2.2.21389.20966). 962
HG185 [136] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 963
10.13140/RG.2.2.16356.04489). 965
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 967
10.13140/RG.2.2.21756.21129). 968
HG183 [138] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 969
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 970
10.13140/RG.2.2.30983.68009). 971
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 973
10.13140/RG.2.2.28552.29445). 974
HG181 [140] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 975
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 976
(doi: 10.13140/RG.2.2.10936.21761). 977
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 979
10.13140/RG.2.2.35105.89447). 980
HG179 [142] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 981
(doi: 10.13140/RG.2.2.30072.72960). 983
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 985
10.13140/RG.2.2.31147.52003). 986
HG177 [144] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 987
10.13140/RG.2.2.32825.24163). 989
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 991
10.13140/RG.2.2.13059.58401). 992
HG175 [146] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 993
10.13140/RG.2.2.11172.14720). 995

By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 997
2023, (doi: 10.13140/RG.2.2.22011.80165). 998
HG173 [148] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 999
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 1000
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 1001
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 1003
2023, (doi: 10.13140/RG.2.2.10493.84962). 1004
HG171 [150] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 1005
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 1007
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 1009
2023, (doi: 10.13140/RG.2.2.19944.14086). 1010
HG169 [152] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 1011
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 1013
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 1015
(doi: 10.13140/RG.2.2.33103.76968). 1016
HG167 [154] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 1017
(doi: 10.13140/RG.2.2.23037.44003). 1019
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 1021
(doi: 10.13140/RG.2.2.35646.56641). 1022
HG165 [156] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 1023
10.13140/RG.2.2.18030.48967). 1025
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 1027
(doi: 10.13140/RG.2.2.13973.81121). 1028
HG163 [158] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 1029
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1030
2023, (doi: 10.13140/RG.2.2.34106.47047). 1031
HG162 [159] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 1032
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1033

By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 1036
2023, (doi: 10.13140/RG.2.2.31956.88961). 1037
HG160 [161] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 1038
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1039
2023, (doi: 10.13140/RG.2.2.15179.67361). 1040
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 1042
10.13140/RG.2.2.21510.45125). 1043
HG158 [163] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 1044
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1045
2023, (doi: 10.13140/RG.2.2.13121.84321). 1046
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 1048
10.13140/RG.2.2.11758.69441). 1049
HG156 [165] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 1050
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 1051
2023, (doi: 10.13140/RG.2.2.31891.35367). 1052
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 1054
10.13140/RG.2.2.19360.87048). 1055
HG154 [167] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1056
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1057
10.13140/RG.2.2.32363.21286). 1058
HG153 [168] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1059
10.13140/RG.2.2.23266.81602). 1061
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1063
10.13140/RG.2.2.19911.37285). 1064
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1066
10.13140/RG.2.2.11050.90569). 1067
HG150 [171] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1068
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1069
2023, (doi: 10.13140/RG.2.2.17761.79206). 1070
HG149 [172] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1071
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1072

HG148 [173] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1074
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1075
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1076
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1078
(doi: 10.13140/RG.2.2.30182.50241). 1079
HG146 [175] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1080
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1081
HG145 [176] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1083
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1084
HG144 [177] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1086
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1087
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1088
HG143 [178] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1089
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1090
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1091
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1094
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1097
HG140 [181] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1098
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1099
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1100
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1103
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1106
HG137 [184] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1107
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1108
HG136 [185] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1110
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1111
2023, (doi: 10.13140/RG.2.2.17252.24968). 1112

HG135 [186] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1113
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1114
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1115
HG134 [187] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1116
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1117
HG132 [188] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1119
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1120

2023010396 (doi: 10.20944/preprints202301.0396.v1). 1121
HG131 [189] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1122
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1123

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1124
HG130 [190] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1125
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1126
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1127

SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1128
HG129 [191] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1129
Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1130
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1131
HG128 [192] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1133
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1134

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1135
HG127 [193] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1136
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1137

2023,(doi: 10.13140/RG.2.2.36745.93289). 1138
HG126 [194] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1139
HG125 [195] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1142

10.20944/preprints202301.0282.v1). 1145
HG124 [196] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1146
10.20944/preprints202301.0267.v1).). 1148


(doi: 10.20944/preprints202301.0265.v1). 1153
HG122 [198] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1154
prints202301.0262.v1). 1157

2023010224, (doi: 10.20944/preprints202301.0224.v1). 1163
HG24 [201] Henry Garrett,“SuperHyperMatching By (R-)Definitions And Polynomials To Monitor 1164

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1165
10.13140/RG.2.2.35061.65767). 1166
HG25 [202] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1167
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1168
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1169
10.13140/RG.2.2.18494.15680). 1170
HG26 [203] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1171
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1172
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1173
10.13140/RG.2.2.32530.73922). 1174
HG27 [204] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1175
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1176
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1177
10.13140/RG.2.2.15897.70243). 1178

10.13140/RG.2.2.32530.73922). 1182
prints202301.0105.v1). 1185
HG28 [207] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1186
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1187

HG29 [208] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1189
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1190
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1191
10.13140/RG.2.2.23172.19849). 1192
HG30 [211] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1199
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1200
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1201
10.13140/RG.2.2.17385.36968). 1202
Preprints 2023, 2023010044 1205
10.20944/preprints202301.0043.v1). 1208
HG31 [214] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1209
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1210

2023, (doi: 10.13140/RG.2.2.28945.92007). 1211
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1216
10.13140/RG.2.2.35774.77123). 1217
HG35 [218] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1221
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1222

10.13140/RG.2.2.29430.88642). 1223

(doi: 10.20944/preprints202212.0549.v1). 1229
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1231

10.13140/RG.2.2.19380.94084). 1232
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1240
(doi: 10.20944/preprints202212.0500.v1). 1243
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1245
10.13140/RG.2.2.20993.12640). 1246
HG952 [226] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1247

HG95 [227] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1250
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1251
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1252
HG37 [230] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1259
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1260

10.13140/RG.2.2.29173.86244). 1261
HG38 [231] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1262
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1263
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1264

HG188b [232] Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1265
Garrett, 2023 (doi: 10.5281/zenodo.8092816). 1266
HG187b [233] Henry Garrett, “Unequal Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1267
HG186b [234] Henry Garrett, “Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1269
2023 (doi: 10.5281/zenodo.8086310). 1270
HG185b [235] Henry Garrett, “Reverse Strict Connective In SuperHyperGraphs”. Dr. Henry Garrett, 1271
2023 (doi: 10.5281/zenodo.8080167). 1272
HG184b [236] Henry Garrett, “Unequal Connective Dominating In SuperHyperGraphs”. Dr. Henry 1273
HG183b [237] Henry Garrett, “Strict Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1275
2023 (doi: 10.5281/zenodo.8076449). 1276
HG182b [238] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1277
HG181b [239] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1279
2023 (doi: 10.5281/zenodo.8067469). 1280
HG180b [240] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1281
(doi: 10.5281/zenodo.8062076). 1282
HG179b [241] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1283
HG178b [242] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1285
2023 (doi: 10.5281/zenodo.8052976). 1286
HG177b [243] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1287
(doi: 10.5281/zenodo.8051368). 1288
HG176b [244] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1289
(doi: 10.5281/zenodo.8027488). 1290
HG175b [245] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1291
10.5281/zenodo.8020181). 1292
HG174b [246] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7978921). 1294
HG173b [247] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1295
odo.7943878). 1296
HG172b [248] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1297
10.5281/zenodo.7943871). 1298
HG171b [249] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1299
10.5281/zenodo.7923786). 1300

HG170b [250] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1301
2023 (doi: 10.5281/zenodo.7905287). 1302
HG169b [251] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1303

HG168b [252] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1305
2023 (doi: 10.5281/zenodo.7874677). 1306
HG167b [253] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1307
(doi: 10.5281/zenodo.7857906). 1308
HG166b [254] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1309
2023 (doi: 10.5281/zenodo.7856329). 1310
HG165b [255] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1311
10.5281/zenodo.7854561). 1312
HG164b [256] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1313
2023 (doi: 10.5281/zenodo.7851893). 1314
HG163b [257] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1315

HG162b [258] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1317
(doi: 10.5281/zenodo.7835063). 1318
HG161b [259] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1319
(doi: 10.5281/zenodo.7826705). 1320
HG160b [260] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1321
2023 (doi: 10.5281/zenodo.7820680). 1322
HG159b [261] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1323
10.5281/zenodo.7812750). 1324
HG158b [262] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1325

HG157b [263] Henry Garrett, “Hamiltonian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1327

HG156b [264] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1329
2023 (doi: 10.5281/zenodo.7807782). 1330
HG155b [265] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1331
2023 (doi: 10.5281/zenodo.7804449). 1332
HG154b [266] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1333

HG153b [267] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1335
(doi: 10.5281/zenodo.7792307). 1336

HG152b [268] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1337
(doi: 10.5281/zenodo.7790728). 1338
HG151b [269] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1339
2023 (doi: 10.5281/zenodo.7787712). 1340
HG150b [270] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1341
10.5281/zenodo.7783791). 1342
HG149b [271] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1343
10.5281/zenodo.7780123). 1344
HG148b [272] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1345
(doi: 10.5281/zenodo.7773119). 1346
HG147b [273] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1347
odo.7637762). 1348
HG146b [274] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1349
10.5281/zenodo.7766174). 1350
HG145b [275] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1351
10.5281/zenodo.7762232). 1352
HG144b [276] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1353
(doi: 10.5281/zenodo.7758601). 1354
HG143b [277] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1355
10.5281/zenodo.7754661). 1356
HG142b [278] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1357
10.5281/zenodo.7750995) . 1358
HG141b [279] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1359
(doi: 10.5281/zenodo.7749875). 1360
HG140b [280] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1361
10.5281/zenodo.7747236). 1362
HG139b [281] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1363
10.5281/zenodo.7742587). 1364
HG138b [282] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1365
(doi: 10.5281/zenodo.7738635). 1366
HG137b [283] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1367
10.5281/zenodo.7734719). 1368
HG136b [284] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1369
10.5281/zenodo.7730484). 1370
HG135b [285] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1371
(doi: 10.5281/zenodo.7730469). 1372

HG134b [286] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1373
10.5281/zenodo.7722865). 1374
HG133b [287] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1375
odo.7713563). 1376
odo.7709116). 1378
HG131b [289] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1379
10.5281/zenodo.7706415). 1380
HG130b [290] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1381
10.5281/zenodo.7706063). 1382
HG129b [291] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1383
10.5281/zenodo.7701906). 1384
HG128b [292] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1385
odo.7700205). 1386
HG127b [293] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1387
10.5281/zenodo.7694876). 1388
HG126b [294] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1389
10.5281/zenodo.7679410). 1390
HG125b [295] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1391
10.5281/zenodo.7675982). 1392
HG124b [296] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1393
10.5281/zenodo.7672388). 1394
HG123b [297] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1395
odo.7668648). 1396
HG122b [298] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1397
10.5281/zenodo.7662810). 1398
HG121b [299] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1399
10.5281/zenodo.7659162). 1400
HG120b [300] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1401
odo.7653233). 1402
HG119b [301] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1403
odo.7653204). 1404
HG118b [302] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1405
odo.7653142). 1406
HG117b [303] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1407
odo.7653117). 1408

HG116b [304] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1409
HG115b [305] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1410
odo.7651687). 1411
HG114b [306] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1412
odo.7651619). 1413
HG113b [307] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1414
odo.7651439). 1415
HG112b [308] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1416
odo.7650729). 1417
HG111b [309] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1418
odo.7647868). 1419
HG110b [310] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1420
odo.7647017). 1421
HG109b [311] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1422
odo.7644894). 1423
HG108b [312] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1424
HG107b [313] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1425
odo.7632923). 1426
HG106b [314] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1427
odo.7623459). 1428
HG105b [315] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1429
10.5281/zenodo.7606416). 1430
HG104b [316] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1431
10.5281/zenodo.7606416). 1432
HG103b [317] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1433
odo.7606404). 1434
HG102b [318] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1435
10.5281/zenodo.7580018). 1436
HG101b [319] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1437
odo.7580018). 1438
odo.7580018). 1440
odo.7579929). 1442

HG98b [322] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1443
10.5281/zenodo.7563170). 1444
HG97b [323] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1445
odo.7563164). 1446
HG96b [324] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1447
odo.7563160). 1448
odo.7563160). 1450
HG94b [326] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1451
10.5281/zenodo.7563160). 1452
HG93b [327] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1453
10.5281/zenodo.7557063). 1454
HG92b [328] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1455
10.5281/zenodo.7557009). 1456
HG91b [329] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1457
10.5281/zenodo.7539484). 1458
HG90b [330] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1459
10.5281/zenodo.7523390). 1460
HG89b [331] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1461
10.5281/zenodo.7523390). 1462
HG88b [332] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1463
10.5281/zenodo.7523390). 1464
HG87b [333] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1465
odo.7574952). 1466
HG86b [334] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1467
10.5281/zenodo.7574992). 1468
odo.7523357). 1470
HG84b [336] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1471
10.5281/zenodo.7523357). 1472
HG83b [337] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1473
10.5281/zenodo.7504782). 1474
HG82b [338] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1475
10.5281/zenodo.7504782). 1476
HG81b [339] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1477
10.5281/zenodo.7504782). 1478

HG80b [340] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1479
10.5281/zenodo.7499395). 1480
HG79b [341] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1481
odo.7499395). 1482
HG78b [342] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1483
10.5281/zenodo.7499395). 1484
HG77b [343] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1485
10.5281/zenodo.7497450). 1486
HG76b [344] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1487
10.5281/zenodo.7497450). 1488
HG75b [345] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1489
10.5281/zenodo.7494862). 1490
HG74b [346] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1491
odo.7494862). 1492
HG73b [347] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1493
10.5281/zenodo.7494862). 1494
HG72b [348] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1495
10.5281/zenodo.7493845). 1496
HG71b [349] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1497
odo.7493845). 1498
HG70b [350] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1499
10.5281/zenodo.7493845). 1500
HG69b [351] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1501
odo.7539484). 1502
HG68b [352] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1503
odo.7523390). 1504
HG67b [353] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1505
odo.7523357). 1506
HG66b [354] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1507
odo.7504782). 1508
HG65b [355] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1509
odo.7499395). 1510
HG64b [356] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1511
odo.7497450). 1512
HG63b [357] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1513
odo.7494862). 1514

HG62b [358] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1515
odo.7493845). 1516
HG61b [359] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1517
odo.7480110). 1518
HG60b [360] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1519
odo.7378758). 1520
HG32b [361] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1521
odo.6320305). 1522
HG44b [362] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1523
odo.6677173). 1524

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

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

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1598
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1599
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1600
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1601
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1602
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1603
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1604
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1605
based on the fixed groups of cells or the fixed groups of group of cells? 1606
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1607
messy and dense SuperHyperModels where embedded notions are illustrated? 1608
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1609
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1610
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1611

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

CHAPTER 5 1633
Extreme Reverse Strict Dimension 1634
Dominating 1635
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1636
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1637
2023, (doi: 10.13140/RG.2.2.34953.52320). 1638
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1639
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1640
(doi: 10.13140/RG.2.2.33275.80161). 1641
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1642
10.13140/RG.2.2.11050.90569). 1644
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1645
10.13140/RG.2.2.17761.79206). 1647
10.13140/RG.2.2.19911.37285). 1650
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1651
10.13140/RG.2.2.23266.81602). 1653
10.13140/RG.2.2.19360.87048). 1656
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1657
10.13140/RG.2.2.32363.21286). 1659
10.13140/RG.2.2.11758.69441). 1662
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1663
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1664
10.13140/RG.2.2.31891.35367). 1665
53

10.13140/RG.2.2.21510.45125). 1668
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1669
10.13140/RG.2.2.13121.84321). 1671

CHAPTER 6 1672
New Ideas On Super Dimity By Hyper 1673
Dimple Of Reverse Strict Dimension 1674
Dominating In Recognition of Cancer 1675
With (Neutrosophic) SuperHyperGraph 1676
55
CHAPTER 7 1677
ABSTRACT 1678
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 1679
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Strict Dimension 1680
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1681
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Strict 1682
Dimension Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Strict 1683
Dimension Dominating criteria holds 1684
∀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-SuperHyperReverse Strict Dimension Dominating if the following expression is called 1685
Neutrosophic e-SuperHyperReverse Strict Dimension Dominating criteria holds 1686

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

SuperHyperReverse Strict Dimension Dominating if the following expression is called Neutrosophic 1688
v-SuperHyperReverse Strict Dimension Dominating criteria holds 1689
∀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-SuperHyperReverse Strict Dimension Dominating if the following expression is called 1690
Neutrosophic v-SuperHyperReverse Strict Dimension Dominating criteria holds 1691

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 1692
rHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Di- 1693
mension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v- 1694
SuperHyperReverse Strict Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension 1695
Dominating. ((Neutrosophic) SuperHyperReverse Strict Dimension Dominating). Assume a Neutrosophic 1696
57
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 1697

(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperReverse Strict Dimension 1698
Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 1699
re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dom- 1700
inating, and Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an 1701
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Ex- 1702
treme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 1703
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices 1704
such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; a Neutrosophic 1705
SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict 1706
Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v- 1707
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 1709
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 1710
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 1711
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Dimension Domin- 1712
ating; an Extreme SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial if it’s either of 1713
Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict 1714
Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutrosophic 1715
rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 1716
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 1717
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 1718
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHy- 1719
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 1720
Strict Dimension Dominating; and the Extreme power is corresponded to its Extreme coefficient; a 1721
Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial if it’s either of 1722
rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyper- 1725
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1726
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1727
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1728
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1729
such that they form the Neutrosophic SuperHyperReverse Strict Dimension Dominating; and the Neutro- 1730
sophic power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse 1731
Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, 1732
Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict 1733
Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) 1734
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 1735
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in 1736
the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 1737
tices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; a Neutrosophic 1738
V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse 1739
Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 1740
v-SuperHyperReverse Strict Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension 1741
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 1742

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 1743

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 1744
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 1745
Strict Dimension Dominating; an Extreme V-SuperHyperReverse Strict Dimension Dominating SuperHyperPoly- 1746
nomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 1747
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1750
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1751
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme car- 1752
dinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 1753
they form the Extreme SuperHyperReverse Strict Dimension Dominating; and the Extreme power is 1754
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict Dimension Dominating 1755
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, 1756
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolyno- 1759
mial contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 1760
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Super- 1761

HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 1762
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 1763
Strict Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 1764
cient. In this scientific research, new setting is introduced for new SuperHyperNotions, namely, 1765
a SuperHyperReverse Strict Dimension Dominating and Neutrosophic SuperHyperReverse Strict Dimension 1766
Dominating. Two different types of SuperHyperDefinitions are debut for them but the research 1767
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 1774
under research to figure out the challenges make sense about ongoing and upcoming research. 1775
The special case is up. The cells are viewed in the deemed ways. There are different types 1776
of them. Some of them are individuals and some of them are well-modeled by the group of 1777
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 1780
these complex and dense SuperHyperModels open up some avenues to research on theoretical 1781
segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s 1782
also officially collected in the form of some questions and some problems. Assume a Super- 1783
HyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Strict Dimension Dominating 1784

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1786
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1787
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 1788

S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Strict Dimension Dominating is 1789

a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1790
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1791
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1792
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 1793
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperReverse 1795

Strict Dimension Dominating . Since there’s more ways to get type-results to make a SuperHyperReverse 1796
Strict Dimension Dominating more understandable. For the sake of having Neutrosophic SuperHy- 1797
perReverse Strict Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperReverse 1798
Strict Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 1799
labels from the letters of the alphabets. In this procedure, there’s the usage of the position of la- 1800
bels to assign to the values. Assume a SuperHyperReverse Strict Dimension Dominating . It’s redefined a 1801
Neutrosophic SuperHyperReverse Strict Dimension Dominating if the mentioned Table holds, concerning, 1802
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 1803
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 1804
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 1805
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 1806
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 1807
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to intro- 1808
duce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperReverse Strict Dimension 1809
Dominating . It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 1810
kind of SuperHyperClass. If there’s a need to have all SuperHyperReverse Strict Dimension Dominating 1811
until the SuperHyperReverse Strict Dimension Dominating, then it’s officially called a “SuperHyperReverse 1812
Strict Dimension Dominating” but otherwise, it isn’t a SuperHyperReverse Strict Dimension Dominating . There 1813
are some instances about the clarifications for the main definition titled a “SuperHyperReverse 1814
Strict Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 1815
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperReverse 1816
Strict Dimension Dominating . For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension 1817
Dominating, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperReverse Strict 1818
Dimension Dominating” and a “Neutrosophic SuperHyperReverse Strict Dimension Dominating ”. The Supe- 1819
rHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 1820
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 1822
if the intended Table holds. And a SuperHyperReverse Strict Dimension Dominating are redefined to 1823
a “Neutrosophic SuperHyperReverse Strict Dimension Dominating” if the intended Table holds. It’s 1824
get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Strict Dimension Dominating 1826
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1827
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 1828
Strict Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 1829
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse 1830

Strict Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 1831
Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Strict Dimension Dominat- 1833
ing” where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse 1834

Strict Dimension Dominating amid the maximum value amid all SuperHyperVertices from a Supe- 1835
rHyperReverse Strict Dimension Dominating .] SuperHyperReverse Strict Dimension Dominating . A graph is a 1836
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 1837
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 1838
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 1839
SuperHyperEdges with two exceptions; it’s SuperHyperReverse Strict Dimension Dominating if it’s only 1840
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 1841
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 1842
in redeemed ways. The recognition of the cancer in the long-term function. The specific 1857
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 1858
the move from the cancer is identified by this research. Sometimes the move of the cancer 1859
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 1860
about the moves and the effects of the cancer on that region; this event leads us to choose 1861
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 1862
on what’s happened and what’s done. There are some specific models, which are well-known 1863
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 1864
the traces of the cancer on the complex tracks and between complicated groups of cells could 1865
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Dimension Dominating, 1866
is to find either the longest SuperHyperReverse Strict Dimension Dominating or the strongest Super- 1868
HyperReverse Strict Dimension Dominating in those Neutrosophic SuperHyperModels. For the longest 1869
SuperHyperReverse Strict Dimension Dominating, called SuperHyperReverse Strict Dimension Dominating, and 1870
the strongest SuperHyperReverse Strict Dimension Dominating, called Neutrosophic SuperHyperReverse 1871
Strict Dimension Dominating, some general results are introduced. Beyond that in SuperHyperStar, 1872
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 1873
essential to have at least three SuperHyperEdges to form any style of a SuperHyperReverse Strict 1874
Dimension Dominating. There isn’t any formation of any SuperHyperReverse Strict Dimension Dominating 1875
but literarily, it’s the deformation of any SuperHyperReverse Strict Dimension Dominating. It, literarily, 1876
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperReverse Strict 1877
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 1878
proposed. 1879
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Strict Dimension Dominating, Can- 1880

cer’s Neutrosophic Recognition 1881


CHAPTER 8 1883
Applied Notions Under The Scrutiny Of 1884
The Motivation Of This Scientific 1885
Research 1886
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1887
try to bring the motivations in the narrative ways. Some cells have been faced with some 1888
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1889
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1890
as some groups and some groups or individuals have excessive labels which all are raised from 1891
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1892
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1893
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1894
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1895
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 1896
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 1897
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 1898
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 1899
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 1900
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 1901
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 1902
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 1903
It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the 1904
disease but the model is going to figure out what’s going on this phenomenon. The special case 1905
of this disease is considered and as the consequences of the model, some parameters are used. 1906
The cells are under attack of this disease but the moves of the cancer in the special region are 1907
the matter of mind. The recognition of the cancer could help to find some treatments for this 1908
disease. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 1909
the “Cancer’s Recognition” and both bases are the background of this research. Sometimes the 1910
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 1911
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 1913
the architecture are formally called “ SuperHyperReverse Strict Dimension Dominating” in the themes 1914
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded 1915
63
styles to figure out the background for the SuperHyperNotions. The recognition of the cancer 1916
in the long-term function. The specific region has been assigned by the model [it’s called 1917
SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. 1918
Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, 1919
indeterminacy and neutrality about the moves and the effects of the cancer on that region; 1920
this event leads us to choose another model [it’s said to be Extreme SuperHyperGraph] to 1921
have convenient perception on what’s happened and what’s done. There are some specific 1922
models, which are well-known and they’ve got the names, and some general models. The 1923
moves and the traces of the cancer on the complex tracks and between complicated groups 1924
of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperReverse Strict Dimension 1925
Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1926
The aim is to find either the optimal SuperHyperReverse Strict Dimension Dominating or the Extreme 1927
SuperHyperReverse Strict Dimension Dominating in those Extreme SuperHyperModels. Some general 1928
results are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath 1929
s have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1930
SuperHyperEdges to form any style of a SuperHyperReverse Strict Dimension Dominating. There isn’t 1931
any formation of any SuperHyperReverse Strict Dimension Dominating but literarily, it’s the deformation 1932
of any SuperHyperReverse Strict Dimension Dominating. It, literarily, deforms and it doesn’t form. 1933
Question 8.0.1. How to define the SuperHyperNotions and to do research on them to find 1934
the “ amount of SuperHyperReverse Strict Dimension Dominating” of either individual of cells or the 1935
groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 1936
SuperHyperReverse Strict Dimension Dominating” based on the fixed groups of cells or the fixed groups of 1937
group of cells? 1938
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1939
messy and dense SuperHyperModels where embedded notions are illustrated? 1940
Thus it motivates us to define different types of “ SuperHyperReverse Strict Dimension Dominating” 1942
and “Extreme SuperHyperReverse Strict Dimension Dominating” on “SuperHyperGraph” and “Extreme 1943
SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 1944
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 1945
motivates us to get some instances and examples to make clarifications about the framework of 1946
this research. The general results and some results about some connections are some avenues to 1947
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 1948
The framework of this research is as follows. In the beginning, I introduce basic definitions 1949
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1950
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1951
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1952
review literature are applied to make sense about what’s going to figure out about the 1953
upcoming sections. The main definitions and their clarifications alongside some results 1954
about new notions, SuperHyperReverse Strict Dimension Dominating and Extreme SuperHyperReverse 1955
Strict Dimension Dominating, are figured out in sections “ SuperHyperReverse Strict Dimension Dominating” 1956
and “Extreme SuperHyperReverse Strict Dimension Dominating”. In the sense of tackling on getting 1957
results and in Reverse Strict Dimension Dominating to make sense about continuing the research, the 1958
ideas of SuperHyperUniform and Extreme SuperHyperUniform are introduced and as their 1959
consequences, corresponded SuperHyperClasses are figured out to debut what’s done in this 1960

section, titled “Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. 1961

As going back to origin of the notions, there are some smart steps toward the common 1962
notions to extend the new notions in new frameworks, SuperHyperGraph and Extreme 1963
SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on Extreme 1964
SuperHyperClasses”. The starter research about the general SuperHyperRelations and as 1965
concluding and closing section of theoretical research are contained in the section “General 1966
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 1967
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, “ 1968
SuperHyperReverse Strict Dimension Dominating”, “Extreme SuperHyperReverse Strict Dimension Dominating”, 1969
“Results on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. There are curious 1970
questions about what’s done about the SuperHyperNotions to make sense about excellency of 1971
this research and going to figure out the word “best” as the description and adjective for this 1972
research as presented in section, “ SuperHyperReverse Strict Dimension Dominating”. The keyword of 1973
this research debut in the section “Applications in Cancer’s Recognition” with two cases and 1974
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 1975
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 1976
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 1977
happened in this research in the terms of “questions” and “problems” to make sense to figure 1978
out this research in featured style. The advantages and the limitations of this research alongside 1979
about what’s done in this research to make sense and to get sense about what’s figured out are 1980
included in the section, “Conclusion and Closing Remarks”. 1981

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1988
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1989
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1990
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1991
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1992
ideas and their clarifications are addressed to Ref.[HG38]. 1993

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

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

by x. A single valued Neutrosophic set A (SVNS A) is characterized by truth-membership
function TA (x), an indeterminacy-membership function IA (x), and a falsity-membership function
FA (x). For each point x in X, TA (x), IA (x), FA (x) ∈ [0, 1]. A SVNS A can be written as
A = {< x : TA (x), IA (x), FA (x) >, x ∈ X}.
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). 1997
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1998
where 1999
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 2000
(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); 2001
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 2002
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 2003
0
1, 2, . . . , n ); 2004
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2005
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2006

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2007
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 2008
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 . 2009
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 2010
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 2011
degree of truth-membership, the degree of indeterminacy-membership and the degree of 2012
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 2013

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 2014
membership, the degree of indeterminacy-membership and the degree of falsity-membership of 2015
the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge (NSHE) 2016
E. Thus, the ii0 th element of the Reverse Strict Dimension Dominating of Neutrosophic 2017
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 2018
are crisp sets. 2019

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

(Ref.[HG11s],Definition 2.7,p.3). 2021
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 2022
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 2023
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 2024
(i) If |Vi | = 1, then Vi is called vertex; 2025
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 2026
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 2027
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 2028
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 2029
SuperEdge; 2030
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 2031
SuperHyperEdge. 2032
If we choose different types of binary operations, then we could get hugely diverse types of 2033
general forms of Neutrosophic SuperHyperGraph (NSHG). 2034
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 2035

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 2036
x, y, z, w ∈ [0, 1]: 2037
(i) 1 ⊗ x = x; 2038
(ii) x ⊗ y = y ⊗ x; 2039
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 2040
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 2041

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

where 2044

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 2045
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 2048
1, 2, . . . , n0 ); 2049
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 2050
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 2051
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 2052
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 2053
0

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

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2080
of elements of SuperHyperEdges are the same. 2081
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2082
makes to have SuperHyperUniform more understandable. 2083
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2084
Classes as follows. 2085
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2086
two given SuperHyperEdges with two exceptions; 2087
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2088
SuperHyperEdges; 2089
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2090
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2091
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2092
in common; 2093
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2094
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2095
SuperHyperEdge in common; 2096
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2097
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2098
SuperVertex. 2099
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 2100
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2101
(i) Vi , Vi+1 ∈ Ei0 ; 2102
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2103
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2104
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2105
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2106
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2107
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2108
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2109
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2111
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2112
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2113
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2114
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2115
perPath . 2116
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 2117
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2118
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2119
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2120
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2121
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2122

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2135
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2136
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2137
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 2138

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

or E 0 is called 2142
(i) Neutrosophic e-SuperHyperReverse Strict Dimension Dominating if the following expres- 2143
sion is called Neutrosophic e-SuperHyperReverse Strict Dimension Dominating criteria 2144
holds 2145
0
∀Ea ∈ EN SHG , ∃Eb ∈ E : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb
(ii) Neutrosophic re-SuperHyperReverse Strict Dimension Dominating if the following expres- 2146
sion is called Neutrosophic re-SuperHyperReverse Strict Dimension Dominating criteria 2147
holds 2148

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2149
(iii) Neutrosophic v-SuperHyperReverse Strict Dimension Dominating if the following expres- 2150
sion is called Neutrosophic v-SuperHyperReverse Strict Dimension Dominating criteria 2151
holds 2152
0
∀Va , ∃Vb ∈ V : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed
(iv) Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating if the following expres- 2153
holds 2155

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2156
(v) Neutrosophic SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic 2157
e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension 2158
Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutrosophic rv- 2159
SuperHyperReverse Strict Dimension Dominating. 2160

Definition 9.0.19. ((Neutrosophic) SuperHyperReverse Strict Dimension Dominating). 2161

(i) an Extreme SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic 2164
SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 2167
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2168
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2169
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2170
form the Extreme SuperHyperReverse Strict Dimension Dominating; 2171
(ii) a Neutrosophic SuperHyperReverse Strict Dimension Dominating if it’s either of Neutro- 2172
sophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict 2173
Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutro- 2174
sophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic 2175
SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neut- 2176
rosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 2177
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVer- 2178
tices such that they form the Neutrosophic SuperHyperReverse Strict Dimension Dominating; 2179
(iii) an Extreme SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial 2180

if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re- 2181
SuperHyperReverse Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension 2182
Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) 2183
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 2184
contains the Extreme coefficients defined as the Extreme number of the maximum 2185
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 2186

S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 2187
SuperHyperVertices such that they form the Extreme SuperHyperReverse Strict Dimension 2188
Dominating; and the Extreme power is corresponded to its Extreme coefficient; 2189
(iv) a Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 2190
mial if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 2191
re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimen- 2192
sion Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) 2193
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyper- 2194
Polynomial contains the Neutrosophic coefficients defined as the Neutrosophic number 2195
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 2196
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 2197

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 2198
Neutrosophic SuperHyperReverse Strict Dimension Dominating; and the Neutrosophic power is 2199
corresponded to its Neutrosophic coefficient; 2200
(v) an Extreme V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neutro- 2201

, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutro-

sophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme Su- 2204
perHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 2205
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 2206
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyper- 2207
Vertices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; 2208
(vi) a Neutrosophic V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neut- 2209
rosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse 2210

Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neut- 2211
rosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic 2212
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 2214
(vii) an Extreme V-SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 2217
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 2222
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high 2223
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 2224

tices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; and the 2225
Extreme power is corresponded to its Extreme coefficient; 2226
(viii) a Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 2227


of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 2233
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 2234
corresponded to its Neutrosophic coefficient. 2237
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Strict Dimension Dominating). 2238

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2239
(i) an δ−SuperHyperReverse Strict Dimension Dominating is a Neutrosophic kind of Neutro- 2240

sophic SuperHyperReverse Strict Dimension Dominating such that either of the following expressions 2241
hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2242
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2

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
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 2243

(29.1), holds if S is an δ−SuperHyperDefensive; 2244
(ii) a Neutrosophic δ−SuperHyperReverse Strict Dimension Dominating is a Neutrosophic kind 2245

of Neutrosophic SuperHyperReverse Strict Dimension Dominating such that either of the following 2246
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2247
of s ∈ S : 2248
|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 2249

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2250
For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension Dominating, there’s a 2251
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 2252
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 2253
procedure, there’s the usage of the position of labels to assign to the values. 2254
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2255
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2256
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2257
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2258
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus 2260
Neutrosophic SuperHyperPath , SuperHyperReverse Strict Dimension Dominating, SuperHyperStar, 2261
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2262
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2263
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2264
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2265
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Strict Dimension 2266
Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 2267
Strict Dimension Dominating more Neutrosophicly understandable. 2268
For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension Dominating, there’s a need to 2269
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Strict Dimension Dominating”. 2270
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 2271

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

136TBL4

136TBL1
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 2272
values. 2273
136DEF1 Definition 9.0.23. Assume a SuperHyperReverse Strict Dimension Dominating. It’s redefined a Neut- 2274
rosophic SuperHyperReverse Strict Dimension Dominating if the Table (29.3) holds. 2275

CHAPTER 10 2276
Extreme SuperHyper But As Reverse Strict Dimension Dominating 2277
The Extensions Excerpt From Dense And 2278
Super Forms 2279
Definition 10.0.1. (Extreme event). 2280
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2281
a probability Reverse Strict Dimension Dominating. Any Extreme k-subset of A of V is called Extreme 2282
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2283
expression is called Extreme probability of A. 2284
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2285

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2286
is a probability Reverse Strict Dimension Dominating. s Extreme k-events Ai , i ∈ I is called Extreme 2287
s-independent if the following expression is called Extreme s-independent criteria 2288
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 2289
following expression is called Extreme independent criteria 2290
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2291

a probability Reverse Strict Dimension Dominating. Any k-function Reverse Strict Dimension Dominating like E 2293
is called Extreme k-Variable. If k = 2, then any 2-function Reverse Strict Dimension Dominating like 2294
E is called Extreme Variable. 2295
The notion of independent on Extreme Variable is likewise. 2296
Definition 10.0.4. (Extreme Expectation). 2297
79
is a probability Reverse Strict Dimension Dominating. an Extreme k-Variable E has a number is called 2299
Extreme Expectation if the following expression is called Extreme Expectation criteria 2300
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2301

a probability Reverse Strict Dimension Dominating. an Extreme number is called Extreme Crossing 2303
if the following expression is called Extreme Crossing criteria 2304
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 2305
S = (V, E) is a probability Reverse Strict Dimension Dominating. Let m and n propose special Reverse Strict 2306
Dimension Dominating. Then with m ≥ 4n, 2307
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 Reverse Strict 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: 2308
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2309
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2310
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let P be a SuperHyperSet of 2311
n points in the plane, and let l be the Extreme number √ of SuperHyperLines in the plane passing 2312
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2313
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2314

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

Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let P be a SuperHyperSet of n 2321
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 2322
Then k < 5n4/3 . 2323
Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = 2324
(V, E) is a probability Reverse Strict Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle 2325
around each SuperHyperPoint of P. Let ni be the P Extreme number of these SuperHyperCircles 2326
i = 0n−1 ni = n and k = 12 i = 0n−1 ini .
P
passing through exactly i points of P. Then 2327
Now form an Extreme SuperHyperGraph H with SuperHyperVertex SuperHyperSet P whose 2328

SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on the 2329
SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 2330
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 2331
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, so 2332

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2333
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2334
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2335
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2336
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2337
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let X be a nonnegative 2338
Extreme Variable and t a positive real number. Then 2339
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. 2340
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2341
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let Xn be a nonnegative integer- 2342
valued variable in a probability Reverse Strict Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2343
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2344
Proof. 2345
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. A special SuperHyperGraph in 2347
Gn,p almost surely has stability number at most d2p−1 log ne. 2348

Proof. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 2349
S = (V, E) is a probability Reverse Strict Dimension Dominating. A special SuperHyperGraph in Gn,p 2350
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2351
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2352
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2353
SuperHyperEdge of the Extreme SuperHyperGraph G. 2354
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2355
Extreme Variable for this Extreme Event. By equation, we have 2356
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 2357
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2358
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: 2359
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2360
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 2361
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2362
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2363
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2364
Definition 10.0.12. (Extreme Variance). 2365

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

S = (V, E) is a probability Reverse Strict Dimension Dominating. Let X be an Extreme Variable and let 2373
t be a positive real number. Then 2374
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2375
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let Xn be an Extreme 2377
Variable in a probability Reverse Strict Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 2378
V (Xn ) << E 2 (Xn ), then 2379
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Strict Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2381
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2382
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2383
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 2385
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 2386
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2387
S = (V, E) is a probability Reverse Strict Dimension Dominating. As in the proof of related Theorem, 2389
the result is straightforward. 2390
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let G ∈ Gn,1/2 and let f and 2392
k ∗ be as defined in previous Theorem. Then either: 2393
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2394
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2395
S = (V, E) is a probability Reverse Strict Dimension Dominating. The latter is straightforward. 2397
Definition 10.0.17. (Extreme Threshold). 2398

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2399
probability Reverse Strict Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 2400
(one which is preserved when SuperHyperEdges are added). Then a Extreme Threshold for 2401
P is a function f (n) such that: 2402
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 2403
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 2404

Definition 10.0.18. (Extreme Balanced). 2405

is a probability Reverse Strict Dimension Dominating. Let F be a fixed Extreme SuperHyperGraph. 2407
Then there is a threshold function for the property of containing a copy of F as an Extreme 2408
SubSuperHyperGraph is called Extreme Balanced. 2409
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let F be a nonempty balanced 2411
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2412

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2413
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2416
the mentioned Extreme Figures in every Extreme items. 2417
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperReverse 2418
Strict Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. 2419
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Extreme 2420
SuperHyperEdge and E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme 2421
SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . The 2422
Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 2423
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 2424

V3 , is excluded in every given Extreme SuperHyperReverse Strict Dimension Dominating. 2425
C(N SHG)Extreme Reverse Strict Dimension Dominating =

{}.
C(N SHG)Extreme Reverse Strict Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Extreme V-Reverse Strict Dimension Dominating =
{}.
C(N SHG)Extreme V-Reverse Strict Dimension Dominating SuperHyperPolynomial
= 0z 0 .
2426
E1 , E2 and E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme 2429

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

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2438



{}.
= 0z 0 .
{}.
= 0z 0 .
2441

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

= z 7−c .
2444

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

{EN SHG − {Ei }}.

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

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

= z 3−a .
2453

{E3i+1 , E23 }3i=0 .
= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
2456
• On the Figure (30.10), the Extreme SuperHyperNotion, namely, Extreme SuperHy- 2457
perReverse Strict Dimension Dominating, is up. The Extreme Algorithm is Extremely straightfor- 2458
ward. 2459


{EN SHG − {E1 , E5 }}.

= z 3−a .
{VN SHG − {V1 , V11 }}.
= z 3−a .
2460
ward. 2463

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

= z 3−a .
2464
ward. 2467

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

ward. 2471

{EN SHG − {E6 , E9 }}.
= z 2−a .
{VN SHG − {V1 , V5 }}.
= z 3−a .
2472
ward. 2475

{E2 }.
= z 3−a .


{V1 }.
= z 5−a .
2476
ward. 2479

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

ward. 2483

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


ward. 2487

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

{E3i+2 }1i=0 .


= z 2−a .
{V2 , V17 , V7 , V27 }.
= z 2−a .
2492
ward. 2495

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

= z 2−a .
2496
ward. 2499

{EN SHG − {E1 }}.
= z 3−a .
{VN SHG − {V1 , {U2 , V2 , W2 }}.
= z 3−a .
2500

ward. 2503

{E2 }.
= z |1−a| .
{V1 }.
= z |5−a| .
2504
ward. 2507

{E2i+3 }1i=0 .

SuperHyperReverse Strict Dimension Dominating in the Extreme Example (42.0.3) 95NHG1
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .
2508
Proposition 10.0.21. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The all 2509
interior Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict Dimension Dominating 2510
if for any of them, and any of other corresponded Extreme SuperHyperVertex, some interior 2511
Extreme SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme 2512
exception at all minus all Extreme SuperHypeNeighbors to any amount of them. 2513
Proposition 10.0.22. Assume a connected non-obvious Extreme SuperHyperGraph ESHG : 2514
(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2515

SuperHyperReverse Strict Dimension Dominating in the Extreme Example (42.0.3) 95NHG2
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2516
quasi-R-Reverse Strict Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them 2517
but not all of them. In other words, there’s only an unique Extreme SuperHyperEdge 2518
E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in an Extreme quasi- 2519
R-Reverse Strict Dimension Dominating, minus all Extreme SuperHypeNeighbor to some of them but not 2520
all of them. 2521
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-Reverse Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Strict Dimension Dominating 2522
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2523
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2524
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2525
of Extreme SuperHyperVertices are renamed to Extreme Reverse Strict Dimension Dominating in some 2526
cases but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme 2527
number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in 2528
an Extreme R-Reverse Strict Dimension Dominating. 2529
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Reverse Strict 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-Reverse Strict Dimension Dominating with the least Extreme cardinality, 2530
the lower sharp Extreme bound for cardinality. 2531
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2532
Then in the worst case, literally, 2533
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 5 .
Is an Extreme type-result-Reverse Strict Dimension Dominating. In other words, the least cardinality, the 2534
lower sharp bound for the cardinality, of an Extreme type-result-Reverse Strict Dimension Dominating is 2535
the cardinality of 2536
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseStrictDimensionDominatingSuperHyperP 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-Reverse Strict 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-Reverse Strict Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a quasi-R-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-Reverse Strict Dimension Dominating has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-
Reverse Strict 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-Reverse Strict 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-Reverse Strict Dimension Dominating. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Reverse Strict 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-Reverse Strict Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Reverse Strict 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-Reverse Strict 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, 2537
Extreme R-Reverse Strict Dimension Dominating =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
2538
Extreme R-Reverse Strict Dimension Dominating =

Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Reverse Strict 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 Reverse Strict 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-Reverse Strict
Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Strict Dimension Dominating 2539
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2540
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2541
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2542
number of Extreme SuperHyperVertices are renamed to Extreme Reverse Strict Dimension Dominating 2543
in some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2544
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2545
contained in an Extreme R-Reverse Strict Dimension Dominating. 2546
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Ex- 2547
treme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the 2548
Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme Super- 2549
HyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2550
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2551
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2552
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2553
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2554
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyper- 2555
Vertices. Thus it forms an Extreme quasi-R-Reverse Strict Dimension Dominating where the Extreme 2556
completion of the Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded 2557

R-Reverse Strict Dimension Dominating. The SuperHyperNotions of embedded SuperHyperSet and 2558
quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only don’t 2559
satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected such that 2560
those SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2561
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are in- 2562
cluded in the minimum Extreme style of the embedded Extreme R-Reverse Strict Dimension Dominating. 2563
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2564
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2565
common connections, more precise and more formal, the perfect unique connections inside the 2566
Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the Extreme 2567
R-Reverse Strict Dimension Dominating. Thus Extreme exterior SuperHyperVertices could be used only 2568
in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior Extreme 2569
SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme Reverse Strict 2570
Dimension Dominating, there’s the usage of exterior Extreme SuperHyperVertices since they’ve more 2571
connections inside more than outside. Thus the title “exterior” is more relevant than the 2572
title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the Extreme 2573
SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement has been 2574
ignored in the exploring to lead on the optimal case implying the Extreme R-Reverse Strict Dimension 2575
Dominating. The Extreme R-Reverse Strict Dimension Dominating with the exclusion of the exclusion of 2576
all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, the 2577
Extreme R-Reverse Strict Dimension Dominating with the inclusion of all Extreme SuperHyperVertices 2578
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Reverse Strict Dimension Dominating. To sum 2579
them up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s only 2580
one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the 2581
distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Reverse Strict 2582
Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2583
In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only 2584
two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Strict Dimension Dominating, 2585
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2586
The main definition of the Extreme R-Reverse Strict Dimension Dominating has two titles. an Ex- 2587
treme quasi-R-Reverse Strict Dimension Dominating and its corresponded quasi-maximum Extreme 2588
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2589
there’s an Extreme quasi-R-Reverse Strict Dimension Dominating with that quasi-maximum Extreme 2590
SuperHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s 2591
an embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us 2592
to take the collection of all the Extreme quasi-R-Reverse Strict Dimension Dominatings for all Extreme 2593
numbers less than its Extreme corresponded maximum number. The essence of the Extreme 2594
Reverse Strict Dimension Dominating ends up but this essence starts up in the terms of the Extreme 2595
quasi-R-Reverse Strict Dimension Dominating, again and more in the operations of collecting all the 2596
Extreme quasi-R-Reverse Strict Dimension Dominatings acted on the all possible used formations of the 2597
Extreme SuperHyperGraph to achieve one Extreme number. This Extreme number is 2598
considered as the equivalence class for all corresponded quasi-R-Reverse Strict Dimension Dominat- 2599
ings. Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Reverse Strict Dimension Dominating be an 2600
Extreme number, an Extreme SuperHyperSet and an Extreme Reverse Strict Dimension Dominating. 2601
Then 2602
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Reverse Strict Dimension Dominating ,

|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Reverse Strict Dimension Dominating is re- 2603
formalized and redefined as follows. 2604
GExtreme Reverse Strict 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 2605
definition for the Extreme Reverse Strict Dimension Dominating. 2606
GExtreme Reverse Strict 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 Reverse Strict 2607
poses the upcoming expressions.


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

= max zExtreme Number


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


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

2612

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

2613


2614


Now, the extension of these types of approaches is up. Since the new term, “Extreme Super- 2615
HyperNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices 2616

such that any amount of its Extreme SuperHyperVertices are incident to an Extreme Supe- 2617
rHyperEdge. It’s, literarily, another name for “Extreme Quasi-Reverse Strict Dimension Dominating” 2618
but, precisely, it’s the generalization of “Extreme Quasi-Reverse Strict Dimension Dominating” since 2619
“Extreme Quasi-Reverse Strict Dimension Dominating” happens “Extreme Reverse Strict Dimension Dominating” 2620
in an Extreme SuperHyperGraph as initial framework and background but “Extreme Super- 2621
HyperNeighborhood” may not happens “Extreme Reverse Strict Dimension Dominating” in an Extreme 2622
SuperHyperGraph as initial framework and preliminarily background since there are some 2623
ambiguities about the Extreme SuperHyperCardinality arise from it. To get orderly keywords, 2624
the terms, “Extreme SuperHyperNeighborhood”, “Extreme Quasi-Reverse Strict Dimension Dominating”, 2625
and “Extreme Reverse Strict Dimension Dominating” are up. 2626
Thus, let 2627
zExtreme Number , NExtreme SuperHyperNeighborhood and 2628
GExtreme Reverse Strict Dimension Dominating be an Extreme number, an Extreme SuperHyperNeigh- 2629
borhood and an Extreme Reverse Strict Dimension Dominating and the new terms are up. 2630
GExtreme Reverse Strict Dimension Dominating ∈ ∪zExtreme Number

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

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

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



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

2635

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

2636


2637


Thus, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior Extreme
SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict 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-Reverse Strict Dimension Dominating.
The Extreme SuperHyperSet of Extreme SuperHyperVertices,
Is the simple Extreme type-SuperHyperSet of the Extreme R-Reverse Strict Dimension Dominating. The
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Reverse Strict Dimension Dominating C(ESHG) for an Extreme SuperHyper-

Graph 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 Reverse Strict Dimension Dominating is related to the Extreme SuperHyperSet of the
There’s not only one Extreme SuperHyperVertex inside the intended Extreme SuperHyperSet.
Thus the non-obvious Extreme Reverse Strict Dimension Dominating is up. The obvious simple Extreme
type-SuperHyperSet called the Extreme Reverse Strict Dimension Dominating is an Extreme SuperHy-
perSet includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of
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-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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 Reverse Strict Dimension Dominating
and it’s an Extreme Reverse Strict 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
Reverse Strict Dimension Dominating. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Reverse Strict Dimension Dominating,
is up. The non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Strict Dimension
Dominating, not:
Is the Extreme SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Extreme SuperHyperGraph 2638
ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an SuperHyperEdge. 2639
It’s interesting to mention that the only non-obvious simple Extreme type-SuperHyperSet called 2640
the 2641
“Extreme R-Reverse Strict Dimension Dominating” 2642
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2643
Extreme R-Reverse Strict Dimension Dominating, 2644
is only and only
In a connected Extreme SuperHyperGraph ESHG : (V, E) with a illustrated SuperHyperMod-

eling. 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 SuperHyper-
Model. But all only non-obvious simple Extreme type-SuperHyperSets of the Extreme R-Reverse
Strict Dimension Dominating amid those obvious simple Extreme type-SuperHyperSets of the Extreme
Reverse Strict 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-Reverse Strict Dimension Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of an Extreme R-Reverse Strict Dimension Dominating is the cardinality
of
2645
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2646
Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Strict Dimension Dominating if for 2647
any of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2648
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2649
all minus all Extreme SuperHypeNeighbors to any amount of them. 2650

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2651
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2652
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2653
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2654
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2655
R-Reverse Strict Dimension Dominating with the least cardinality, the lower sharp Extreme bound for 2656
Extreme cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The 2657
Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme Super- 2658
HyperSet S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge 2659
to have some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Reverse Strict 2660
Dimension Dominating. Since it doesn’t have 2661
2662
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHy- 2663
perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2664
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} is the 2665
maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme SuperHyperVertices 2666
but it isn’t an Extreme R-Reverse Strict Dimension Dominating. Since it doesn’t do the Extreme 2667
procedure such that such that there’s an Extreme SuperHyperEdge to have some Extreme 2668
SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2669
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2670
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2671
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2672
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2673
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus the 2674
obvious Extreme R-Reverse Strict Dimension Dominating, VESHE is up. The obvious simple Extreme 2675
type-SuperHyperSet of the Extreme R-Reverse Strict Dimension Dominating, VESHE , is an Extreme 2676
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2677
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2678
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2679
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2680

S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2681

some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2682
ESHG : (V, E). Any Extreme R-Reverse Strict Dimension Dominating only contains all interior Extreme 2683
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2684
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2685
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2686
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2687
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2688
The SuperHyperNotion, namely, Reverse Strict Dimension Dominating, is up. There’s neither empty 2689
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Extreme 2690
SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of the 2691
Extreme Reverse Strict Dimension Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2692
perEdges[SuperHyperVertices], 2693
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ReverseStrictDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ReverseStrictDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Reverse Strict Dimension Dominating. The 2694
Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2695
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Reverse Strict Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph 2696
ESHG : (V, E) is an Extreme type-SuperHyperSet with 2697
2698
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2699
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2700
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2701
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2702
Extreme SuperHyperSet. Thus the non-obvious Extreme Reverse Strict Dimension Dominating is up. The 2703
obvious simple Extreme type-SuperHyperSet called the Extreme Reverse Strict Dimension Dominating is 2704

an Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2705
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2706
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. 2707
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Strict 2708
Dimension Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme 2709
SuperHyperEdges[SuperHyperVertices], 2710
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 Reverse Strict Dimension Domin- 2711
. Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices],
ating 2712
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Reverse Strict Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph 2713
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such that 2714
there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by that 2715
Extreme type-SuperHyperSet called the Extreme Reverse Strict Dimension Dominating and it’s an 2716
Extreme Reverse Strict Dimension Dominating. Since it’s 2717

2718
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2719
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2720
Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2721
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2722
intended Extreme SuperHyperSet, 2723
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme ,

Reverse Strict Dimension Dominating 2724
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 Reverse Strict Dimension 2725
, not:
Dominating 2726
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2727
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 2728
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2729
SuperHyperSet called the 2730
“Extreme Reverse Strict Dimension Dominating ” 2731
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2732
Extreme ,
is only and only 2734
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2735

CHAPTER 11 2736
The Extreme Departures on The 2737
Theoretical Results Toward Theoretical 2738
Motivations 2739
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2740
SuperHyperClasses. 2741
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2742

|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 2743
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2744
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
121
Figure 11.1: an Extreme SuperHyperPath Associated to the Notions of Extreme SuperHy-

perReverse Strict 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 2745
new way to redefine as 2746
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 2747
to ViEXT ERN AL in the literatures of SuperHyperReverse Strict Dimension Dominating. The latter is 2748
straightforward. 2749
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2750
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2751
(31.1), is the SuperHyperReverse Strict Dimension Dominating. 2752
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2753

|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 2754
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
2755
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 2756

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2761
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2762
SuperHyperModel (31.2), is the Extreme SuperHyperReverse Strict Dimension Dominating. 2763

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

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

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

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

SuperHyperReverse Strict 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 2767
way to redefine as 2768

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2772
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2773
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2774
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperReverse 2775
Strict Dimension Dominating. 2776
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2777

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


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2778
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
2779
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 2780
a new way to redefine as 2781

straightforward. Then there’s no at least one SuperHyperReverse Strict Dimension Dominating. Thus the 2784
notion of quasi may be up but the SuperHyperNotions based on SuperHyperReverse Strict Dimension 2785
Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 2786
could have one SuperHyperVertex as the representative in the 2787
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperReverse Strict Dimension Dominating taken from a connected Extreme 2788
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 2789
Extreme-of-SuperHyperPart SuperHyperEdges are attained in any solution 2790
P :

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

Extreme SuperHyperReverse Strict Dimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2791
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2792
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2793
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2794
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2795
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperReverse Strict Dimension Dominating. 2796
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2797
Then 2798

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

Proof. Let 2799
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2800
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 2802

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

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

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

SuperHyperReverse Strict Dimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2814
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2815
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2816
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2817
the Extreme SuperHyperReverse Strict Dimension Dominating. 2818
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2819

Then, 2820

|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 2821
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

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

straightforward. Then there’s at least one SuperHyperReverse Strict Dimension Dominating. Thus 2826
the notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Strict 2827
Dimension Dominating could be applied. The unique embedded SuperHyperReverse Strict Dimension 2828
Dominating proposes some longest SuperHyperReverse Strict Dimension Dominating excerpt from some 2829
representatives. The latter is straightforward. 2830
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2831
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2832
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2833
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2834
Extreme SuperHyperReverse Strict Dimension Dominating. 2835

CHAPTER 12 2836
The Surveys of Mathematical Sets On 2837
The Results But As The Initial Motivation 2838
For the SuperHyperReverse Strict Dimension Dominating, Extreme SuperHyperReverse Strict Dimension 2839
, and the Extreme SuperHyperReverse Strict Dimension Dominating, some general results are
Dominating 2840
introduced. 2841
Remark 12.0.1. Let remind that the Extreme SuperHyperReverse Strict Dimension Dominating is 2842
“redefined” on the positions of the alphabets. 2843
Corollary 12.0.2. Assume Extreme SuperHyperReverse Strict Dimension Dominating. Then 2844
Extreme SuperHyperReverseStrictDimensionDominating =
{theSuperHyperReverseStrictDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseStrictDimensionDominating
|ExtremecardinalityamidthoseSuperHyperReverseStrictDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2845
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2846
and the neutrality, for i = 1, 2, 3, respectively. 2847
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of 2848
the alphabet. Then the notion of Extreme SuperHyperReverse Strict Dimension Dominating and 2849
SuperHyperReverse Strict Dimension Dominating coincide. 2850
Corollary 12.0.4. Assume an Extreme SuperHyperGraph on the same identical letter of the 2851
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperReverse 2852

Strict Dimension Dominating if and only if it’s a SuperHyperReverse Strict Dimension Dominating. 2853
Corollary 12.0.5. Assume an Extreme SuperHyperGraph on the same identical letter of the 2854
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 2855
Strict Dimension Dominating if and only if it’s a longest SuperHyperReverse Strict Dimension Dominating. 2856
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2857

identical letter of the alphabet. Then its Extreme SuperHyperReverse Strict Dimension Dominating is its 2858
SuperHyperReverse Strict Dimension Dominating and reversely. 2859
131
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Dimension Dominat- 2860

ing, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the 2861
same identical letter of the alphabet. Then its Extreme SuperHyperReverse Strict Dimension Dominating 2862
is its SuperHyperReverse Strict Dimension Dominating and reversely. 2863
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2864
isn’t well-defined if and only if its SuperHyperReverse Strict Dimension Dominating
Strict Dimension Dominating 2865
isn’t well-defined. 2866
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its Ex- 2867
treme SuperHyperReverse Strict Dimension Dominating isn’t well-defined if and only if its SuperHyperReverse 2868
Strict Dimension Dominating isn’t well-defined. 2869
Corollary 12.0.10. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Dimension 2870

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel).
Dominating 2871
Then its Extreme SuperHyperReverse Strict Dimension Dominating isn’t well-defined if and only if its 2872
SuperHyperReverse Strict Dimension Dominating isn’t well-defined. 2873
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2874
is well-defined if and only if its SuperHyperReverse Strict Dimension Dominating is
well-defined. 2876
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2877
Extreme SuperHyperReverse Strict Dimension Dominating is well-defined if and only if its SuperHyperReverse 2878
Strict Dimension Dominating is well-defined. 2879
Corollary 12.0.13. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Strict Dimension 2880

Dominating 2881
Then its Extreme SuperHyperReverse Strict Dimension Dominating is well-defined if and only if its 2882
SuperHyperReverse Strict Dimension Dominating is well-defined. 2883
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2884
(i) : the dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2885
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2886
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2887
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2888
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2889
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 2890
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2891
(i) : the SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2892
(ii) : the strong SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2893
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2894
(iv) : the δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2895

(v) : the strong δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2896
(vi) : the connected δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 2897
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2898

independent SuperHyperSet is 2899
(iii) : the connected SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2902
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2906

which is a SuperHyperReverse Strict Dimension Dominating/SuperHyperPath. Then V is a maximal 2907
(i) : SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2908
(ii) : strong SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2909
(iii) : connected SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2910
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2911
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2912
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2913
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2914
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2915
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2916
(i) : dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2917
(ii) : strong dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2918
(iii) : connected dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2919
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2920
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2921
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2922
which is a SuperHyperReverse Strict Dimension Dominating/SuperHyperPath. Then the number of 2925

(i) : the SuperHyperReverse Strict Dimension Dominating; 2926
(ii) : the SuperHyperReverse Strict Dimension Dominating; 2927
(iii) : the connected SuperHyperReverse Strict Dimension Dominating; 2928
(iv) : the O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 2929
(v) : the strong O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 2930
(vi) : the connected O(ESHG)-SuperHyperReverse Strict Dimension Dominating. 2931
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2932
coincide. 2933

which is a SuperHyperWheel. Then the number of 2935
(i) : the dual SuperHyperReverse Strict Dimension Dominating; 2936
(ii) : the dual SuperHyperReverse Strict Dimension Dominating; 2937
(iii) : the dual connected SuperHyperReverse Strict Dimension Dominating; 2938
(iv) : the dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 2939
(v) : the strong dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 2940
(vi) : the connected dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating. 2941
coincide. 2943

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2945
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2946
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2947
is a 2948
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2952
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2953
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 2954


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2957
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2958
SuperHyperPart is a 2959
(iv) : δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2963
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2964
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 2965

SuperHyperMultipartite. Then Then the number of 2968
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2975
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2976
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2978
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2979
(iv) : SuperHyperReverse Strict Dimension Dominating; 2983
(v) : strong 1-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 2984
(vi) : connected 1-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 2985

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2986
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2987
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2988
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2989

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

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

2 + 1)-SuperHyperDefensive SuperHyperReverse Strict Dimension Domin- 2996
ating. 2997
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2998
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2999
dual 3000
(iv) : 0-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 3004
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 3007
perComplete. Then there’s no independent SuperHyperSet. 3008
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 3009
perReverse Strict Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 3010
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 3011
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 3015
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 3016

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominat- 3017
ing. 3018
Proposition 12.0.30. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 3019
HyperStar/complete SuperHyperBipartite/complete SuperHyperMultiPartite. The number is 3020
O(ESHG:(V,E))
2 + 1 and the Extreme number is min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the 3021
t>
2
setting of a dual 3022


ating. 3029
Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 3030
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 3031
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 3032
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 3033
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 3034
SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such 3035

that 3036
(i) v ∈ Ns (x); 3037
(ii) vx ∈ E. 3038
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 3039
SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating, then 3040
(i) S is SuperHyperReverse Strict Dimension Dominating set; 3041
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 3042
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 3043
(i) Γ ≤ O; 3044
(ii) Γs ≤ On . 3045
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 3046
connected. Then 3047
(i) Γ ≤ O − 1; 3048

(ii) Γs ≤ On − Σ3i=1 σi (x). 3049
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 3050
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperReverse 3051
Strict Dimension Dominating; 3052
(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 3053
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 3054
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 3055
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 3057
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Strict Dimension 3058
Dominating; 3059
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 3060
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3061
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3062
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Strict Dimension Dominating. 3064
Then 3065
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 3066
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 3068
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 3069
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 3070
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse .

Then 3073

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 3077
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 3078
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 3080

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Strict Dimension Dominating; 3081
(ii) Γ = 1; 3082
(iii) Γs = Σ3i=1 σi (c); 3083
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Strict Dimension 3084
Dominating. 3085
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 3086
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 3087
SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 3088
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 3089
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 3090
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 3091
SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 3092
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 3093
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperReverse Strict 3094
Dimension Dominating; 3095
(ii) Γ = b n2 c + 1; 3096
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 3097
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 3098
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 3100
bn
2c
(ii) Γ = b n2 c; 3103

bnc ; 3104
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive SuperHy- 3105
perReverse Strict Dimension Dominating. 3106
Proposition 12.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Extreme SuperHyper- 3107

Stars with common Extreme SuperHyperVertex SuperHyperSet. Then 3108
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 3109
Strict Dimension Dominating for N SHF; 3110

(ii) Γ = m for N SHF : (V, E); 3111
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3112
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse Strict 3113
Dimension Dominating for N SHF : (V, E). 3114
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3115

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3116
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHy- 3117
perReverse Strict Dimension Dominating for N SHF; 3118
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 3119
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 3120
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=12
are only a dual maximal SuperHyperReverse Strict Dimension 3121
Dominating for N SHF : (V, E). 3122
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 3123
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3124
bn
2c
Dimension Dominating for N SHF : (V, E); 3126
(ii) Γ = b n2 c for N SHF : (V, E); 3127
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 3128
S={vi }i=1
bnc
are only dual maximal SuperHyperReverse Strict Dimension 3129
following statements hold; 3132
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Supe- 3133

rHyperReverse Strict Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 3134
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive 3136

SuperHyperReverse Strict Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHy- 3137
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Su- 3141

perHyperReverse Strict Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 3142


SuperHyperReverse Strict Dimension Dominating, then S is a dual s-SuperHyperPowerful SuperHy- 3145
Proposition 12.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Extreme 3147

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

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

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

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

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

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


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

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


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

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

SuperHyperGraph which is SuperHyperReverse Strict Dimension Dominating. Then following statements 3188
hold; 3189
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperReverse 3190
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 3192

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

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


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

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

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


CHAPTER 13 3209
Extreme Applications in Cancer’s 3210
Extreme Recognition 3211
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3212
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3213
as the consequences of the model, some parameters are used. The cells are under attack of this 3214
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3215
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3216
In the following, some Extreme steps are Extreme devised on this disease. 3217
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3218
function. 3219
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3220
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3221
is identified by this research. Sometimes the move of the cancer hasn’t be easily identified 3222
since there are some determinacy, indeterminacy and neutrality about the moves and the 3223
effects of the cancer on that region; this event leads us to choose another model [it’s said 3224
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3225
what’s done. 3226
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3227
they’ve got the names, and some general Extreme models. The moves and the Extreme 3228
traces of the cancer on the complex tracks and between complicated groups of cells could 3229
be fantasized by an Extreme SuperHyperPath(-/SuperHyperReverse Strict Dimension Dominating, 3230
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3231
aim is to find either the Extreme SuperHyperReverse Strict Dimension Dominating or the Extreme 3232
SuperHyperReverse Strict Dimension Dominating in those Extreme Extreme SuperHyperModels. 3233
143
CHAPTER 14 3234
Case 1: The Initial Extreme Steps 3235
Toward Extreme SuperHyperBipartite 3236
as Extreme SuperHyperModel 3237
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3238
is Extreme highlighted and Extreme featured. 3239
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3240
partite is obtained. 3241
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3242
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperReverse Strict Dimension Dominating 136NSHGaa21aa
145
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3246
Case 2: The Increasing Extreme Steps 3247
Toward Extreme 3248
SuperHyperMultipartite as Extreme 3249
SuperHyperModel 3250
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3251
ite is Extreme highlighted and Extreme featured. 3252
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3253
partite is obtained. 3254
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3255
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 3256

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

CHAPTER 16 3259
Wondering Open Problems But As The 3260
Directions To Forming The Motivations 3261
In what follows, some “problems” and some “questions” are proposed. 3262
The SuperHyperReverse Strict Dimension Dominating and the Extreme SuperHyperReverse Strict Dimension 3263
Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 3264
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3265
recognitions? 3266
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Strict Dimension 3267
and the Extreme SuperHyperReverse Strict Dimension Dominating?
Dominating 3268
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3269
them? 3270
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse Strict 3271
and the Extreme SuperHyperReverse Strict Dimension Dominating?
Problem 16.0.5. The SuperHyperReverse Strict Dimension Dominating and the Extreme SuperHyperReverse 3273
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperReverse Strict Dimension Dominating, are there else? 3275
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3276
Numbers types-results? 3277
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3278
the multiple types of SuperHyperNotions? 3279
149
CHAPTER 17 3280
Conclusion and Closing Remarks 3281
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3282
research are illustrated. Some benefits and some advantages of this research are highlighted. 3283
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3284
In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse Strict Dimension 3285
Dominating. For that sake in the second definition, the main definition of the Extreme 3286
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3287
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperReverse 3288
Strict Dimension Dominating, finds the convenient background to implement some results based on 3289
that. Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this 3290
research on the modeling of the regions where are under the attacks of the cancer to recognize 3291
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 3292
the SuperHyperNotion, SuperHyperReverse Strict Dimension Dominating, the new SuperHyperClasses 3293
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 3294
the SuperHyperReverse Strict Dimension Dominating and the Extreme SuperHyperReverse Strict Dimension 3295
Dominating. The clarifications, instances and literature reviews have taken the whole way through. 3296
In this research, the literature reviews have fulfilled the lines containing the notions and the 3297
results. The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on 3298
the “Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3299
of the moves of the cancer in the longest and strongest styles with the formation of the design and 3302
the architecture are formally called “ SuperHyperReverse Strict Dimension Dominating” in the themes of 3303
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 3304
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 3305
for this research are, figured out, pointed out and spoken out. 3306
151
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperReverse Strict Dimension Dominating
3. Extreme SuperHyperReverse Strict Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3307
Extreme SuperHyperDuality But As The 3308
Extensions Excerpt From Dense And 3309
Super Forms 3310
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3311

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

Va ∈ Ei , Ej ; 3315
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3316
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3317
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3318
Vi , Vj ∈ Ea ; 3319
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3320
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3321
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3322
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3323

SuperHyperDuality. 3324
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3325

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3330
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3331
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3332
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3333
Extreme SuperHyperDuality; 3334
153
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3335

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3336
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3337
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3340
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3341

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3342
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3343
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3344
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3345
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3346
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3348
coefficient; 3349
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3350

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

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

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

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

of Extreme e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v- 3373
SuperHyperDuality, and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme 3374
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 3375
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 3376
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 3377

cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 3378

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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3386
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3387
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3388
Extreme coefficient. 3389
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3390
mentioned Extreme Figures in every Extreme items. 3391
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3392
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3393
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3394
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3395
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3396
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- 3400
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3401
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3402
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3403
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3404
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3405
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3406


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

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 3450
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 3453
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3454
(31.1), is the SuperHyperDuality. 3457
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 3459
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.2), is the Extreme SuperHyperDuality. 3466
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 3468
P : ViEXT ERN AL , Ei , CEN T ER, VjEXT ERN AL .



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3476
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 3478
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. 3482
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3483
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3484
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3485
representative in the 3486
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 : 3487

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

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 3498
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3499

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

Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 3503
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 3504
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. 3516
Proposition 18.0.14. Assume a connected Extreme SuperHyperWheel ESHW : (V, E). Then, 3517
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 3518
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 : 3519

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

∃!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 3524
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3525
Extreme SuperHyperDuality. 3531

CHAPTER 19 3532
Extreme SuperHyperJoin But As The 3533
Super Forms 3535
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3536

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3547
|Vj |Extreme CARDINALITY ; 3548
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3549
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3550
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3551

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3555
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3556
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3557
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3558
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3559
167
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3560

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3567
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3568
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3569
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3570
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3571
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3572
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3573
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3574

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3590
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3591
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3593
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3594
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3595

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3598

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

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

SuperHyperJoin. 3619
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 3621
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3622
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3623
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3624
V3 , is excluded in every given Extreme SuperHyperJoin. 3626

is up. The Extreme Algorithm is Extremely straightforward. 3628


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 3670
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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


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

SuperHyperModel (31.2), is the Extreme SuperHyperJoin. 3686
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 3688



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperJoin. 3696
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 3698
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 3702
no at least one SuperHyperJoin. Thus the notion of quasi may be up but the SuperHyperNotions 3703
based on SuperHyperJoin could be applied. There are only two SuperHyperParts. Thus every 3704
SuperHyperPart could have one SuperHyperVertex as the representative in the 3705
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Extreme SuperHyperBipartite ESHB : 3706

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

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


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 3723
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. 3734

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

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

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

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

CHAPTER 20 3749
Extreme SuperHyperPerfect But As The 3750
Super Forms 3752
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3753

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3765
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3766

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3770
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3771
Extreme SuperHyperPerfect; 3775
181
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3776

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3783
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3784
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3789
coefficient; 3790
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3791

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3827
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3828
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3829
Extreme coefficient. 3830
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3833
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3834
SuperHyperPerfect. 3840
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 3842
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3843
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3847


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

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 3891
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3895
(31.1), is the SuperHyperPerfect. 3898
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 3900
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperPerfect. 3917
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 3919
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 3923
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 3924
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 3925
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperBipartite ESHB : 3928

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

Then 3938

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 3939
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Extreme SuperHyperMultipartite 3940



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 3943
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 3944
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 3945
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. 3957
C(N SHG)Extreme SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

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


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

CHAPTER 21 3973
Extreme SuperHyperTotal But As The 3974
Super Forms 3976
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3977
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3980
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3981

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3987
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3988

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3992
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3995
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3996
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3997

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 4012
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 4014
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 4015
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 4016
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 4018
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 4019

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 4020
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 4023
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 4024
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 4025

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 4032
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 4033
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 4036
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 4037
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 4038
coefficient; 4039
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 4040

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 4043
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 4044
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 4045
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 4047
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 4050
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 4051
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 4052
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 4053
SuperHyperTotal. 4057
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 4059
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 4060
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 4061
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 4062
V3 , is excluded in every given Extreme SuperHyperTotal. 4064



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 4108
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4112
(31.1), is the SuperHyperTotal. 4115
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 4117
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. 4124
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 4126
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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 4136
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

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

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 4155
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperMultipartite 4156



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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperTotal. 4172
∗
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 4174
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Extreme SuperHyperWheel ESHW : 4175



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

CHAPTER 22 4188
Extreme SuperHyperConnected But As 4189
Super Forms 4191
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4192

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4206
SuperHyperConnected. 4207
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4208
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4211

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4225
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4226
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4227
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4228
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4229
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4231
corresponded to its Extreme coefficient; 4232
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4233


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

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

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

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

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

SuperHyperVertices such that they form the Extreme SuperHyperConnected; and the 4262
(viii) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4264


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

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 4284
E3 are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 4285
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperConnected. 4289


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

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. 4305

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 4333
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. 4337
(31.1), is the SuperHyperConnected. 4340
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 4342
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. 4349
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 4351



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperConnected. 4359
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 4361
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4370

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4371
SuperHyperPart SuperHyperEdges are attained in any solution 4372
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4378
Then 4380
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 4381
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4382


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

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
the Extreme SuperHyperConnected. 4399
∗
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 4401
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperWheel 4402

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4405
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4406
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4407
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4408
some representatives. The latter is straightforward. 4409
Extreme SuperHyperConnected. 4414

CHAPTER 23 4415
Background 4416
223










HG291; HG292; HG293; HG294; HG295], there are some endeavors to formalize the basic 4580
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 4581
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 4582



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

HG287; HG288; HG289; HG290; HG291; HG292; HG293; HG294; HG295] alongside 4636

HG186b; HG187b]. Two popular scientific research books in Scribd ,in the terms of high 4652

Bibliography 4654

10.33140/JMTCM.01.03.09) 4683
229
10.20944/preprints202301.0282.v1). 4699
10.20944/preprints202301.0267.v1). 4702
(doi: 10.20944/preprints202301.0265.v1). 4707
prints202301.0262.v1). 4711
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4717

prints202301.0105.v1). 4720

Preprints 2023, 2023010044 4726
10.20944/preprints202301.0043.v1). 4729

(doi: 10.20944/preprints202212.0549.v1). 4738
(doi: 10.20944/preprints202212.0500.v1). 4745
(doi: 10.5281/zenodo.8088438). 4754
2023, (doi: 10.5281/zenodo.8088387). 4757
10.5281/zenodo.8084436). 4760

2023, (doi: 10.5281/zenodo.8084420). 4763
10.5281/zenodo.8080100). 4766
10.5281/zenodo.8080068). 4769
(doi: 10.5281/zenodo.8078445). 4772
2023, (doi: 10.5281/zenodo.8078543). 4775
10.5281/zenodo.8076416). 4778
2023, (doi: 10.5281/zenodo.8076399). 4781
(doi: 10.5281/zenodo.8072171). 4784
2023, (doi: 10.5281/zenodo.8072267). 4787
10.5281/zenodo.8067384). 4790
2023, (doi: 10.5281/zenodo.8067409). 4793
10.5281/zenodo.8061927). 4796
10.5281/zenodo.8062016). 4799

10.5281/zenodo.8057696). 4802
2023, (doi: 10.5281/zenodo.8057753). 4805
10.5281/zenodo.8052893). 4808
2023, (doi: 10.5281/zenodo.8052925). 4811
10.5281/zenodo.8051346). 4814
10.5281/zenodo.8051360). 4817
10.5281/zenodo.8025707). 4820
10.5281/zenodo.8027275). 4823
odo.8017246). 4826
10.5281/zenodo.8020128). 4829
odo.7978571). 4832
10.5281/zenodo.7978857). 4835
10.5281/zenodo.7940830). 4838

10.5281/zenodo.7943578). 4841
odo.7916595). 4844
odo.7923632). 4847
(doi: 10.5281/zenodo.7904698). 4850
2023, (doi: 10.5281/zenodo.7904671). 4853
10.5281/zenodo.7871026). 4862
2023, (doi: 10.5281/zenodo.7874647). 4865
10.5281/zenodo.7857856). 4868
2023, (doi: 10.5281/zenodo.7857841). 4871

10.5281/zenodo.7853867). 4880
10.5281/zenodo.7853922). 4883
(doi: 10.5281/zenodo.7851519). 4886
(doi: 10.5281/zenodo.7851550). 4889
10.5281/zenodo.7834229). 4898
10.5281/zenodo.7834261). 4901
10.5281/zenodo.7824560). 4904

(doi: 10.5281/zenodo.7824623). 4907

2023, (doi: 10.5281/zenodo.7809365). 4918
2023, (doi: 10.5281/zenodo.7809358). 4921
10.5281/zenodo.7809219). 4924
10.5281/zenodo.7809328). 4927
2023, (doi: 10.5281/zenodo.7806767). 4930
2023, (doi: 10.5281/zenodo.7806838). 4933
10.5281/zenodo.7799902). 4942
(doi: 10.5281/zenodo.7804218). 4945
(doi: 10.5281/zenodo.7796334). 4948
10.5281/zenodo.7791952). 4954

10.5281/zenodo.7791982). 4957
10.5281/zenodo.7790026). 4960
10.5281/zenodo.7790052). 4963
2023, (doi: 10.5281/zenodo.7787066). 4966
10.5281/zenodo.7781476). 4972
10.5281/zenodo.7783082). 4975
10.5281/zenodo.7777857). 4978
10.5281/zenodo.7779286). 4981
(doi: 10.5281/zenodo.7771831). 4984
2023, (doi: 10.5281/zenodo.7772468). 4987
10.13140/RG.2.2.20913.25446). 4990
odo.7764916). 4993

10.13140/RG.2.2.11770.98247). 4996
10.13140/RG.2.2.12400.12808). 4999
2023, (doi: 10.13140/RG.2.2.22545.10089). 5002
10.13140/RG.2.2.11377.76644). 5008
10.13140/RG.2.2.23750.96329). 5011
10.13140/RG.2.2.31366.24641). 5014
10.13140/RG.2.2.34721.68960). 5017
2023, (doi: 10.13140/RG.2.2.30212.81289). 5020
10.13140/RG.2.2.24288.35842). 5026
10.13140/RG.2.2.32467.25124). 5029
10.13140/RG.2.2.31025.45925). 5032

10.13140/RG.2.2.17184.25602). 5035
10.13140/RG.2.2.23423.28327). 5038
10.13140/RG.2.2.28456.44805). 5041
10.13140/RG.2.2.23525.68320). 5044
10.13140/RG.2.2.20170.24000). 5047
10.13140/RG.2.2.36475.59683). 5050
10.13140/RG.2.2.29764.71046). 5053
2023, (doi: 10.13140/RG.2.2.18780.87683). 5056
10.13140/RG.2.2.26134.01603). 5062
10.13140/RG.2.2.27392.30721). 5065
10.13140/RG.2.2.33028.40321). 5068
10.13140/RG.2.2.21389.20966). 5071

10.13140/RG.2.2.16356.04489). 5074
10.13140/RG.2.2.21756.21129). 5077
10.13140/RG.2.2.30983.68009). 5080
10.13140/RG.2.2.28552.29445). 5083
(doi: 10.13140/RG.2.2.10936.21761). 5086
10.13140/RG.2.2.35105.89447). 5089
(doi: 10.13140/RG.2.2.30072.72960). 5092
10.13140/RG.2.2.31147.52003). 5095
10.13140/RG.2.2.32825.24163). 5098
10.13140/RG.2.2.13059.58401). 5101
10.13140/RG.2.2.11172.14720). 5104
2023, (doi: 10.13140/RG.2.2.22011.80165). 5107
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 5110

2023, (doi: 10.13140/RG.2.2.10493.84962). 5113
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 5116
2023, (doi: 10.13140/RG.2.2.19944.14086). 5119
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 5122
(doi: 10.13140/RG.2.2.33103.76968). 5125
(doi: 10.13140/RG.2.2.23037.44003). 5128
(doi: 10.13140/RG.2.2.35646.56641). 5131
10.13140/RG.2.2.18030.48967). 5134
(doi: 10.13140/RG.2.2.13973.81121). 5137
2023, (doi: 10.13140/RG.2.2.34106.47047). 5140
2023, (doi: 10.13140/RG.2.2.31956.88961). 5146
2023, (doi: 10.13140/RG.2.2.15179.67361). 5149

10.13140/RG.2.2.21510.45125). 5152
2023, (doi: 10.13140/RG.2.2.13121.84321). 5155
10.13140/RG.2.2.11758.69441). 5158
2023, (doi: 10.13140/RG.2.2.31891.35367). 5161
10.13140/RG.2.2.19360.87048). 5164
10.13140/RG.2.2.32363.21286). 5167
10.13140/RG.2.2.23266.81602). 5170
10.13140/RG.2.2.19911.37285). 5173
10.13140/RG.2.2.11050.90569). 5176
2023, (doi: 10.13140/RG.2.2.17761.79206). 5179
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5185
(doi: 10.13140/RG.2.2.30182.50241). 5188

2023, (doi: 10.13140/RG.2.2.17252.24968). 5221

2023010396 (doi: 10.20944/preprints202301.0396.v1). 5230
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5233



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

10.20944/preprints202301.0282.v1). 5254
10.20944/preprints202301.0267.v1).). 5257
(doi: 10.20944/preprints202301.0265.v1). 5262
prints202301.0262.v1). 5266


2023010224, (doi: 10.20944/preprints202301.0224.v1). 5272

10.13140/RG.2.2.35061.65767). 5275

10.13140/RG.2.2.18494.15680). 5279

10.13140/RG.2.2.32530.73922). 5283

10.13140/RG.2.2.15897.70243). 5287

10.13140/RG.2.2.32530.73922). 5291

prints202301.0105.v1). 5294

10.13140/RG.2.2.23172.19849). 5301


10.13140/RG.2.2.17385.36968). 5311
Preprints 2023, 2023010044 5314
10.20944/preprints202301.0043.v1). 5317
2023, (doi: 10.13140/RG.2.2.28945.92007). 5320
10.13140/RG.2.2.35774.77123). 5326

10.13140/RG.2.2.29430.88642). 5332
(doi: 10.20944/preprints202212.0549.v1). 5338
10.13140/RG.2.2.19380.94084). 5341

(doi: 10.20944/preprints202212.0500.v1). 5352
10.13140/RG.2.2.20993.12640). 5355


10.13140/RG.2.2.29173.86244). 5370
2023 (doi: 10.5281/zenodo.8086310). 5377
2023 (doi: 10.5281/zenodo.8080167). 5379

2023 (doi: 10.5281/zenodo.8076449). 5383
2023 (doi: 10.5281/zenodo.8067469). 5387
(doi: 10.5281/zenodo.8062076). 5389
2023 (doi: 10.5281/zenodo.8052976). 5393
(doi: 10.5281/zenodo.8051368). 5395
(doi: 10.5281/zenodo.8027488). 5397
10.5281/zenodo.8020181). 5399
10.5281/zenodo.7978921). 5401
odo.7943878). 5403
10.5281/zenodo.7943871). 5405
10.5281/zenodo.7923786). 5407
2023 (doi: 10.5281/zenodo.7905287). 5409

2023 (doi: 10.5281/zenodo.7874677). 5413
(doi: 10.5281/zenodo.7857906). 5415

2023 (doi: 10.5281/zenodo.7856329). 5417
10.5281/zenodo.7854561). 5419
2023 (doi: 10.5281/zenodo.7851893). 5421

(doi: 10.5281/zenodo.7835063). 5425
(doi: 10.5281/zenodo.7826705). 5427
2023 (doi: 10.5281/zenodo.7820680). 5429
10.5281/zenodo.7812750). 5431

2023 (doi: 10.5281/zenodo.7807782). 5437
2023 (doi: 10.5281/zenodo.7804449). 5439

(doi: 10.5281/zenodo.7792307). 5443
(doi: 10.5281/zenodo.7790728). 5445
2023 (doi: 10.5281/zenodo.7787712). 5447
10.5281/zenodo.7783791). 5449
10.5281/zenodo.7780123). 5451

(doi: 10.5281/zenodo.7773119). 5453
odo.7637762). 5455
10.5281/zenodo.7766174). 5457
10.5281/zenodo.7762232). 5459
(doi: 10.5281/zenodo.7758601). 5461
10.5281/zenodo.7754661). 5463
10.5281/zenodo.7750995) . 5465
(doi: 10.5281/zenodo.7749875). 5467
10.5281/zenodo.7747236). 5469
10.5281/zenodo.7742587). 5471
(doi: 10.5281/zenodo.7738635). 5473
10.5281/zenodo.7734719). 5475
10.5281/zenodo.7730484). 5477
(doi: 10.5281/zenodo.7730469). 5479
10.5281/zenodo.7722865). 5481
odo.7713563). 5483
odo.7709116). 5485
10.5281/zenodo.7706415). 5487

10.5281/zenodo.7706063). 5489
10.5281/zenodo.7701906). 5491
odo.7700205). 5493
10.5281/zenodo.7694876). 5495
10.5281/zenodo.7679410). 5497
10.5281/zenodo.7675982). 5499
10.5281/zenodo.7672388). 5501
odo.7668648). 5503
10.5281/zenodo.7662810). 5505
10.5281/zenodo.7659162). 5507
odo.7653233). 5509
odo.7653204). 5511
odo.7653142). 5513
odo.7653117). 5515
odo.7651687). 5518
odo.7651619). 5520
odo.7651439). 5522

odo.7650729). 5524
odo.7647868). 5526
odo.7647017). 5528
odo.7644894). 5530
odo.7632923). 5533
odo.7623459). 5535
10.5281/zenodo.7606416). 5537
10.5281/zenodo.7606416). 5539
odo.7606404). 5541
10.5281/zenodo.7580018). 5543
odo.7580018). 5545
odo.7580018). 5547
odo.7579929). 5549
10.5281/zenodo.7563170). 5551
odo.7563164). 5553
odo.7563160). 5555
odo.7563160). 5557

10.5281/zenodo.7563160). 5559
10.5281/zenodo.7557063). 5561
10.5281/zenodo.7557009). 5563
10.5281/zenodo.7539484). 5565
10.5281/zenodo.7523390). 5567
10.5281/zenodo.7523390). 5569
10.5281/zenodo.7523390). 5571
odo.7574952). 5573
10.5281/zenodo.7574992). 5575
odo.7523357). 5577
10.5281/zenodo.7523357). 5579
10.5281/zenodo.7504782). 5581
10.5281/zenodo.7504782). 5583
10.5281/zenodo.7504782). 5585
10.5281/zenodo.7499395). 5587
odo.7499395). 5589
10.5281/zenodo.7499395). 5591
10.5281/zenodo.7497450). 5593

10.5281/zenodo.7497450). 5595
10.5281/zenodo.7494862). 5597
odo.7494862). 5599
10.5281/zenodo.7494862). 5601
10.5281/zenodo.7493845). 5603
odo.7493845). 5605
10.5281/zenodo.7493845). 5607
odo.7539484). 5609
odo.7523390). 5611
odo.7523357). 5613
odo.7504782). 5615
odo.7499395). 5617
odo.7497450). 5619
odo.7494862). 5621
odo.7493845). 5623
odo.7480110). 5625
odo.7378758). 5627
odo.6320305). 5629

odo.6677173). 5631

CHAPTER 24 5632
Cancer In Neutrosophic 5633
SuperHyperGraph 5634
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5635
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5636
disease is considered and as the consequences of the model, some parameters are used. The cells 5637
are under attack of this disease but the moves of the cancer in the special region are the matter 5638
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5639
treatments for this Neutrosophic disease. 5640
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5641
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5642
term Neutrosophic function. 5643
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5644
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5645
move from the cancer is identified by this research. Sometimes the move of the cancer 5646
about the moves and the effects of the cancer on that region; this event leads us to 5648
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5649
perception on what’s happened and what’s done. 5650
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5651
known and they’ve got the names, and some general Neutrosophic models. The moves 5652
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5653
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5654
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5655
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5656
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5657
Models. 5658
Some cells have been faced with some attacks from the situation which is caused by the 5659
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5660
which in that, the cells could be labelled as some groups and some groups or individuals have 5661
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5662
the embedded situations, the individuals of cells and the groups of cells could be considered 5663
257
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5664
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5665
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5666
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5667
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5668
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5669
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5670
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5671
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5672
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5673
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5674
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5675
out what’s going on this phenomenon. The special case of this disease is considered and as the 5676
consequences of the model, some parameters are used. The cells are under attack of this disease 5677
but the moves of the cancer in the special region are the matter of mind. The recognition of 5678
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5679
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5680
both bases are the background of this research. Sometimes the cancer has been happened on the 5681
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5682
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5683
in the forms of alliances’ styles with the formation of the design and the architecture are 5684
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5685
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5686
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5687
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5688
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5689
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5690
names, and some general models. The moves and the traces of the cancer on the complex tracks 5694
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5695
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5696
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5697
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5698
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5699
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5700
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5701
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5702
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5703
Question 24.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 5704
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5705
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5706
based on the fixed groups of cells or the fixed groups of group of cells? 5707
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5708

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5712
Then the research has taken more motivations to define SuperHyperClasses and to find some 5713
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5714
some instances and examples to make clarifications about the framework of this research. The 5715
general results and some results about some connections are some avenues to make key point of 5716
this research, “Cancer’s Recognition”, more understandable and more clear. 5717
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5718
research on the modeling of the regions where are under the attacks of the cancer to 5719
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5720
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5721
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5722
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5723

instances and literature reviews have taken the whole way through. In this scientific research, 5724
the literature reviews have fulfilled the lines containing the notions and the results. The 5725
SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5726
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 5727
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In 5728
this scientific segment, the SuperHyperModel proposes some SuperHyperNotions based on the 5729
connectivities of the moves of the cancer in the longest and strongest styles with the formation of 5730
the design and the architecture are formally called “ SuperHyperK-Domination” in the themes 5731
of jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles 5732
to figure out the background for the SuperHyperNotions. 5733

CHAPTER 25 5734
Neutrosophic Reverse Strict Dimension 5735
Dominating 5736
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5737
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5738
2023, (doi: 10.13140/RG.2.2.34953.52320). 5739
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5740
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5741
(doi: 10.13140/RG.2.2.33275.80161). 5742
10.13140/RG.2.2.11050.90569). 5745
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5746
10.13140/RG.2.2.17761.79206). 5748
10.13140/RG.2.2.19911.37285). 5751
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5752
10.13140/RG.2.2.23266.81602). 5754
10.13140/RG.2.2.19360.87048). 5757
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5758
10.13140/RG.2.2.32363.21286). 5760
10.13140/RG.2.2.11758.69441). 5763
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5764
10.13140/RG.2.2.31891.35367). 5766
261

10.13140/RG.2.2.21510.45125). 5769
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5770
10.13140/RG.2.2.13121.84321). 5772

CHAPTER 26 5773
New Ideas In Recognition of Cancer And 5774
Neutrosophic SuperHyperGraph By 5775
Reverse Strict Dimension Dominating As 5776
Hyper Dimple On Super Dimity 5777
263
CHAPTER 27 5778
ABSTRACT 5779
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 5780
Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Strict Dimension 5781
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5782
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Strict 5783
Dimension Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Strict 5784
Dimension Dominating criteria holds 5785

Neutrosophic re-SuperHyperReverse Strict Dimension Dominating if the following expression is called 5786
Neutrosophic e-SuperHyperReverse Strict Dimension Dominating criteria holds 5787

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

SuperHyperReverse Strict Dimension Dominating if the following expression is called Neutrosophic 5789
v-SuperHyperReverse Strict Dimension Dominating criteria holds 5790

Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating if the following expression is called 5791
Neutrosophic v-SuperHyperReverse Strict Dimension Dominating criteria holds 5792

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Supe- 5793
rHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Di- 5794
mension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v- 5795
Dominating. ((Neutrosophic) SuperHyperReverse Strict Dimension Dominating). Assume a Neutrosophic 5797
265
SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider a Neutrosophic SuperHyperEdge 5798

(NSHE) E = {V1 , V2 , . . . , Vs }. Then E is called an Extreme SuperHyperReverse Strict Dimension 5799
Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 5800
Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Ex- 5803
treme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperEdges in the 5804
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices 5805
such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; a Neutrosophic 5806
SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict 5807
Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic v- 5808
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum 5810
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 5811
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 5812
SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse Strict Dimension Domin- 5813
ating; an Extreme SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial if it’s either of 5814
rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 5817
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 5818
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 5819
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme SuperHy- 5820
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 5821
Strict Dimension Dominating; and the Extreme power is corresponded to its Extreme coefficient; a 5822
Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial if it’s either of 5823
rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyper- 5826
Graph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5827
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5828
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5829
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5830
such that they form the Neutrosophic SuperHyperReverse Strict Dimension Dominating; and the Neutro- 5831
sophic power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse 5832
Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, 5833
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an 5836
Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in 5837
the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyperVer- 5838
tices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; a Neutrosophic 5839
V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse 5840
Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 5841
v-SuperHyperReverse Strict Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension 5842
Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the max- 5843


SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 5845
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 5846
Strict Dimension Dominating; an Extreme V-SuperHyperReverse Strict Dimension Dominating SuperHyperPoly- 5847
nomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic 5848
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5851
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5852
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme car- 5853
dinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that 5854
they form the Extreme SuperHyperReverse Strict Dimension Dominating; and the Extreme power is 5855
corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Strict Dimension Dominating 5856
SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, 5857
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolyno- 5860
mial contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 5861
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Super- 5862

HyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 5863
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperReverse 5864
Strict Dimension Dominating; and the Neutrosophic power is corresponded to its Neutrosophic coeffi- 5865
cient. In this scientific research, new setting is introduced for new SuperHyperNotions, namely, 5866
a SuperHyperReverse Strict Dimension Dominating and Neutrosophic SuperHyperReverse Strict Dimension 5867
Dominating. Two different types of SuperHyperDefinitions are debut for them but the research 5868
about the theoretical aspect of this ongoing research. The “Cancer’s Recognition” are the 5875
under research to figure out the challenges make sense about ongoing and upcoming research. 5876
The special case is up. The cells are viewed in the deemed ways. There are different types 5877
of them. Some of them are individuals and some of them are well-modeled by the group of 5878
SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognition”. Thus 5881
these complex and dense SuperHyperModels open up some avenues to research on theoretical 5882
segments and “Cancer’s Recognition”. Some avenues are posed to pursue this research. It’s 5883
also officially collected in the form of some questions and some problems. Assume a Super- 5884
HyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Strict Dimension Dominating 5885

following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5887
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5888
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if 5889

S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Strict Dimension Dominating is 5890

a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5891
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5892
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5893
and |S ∩N (s)|N eutrosophic < |S ∩(V \N (s))|N eutrosophic +δ. The first Expression, holds if S is a 5894
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a SuperHyperReverse 5896

Strict Dimension Dominating . Since there’s more ways to get type-results to make a SuperHyperReverse 5897
Strict Dimension Dominating more understandable. For the sake of having Neutrosophic SuperHy- 5898
perReverse Strict Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHyperReverse 5899
Strict Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned by the 5900
labels from the letters of the alphabets. In this procedure, there’s the usage of the position of la- 5901
bels to assign to the values. Assume a SuperHyperReverse Strict Dimension Dominating . It’s redefined a 5902
Neutrosophic SuperHyperReverse Strict Dimension Dominating if the mentioned Table holds, concerning, 5903
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to 5904
The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The 5905
Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum Values of Its 5906
Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, “The Values of The 5907
HyperEdges&The maximum Values of Its Vertices”, “The Values of The SuperHyperEdges&The 5908
maximum Values of Its Endpoints”. To get structural examples and instances, I’m going to intro- 5909
duce the next SuperHyperClass of SuperHyperGraph based on a SuperHyperReverse Strict Dimension 5910
Dominating . It’s the main. It’ll be disciplinary to have the foundation of previous definition in the 5911
kind of SuperHyperClass. If there’s a need to have all SuperHyperReverse Strict Dimension Dominating 5912
until the SuperHyperReverse Strict Dimension Dominating, then it’s officially called a “SuperHyperReverse 5913
Strict Dimension Dominating” but otherwise, it isn’t a SuperHyperReverse Strict Dimension Dominating . There 5914
are some instances about the clarifications for the main definition titled a “SuperHyperReverse 5915
Strict Dimension Dominating ”. These two examples get more scrutiny and discernment since there are 5916
characterized in the disciplinary ways of the SuperHyperClass based on a SuperHyperReverse 5917
Strict Dimension Dominating . For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension 5918
Dominating, there’s a need to “redefine” the notion of a “Neutrosophic SuperHyperReverse Strict 5919
Dimension Dominating” and a “Neutrosophic SuperHyperReverse Strict Dimension Dominating ”. The Supe- 5920
rHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the 5921
Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 5923
if the intended Table holds. And a SuperHyperReverse Strict Dimension Dominating are redefined to 5924
a “Neutrosophic SuperHyperReverse Strict Dimension Dominating” if the intended Table holds. It’s 5925
get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Strict Dimension Dominating 5927
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5928
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 5929
Strict Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and 5930
SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse 5931

Strict Dimension Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, 5932
Table holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Strict Dimension Dominat- 5934
ing” where it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse 5935

Strict Dimension Dominating amid the maximum value amid all SuperHyperVertices from a Supe- 5936
rHyperReverse Strict Dimension Dominating .] SuperHyperReverse Strict Dimension Dominating . A graph is a 5937
SuperHyperUniform if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges 5938
are the same. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses 5939
as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given 5940
SuperHyperEdges with two exceptions; it’s SuperHyperReverse Strict Dimension Dominating if it’s only 5941
one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s 5942
only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s 5943
in redeemed ways. The recognition of the cancer in the long-term function. The specific 5958
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of 5959
the move from the cancer is identified by this research. Sometimes the move of the cancer 5960
about the moves and the effects of the cancer on that region; this event leads us to choose 5962
another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient perception 5963
on what’s happened and what’s done. There are some specific models, which are well-known 5964
and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and 5965
the traces of the cancer on the complex tracks and between complicated groups of cells could 5966
be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Dimension Dominating, 5967
is to find either the longest SuperHyperReverse Strict Dimension Dominating or the strongest Super- 5969
HyperReverse Strict Dimension Dominating in those Neutrosophic SuperHyperModels. For the longest 5970
SuperHyperReverse Strict Dimension Dominating, called SuperHyperReverse Strict Dimension Dominating, and 5971
the strongest SuperHyperReverse Strict Dimension Dominating, called Neutrosophic SuperHyperReverse 5972
Strict Dimension Dominating, some general results are introduced. Beyond that in SuperHyperStar, 5973
all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s 5974
essential to have at least three SuperHyperEdges to form any style of a SuperHyperReverse Strict 5975
Dimension Dominating. There isn’t any formation of any SuperHyperReverse Strict Dimension Dominating 5976
but literarily, it’s the deformation of any SuperHyperReverse Strict Dimension Dominating. It, literarily, 5977
deforms and it doesn’t form. A basic familiarity with Neutrosophic SuperHyperReverse Strict 5978
Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic SuperHyperGraphs theory are 5979
proposed. 5980
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Strict Dimension Dominating, Can- 5981

cer’s Neutrosophic Recognition 5982


CHAPTER 28 5984
Applied Notions Under The Scrutiny Of 5985
The Motivation Of This Scientific 5986
Research 5987
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5988
try to bring the motivations in the narrative ways. Some cells have been faced with some 5989
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5990
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5991
as some groups and some groups or individuals have excessive labels which all are raised from 5992
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5993
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5994
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5995
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5996
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5997
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5998
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5999
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 6000
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 6001
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 6002
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 6003
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 6004
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 6005
is the disease but the model is going to figure out what’s going on this phenomenon. The special 6006
case of this disease is considered and as the consequences of the model, some parameters are used. 6007
The cells are under attack of this disease but the moves of the cancer in the special region are the 6008
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 6009
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 6010
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 6011
of the moves of the cancer in the forms of alliances’ styles with the formation of the design and 6014
the architecture are formally called “ SuperHyperReverse Strict Dimension Dominating” in the themes of 6015
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 6016
271
figure out the background for the SuperHyperNotions. The recognition of the cancer in the long- 6017
term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] 6018
and the long cycle of the move from the cancer is identified by this research. Sometimes the 6019
move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy 6020
and neutrality about the moves and the effects of the cancer on that region; this event leads us 6021
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 6022
perception on what’s happened and what’s done. There are some specific models, which are 6023
well-known and they’ve got the names, and some general models. The moves and the traces of 6024
the cancer on the complex tracks and between complicated groups of cells could be fantasized by 6025
a Neutrosophic SuperHyperPath (-/SuperHyperReverse Strict Dimension Dominating, SuperHyperStar, 6026
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 6027
the optimal SuperHyperReverse Strict Dimension Dominating or the Neutrosophic SuperHyperReverse 6028
Strict Dimension Dominating in those Neutrosophic SuperHyperModels. Some general results are 6029
introduced. Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s 6030
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 6031
SuperHyperEdges to form any style of a SuperHyperReverse Strict Dimension Dominating. There isn’t 6032
any formation of any SuperHyperReverse Strict Dimension Dominating but literarily, it’s the deformation 6033
of any SuperHyperReverse Strict Dimension Dominating. It, literarily, deforms and it doesn’t form. 6034
Question 28.0.1. How to define the SuperHyperNotions and to do research on them to find 6035
the “ amount of SuperHyperReverse Strict Dimension Dominating” of either individual of cells or the 6036
groups of cells based on the fixed cell or the fixed group of cells, extensively, the “amount of 6037
SuperHyperReverse Strict Dimension Dominating” based on the fixed groups of cells or the fixed groups of 6038
group of cells? 6039
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 6040
these messy and dense SuperHyperModels where embedded notions are illustrated? 6041
Thus it motivates us to define different types of “ SuperHyperReverse Strict Dimension Dominating” 6043
and “Neutrosophic SuperHyperReverse Strict Dimension Dominating” on “SuperHyperGraph” and 6044
“Neutrosophic SuperHyperGraph”. Then the research has taken more motivations to define 6045
SuperHyperClasses and to find some connections amid this SuperHyperNotion with other 6046
SuperHyperNotions. It motivates us to get some instances and examples to make clarifications 6047
about the framework of this research. The general results and some results about some 6048
connections are some avenues to make key point of this research, “Cancer’s Recognition”, more 6049
understandable and more clear. 6050
The framework of this research is as follows. In the beginning, I introduce basic definitions 6051
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 6052
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 6053
discussed. The elementary concepts are clarified and illustrated completely and sometimes 6054
review literature are applied to make sense about what’s going to figure out about the 6055
upcoming sections. The main definitions and their clarifications alongside some results about 6056
new notions, SuperHyperReverse Strict Dimension Dominating and Neutrosophic SuperHyperReverse Strict 6057
Dimension Dominating, are figured out in sections “ SuperHyperReverse Strict Dimension Dominating” and 6058
“Neutrosophic SuperHyperReverse Strict Dimension Dominating”. In the sense of tackling on getting 6059
results and in Reverse Strict Dimension Dominating to make sense about continuing the research, 6060
the ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 6061

as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 6062
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 6063
SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 6064
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 6065
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 6066
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 6067
and as concluding and closing section of theoretical research are contained in the section “General 6068
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 6069
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 6070
“ SuperHyperReverse Strict Dimension Dominating”, “Neutrosophic SuperHyperReverse Strict Dimension 6071
Dominating”, “Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. 6072
There are curious questions about what’s done about the SuperHyperNotions to make sense 6073
about excellency of this research and going to figure out the word “best” as the description and 6074
adjective for this research as presented in section, “ SuperHyperReverse Strict Dimension Dominating”. 6075
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 6076
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 6077
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 6078
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 6079
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 6080
to make sense to figure out this research in featured style. The advantages and the limitations 6081
of this research alongside about what’s done in this research to make sense and to get sense 6082
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 6083

CHAPTER 29 6084
Neutrosophic Preliminaries Of This 6085
Scientific Research On the Redeemed 6086
Ways 6087
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 6088
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 6089

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 6090
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 6091
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 6092
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 6093
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 6094
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 6095

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

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

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

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 6100
2.5,p.2). 6101
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 6102
S = (V, E), where 6103
1, 2, . . . , n0 ); 6108
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6109
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6110

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 6140
x, y, z, w ∈ [0, 1]: 6141
(i) 1 ⊗ x = x; 6142
(ii) x ⊗ y = y ⊗ x; 6143
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 6144
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 6145

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

where 6148

1, 2, . . . , n0 ); 6153
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 6154
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 6155
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 6156
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 6157
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 6184
of elements of SuperHyperEdges are the same. 6185
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6186
makes to have SuperHyperUniform more understandable. 6187
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6188
Classes as follows. 6189
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6190
two given SuperHyperEdges with two exceptions; 6191
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6192
SuperHyperEdges; 6193
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6194
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6195
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6196
in common; 6197
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6198
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6199
SuperHyperEdge in common; 6200
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6201
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6202
SuperVertex. 6203
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 6204
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6205
(i) Vi , Vi+1 ∈ Ei0 ; 6206
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6207
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6208
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6209
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6210
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6211
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6212
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6213
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6215
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6216
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6217
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6218
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6219
perPath . 6220
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 6221
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6222
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6223
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6224
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6225
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6226

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6239
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6240
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6241
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Strict 6242

).

(i) Neutrosophic e-SuperHyperReverse Strict Dimension Dominating if the following expres- 6247
sion is called Neutrosophic e-SuperHyperReverse Strict Dimension Dominating criteria 6248
holds 6249
0
∀Ea ∈ EN SHG , ∃Eb ∈ E : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb
(ii) Neutrosophic re-SuperHyperReverse Strict Dimension Dominating if the following expres- 6250
sion is called Neutrosophic re-SuperHyperReverse Strict Dimension Dominating criteria 6251
holds 6252

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6253
(iii) Neutrosophic v-SuperHyperReverse Strict Dimension Dominating if the following expres- 6254
holds 6256
0
∀Va , ∃Vb ∈ V : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed
(iv) Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating if the following expres- 6257
holds 6259

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6260
(v) Neutrosophic SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic 6261

Definition 29.0.19. ((Neutrosophic) SuperHyperReverse Strict Dimension Dominating). 6265

(i) an Extreme SuperHyperReverse Strict Dimension Dominating if it’s either of Neutrosophic 6268
SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 6271
form the Extreme SuperHyperReverse Strict Dimension Dominating; 6275
(ii) a Neutrosophic SuperHyperReverse Strict Dimension Dominating if it’s either of Neutro- 6276
Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutro- 6278
sophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic 6279
rosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 6281
(iii) an Extreme SuperHyperReverse Strict Dimension Dominating SuperHyperPolynomial 6284

if it’s either of Neutrosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re- 6285
SuperHyperReverse Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension 6286
Dominating, and Neutrosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) 6287

SuperHyperVertices such that they form the Extreme SuperHyperReverse Strict Dimension 6292
Dominating; and the Extreme power is corresponded to its Extreme coefficient; 6293
(iv) a Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 6294
of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 6300
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 6301

corresponded to its Neutrosophic coefficient; 6304
(v) an Extreme V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neutro- 6305

, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neutro-

sophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for an Extreme Su- 6308
perHyperGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme 6309
SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyperVertices in the 6310
consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme SuperHyper- 6311
Vertices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; 6312
(vi) a Neutrosophic V-SuperHyperReverse Strict Dimension Dominating if it’s either of Neut- 6313
rosophic e-SuperHyperReverse Strict Dimension Dominating, Neutrosophic re-SuperHyperReverse 6314

Strict Dimension Dominating, Neutrosophic v-SuperHyperReverse Strict Dimension Dominating, and Neut- 6315
rosophic rv-SuperHyperReverse Strict Dimension Dominating and C(N SHG) for a Neutrosophic 6316
rosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 6318
(vii) an Extreme V-SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 6321

tices such that they form the Extreme SuperHyperReverse Strict Dimension Dominating; and the 6329
(viii) a Neutrosophic SuperHyperReverse Strict Dimension Dominating SuperHyperPolyno- 6331


of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of 6337
a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 6338
corresponded to its Neutrosophic coefficient. 6341
Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Strict Dimension Dominating). 6342

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6343
(i) an δ−SuperHyperReverse Strict Dimension Dominating is a Neutrosophic kind of Neutro- 6344

sophic SuperHyperReverse Strict Dimension Dominating such that either of the following expressions 6345
hold for the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6346
|S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; 136EQN1
|S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. 136EQN2


136TBL3
The Expression (29.1), holds if S is an δ−SuperHyperOffensive. And the Expression 6347

(29.1), holds if S is an δ−SuperHyperDefensive; 6348
(ii) a Neutrosophic δ−SuperHyperReverse Strict Dimension Dominating is a Neutrosophic kind 6349

of Neutrosophic SuperHyperReverse Strict Dimension Dominating such that either of the following 6350
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6351
of s ∈ S : 6352
|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 6353

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6354
For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension Dominating, there’s a 6355
need to “redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices 6356
and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this 6357
procedure, there’s the usage of the position of labels to assign to the values. 6358
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6360
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6361
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6362
There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. Thus 6364
Neutrosophic SuperHyperPath , SuperHyperReverse Strict Dimension Dominating, SuperHyperStar, 6365
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6366
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6367
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6368
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6369
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Strict Dimension 6370
Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 6371
Strict Dimension Dominating more Neutrosophicly understandable. 6372
For the sake of having a Neutrosophic SuperHyperReverse Strict Dimension Dominating, there’s a need to 6373
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Strict Dimension Dominating”. 6374
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 6375

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

136TBL4

136TBL1
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the 6376
values. 6377
136DEF1 Definition 29.0.23. Assume a SuperHyperReverse Strict Dimension Dominating. It’s redefined a 6378
Neutrosophic SuperHyperReverse Strict Dimension Dominating if the Table (29.3) holds. 6379

CHAPTER 30 6380
Neutrosophic SuperHyper But Reverse Strict Dimension Dominating 6381
As The Extensions Excerpt From Dense 6382
And Super Forms 6383
Definition 30.0.1. (Neutrosophic event). 6384

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6385
is a probability Reverse Strict Dimension Dominating. Any Neutrosophic k-subset of A of V is 6386
called Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6387
Neutrosophic event. The following expression is called Neutrosophic probability of A. 6388
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6389

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6390
S = (V, E) is a probability Reverse Strict Dimension Dominating. s Neutrosophic k-events Ai , i ∈ I 6391

is called Neutrosophic s-independent if the following expression is called Neutrosophic 6392
s-independent criteria 6393
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. 6394
The following expression is called Neutrosophic independent criteria 6395
E(A ∩ B) = P (A)P (B). (30.2)
Definition 30.0.3. (Neutrosophic Variable). 6396

is a probability Reverse Strict Dimension Dominating. Any k-function Reverse Strict Dimension Dominating like E 6398
is called Neutrosophic k-Variable. If k = 2, then any 2-function Reverse Strict Dimension Dominating 6399
like E is called Neutrosophic Variable. 6400
The notion of independent on Neutrosophic Variable is likewise. 6401
287
Definition 30.0.4. (Neutrosophic Expectation). 6402

is a probability Reverse Strict Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6404
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6405
criteria 6406
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6407

is a probability Reverse Strict Dimension Dominating. A Neutrosophic number is called Neutrosophic 6409
Crossing if the following expression is called Neutrosophic Crossing criteria 6410
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). 6411
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let m and n propose special 6412
Reverse Strict Dimension Dominating. Then with m ≥ 4n, 6413
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 Reverse Strict 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: 6414
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6415
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6416
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let P be a SuperHyperSet of 6417
n points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6418
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6419

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

whose SuperHyperEdge are the segments between consecutive points on the SuperHyperLines 6421
which pass through at least k + 1 points of P. This Neutrosophic SuperHyperGraph has at least 6422
kl SuperHyperEdges and Neutrosophic crossing at most l choose two. Thus either kl < 4n, in 6423
3
which case l < 4n/k ≤ 32n2 /k 3 , or l2 /2 > l choose 2 ≥ cr(G) ≥ (kl) /64n2 by the Neutrosophic 6424
Crossing Lemma, and again l < 32n2 /k 3 . 6425
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let P be a SuperHyperSet of n 6427
points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6428
Then k < 5n4/3 . 6429
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6430
S = (V, E) is a probability Reverse Strict Dimension Dominating. Draw a SuperHyperUnit Supe- 6431
rHyperCircle around each SuperHyperPoint of P. Let ni be the Neutrosophic number of 6432

P n−1
these SuperHyperCircles passing through exactly i points of P. Then i = 0 n i = n and 6433
k = 12 i = 0n−1 ini . Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex
P
6434
SuperHyperSet P whose SuperHyperEdges are the SuperHyperArcs between consecutive Super- 6435
HyperPoints on the SuperHyperCircles that pass through at least three SuperHyperPoints of P. 6436
Then 6437
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 6438
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6439

so as to obtain a simple Neutrosophic SuperHyperGraph G with e(G) ≥ k − n. Now 6440
cr(G) ≤ n(n − 1) because G is formed from at most n SuperHyperCircles, and any two 6441
SuperHyperCircles cross at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , 6442
3
or n2 > n(n − 1) ≥ cr(G) ≥ (k − n) /64n2 by the Neutrosophic Crossing Lemma, and 6443
4/3 4/3
k < 4n + n < 5n . 6444
Proposition 30.0.9. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6445
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let X be a nonnegative 6446
Neutrosophic Variable and t a positive real number. Then 6447
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. 6448

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6449
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let Xn be a nonnegative integer- 6450
valued variable in a probability Reverse Strict Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6451
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6452
Proof. 6453
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. A special SuperHyperGraph in 6455
Gn,p almost surely has stability number at most d2p−1 log ne. 6456
S = (V, E) is a probability Reverse Strict Dimension Dominating. A special SuperHyperGraph in Gn,p 6458
is up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6459
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6460
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6461
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6462
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6463
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6464
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 6465
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6466

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: 6467
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6468
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 6469
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6470
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6471
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6472
Definition 30.0.12. (Neutrosophic Variance). 6473
is a probability Reverse Strict Dimension Dominating. A Neutrosophic k-Variable E has a number is 6475
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 6476
criteria 6477
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let X be a Neutrosophic 6479
Variable and let t be a positive real number. Then 6480
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Reverse Strict Dimension Dominating. Let X be a Neutrosophic Variable and 6482
let t be a positive real number. Then 6483
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6484
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let Xn be a Neutrosophic 6486
Variable in a probability Reverse Strict Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and 6487
V (Xn ) << E 2 (Xn ), then 6488
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Strict Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6490
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6491
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6492
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, 6494
set f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less 6495
than one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6496
S = (V, E) is a probability Reverse Strict Dimension Dominating. As in the proof of related Theorem, 6498
the result is straightforward. 6499
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let G ∈ Gn,1/2 and let f and 6501
k ∗ be as defined in previous Theorem. Then either: 6502
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6503
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6504

Definition 30.0.17. (Neutrosophic Threshold). 6507

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6508
a probability Reverse Strict Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 6509
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6510
for P is a function f (n) such that: 6511
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6512
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6513
Definition 30.0.18. (Neutrosophic Balanced). 6514
is a probability Reverse Strict Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. 6516
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6517
SubSuperHyperGraph is called Neutrosophic Balanced. 6518
Consider S = (V, E) is a probability Reverse Strict Dimension Dominating. Let F be a nonempty 6520
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6521
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6522
SubSuperHyperGraph. 6523
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6526
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6527
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 6528
HyperReverse Strict Dimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6529
straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a 6530
loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in 6531
the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHy- 6532
perEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated 6533
means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 6534
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 6535

C(N SHG)Neutrosophic Reverse Strict Dimension Dominating =

{}.
C(N SHG)Neutrosophic Reverse Strict Dimension Dominating SuperHyperPolynomial
= 0z 0 .
C(N SHG)Neutrosophic V-Reverse Strict Dimension Dominating =
{}.
C(N SHG)Neutrosophic V-Reverse Strict Dimension Dominating SuperHyperPolynomial
= 0z 0 .
6537

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

Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example (42.0.3) 136NSHG1
straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges but E4 6540

is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyper- 6541
Neighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic 6542
SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no Neutrosophic Super- 6543
HyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, 6544
V3 , is excluded in every given Neutrosophic SuperHyperReverse Strict Dimension Dominating. 6545

{}.
= 0z 0 .
{}.
= 0z 0 .
6546



{}.
= 0z 0 .
{}.
= 0z 0 .
6550

{}.
= 0z 0 .




{}.
= 0z 0 .
6554



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

{Ei }22
i=12 .



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

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


= z 7−c .
6566

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


{E3i+1 , E23 }3i=0 .

= z 3−a .
{V3i+1 , V11 }3i=0 .
= z 3−a .
6574

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


= z 3−a .
6578

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






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

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



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

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



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



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

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



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

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






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

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



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

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


Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG1
6622

{E2i+3 }1i=0 .
= z 1−a .
{V1 , V10 , V6 }.
= z 4−a .


Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
6626
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6627
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict Di- 6628
mension Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6629
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6630
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6631
of them. 6632
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6633

(V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 6634
possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any given 6635
Neutrosophic quasi-R-Reverse Strict Dimension Dominating minus all Neutrosophic SuperHypeNeighbor 6636
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6637
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an 6638
Neutrosophic quasi-R-Reverse Strict Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor 6639
to some of them but not all of them. 6640
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-Reverse Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Strict Dimension 6641
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of the 6642
Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHyperEdges. 6643
In other words, the maximum number of the Neutrosophic SuperHyperEdges contains the 6644
maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neutrosophic 6645
Reverse Strict Dimension Dominating in some cases but the maximum number of the Neutrosophic 6646
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6647

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Strict Dimension 6648
Dominating. 6649
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Reverse Strict 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-Reverse Strict Dimension Dominating with the least Neutrosophic 6650
cardinality, the lower sharp Neutrosophic bound for cardinality. 6651
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6652
(V, E). Then in the worst case, literally, 6653
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Reverse Strict Dimension Dominating. In other words, the least cardinality, 6654
the lower sharp bound for the cardinality, of a Neutrosophic type-result-Reverse Strict Dimension 6655
Dominating is the cardinality of 6656

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ReverseStrictDimensionDominatingSuperHyperP 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-Reverse Strict 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-Reverse Strict Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a quasi-R-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-
Reverse Strict 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-Reverse Strict Dimension Dominating has the
Neutrosophic cardinality of a Neutrosophic SuperHyperEdge. Thus, a Neutrosophic R-Reverse
Strict 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-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-Reverse Strict 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-Reverse Strict Dimension
Dominating. Those Neutrosophic SuperHyperVertices are potentially included in a Neutrosophic
style-R-Reverse Strict 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-Reverse Strict Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Neutrosophic R-Reverse Strict 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-Reverse Strict 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, 6657
Neutrosophic R-Reverse Strict Dimension Dominating =

E
{Z1 , Z2 , . . . , Zz | ∀i 6= j, i, j = 1, 2, . . . , z, ∃Ex , Zi ∼x Zj , }.
6658
Neutrosophic R-Reverse Strict Dimension Dominating =

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Reverse Strict 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 Reverse Strict 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-Reverse Strict Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Strict Dimension 6659
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6660
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic Supe- 6661
rHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6662
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed 6663
to Neutrosophic Reverse Strict Dimension Dominating in some cases but the maximum number of the 6664
Neutrosophic SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic Su- 6665
perHyperVertices, has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic 6666
R-Reverse Strict Dimension Dominating. 6667
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6668
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6669
about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6670
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6671
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6672
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6673
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6674
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6675
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6676
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6677
tices. Thus it forms a Neutrosophic quasi-R-Reverse Strict Dimension Dominating where the Neutrosophic 6678
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6679
embedded R-Reverse Strict Dimension Dominating. The SuperHyperNotions of embedded SuperHyperSet 6680
and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6681
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6682
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6683
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic Su- 6684
perHyperVertices are included in the minimum Neutrosophic style of the embedded Neutrosophic 6685
R-Reverse Strict Dimension Dominating. The interior types of the Neutrosophic SuperHyperVertices are 6686
deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by the 6687
interior Neutrosophic SuperHyperVertices. The common connections, more precise and more 6688
formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any distinct 6689
types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Reverse Strict Dimension Dominat- 6690
ing. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6691
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic 6692
SuperHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic 6693
Reverse Strict Dimension Dominating, there’s the usage of exterior Neutrosophic SuperHyperVertices 6694
since they’ve more connections inside more than outside. Thus the title “exterior” is more 6695
relevant than the title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. 6696
Thus, the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one 6697
SuperHyperElement has been ignored in the exploring to lead on the optimal case implying the 6698
Neutrosophic R-Reverse Strict Dimension Dominating. The Neutrosophic R-Reverse Strict Dimension Dominating 6699
with the exclusion of the exclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic 6700
SuperHyperEdge and with other terms, the Neutrosophic R-Reverse Strict Dimension Dominating with 6701
the inclusion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge, 6702
is a Neutrosophic quasi-R-Reverse Strict Dimension Dominating. To sum them up, in a connected 6703
non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s only one Neutrosophic 6704

SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of the distinct interior 6705
Neutrosophic SuperHyperVertices inside of any given Neutrosophic quasi-R-Reverse Strict Dimension 6706
Dominating minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. In 6707
other words, there’s only an unique Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only 6708
two distinct Neutrosophic SuperHyperVertices in an Neutrosophic quasi-R-Reverse Strict Dimension 6709
Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them but not all of them. 6710
The main definition of the Neutrosophic R-Reverse Strict Dimension Dominating has two titles. a Neutro- 6711
sophic quasi-R-Reverse Strict Dimension Dominating and its corresponded quasi-maximum Neutrosophic 6712
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6713
number, there’s a Neutrosophic quasi-R-Reverse Strict Dimension Dominating with that quasi-maximum 6714
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6715
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6716
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Reverse 6717
Strict Dimension Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded 6718
maximum number. The essence of the Neutrosophic Reverse Strict Dimension Dominating ends up but 6719
this essence starts up in the terms of the Neutrosophic quasi-R-Reverse Strict Dimension Dominating, 6720
again and more in the operations of collecting all the Neutrosophic quasi-R-Reverse Strict Dimension 6721
Dominatings acted on the all possible used formations of the Neutrosophic SuperHyperGraph to 6722
achieve one Neutrosophic number. This Neutrosophic number is 6723

considered as the equivalence class for all corresponded quasi-R-Reverse Strict Dimension Dominatings. 6724
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Reverse Strict Dimension Dominating 6725
be a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Reverse Strict Dimen- 6726
sion Dominating. Then 6727
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Reverse Strict Dimension Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Reverse Strict Dimension Dominating is 6728
re-formalized and redefined as follows. 6729
GNeutrosophic Reverse Strict 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 6730
definition for the Neutrosophic Reverse Strict Dimension Dominating. 6731
GNeutrosophic Reverse Strict 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 Reverse 6732
Strict Dimension Dominating poses the upcoming expressions. 6733

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
To translate the statement to this mathematical literature, the formulae will be revised. 6734

= max zNeutrosophic Number

And then, 6735


To get more visions in the closer look-up, there’s an overall overlook. 6736
GNeutrosophic Reverse Strict Dimension Dominating ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6737

{S ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6738

[zNeutrosophic
Number ]Neutrosophic Class

6739


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6740
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6741
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6742
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Reverse Strict 6743
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Reverse Strict Dimen- 6744
sion Dominating” since “Neutrosophic Quasi-Reverse Strict Dimension Dominating” happens “Neutrosophic 6745
Reverse Strict Dimension Dominating” in a Neutrosophic SuperHyperGraph as initial framework and back- 6746
ground but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Reverse 6747
Strict Dimension Dominating” in a Neutrosophic SuperHyperGraph as initial framework and preliminar- 6748
ily background since there are some ambiguities about the Neutrosophic SuperHyperCardinality 6749
arise from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, 6750
“Neutrosophic Quasi-Reverse Strict Dimension Dominating”, and “Neutrosophic Reverse Strict Dimension Domin- 6751
ating” are up. 6752
Thus, let 6753
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6754
GNeutrosophic Reverse Strict Dimension Dominating be a Neutrosophic number, a Neutrosophic Super- 6755
HyperNeighborhood and a Neutrosophic Reverse Strict Dimension Dominating and the new terms are 6756
up. 6757
GNeutrosophic Reverse Strict Dimension Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =

∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6758

{NNeutrosophic SuperHyperNeighborhood
∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =
|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6759

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class |
6760

And with go back to initial structure, 6761
GNeutrosophic Reverse Strict Dimension Dominating ∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6762

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6763

[zNeutrosophic
Number ]Neutrosophic Class

6764


Thus, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all interior
Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict 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-Reverse Strict Dimension Dominating.
The Neutrosophic SuperHyperSet of Neutrosophic SuperHyperVertices,

Is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic R-Reverse Strict Dimension

. The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Dominating

Is an Neutrosophic R-Reverse Strict Dimension Dominating C(ESHG) for an Neutrosophic Supe-

rHyperGraph 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 Reverse Strict 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 Reverse Strict Dimension Dominating is up. The
obvious simple Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Strict 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-Reverse Strict 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-Reverse Strict

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer-
Dimension Dominating
tices,
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Reverse Strict Dimension Dominating C(ESHG) for an Neutrosophic SuperHyper-
Graph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVer-
tices such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyper-
Vertices instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic
Reverse Strict Dimension Dominating and it’s an Neutrosophic Reverse Strict 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 Reverse Strict Dimension Dominating. There isn’t only less than
two Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,

Thus the non-obvious Neutrosophic R-Reverse Strict Dimension Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse

, not:
Strict Dimension Dominating
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6765
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6766
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6767
type-SuperHyperSet called the 6768
“Neutrosophic R-Reverse Strict Dimension Dominating” 6769
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6770
Neutrosophic R-Reverse Strict Dimension Dominating, 6771
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-Reverse Strict Dimension Dominating amid those obvious simple Neutrosophic
type-SuperHyperSets of the Neutrosophic Reverse Strict 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-Reverse Strict Dimension Dominating. In other words, the least cardinality, the
lower sharp bound for the cardinality, of a Neutrosophic R-Reverse Strict Dimension Dominating is the
cardinality of

6772
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all in- 6773
terior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Strict Dimension 6774
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6775
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6776
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6777
amount of them. 6778

Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6779
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6780
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6781
Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6782
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6783
SuperHyperVertices. Consider there’s a Neutrosophic R-Reverse Strict Dimension Dominating with the 6784
least cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a 6785
connected Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet 6786
of the Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of 6787
the Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to 6788
have some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Reverse Strict 6789
Dimension Dominating. Since it doesn’t have 6790

6791
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6792
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6793
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6794
perVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic SuperHy- 6795
perSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Reverse Strict Dimension 6796
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neut- 6797
rosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at 6798
least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6799
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 6800
Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neutrosophic 6801
SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only one Neutro- 6802
sophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, VESHE ∪ {z}, in 6803
the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neutrosophic R-Reverse 6804
Strict Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet 6805
of the Neutrosophic R-Reverse Strict Dimension Dominating, VESHE , is a Neutrosophic SuperHyper- 6806
Set, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6807
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6808
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6809
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6810
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 6811
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, 6812
in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Reverse Strict 6813
Dimension Dominating only contains all interior Neutrosophic SuperHyperVertices and all exterior 6814
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6815
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6816
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6817

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6818
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6819
The SuperHyperNotion, namely, Reverse Strict Dimension Dominating, is up. There’s neither empty 6820
SuperHyperEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neut- 6821
rosophic SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet 6822
of the Neutrosophic Reverse Strict Dimension Dominating. The Neutrosophic SuperHyperSet of Neutro- 6823
sophic SuperHyperEdges[SuperHyperVertices], 6824

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−ReverseStrictDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−ReverseStrictDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−ReverseStrictDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse Strict Dimension Dominating. 6825
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6826

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Strict Dimension Dominating C(ESHG) for an Neutrosophic Super- 6827
HyperGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6828
6829
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6831
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6832
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6833
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6834
non-obvious Neutrosophic Reverse Strict Dimension Dominating is up. The obvious simple Neutrosophic 6835
type-SuperHyperSet called the Neutrosophic Reverse Strict Dimension Dominating is a Neutrosophic 6836
SuperHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6837
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6838

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 SuperHy- 6839
perSet. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic 6840
Reverse Strict Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the 6841
Neutrosophic SuperHyperEdges[SuperHyperVertices], 6842

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 Reverse Strict 6843
Dimension Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6844
perEdges[SuperHyperVertices], 6845

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Strict Dimension Dominating C(ESHG) for an Neutrosophic SuperHy- 6846
perGraph ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHy- 6847
perVertices such that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic 6848
SuperHyperVertices given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Re- 6849
verse Strict Dimension Dominating and it’s an Neutrosophic Reverse Strict Dimension Dominating. Since it’s 6850
6851
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6853
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6854
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6855

Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6856

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Neutrosophic ,


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 Reverse Strict 6858
, not:

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

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- 6861
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6862
Neutrosophic type-SuperHyperSet called the 6863
“Neutrosophic Reverse Strict Dimension Dominating ” 6864
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6865
Neutrosophic Reverse Strict Dimension Dominating, 6866
is only and only 6867

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

CHAPTER 31 6869
The Neutrosophic Departures on The 6870
Theoretical Results Toward Theoretical 6871
Motivations 6872
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6873
Neutrosophic SuperHyperClasses. 6874
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6875

|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 6876
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6877
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
331
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). 6878

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6883
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6884
SuperHyperModel (31.1), is the SuperHyperReverse Strict Dimension Dominating. 6885
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6886

|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 6887
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6888
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). 6889

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6894
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6895
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperReverse Strict Dimension 6896
Dominating. 6897

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

Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example (42.0.7) 136NSHG19a
Proposition 31.0.5. Assume a connected Neutrosophic SuperHyperStar ESHS : (V, E). Then 6898

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

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

Neutrosophic SuperHyperReverse Strict 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 6901

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6906
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6907
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6908
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6909
the Neutrosophic SuperHyperReverse Strict Dimension Dominating. 6910
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6911

Then 6912

= z b−a .
= z b−a .
Proof. Let 6913
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6914
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). 6915

Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6921
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperReverse Strict Dimension Dominating taken from a connected Neutrosophic 6923
SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6924
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6925
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6927
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6928
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6929

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6930
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6931
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6933
Then 6934


= z b−a .
= z b−a .
Proof. Let 6935
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6936
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 6938

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6943
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6945
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6946
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 6950
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6951
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6952
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), in 6953
the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperReverse Strict Dimension 6954
Dominating. 6955
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6956
Then, 6957

|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 6958
P :
CEN T ER, E2∗
6959
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER
SuperHyperWheel ESHW : (V, E). There’s a new way to redefine as 6961

straightforward. Then there’s at least one SuperHyperReverse Strict Dimension Dominating. Thus 6964
the notion of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Strict 6965
Dimension Dominating could be applied. The unique embedded SuperHyperReverse Strict Dimension 6966
Dominating proposes some longest SuperHyperReverse Strict Dimension Dominating excerpt from some 6967
representatives. The latter is straightforward. 6968
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6969
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6970
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6971
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6972
SuperHyperModel (31.6), is the Neutrosophic SuperHyperReverse Strict Dimension Dominating. 6973

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Strict Dimension Dominating in the Neutrosophic Example
(42.0.15) 136NSHG23a

CHAPTER 32 6974
The Surveys of Mathematical Sets On 6975
The Results But As The Initial Motivation 6976
For the SuperHyperReverse Strict Dimension Dominating, Neutrosophic SuperHyperReverse Strict Dimension 6977
, and the Neutrosophic SuperHyperReverse Strict Dimension Dominating, some general results
Dominating 6978
are introduced. 6979
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperReverse Strict Dimension Dominating is 6980
“redefined” on the positions of the alphabets. 6981
Corollary 32.0.2. Assume Neutrosophic SuperHyperReverse Strict Dimension Dominating. Then 6982
N eutrosophic SuperHyperReverseStrictDimensionDominating =
{theSuperHyperReverseStrictDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseStrictDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperReverseStrictDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6983
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6984
the neutrality, for i = 1, 2, 3, respectively. 6985
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6986
the alphabet. Then the notion of Neutrosophic SuperHyperReverse Strict Dimension Dominating and 6987
SuperHyperReverse Strict Dimension Dominating coincide. 6988
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6989
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6990
SuperHyperReverse Strict Dimension Dominating if and only if it’s a SuperHyperReverse Strict Dimension 6991
Dominating. 6992
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6993
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 6994
Strict Dimension Dominating if and only if it’s a longest SuperHyperReverse Strict Dimension Dominating. 6995
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6996

identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Strict Dimension Dominating is 6997
its SuperHyperReverse Strict Dimension Dominating and reversely. 6998
343
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Strict Dimension 6999

Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on 7000
the same identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Strict Dimension 7001
Dominating is its SuperHyperReverse Strict Dimension Dominating and reversely. 7002
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 7003
perReverse Strict Dimension Dominating isn’t well-defined if and only if its SuperHyperReverse Strict Dimension 7004
Dominating isn’t well-defined. 7005
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 7006

its Neutrosophic SuperHyperReverse Strict Dimension Dominating isn’t well-defined if and only if its 7007

Dominating 7010
Then its Neutrosophic SuperHyperReverse Strict Dimension Dominating isn’t well-defined if and only if its 7011
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic Super- 7013
HyperReverse Strict Dimension Dominating is well-defined if and only if its SuperHyperReverse Strict Dimension 7014
Dominating is well-defined. 7015
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 7016
its Neutrosophic SuperHyperReverse Strict Dimension Dominating is well-defined if and only if its 7017

Dominating 7020
Then its Neutrosophic SuperHyperReverse Strict Dimension Dominating is well-defined if and only if its 7021
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 7023
(i) : the dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7024
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7025
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7026
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7027
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7028
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 7029
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 7030
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7033

Proposition 32.0.16. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then an 7037

independent SuperHyperSet is 7038
(iii) : the connected SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7041
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 7045

perGraph which is a SuperHyperReverse Strict Dimension Dominating/SuperHyperPath. Then V is a 7046
maximal 7047
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7051
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7052
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7053
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 7055

SuperHyperUniform SuperHyperWheel. Then V is a maximal 7056
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7060
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7061
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7062

Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 7064

Graph which is a SuperHyperReverse Strict Dimension Dominating/SuperHyperPath. Then the number 7065
of 7066
(i) : the SuperHyperReverse Strict Dimension Dominating; 7067
(ii) : the SuperHyperReverse Strict Dimension Dominating; 7068
(iii) : the connected SuperHyperReverse Strict Dimension Dominating; 7069
(iv) : the O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 7070
(v) : the strong O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 7071
(vi) : the connected O(ESHG)-SuperHyperReverse Strict Dimension Dominating. 7072
coincide. 7074

Graph which is a SuperHyperWheel. Then the number of 7076
(i) : the dual SuperHyperReverse Strict Dimension Dominating; 7077
(ii) : the dual SuperHyperReverse Strict Dimension Dominating; 7078
(iii) : the dual connected SuperHyperReverse Strict Dimension Dominating; 7079
(iv) : the dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 7080
(v) : the strong dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating; 7081
(vi) : the connected dual O(ESHG)-SuperHyperReverse Strict Dimension Dominating. 7082
coincide. 7084
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 7085
perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 7086

Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 7087
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 7088
SuperHyperVertices is a 7089
O(ESHG)
O(ESHG)
O(ESHG)


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 7097
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 7098
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 7099
SuperHyperPart is a 7100
(iv) : δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7104
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7105
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating. 7106
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 7108

plete SuperHyperMultipartite. Then Then the number of 7109
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 7116
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 7117
Proposition 32.0.24. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. The number of 7119
connected component is |V − S| if there’s a SuperHyperSet which is a dual 7120
(iv) : SuperHyperReverse Strict Dimension Dominating; 7124

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 7127
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 7128
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 7129
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 7130

min Σv∈{v1 ,v2 ,··· ,vt } O(ESHG:(V,E)) ⊆V σ(v), in the setting of dual 7131
t>
2


ating. 7138
Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 7139
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 7140
of dual 7141
(iv) : 0-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7145

SuperHyperComplete. Then there’s no independent SuperHyperSet. 7149

SuperHyperReverse Strict Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is 7151
O(ESHG : (V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a 7152
dual 7153
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7157
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating; 7158

(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Strict Dimension Dominat- 7159
ing. 7160

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


ating. 7171
Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 7172
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 7173
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 7174
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 7175
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7176
a dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S 7177

such that 7178
(i) v ∈ Ns (x); 7179
(ii) vx ∈ E. 7180
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 7181

a dual SuperHyperDefensive SuperHyperReverse Strict Dimension Dominating, then 7182
(i) S is SuperHyperReverse Strict Dimension Dominating set; 7183
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 7184
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 7185
(i) Γ ≤ O; 7186
(ii) Γs ≤ On . 7187
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 7188
connected. Then 7189
(i) Γ ≤ O − 1; 7190

(ii) Γs ≤ On − Σ3i=1 σi (x). 7191
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 7192
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 7196
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 7197
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7199
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Strict Dimension 7200
Dominating; 7201
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7202
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7203
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7204
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Strict Dimension Dominating. 7206
Then 7207
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 7208
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7210
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7211
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7212
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse .

Then 7215

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7219
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7220
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7222

(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Strict Dimension Dominating; 7223
(ii) Γ = 1; 7224
(iii) Γs = Σ3i=1 σi (c); 7225
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Strict Dimension 7226
Dominating. 7227
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7228
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 7229
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 7231
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 7232
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 7233
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7235
bn
2 c+1
(ii) Γ = b n2 c + 1; 7238

b n c+1 ; 7239
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 7240
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7242
bn
2c
(ii) Γ = b n2 c; 7245

bnc ; 7246
S={vi }i=1
bnc
(iv) the SuperHyperSet S = {vi }i=1 2
is only a dual maximal SuperHyperDefensive SuperHy- 7247
Proposition 32.0.44. Let N SHF : (V, E) be a m-SuperHyperFamily of Neutrosophic SuperHy- 7249

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7250
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 7251
Strict Dimension Dominating for N SHF; 7252

(ii) Γ = m for N SHF : (V, E); 7253
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7254
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse Strict 7255
Dimension Dominating for N SHF : (V, E). 7256
Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7257

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7258
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHy- 7259
perReverse Strict Dimension Dominating for N SHF; 7260
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 7261
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 7262
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperReverse Strict Dimension 7263
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7265
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7266
bn
2c
Dimension Dominating for N SHF : (V, E); 7268
(ii) Γ = b n2 c for N SHF : (V, E); 7269
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 7270
S={vi }i=1
bnc
are only dual maximal SuperHyperReverse Strict Dimension 7271
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Supe- 7275

rHyperReverse Strict Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 7276

SuperHyperReverse Strict Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHy- 7279
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive Su- 7283

perHyperReverse Strict Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 7284


SuperHyperReverse Strict Dimension Dominating, then S is a dual s-SuperHyperPowerful SuperHy- 7287
Proposition 32.0.49. Let ESHG : (V, E) be a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7289

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7299

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

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

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


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

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


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

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

hold; 7331
(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperReverse 7332
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7334

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

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


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

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

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


CHAPTER 33 7351
Neutrosophic Applications in Cancer’s 7352
Neutrosophic Recognition 7353
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7354
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7355
disease is considered and as the consequences of the model, some parameters are used. The cells 7356
are under attack of this disease but the moves of the cancer in the special region are the matter 7357
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7358
treatments for this Neutrosophic disease. 7359
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7360
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7361
term Neutrosophic function. 7362
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7363
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7364
move from the cancer is identified by this research. Sometimes the move of the cancer 7365
about the moves and the effects of the cancer on that region; this event leads us to 7367
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7368
perception on what’s happened and what’s done. 7369
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7370
known and they’ve got the names, and some general Neutrosophic models. The moves 7371
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7372
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse 7373
Strict Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 7374
SuperHyperWheel). The aim is to find either the Neutrosophic SuperHyperReverse Strict 7375
Dimension Dominating or the Neutrosophic SuperHyperReverse Strict Dimension Dominating in those 7376
Neutrosophic Neutrosophic SuperHyperModels. 7377
355
CHAPTER 34 7378
Case 1: The Initial Neutrosophic Steps 7379
Toward Neutrosophic 7380
SuperHyperBipartite as Neutrosophic 7381
SuperHyperModel 7382
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7383
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7384
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

357
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7385
perBipartite is obtained. 7386
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7387
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7388
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7389
(34.1), is the Neutrosophic SuperHyperReverse Strict Dimension Dominating. 7390

CHAPTER 35 7391
Case 2: The Increasing Neutrosophic 7392
Steps Toward Neutrosophic 7393
SuperHyperMultipartite as 7394
Neutrosophic SuperHyperModel 7395
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7396
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7397
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7398
perMultipartite is obtained. 7399
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7400
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

359
Belong to The Neutrosophic SuperHyperMultipartite

136TBLaa22aa
result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHy- 7401

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7402
Neutrosophic SuperHyperReverse Strict Dimension Dominating. 7403

CHAPTER 36 7404
Wondering Open Problems But As The 7405
Directions To Forming The Motivations 7406
In what follows, some “problems” and some “questions” are proposed. 7407
The SuperHyperReverse Strict Dimension Dominating and the Neutrosophic SuperHyperReverse Strict 7408
Dimension Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 7409
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7410
recognitions? 7411
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Strict Dimension 7412
and the Neutrosophic SuperHyperReverse Strict Dimension Dominating?
Dominating 7413
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7414
them? 7415
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse Strict 7416
and the Neutrosophic SuperHyperReverse Strict Dimension Dominating?
Problem 36.0.5. The SuperHyperReverse Strict Dimension Dominating and the Neutrosophic SuperHy- 7418
perReverse Strict Dimension Dominating do a SuperHyperModel for the Cancer’s recognitions and they’re 7419
based on SuperHyperReverse Strict Dimension Dominating, are there else? 7420
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7421
Numbers types-results? 7422
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7423
the multiple types of SuperHyperNotions? 7424
361
CHAPTER 37 7425
Conclusion and Closing Remarks 7426
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7427
research are illustrated. Some benefits and some advantages of this research are highlighted. 7428
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7429
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse Strict 7430
Dimension Dominating. For that sake in the second definition, the main definition of the Neutrosophic 7431
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 7432
for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHy- 7433
perReverse Strict Dimension Dominating, finds the convenient background to implement some results 7434
based on that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the 7435
cases of this research on the modeling of the regions where are under the attacks of the cancer 7436
to recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 7437
instances on the SuperHyperNotion, SuperHyperReverse Strict Dimension Dominating, the new Super- 7438
HyperClasses and SuperHyperClasses, are introduced. Some general results are gathered in the 7439
section on the SuperHyperReverse Strict Dimension Dominating and the Neutrosophic SuperHyperReverse 7440
Strict Dimension Dominating. The clarifications, instances and literature reviews have taken the whole 7441
way through. In this research, the literature reviews have fulfilled the lines containing the 7442
notions and the results. The SuperHyperGraph and Neutrosophic SuperHyperGraph are the 7443
SuperHyperModels on the “Cancer’s Recognitions” and both bases are the background of this 7444
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 7445
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 7446
based on the connectivities of the moves of the cancer in the longest and strongest styles with 7447
the formation of the design and the architecture are formally called “ SuperHyperReverse Strict 7448
Dimension Dominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to 7449
the theme of the embedded styles to figure out the background for the SuperHyperNotions. In 7450
the Table (37.1), benefits and avenues for this research are, figured out, pointed out and spoken 7451
out. 7452
363
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperReverse Strict Dimension Dominating
3. Neutrosophic SuperHyperReverse Strict Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7453
Neutrosophic SuperHyperDuality But As 7454
Super Forms 7456
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7457

(i) Neutrosophic e-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7461

Va ∈ Ei , Ej ; 7462
(ii) Neutrosophic re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 7463

Va ∈ Ei , Ej and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 7464
(iii) Neutrosophic v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7465

Vi , Vj ∈ Ea ; 7466
(iv) Neutrosophic rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 7467

Vi , Vj ∈ Ea and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7468
(v) Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7469

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7470
sophic rv-SuperHyperDuality. 7471
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7472

(i) an Extreme SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7475

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7477
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7478
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7479
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7480
365
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7482

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7484
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 7485
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7486
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7487
form the Neutrosophic SuperHyperDuality; 7488
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7489
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7490

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an Ex- 7491
treme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 7492
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardin- 7493
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7494
that they form the Extreme SuperHyperDuality; and the Extreme power is corresponded 7496
(iv) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7498

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7500
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7501
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 7502
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7503
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 7504
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 7505
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7506
coefficient; 7507
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7508

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7510
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7511
treme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme sequence 7512
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7513
(vi) a Neutrosophic R-SuperHyperDuality if it’s either of Neutrosophic e- 7515

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7516
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7517
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7518
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7519
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7520
that they form the Neutrosophic SuperHyperDuality; 7521
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7522

Neutrosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic 7523
v-SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for an 7524

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

SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7529
power is corresponded to its Extreme coefficient; 7530
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7531

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7533

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7539
coefficient. 7540
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7541
the mentioned Neutrosophic Figures in every Neutrosophic items. 7542
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 7543

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7544
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7545
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7546
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7547
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7548
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7549
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 7554
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7555
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7556
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7557
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7558

every given Neutrosophic SuperHyperDuality. 7559




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 7603
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. 7610
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 7612
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperDuality. 7619
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 7621


the Neutrosophic SuperHyperDuality. 7630
Then 7632
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 7633
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 7639
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperBipartite 7642

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Neutrosophic-of- 7643
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
Proposition 38.0.12. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : 7652

(V, E). Then 7653

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 7654
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperDuality taken from a connected Neutrosophic SuperHyperMultipartite 7655


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

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

SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 7671
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7672
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7673
Then, 7674
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 7675
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 7676


∗
, ViEXT ERN AL , VjEXT ERN AL ∈ Ez∗ ≡
∗
, {ViEXT ERN AL , VjEXT ERN AL } ⊆ Ez∗ .

SuperHyperNotions based on SuperHyperDuality could be applied. The unique embedded 7681
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 7682
SuperHyperModel (31.6), is the Neutrosophic SuperHyperDuality. 7688

CHAPTER 39 7689
Neutrosophic SuperHyperJoin But As 7690
Super Forms 7692
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7693

(i) Neutrosophic e-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7697
(ii) Neutrosophic re-SuperHyperJoin if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such that 7699

Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = 7700
|Ej |NEUTROSOPHIC CARDINALITY ; 7701
(iii) Neutrosophic v-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7702

(iv) Neutrosophic rv-SuperHyperJoin if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such that 7704

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = 7705
|Vj |NEUTROSOPHIC CARDINALITY ; 7706
(v) Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7707

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7708
rv-SuperHyperJoin. 7709
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7710

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

379

Extreme SuperHyperJoin; 7719
(ii) a Neutrosophic SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7720

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7722
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7723
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7724
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7725
Neutrosophic SuperHyperJoin; 7726
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7727

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7728
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7729
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7734
coefficient; 7735
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7736

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7737
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7738
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7739
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7740
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7741
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7742

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

Extreme SuperHyperJoin; 7751
(vi) a Neutrosophic R-SuperHyperJoin if it’s either of Neutrosophic e-SuperHyperJoin, 7752

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7754
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7755
Neutrosophic SuperHyperJoin; 7758

(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of 7759

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme 7761

that they form the Extreme SuperHyperJoin; and the Extreme power is corresponded to 7766
its Extreme coefficient; 7767
(viii) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7768

SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7770
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7771

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7772
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7773
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7776
coefficient. 7777
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7781

E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 is a loop Neutrosophic 7782

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. 7796




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 7840
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3


SuperHyperModel (31.1), is the SuperHyperJoin. 7847

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

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

Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperJoin. 7856
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 7858


the Neutrosophic SuperHyperJoin. 7867
Then 7869
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 7870
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 7876
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7878

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


(V, E). Then 7889

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 7890
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7891


based on SuperHyperJoin could be applied. There are only z 0 SuperHyperParts. Thus every 7896
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. 7907

Then, 7909

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

.
Proof. Let 7910
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperWheel ESHW : 7911


at least one SuperHyperJoin. Thus the notion of quasi isn’t up and the SuperHyperNotions based 7915
on SuperHyperJoin could be applied. The unique embedded SuperHyperJoin proposes some 7916
longest SuperHyperJoin excerpt from some representatives. The latter is straightforward. 7917
SuperHyperModel (31.6), is the Neutrosophic SuperHyperJoin. 7922

CHAPTER 40 7923
Neutrosophic SuperHyperPerfect But As 7924
Super Forms 7926
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7927

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

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

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

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

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7938
(v) Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7939

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7940
rv-SuperHyperPerfect. 7941
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7942

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7947
393
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7952

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7954
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7955
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7956
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 7957
form the Neutrosophic SuperHyperPerfect; 7958
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7959

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7960
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7961
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7964
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7968

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7970
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 7973
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7976
coefficient; 7977
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7978

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7986
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7987
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7988
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7989
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 7990
that they form the Neutrosophic SuperHyperPerfect; 7991
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7992

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7994

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7997
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 8001

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 8003

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 8009
coefficient. 8010

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8014

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. 8029





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 8073
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

SuperHyperModel (31.1), is the SuperHyperPerfect. 8080
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 8082
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 8100
Then 8102
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 8103
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 8107
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 8108
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 8109
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 8112

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

(V, E). Then 8123

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 8124
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperMultipartite 8125



to ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. 8128
Then there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but 8129
the SuperHyperNotions based on SuperHyperPerfect could be applied. There are only z 0 8130
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. 8142
Then, 8144
C(N SHG)Neutrosophic SuperHyperPerfect = {E ∈ EESHG:(V,E) }.

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 8146


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 8149
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 8150
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 8151
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 8152
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 8158

CHAPTER 41 8159
Neutrosophic SuperHyperTotal But As 8160
Super Forms 8162
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 8163

(i) Neutrosophic e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8167

Va ∈ Ei , Ej ; 8168
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 8169

Va ∈ Ei , Ej ; and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8170
(iii) Neutrosophic v-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8171

Vi , Vj ∈ Ea ; 8172
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 8173

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8174
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8175

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 8176
rv-SuperHyperTotal. 8177
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 8178

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8183
Extreme SuperHyperTotal; 8187
407
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8188

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8190
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 8191
Neutrosophic SuperHyperTotal; 8194
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 8195
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 8196

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 8197
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 8202
coefficient; 8203
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8204
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8205

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8206
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8207
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8208
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8209
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8210
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8211
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8212
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8213

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8215
Extreme SuperHyperTotal; 8219
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8220

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8222
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 8223
Neutrosophic SuperHyperTotal; 8226
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8227

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8228
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8229

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8234
its Extreme coefficient; 8235
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8236
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8237

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8238
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 8239
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8240
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8241
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8242
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8243
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8244

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8248

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. 8263




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 8307
P :
V2EXT ERN AL , E2 ,
V3EXT ERN AL , E3 ,
...

SuperHyperModel (31.1), is the SuperHyperTotal. 8314
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 8316
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. 8323
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 8325


the Neutrosophic SuperHyperTotal. 8334
Then 8336
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 8337
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8343
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8345

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8356

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 8357
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8358


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8363
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. 8374
Then, 8376
∗
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 8377
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8378


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8382
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8383
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8384
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8390

CHAPTER 42 8391
Neutrosophic SuperHyperConnected But 8392
As The Extensions Excerpt From Dense 8393
And Super Forms 8394
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8395

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8399
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8400
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8401

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8402
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8403
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8404

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

V 0 , such that Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and 8407
|Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 8408
(v) Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8409
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8410
rosophic rv-SuperHyperConnected. 8411
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8412

(i) an Extreme SuperHyperConnected if it’s either of Neutrosophic e-SuperHyperConnected,

8415
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8416
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8417
421
form the Extreme SuperHyperConnected; 8421
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8422

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8423
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8424
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8425
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8426
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8427

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8428
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8429
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8430

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8431
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8432
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8438

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8439
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8440
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8441
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8442
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8443
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8444

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8446
Neutrosophic coefficient; 8447
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8448

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8450
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8451
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8452
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8453
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8454
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8455

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8457
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8458
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8459
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8460
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8461

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8462

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8465
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8466

and the Extreme power is corresponded to its Extreme coefficient; 8470
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8471

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8474
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8475
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8476
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8477

Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8479
Neutrosophic coefficient. 8480
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8484
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8486
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8487

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8488
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8489
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8490
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. 8498


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 8542
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. 8549
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 8551
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. 8558
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 8560



the Neutrosophic SuperHyperConnected. 8569
Then 8571
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 8572
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 8577
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8578
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8581

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8592
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 8593
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8594


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8598
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8599
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8600
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. 8611
Then, 8613
∗
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 8614
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8615


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8618
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8619
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8620
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8621
some representatives. The latter is straightforward. 8622
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8627

CHAPTER 43 8628
Background 8629
435










HG291; HG292; HG293; HG294; HG295], there are some endeavors to formalize the basic 8793
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 8794



HG186b; HG187b]. Two popular scientific research books in Scribd in the terms of high 8810

HG287; HG288; HG289; HG290; HG291; HG292; HG293; HG294; HG295] alongside 8849

HG186b; HG187b]. Two popular scientific research books in Scribd ,in the terms of high 8865

Bibliography 8867

10.33140/JMTCM.01.03.09) 8896
441
10.20944/preprints202301.0282.v1). 8912
10.20944/preprints202301.0267.v1). 8915
(doi: 10.20944/preprints202301.0265.v1). 8920
prints202301.0262.v1). 8924
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8930

prints202301.0105.v1). 8933

Preprints 2023, 2023010044 8939
10.20944/preprints202301.0043.v1). 8942

(doi: 10.20944/preprints202212.0549.v1). 8951
(doi: 10.20944/preprints202212.0500.v1). 8958
(doi: 10.5281/zenodo.8088438). 8967
2023, (doi: 10.5281/zenodo.8088387). 8970
10.5281/zenodo.8084436). 8973

2023, (doi: 10.5281/zenodo.8084420). 8976
10.5281/zenodo.8080100). 8979
10.5281/zenodo.8080068). 8982
(doi: 10.5281/zenodo.8078445). 8985
2023, (doi: 10.5281/zenodo.8078543). 8988
10.5281/zenodo.8076416). 8991
2023, (doi: 10.5281/zenodo.8076399). 8994
(doi: 10.5281/zenodo.8072171). 8997
2023, (doi: 10.5281/zenodo.8072267). 9000
10.5281/zenodo.8067384). 9003
2023, (doi: 10.5281/zenodo.8067409). 9006
10.5281/zenodo.8061927). 9009
10.5281/zenodo.8062016). 9012

10.5281/zenodo.8057696). 9015
2023, (doi: 10.5281/zenodo.8057753). 9018
10.5281/zenodo.8052893). 9021
2023, (doi: 10.5281/zenodo.8052925). 9024
10.5281/zenodo.8051346). 9027
10.5281/zenodo.8051360). 9030
10.5281/zenodo.8025707). 9033
10.5281/zenodo.8027275). 9036
odo.8017246). 9039
10.5281/zenodo.8020128). 9042
odo.7978571). 9045
10.5281/zenodo.7978857). 9048
10.5281/zenodo.7940830). 9051

10.5281/zenodo.7943578). 9054
odo.7916595). 9057
odo.7923632). 9060
(doi: 10.5281/zenodo.7904698). 9063
2023, (doi: 10.5281/zenodo.7904671). 9066
10.5281/zenodo.7871026). 9075
2023, (doi: 10.5281/zenodo.7874647). 9078
10.5281/zenodo.7857856). 9081
2023, (doi: 10.5281/zenodo.7857841). 9084

10.5281/zenodo.7853867). 9093
10.5281/zenodo.7853922). 9096
(doi: 10.5281/zenodo.7851519). 9099
(doi: 10.5281/zenodo.7851550). 9102
10.5281/zenodo.7834229). 9111
10.5281/zenodo.7834261). 9114
10.5281/zenodo.7824560). 9117

(doi: 10.5281/zenodo.7824623). 9120

2023, (doi: 10.5281/zenodo.7809365). 9131
2023, (doi: 10.5281/zenodo.7809358). 9134
10.5281/zenodo.7809219). 9137
10.5281/zenodo.7809328). 9140
2023, (doi: 10.5281/zenodo.7806767). 9143
2023, (doi: 10.5281/zenodo.7806838). 9146
10.5281/zenodo.7799902). 9155
(doi: 10.5281/zenodo.7804218). 9158
(doi: 10.5281/zenodo.7796334). 9161
10.5281/zenodo.7791952). 9167

10.5281/zenodo.7791982). 9170
10.5281/zenodo.7790026). 9173
10.5281/zenodo.7790052). 9176
2023, (doi: 10.5281/zenodo.7787066). 9179
10.5281/zenodo.7781476). 9185
10.5281/zenodo.7783082). 9188
10.5281/zenodo.7777857). 9191
10.5281/zenodo.7779286). 9194
(doi: 10.5281/zenodo.7771831). 9197
2023, (doi: 10.5281/zenodo.7772468). 9200
10.13140/RG.2.2.20913.25446). 9203
odo.7764916). 9206

10.13140/RG.2.2.11770.98247). 9209
10.13140/RG.2.2.12400.12808). 9212
2023, (doi: 10.13140/RG.2.2.22545.10089). 9215
10.13140/RG.2.2.11377.76644). 9221
10.13140/RG.2.2.23750.96329). 9224
10.13140/RG.2.2.31366.24641). 9227
10.13140/RG.2.2.34721.68960). 9230
2023, (doi: 10.13140/RG.2.2.30212.81289). 9233
10.13140/RG.2.2.24288.35842). 9239
10.13140/RG.2.2.32467.25124). 9242
10.13140/RG.2.2.31025.45925). 9245

10.13140/RG.2.2.17184.25602). 9248
10.13140/RG.2.2.23423.28327). 9251
10.13140/RG.2.2.28456.44805). 9254
10.13140/RG.2.2.23525.68320). 9257
10.13140/RG.2.2.20170.24000). 9260
10.13140/RG.2.2.36475.59683). 9263
10.13140/RG.2.2.29764.71046). 9266
2023, (doi: 10.13140/RG.2.2.18780.87683). 9269
10.13140/RG.2.2.26134.01603). 9275
10.13140/RG.2.2.27392.30721). 9278
10.13140/RG.2.2.33028.40321). 9281
10.13140/RG.2.2.21389.20966). 9284

10.13140/RG.2.2.16356.04489). 9287
10.13140/RG.2.2.21756.21129). 9290
10.13140/RG.2.2.30983.68009). 9293
10.13140/RG.2.2.28552.29445). 9296
(doi: 10.13140/RG.2.2.10936.21761). 9299
10.13140/RG.2.2.35105.89447). 9302
(doi: 10.13140/RG.2.2.30072.72960). 9305
10.13140/RG.2.2.31147.52003). 9308
10.13140/RG.2.2.32825.24163). 9311
10.13140/RG.2.2.13059.58401). 9314
10.13140/RG.2.2.11172.14720). 9317
2023, (doi: 10.13140/RG.2.2.22011.80165). 9320
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9323

2023, (doi: 10.13140/RG.2.2.10493.84962). 9326
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9329
2023, (doi: 10.13140/RG.2.2.19944.14086). 9332
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9335
(doi: 10.13140/RG.2.2.33103.76968). 9338
(doi: 10.13140/RG.2.2.23037.44003). 9341
(doi: 10.13140/RG.2.2.35646.56641). 9344
10.13140/RG.2.2.18030.48967). 9347
(doi: 10.13140/RG.2.2.13973.81121). 9350
2023, (doi: 10.13140/RG.2.2.34106.47047). 9353
2023, (doi: 10.13140/RG.2.2.31956.88961). 9359
2023, (doi: 10.13140/RG.2.2.15179.67361). 9362

10.13140/RG.2.2.21510.45125). 9365
2023, (doi: 10.13140/RG.2.2.13121.84321). 9368
10.13140/RG.2.2.11758.69441). 9371
2023, (doi: 10.13140/RG.2.2.31891.35367). 9374
10.13140/RG.2.2.19360.87048). 9377
10.13140/RG.2.2.32363.21286). 9380
10.13140/RG.2.2.23266.81602). 9383
10.13140/RG.2.2.19911.37285). 9386
10.13140/RG.2.2.11050.90569). 9389
2023, (doi: 10.13140/RG.2.2.17761.79206). 9392
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9398
(doi: 10.13140/RG.2.2.30182.50241). 9401

2023, (doi: 10.13140/RG.2.2.17252.24968). 9434

2023010396 (doi: 10.20944/preprints202301.0396.v1). 9443
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9446



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

10.20944/preprints202301.0282.v1). 9467
10.20944/preprints202301.0267.v1).). 9470
(doi: 10.20944/preprints202301.0265.v1). 9475
prints202301.0262.v1). 9479


2023010224, (doi: 10.20944/preprints202301.0224.v1). 9485

10.13140/RG.2.2.35061.65767). 9488

10.13140/RG.2.2.18494.15680). 9492

10.13140/RG.2.2.32530.73922). 9496

10.13140/RG.2.2.15897.70243). 9500

10.13140/RG.2.2.32530.73922). 9504

prints202301.0105.v1). 9507

10.13140/RG.2.2.23172.19849). 9514


10.13140/RG.2.2.17385.36968). 9524
Preprints 2023, 2023010044 9527
10.20944/preprints202301.0043.v1). 9530
2023, (doi: 10.13140/RG.2.2.28945.92007). 9533
10.13140/RG.2.2.35774.77123). 9539

10.13140/RG.2.2.29430.88642). 9545
(doi: 10.20944/preprints202212.0549.v1). 9551
10.13140/RG.2.2.19380.94084). 9554

(doi: 10.20944/preprints202212.0500.v1). 9565
10.13140/RG.2.2.20993.12640). 9568


10.13140/RG.2.2.29173.86244). 9583
2023 (doi: 10.5281/zenodo.8086310). 9590
2023 (doi: 10.5281/zenodo.8080167). 9592

2023 (doi: 10.5281/zenodo.8076449). 9596
2023 (doi: 10.5281/zenodo.8067469). 9600
(doi: 10.5281/zenodo.8062076). 9602
2023 (doi: 10.5281/zenodo.8052976). 9606
(doi: 10.5281/zenodo.8051368). 9608
(doi: 10.5281/zenodo.8027488). 9610
10.5281/zenodo.8020181). 9612
10.5281/zenodo.7978921). 9614
odo.7943878). 9616
10.5281/zenodo.7943871). 9618
10.5281/zenodo.7923786). 9620
2023 (doi: 10.5281/zenodo.7905287). 9622

2023 (doi: 10.5281/zenodo.7874677). 9626
(doi: 10.5281/zenodo.7857906). 9628

2023 (doi: 10.5281/zenodo.7856329). 9630
10.5281/zenodo.7854561). 9632
2023 (doi: 10.5281/zenodo.7851893). 9634

(doi: 10.5281/zenodo.7835063). 9638
(doi: 10.5281/zenodo.7826705). 9640
2023 (doi: 10.5281/zenodo.7820680). 9642
10.5281/zenodo.7812750). 9644

2023 (doi: 10.5281/zenodo.7807782). 9650
2023 (doi: 10.5281/zenodo.7804449). 9652

(doi: 10.5281/zenodo.7792307). 9656
(doi: 10.5281/zenodo.7790728). 9658
2023 (doi: 10.5281/zenodo.7787712). 9660
10.5281/zenodo.7783791). 9662
10.5281/zenodo.7780123). 9664

(doi: 10.5281/zenodo.7773119). 9666
odo.7637762). 9668
10.5281/zenodo.7766174). 9670
10.5281/zenodo.7762232). 9672
(doi: 10.5281/zenodo.7758601). 9674
10.5281/zenodo.7754661). 9676
10.5281/zenodo.7750995) . 9678
(doi: 10.5281/zenodo.7749875). 9680
10.5281/zenodo.7747236). 9682
10.5281/zenodo.7742587). 9684
(doi: 10.5281/zenodo.7738635). 9686
10.5281/zenodo.7734719). 9688
10.5281/zenodo.7730484). 9690
(doi: 10.5281/zenodo.7730469). 9692
10.5281/zenodo.7722865). 9694
odo.7713563). 9696
odo.7709116). 9698
10.5281/zenodo.7706415). 9700

10.5281/zenodo.7706063). 9702
10.5281/zenodo.7701906). 9704
odo.7700205). 9706
10.5281/zenodo.7694876). 9708
10.5281/zenodo.7679410). 9710
10.5281/zenodo.7675982). 9712
10.5281/zenodo.7672388). 9714
odo.7668648). 9716
10.5281/zenodo.7662810). 9718
10.5281/zenodo.7659162). 9720
odo.7653233). 9722
odo.7653204). 9724
odo.7653142). 9726
odo.7653117). 9728
odo.7651687). 9731
odo.7651619). 9733
odo.7651439). 9735

odo.7650729). 9737
odo.7647868). 9739
odo.7647017). 9741
odo.7644894). 9743
odo.7632923). 9746
odo.7623459). 9748
10.5281/zenodo.7606416). 9750
10.5281/zenodo.7606416). 9752
odo.7606404). 9754
10.5281/zenodo.7580018). 9756
odo.7580018). 9758
odo.7580018). 9760
odo.7579929). 9762
10.5281/zenodo.7563170). 9764
odo.7563164). 9766
odo.7563160). 9768
odo.7563160). 9770

10.5281/zenodo.7563160). 9772
10.5281/zenodo.7557063). 9774
10.5281/zenodo.7557009). 9776
10.5281/zenodo.7539484). 9778
10.5281/zenodo.7523390). 9780
10.5281/zenodo.7523390). 9782
10.5281/zenodo.7523390). 9784
odo.7574952). 9786
10.5281/zenodo.7574992). 9788
odo.7523357). 9790
10.5281/zenodo.7523357). 9792
10.5281/zenodo.7504782). 9794
10.5281/zenodo.7504782). 9796
10.5281/zenodo.7504782). 9798
10.5281/zenodo.7499395). 9800
odo.7499395). 9802
10.5281/zenodo.7499395). 9804
10.5281/zenodo.7497450). 9806

10.5281/zenodo.7497450). 9808
10.5281/zenodo.7494862). 9810
odo.7494862). 9812
10.5281/zenodo.7494862). 9814
10.5281/zenodo.7493845). 9816
odo.7493845). 9818
10.5281/zenodo.7493845). 9820
odo.7539484). 9822
odo.7523390). 9824
odo.7523357). 9826
odo.7504782). 9828
odo.7499395). 9830
odo.7497450). 9832
odo.7494862). 9834
odo.7493845). 9836
odo.7480110). 9838
odo.7378758). 9840
odo.6320305). 9842

odo.6677173). 9844

CHAPTER 44 9845
Books’ Contributions 9846
“Books’ Contributions”: | Featured Threads 9847

The following references are cited by chapters. 9848
9849
[Ref296 9850
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Strict Dimension 9851
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 9852
(doi: 10.5281/zenodo.8092766). 9853
9854
[Ref297] 9855
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9856
Reverse Strict Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 9857
10.5281/zenodo.8092796). 9858
9859
The links to the contributions of this scientific research book are listed below. 9860
[HG296] 9861
(doi: 10.5281/zenodo.8092766). 9864
9865
[TITLE] “New Ideas On Super Dimity By Hyper Dimple Of Reverse Strict Dimension 9866
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9867

9868
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9869
https://www.researchgate.net/publication/371939390 9870
9871
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9872
https://www.scribd.com/document/656041411 9873
9874
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9875
https://zenodo.org/record/8092766 9876
9877
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9878
https://www.academia.edu/104009896 9879
469
Figure 44.1: [HG296] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse
Strict Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8092766).
9880
[ADDRESSED CITATION] 9881
(doi: 10.5281/zenodo.8092766). 9884
[ASSIGNED NUMBER] #296 Article 9885
[DATE] June 2023 9886

[DOI] 10.5281/zenodo.8092766 9887
[LICENSE] CC BY-NC-ND 4.0 9888
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9889
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9890
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9891
9892
[HG297] 9893
10.5281/zenodo.8092796). 9896
9897
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9898

Reverse Strict Dimension Dominating As Hyper Dimple On Super Dimity” 9899
9900
https://www.researchgate.net/publication/371939401 9902
9903
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9904


Figure 44.4: [HG297] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Strict Dimension Dominating As Hyper Dimple On Super
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8092796).
https://www.scribd.com/document/656044153 9905
9906
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9907
9909
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9910
https://www.academia.edu/104010494 9911
9912
10.5281/zenodo.8092796). 9916
[ASSIGNED NUMBER] #297 Article 9917
[DATE] June 2023 9918
[DOI] 10.5281/zenodo.8092796 9919
[LICENSE] CC BY-NC-ND 4.0 9920

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9921
[AVAILABLE AT TWITTER’S IDS] 9922
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9923
googlebooks GooglePlay 9924
9925
[ASSIGNED NUMBER] | Book #188 9926

HG188b
Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyperGraphs”. Dr. Henry 9928


[TITLE] Reverse Strict Dimension Dominating In SuperHyperGraphs 9930

#Latest_Updates 9931
#The_Links 9932
9936
9938
#The_Links 9939
9940
[ASSIGNED NUMBER] | Book #188 9941

9942
[TITLE] Reverse Strict Dimension Dominating In SuperHyperGraphs 9943
9944
9948
– 9949
9950
[PUBLISHER] 9951
(Paperback): https://www.amazon.com/dp/- 9952
(Hardcover): https://www.amazon.com/dp/- 9953

(Kindle Edition): https://www.amazon.com/dp/- 9954
9955
– 9956
9957
[ISBN] 9958
(Paperback): - 9959
(Hardcover): - 9960
(Kindle Edition): CC BY-NC-ND 4.0 9961
(EBook): CC BY-NC-ND 4.0 9962
9963
– 9964
9965
[PRINT LENGTH] 9966
(Paperback): - pages 9967
(Hardcover): - pages 9968
(Kindle Edition): - pages 9969
(E-Book): - pages 9970
9971
– 9972
9973
9975

#The_Links 9976
9977
https://www.researchgate.net/publication/- 9979
9980
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9981
https://drhenrygarrett.wordpress.com/2023/07/22/ 9982
Reverse-Strict-Dimension-Dominating-In-SuperHyperGraphs/ 9983
9984
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9985
https://www.scribd.com/document/- 9986
9987
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9988
https://www.academia.edu/- 9989
9990
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9991
9993
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9994
https://books.google.com/books/about?id=- 9995
9996
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9997
https://play.google.com/store/books/details?id=- 9998

[TITLE] Reverse Strict Dimension Dominating In SuperHyperGraphs (Published Version) 9999

10000
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 10001
10002
https://drhenrygarrett.wordpress.com/2023/07/22/ 10003
Reverse-Strict-Dimension-Dominating-In-SuperHyperGraphs/ 10004
10005
– 10006
10007
[POSTED BY] Dr. Henry Garrett 10008
10009
[DATE] June 028, 2023 10010

10011
[POSTED IN] 188 | Reverse Strict Dimension Dominating In SuperHyperGraphs 10012
10013
[TAGS] 10014
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 10015
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 10016
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 10017
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 10018
neutrosophic SuperHyperGraphs, Neutrosophic Reverse Strict Dimension Dominating In 10019
SuperHyperGraphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathemat- 10020
ics, Questions, Real-World Applications, Recent Research, Recognitions, Research, scientific 10021
research Article, scientific research Articles, scientific research Book, scientific research Chapter, 10022
scientific research Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, 10023
SuperHyperGraph Theory, SuperHyperGraphs, Reverse Strict Dimension Dominating In 10024
SuperHyperGraphs, SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, 10025
Vertices. 10026
In this scientific research book, there are some scientific research chapters on “Extreme 10027
Reverse Strict Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Reverse 10028
Strict Dimension Dominating In SuperHyperGraphs” about some scientific research on Reverse 10029
Strict Dimension Dominating In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, 10030
namely, Extreme Reverse Strict Dimension Dominating In SuperHyperGraphs and Neutrosophic 10031
Reverse Strict Dimension Dominating In SuperHyperGraphs. With scientific research on 10032
the basic scientific research properties, the scientific research book starts to make Extreme 10033
Reverse Strict Dimension Dominating In SuperHyperGraphs theory and Neutrosophic Reverse 10034
Strict Dimension Dominating In SuperHyperGraphs theory more (Extremely/Neutrosophicly) 10035
understandable. 10036

HG188b1.png
Figure 44.7: [HG188b] Henry Garrett, “Reverse Strict Dimension Dominating In SuperHyper-
Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8092816).

HG188b2.png

HG188b3.png

CHAPTER 45 10037
“SuperHyperGraph-Based Books”: | 10038
Featured Tweets 10039
“SuperHyperGraph-Based Books”: | Featured Tweets 10040
481
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 10041
CV 10042
509
10043
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
10044
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)
10045
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

10046

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
10047
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

10048
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

10049
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

10050
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

10051
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

10052
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

10053
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

10054
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

10055
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

10056
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).
10057
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

10058
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

10059
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

10060
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

10061
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

10062
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/-
10063
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

10064
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

10065
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

10066
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

10067
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

10068
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

10069
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

10070
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

10071
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

10072
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

10073
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

10074
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

10075
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

10076
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

10077
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

10078
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

10079
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
10080
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).
10081
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
10082
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”,
10083
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”,
10084
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
10085
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
10086
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
10087
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).
10088
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).
10089
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).
10090
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

10091
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).
10092
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).
10093
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).
10094
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

10095
[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

10096
[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

10097
[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

10098
[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

10099
[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

10100
[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

10101
[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

10102
[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

10103
[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

10104
[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

10105
[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

10106
[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

10107
[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

10108
[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

10109
[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

10110
[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

10111
[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

10112
[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

10113
[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

10114
[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

10115
[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

10116
[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

10117
[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

10118
[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

10119
[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

10120
[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

10121
[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

10122
[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

10123
[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

10124
[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
10125
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

10126
[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

10127
[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

10128
[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

10129
[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

10130
[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
10131
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

10132
“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

10133
[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
10134
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

10135
[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

10136
[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

10137
[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

10138
[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

10139
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

10140
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
10141
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
10142
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

10143
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

10144
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
-
10145
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

10146
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

10147
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
10148
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
10149
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

10150
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
10151
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
...
10152
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/
10153
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
10154
10155
10156
Henry Garrett
01/23/2022
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
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
10210

Reverse Strict 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

Reverse Strict Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

Reverse Strict Dimension

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 49

5 Extreme Reverse Strict Dimension Dominating 53

6 New Ideas On Super Dimity By Hyper Dimple Of Reverse Strict

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 SuperHyperReverse Strict Dimension Dominating But As The Exten-

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 257

25 Neutrosophic Reverse Strict Dimension Dominating 261

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 SuperHyperReverse Strict Dimension Dominating But As The

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 355

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 363

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 469

45 “SuperHyperGraph-Based Books”: | Featured Tweets 481

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 ·

45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 482

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

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