Reverse Dimension Dominating in SuperHyperGraphs

See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/371783383
Reverse Dimension Dominating In SuperHyperGraphs
Book · June 2023

DOI: 10.5281/zenodo.8072310
CITATIONS
1 author:
Henry Garrett
504 PUBLICATIONS 21,753 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
On Fuzzy Logic View project
On Algebraic Structures and Algebraic Hyperstructures View project
All content following this page was uploaded by Henry Garrett on 22 June 2023.
The user has requested enhancement of the downloaded file.

Reverse 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 45
4 Cancer In Extreme SuperHyperGraph 47
5 Extreme Reverse Dimension Dominating 51
6 New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension

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

Scientific Research 61
9 Extreme Preliminaries Of This Scientific Research On the Redeemed Ways 65
10 Extreme SuperHyperReverse Dimension Dominating But As The Extensions

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

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

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

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

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

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

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

21 Extreme SuperHyperTotal But As The Extensions Excerpt From Dense

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

23 Background 221
Bibliography 227
24 Cancer In Neutrosophic SuperHyperGraph 253
25 Neutrosophic Reverse Dimension Dominating 257
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

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

Scientific Research 267

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 271
30 Neutrosophic SuperHyperReverse Dimension Dominating But As The Exten-

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

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

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

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

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

Motivations 357
37 Conclusion and Closing Remarks 359
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 417
43 Background 431
Bibliography 437
44 Books’ Contributions 463
45 “SuperHyperGraph-Based Books”: | Featured Tweets 475
46 CV 503

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

SuperHyperReverse Dimension Dominating in the Extreme Example (42.0.3) . . . . . . . 83
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 Dimension Dominating in the Example (42.0.5) . . . . . . . . . . . . . . . . . . 120
11.2 an Extreme SuperHyperCycle Associated to the Extreme Notions of Extreme
SuperHyperReverse Dimension Dominating in the Extreme Example (42.0.7) . . . . . . . . 122
11.3 an Extreme SuperHyperStar Associated to the Extreme Notions of Extreme
SuperHyperReverse Dimension Dominating in the Extreme Example (42.0.9) . . . . . . . . 123
11.4 Extreme SuperHyperBipartite Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Dimension Dominating in the Example (42.0.11) . . . . . . . 125
11.5 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme
SuperHyperReverse Dimension Dominating in the Example (42.0.13) . . . . . . . . . . . . 127
11.6 an Extreme SuperHyperWheel Extreme Associated to the Extreme Notions of
Extreme SuperHyperReverse Dimension Dominating in the Extreme Example (42.0.15) . . 128
14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

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

SuperHyperReverse Dimension Dominating . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

of Neutrosophic SuperHyperReverse Dimension Dominating in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 292


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


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 306
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG284] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of
Reverse Dimension Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8072267). . . . . . . . . . 464
44.4 [HG285] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Dimension Dominating As Hyper Dimple On Super
Dimity”, Zenodo 2023, (doi: 10.5281/zenodo.8072171). . . . . . . . . . . . . . . . . 466

44.7 [HG182b] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8072310). . . . . . . . . . . . . . . . 471
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 476

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

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) 74
Belong to The Neutrosophic SuperHyperGraph, Mentioned in the Definition (29.0.22) 75

Belong to The Extreme SuperHyperBipartite . . . . . . . . . . . . . . . . . . . . . 144

Belong to The Extreme SuperHyperMultipartite . . . . . . . . . . . . . . . . . . . 146
17.1 An Overlook On This Research And Beyond . . . . . . . . . . . . . . . . . . . . . 150

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 354

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

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

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

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

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

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

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

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

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 80

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

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

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

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

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

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

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

SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, 196
there’s the usage of the position of labels to assign to the values. Assume a Neutrosophic 197
SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” if the intended Table holds. 198
And Reverse Dimension Dominating In SuperHyperGraphs are redefined “Neutrosophic Reverse 199
Dimension Dominating In SuperHyperGraphs” if the intended Table holds. It’s useful to define 200
“Neutrosophic” version of SuperHyperClasses. Since there’s more ways to get Neutrosophic 201
type-results to make Neutrosophic Reverse Dimension Dominating In SuperHyperGraphs more 202
understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 203
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Reverse Dimension Dom- 204
inating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, 205
and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Reverse Dimension 206

Dominating In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHy- 207
perBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” 208
if the intended Table holds. A SuperHyperGraph has “Neutrosophic Reverse Dimension 209
Dominating In SuperHyperGraphs” where it’s the strongest [the maximum Neutrosophic value 210
from all Reverse Dimension Dominating In SuperHyperGraphs amid the maximum value 211
amid all SuperHyperVertices from a Reverse Dimension Dominating In SuperHyperGraphs 212

.] Reverse Dimension Dominating In SuperHyperGraphs . A graph is SuperHyperUniform 213
if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 214
Assume a Neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s 215
SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges 216

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

261

Some scientific studies and scientific researches about neutrosophic graphs, are proposed 262
as book in the following by Henry Garrett (2022) which is indexed by Google Scholar and has 263
more than 3181 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published by 264
Ohio: E-publishing: Educational Publisher 1091 West 1st Ave Grandview Heights, Ohio 43212 265
United State. This research book covers different types of notions and settings in neutrosophic 266
graph theory and neutrosophic SuperHyperGraph theory. 267

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

which is popular in the terms of high readers in Scribd. 286
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 287
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 288
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 289
[Ref] Henry Garrett, (2022). “Neutrosophic Duality”, Florida: GLOBAL KNOWLEDGE 290
- Publishing House 848 Brickell Ave Ste 950 Miami, Florida 33131 United States. ISBN: 291
978-1-59973-743-0 (http://fs.unm.edu/NeutrosophicDuality.pdf). 292




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

of neutrosophic SuperHyperGraph. It’s published in prestigious and fancy journal is entitled 329
“Journal of Mathematical Techniques and Computational Mathematics(JMTCM)” with ISO 330
abbreviation “J Math Techniques Comput Math” in volume 1 and issue 3 with pages 242-263. 331
The research article studies deeply with choosing directly neutrosophic SuperHyperGraph and 332
SuperHyperGraph. It’s the breakthrough toward independent results based on initial background 333
and fundamental SuperHyperNumbers. The seminal paper and groundbreaking article is titled 334
“neutrosophic co-degree and neutrosophic degree alongside chromatic numbers in the setting of 335
some classes related to neutrosophic hypergraphs” in Ref. [HG55s] by Henry Garrett (2023). 336
In this research article, a novel approach is implemented on SuperHyperGraph and neutrosophic 337
SuperHyperGraph based on general forms without using neutrosophic classes of neutrosophic 338
SuperHyperGraph. It’s published in prestigious and fancy journal is entitled “Journal of Current 339
Trends in Computer Science Research (JCTCSR)” with ISO abbreviation “J Curr Trends Comp 340
Sci Res” in volume 2 and issue 1 with pages 16-24. The research article studies deeply with choos- 341
ing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the breakthrough 342
toward independent results based on initial background. The research article studies deeply 343
with choosing neutrosophic hypergraphs instead of neutrosophic SuperHyperGraph. It’s the 344
breakthrough toward independent results based on initial background. In some articles are titled 345
“0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving and (Dual)Coloring 346
alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph” in Ref. [HG4] by Henry 347
Garrett (2022), “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs” in Ref. [HG5] 348
by Henry Garrett (2022), “Extreme SuperHyperClique as the Firm Scheme of Confrontation 349
under Cancer’s Recognition as the Model in The Setting of (Neutrosophic) SuperHyperGraphs” in 350
Ref. [HG6] by Henry Garrett (2022), “Uncertainty On The Act And Effect Of Cancer Alongside 351
The Foggy Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 352
SuperHyperGraphs Titled Cancer’s Recognition” in Ref. [HG7] by Henry Garrett (2022), 353
“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s Recognition On Neutrosophic 354
SuperHyperGraphs” in Ref. [HG8] by Henry Garrett (2022), “The Shift Paradigm To Classify 355
Separately The Cells and Affected Cells Toward The Totality Under Cancer’s Recognition By 356
New Multiple Definitions On the Sets Polynomials Alongside Numbers In The (Neutrosophic) 357
SuperHyperMatching Theory Based on SuperHyperGraph and Neutrosophic SuperHyperGraph” 358

in Ref. [HG9] by Henry Garrett (2022), “Breaking the Continuity and Uniformity of Cancer 359
In The Worst Case of Full Connections With Extreme Failed SuperHyperClique In Cancer’s 360
Recognition Applied in (Neutrosophic) SuperHyperGraphs” in Ref. [HG10] by Henry Garrett 361
(2022), “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s Neutrosophic 362
Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHyperGraphs” in Ref. 363

[HG11] by Henry Garrett (2022), “Extremism of the Attacked Body Under the Cancer’s Circum- 364
stances Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG12] 365
by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 366
And (Neutrosophic) SuperHyperGraphs” in Ref. [HG13] by Henry Garrett (2022), “Neut- 367
rosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable To Act on 368
Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG14] by Henry Garrett 369
(2022), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutro- 370
sophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. [HG15] 371
by Henry Garrett (2022), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 372
SuperHyperModelled (Neutrosophic) SuperHyperGraphs ” in Ref. [HG16] by Henry Garrett 373

(2022), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic SuperHyperStable 374

To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. [HG12] by 375
Henry Garrett (2022), “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutro- 376
sophic) SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” 377
in Ref. [HG17] by Henry Garrett (2022), “Neutrosophic Messy-Style SuperHyperGraphs To 378
Form Neutrosophic SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special 379
ViewPoints” in Ref. [HG18] by Henry Garrett (2022),“(Neutrosophic) SuperHyperModeling of 380

Cancer’s Recognitions Featuring (Neutrosophic) SuperHyperDefensive SuperHyperAlliances” in 381
Ref. [HG19] by Henry Garrett (2022), “(Neutrosophic) SuperHyperAlliances With SuperHyper- 382
Defensive and SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph 383
With (Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 384
SuperHyperClasses” in Ref. [HG20] by Henry Garrett (2022), “SuperHyperGirth on Su- 385
perHyperGraph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s 386

Recognitions” in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and 387
Co-SuperHyperDegrees on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside 388
Applications in Cancer’s Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyper- 389
Dominating and SuperHyperResolving on Neutrosophic SuperHyperGraphs And Their Directions 390
in Game Theory and Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett 391
(2022), “SuperHyperMatching By (R-)Definitions And Polynomials To Monitor Cancer’s Recog- 392

nition In Neutrosophic SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The 393
Focus on The Partitions Obtained By Parallel Moves In The Cancer’s Extreme Recognition 394
With Different Types of Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) 395
SuperHyperGraphs” in Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyper- 396
Clique Decides the Failures on the Cancer’s Recognition in the Perfect Connections of Cancer’s 397
Attacks By SuperHyperModels Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by 398

Henry Garrett (2023), “Indeterminacy On The All Possible Connections of Cells In Front of 399
Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recogni- 400
tion called Neutrosophic SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect 401
Directions Toward Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic 402
SuperHyperClique on Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett 403
(2023), “Demonstrating Complete Connections in Every Embedded Regions and Sub-Regions in 404
the Terms of Cancer’s Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) 405
SuperHyperClique” in Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types 406
of Neutrosophic Regions titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic 407
Recognition modeled in the Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by 408
Henry Garrett (2023), “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 409
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by 410
Henry Garrett (2023), “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 411
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints” in Ref. 412
[HG32] by Henry Garrett (2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition 413
by Well-SuperHyperModelled (Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry 414
Garrett (2023), “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To Use 415

Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond” in Ref. 416
[HG34] by Henry Garrett (2022), “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s 417
Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG35] by Henry Garrett (2022), 418
“Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) SuperHyperMod- 419

eling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by 420

Henry Garrett (2022), “Basic Neutrosophic Notions Concerning SuperHyperDominating and 421
Neutrosophic SuperHyperResolving in SuperHyperGraph” in Ref. [HG37] by Henry Garrett 422
(2022), “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic Notions 423
Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyperGraph (NSHG)” 424
in Ref. [HG38] by Henry Garrett (2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; 425
HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; HG19; 426
HG20; HG21; HG22; HG23; HG24; HG25; HG26; HG27; HG28; HG29; HG30; 427
HG952; HG96; HG962; HG97; HG972; HG98; HG982; HG106; HG107; HG111; 429
HG281; HG282; HG283; HG284; HG285], there are some endeavors to formalize the basic 446
SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside 447
scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; 448
HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; HG76b; 449
HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; HG105b; 452
HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; HG113b; 453


HG178b; HG179b; HG180b; HG181b; HG182b]. Two popular scientific research books 462
in Scribd in the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is on 463
[HG32b; HG44b]. 464
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 465

book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 466
more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 467
by Dr. Henry Garrett. This research book covers different types of notions and settings in 468
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 469
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 470
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 471
has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 472
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 473
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 474
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 475
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 476
that what’s done in this research book which is popular in the terms of high readers in Scribd. 477
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the 478
notions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Supe- 479
rHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; 480
HG278; HG279; HG280; HG281; HG282; HG283; HG284; HG285] alongside scientific 501
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 502



HG179b; HG180b; HG181b; HG182b]. Two popular scientific research books in Scribd in 516
the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; 517
HG44b]. 518

Bibliography 519
HG11s [1] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 520
Graph As Hyper Tool On Super Toot”, Curr Trends Mass Comm 2(1) (2023) 32- 521
55. (https://www.opastpublishers.com/open-access-articles/new-ideas-in-recognition-of- 522
cancer-and-neutrosophic-super-hypergraph-as-hyper-tool-on-super-toot.pdf) 523
HG22s [2] Henry Garrett, “Some Super Hyper Degrees and Co-Super Hyper Degrees on Neut- 524
rosophic Super Hyper Graphs And Super Hyper Graphs Alongside Applications 525
in Cancer’s Treatments”, J Math Techniques Comput Math 2(1) (2023) 35-47. 526
(https://www.opastpublishers.com/open-access-articles/some-super-hyper-degrees-and- 527
cosuper-hyper-degrees-on-neutrosophic-super-hyper-graphs-and-super-hyper-graphs- 528
alongside-a.pdf) 529
HG33s [3] Henry Garrett, “A Research on Cancer’s Recognition and Neutrosophic Super 530
Hypergraph by Eulerian Super Hyper Cycles and Hamiltonian Sets as Hyper Cov- 531
ering Versus Super separations”, J Math Techniques Comput Math 2(3) (2023) 532
136-148. (https://www.opastpublishers.com/open-access-articles/a-research-on-cancers- 533
recognition-and-neutrosophic-super-hypergraph-by-eulerian-super-hyper-cycles-and- 534
hamiltonian-sets-.pdf) 535
HG44s [4] Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic 536
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr 537
Trends Comp Sci Res 2(1) (2023) 16-24. (doi: 10.33140/JCTCSR.02.01.04) 538
HG55s [5] Henry Garrett, “Super Hyper Dominating and Super Hyper Resolving on Neutro- 539
sophic Super Hyper Graphs and Their Directions in Game Theory and Neutrosophic 540
Super Hyper Classes”, J Math Techniques Comput Math 1(3) (2022) 242-263. (doi: 541
10.33140/JMTCM.01.03.09) 542
HG4 [6] Garrett, Henry. “0039 | Closing Numbers and Super-Closing Numbers as (Dual)Resolving 543
and (Dual)Coloring alongside (Dual)Dominating in (Neutrosophic)n-SuperHyperGraph.” 544
CERN European Organization for Nuclear Research - Zenodo, Nov. 2022. CERN 545
European Organization for Nuclear Research, https://doi.org/10.5281/zenodo.6319942. 546
https://oa.mg/work/10.5281/zenodo.6319942 547
HG5 [7] Garrett, Henry. “0049 | (Failed)1-Zero-Forcing Number in Neutrosophic Graphs.” 548
CERN European Organization for Nuclear Research - Zenodo, Feb. 2022. CERN 549
19
European Organization for Nuclear Research, https://doi.org/10.13140/rg.2.2.35241.26724. 550

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

Preprints 2023, 2023010308 (doi: 10.20944/preprints202301.0308.v1). 554
HG7 [9] Henry Garrett, “Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 555
Positions Of Cells Toward Neutrosophic Failed SuperHyperClique inside Neutrosophic 556
SuperHyperGraphs Titled Cancer’s Recognition”, Preprints 2023, 2023010282 (doi: 557

10.20944/preprints202301.0282.v1). 558
HG8 [10] Henry Garrett, “Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 559
Recognition On Neutrosophic SuperHyperGraphs”, Preprints 2023, 2023010267 (doi: 560

10.20944/preprints202301.0267.v1). 561
HG9 [11] Henry Garrett, “The Shift Paradigm To Classify Separately The Cells and Affected Cells 562
Toward The Totality Under Cancer’s Recognition By New Multiple Definitions On the Sets 563
Polynomials Alongside Numbers In The (Neutrosophic) SuperHyperMatching Theory Based 564

on SuperHyperGraph and Neutrosophic SuperHyperGraph”, Preprints 2023, 2023010265 565
(doi: 10.20944/preprints202301.0265.v1). 566
HG10 [12] Henry Garrett, “Breaking the Continuity and Uniformity of Cancer In The Worst Case of 567
Full Connections With Extreme Failed SuperHyperClique In Cancer’s Recognition Applied 568
in (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010262,(doi: 10.20944/pre- 569
prints202301.0262.v1). 570
HG11 [13] Henry Garrett, “Neutrosophic Failed SuperHyperStable as the Survivors on the Cancer’s 571
Neutrosophic Recognition Based on Uncertainty to All Modes in Neutrosophic SuperHy- 572
perGraphs”, Preprints 2023, 2023010240 (doi: 10.20944/preprints202301.0240.v1). 573
HG12 [14] Henry Garrett, “Extremism of the Attacked Body Under the Cancer’s Circumstances 574
Where Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 575
2023010224, (doi: 10.20944/preprints202301.0224.v1). 576
HG13 [15] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Recognitions 577
And (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010105 (doi: 10.20944/pre- 578

prints202301.0105.v1). 579
HG14 [16] Henry Garrett, “Neutrosophic Messy-Style SuperHyperGraphs To Form Neutrosophic 580
SuperHyperStable To Act on Cancer’s Neutrosophic Recognitions In Special ViewPoints”, 581

HG15 [17] Henry Garrett, “Neutrosophic 1-Failed SuperHyperForcing in the SuperHyperFunction To 583
Use Neutrosophic SuperHyperGraphs on Cancer’s Neutrosophic Recognition And Beyond”, 584
Preprints 2023, 2023010044 585
HG16 [18] Henry Garrett, “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well- 586
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, Preprints 2023, 2023010043 (doi: 587
10.20944/preprints202301.0043.v1). 588

HG17 [19] Henry Garrett, “Basic Notions on (Neutrosophic) SuperHyperForcing And (Neutrosophic) 589
SuperHyperModeling in Cancer’s Recognitions And (Neutrosophic) SuperHyperGraphs”, 590
HG19 [21] Henry Garrett, “(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions Featuring 595
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, Preprints 2022, 2022120549 596
(doi: 10.20944/preprints202212.0549.v1). 597
HG20 [22] Henry Garrett, “(Neutrosophic) SuperHyperAlliances With SuperHyperDefensive and 598
SuperHyperOffensive Type-SuperHyperSet On (Neutrosophic) SuperHyperGraph With 599

(Neutrosophic) SuperHyperModeling of Cancer’s Recognitions And Related (Neutrosophic) 600
SuperHyperClasses”, Preprints 2022, 2022120540 (doi: 10.20944/preprints202212.0540.v1). 601
HG21 [23] Henry Garrett, “SuperHyperGirth on SuperHyperGraph and Neutrosophic SuperHyper- 602
Graph With SuperHyperModeling of Cancer’s Recognitions”, Preprints 2022, 2022120500 603
(doi: 10.20944/preprints202212.0500.v1). 604
HG22 [24] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 605
SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 606
HG23 [25] Henry Garrett, “SuperHyperDominating and SuperHyperResolving on Neutrosophic Super- 608
HyperGraphs And Their Directions in Game Theory and Neutrosophic SuperHyperClasses”, 609
HG285 [26] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 611
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, 612
(doi: 10.5281/zenodo.8072171). 613
HG284 [27] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension 614
Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 615

2023, (doi: 10.5281/zenodo.8072267). 616
By Equal Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 618
10.5281/zenodo.8067384). 619
HG282 [29] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Equal Dimension 620
2023, (doi: 10.5281/zenodo.8067409). 622
By Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 624
10.5281/zenodo.8061927). 625

HG280 [31] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Dimension Dominating 626
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 627
10.5281/zenodo.8062016). 628
By Reverse Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 630
10.5281/zenodo.8057696). 631
HG278 [33] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective 632
2023, (doi: 10.5281/zenodo.8057753). 634
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 636
10.5281/zenodo.8052893). 637
HG276 [35] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 638
2023, (doi: 10.5281/zenodo.8052925). 640
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 642
10.5281/zenodo.8051346). 643
HG274 [37] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 644
10.5281/zenodo.8051360). 646
HG273 [38] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 647
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 648
10.5281/zenodo.8025707). 649
HG272 [39] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 650
10.5281/zenodo.8027275). 652
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 654
odo.8017246). 655
HG270 [41] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 656
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 657
10.5281/zenodo.8020128). 658
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 660
odo.7978571). 661
HG268 [43] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 662
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 663
10.5281/zenodo.7978857). 664

Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 666
10.5281/zenodo.7940830). 667
HG266 [45] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 668
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 669
10.5281/zenodo.7943578). 670
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 672
odo.7916595). 673
HG264 [47] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 674
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 675
odo.7923632). 676
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 678
(doi: 10.5281/zenodo.7904698). 679
HG262 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 680
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 681
2023, (doi: 10.5281/zenodo.7904671). 682
By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 684
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 685
HG260 [51] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 686
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 687
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 688
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 690
10.5281/zenodo.7871026). 691
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 693
2023, (doi: 10.5281/zenodo.7874647). 694
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 696
10.5281/zenodo.7857856). 697
HG256 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 698
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 699
2023, (doi: 10.5281/zenodo.7857841). 700
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 702

Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 705
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 708
10.5281/zenodo.7853867). 709
HG252 [59] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 710
10.5281/zenodo.7853922). 712
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 714
(doi: 10.5281/zenodo.7851519). 715
HG250 [61] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 716
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 717
(doi: 10.5281/zenodo.7851550). 718
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 720
Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 723
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 726
10.5281/zenodo.7834229). 727
HG246 [65] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 728
10.5281/zenodo.7834261). 730
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 732
10.5281/zenodo.7824560). 733
HG244 [67] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 734
(doi: 10.5281/zenodo.7824623). 736
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 738
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 741

As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 744
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 746
2023, (doi: 10.5281/zenodo.7809365). 747
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 749
2023, (doi: 10.5281/zenodo.7809358). 750
HG238 [73] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 751

10.5281/zenodo.7809219). 753
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 755
10.5281/zenodo.7809328). 756
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 758
2023, (doi: 10.5281/zenodo.7806767). 759
HG235 [76] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 760

2023, (doi: 10.5281/zenodo.7806838). 762
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 764
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 765
HG233 [78] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 766
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 767
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 768
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 770
10.5281/zenodo.7799902). 771
HG231 [80] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 772
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 773
(doi: 10.5281/zenodo.7804218). 774
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 776
(doi: 10.5281/zenodo.7796334). 777
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 779

By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 782
10.5281/zenodo.7791952). 783
HG225 [84] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 784
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 785
10.5281/zenodo.7791982). 786
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 788
10.5281/zenodo.7790026). 789
HG223 [86] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 790
10.5281/zenodo.7790052). 792
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 794
2023, (doi: 10.5281/zenodo.7787066). 795
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 797
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 798
By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 800
10.5281/zenodo.7781476). 801
HG219 [90] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 802
10.5281/zenodo.7783082). 804
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 806
10.5281/zenodo.7777857). 807
HG217 [92] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 808
10.5281/zenodo.7779286). 810
HG215 [93] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 811
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 812
(doi: 10.5281/zenodo.7771831). 813
HG214 [94] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 814
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 815
2023, (doi: 10.5281/zenodo.7772468). 816
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 818
10.13140/RG.2.2.20913.25446). 819

HG212 [96] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 820
odo.7764916). 822
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 824
10.13140/RG.2.2.11770.98247). 825
HG210 [98] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 826
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 827
10.13140/RG.2.2.12400.12808). 828
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 830
2023, (doi: 10.13140/RG.2.2.22545.10089). 831
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 833
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 834
HG207 [101] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 835
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 836
10.13140/RG.2.2.11377.76644). 837
HG206 [102] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 838
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 839
10.13140/RG.2.2.23750.96329). 840
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 842
10.13140/RG.2.2.31366.24641). 843
HG204 [104] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 844
10.13140/RG.2.2.34721.68960). 846
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 848
2023, (doi: 10.13140/RG.2.2.30212.81289). 849
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 851
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 854
10.13140/RG.2.2.24288.35842). 855
HG200 [108] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 856
10.13140/RG.2.2.32467.25124). 858

By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 860
10.13140/RG.2.2.31025.45925). 861
HG198 [110] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 862
10.13140/RG.2.2.17184.25602). 864
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 866
10.13140/RG.2.2.23423.28327). 867
HG196 [112] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 868
10.13140/RG.2.2.28456.44805). 870
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 872
10.13140/RG.2.2.23525.68320). 873
HG194 [114] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 874
10.13140/RG.2.2.20170.24000). 876
By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 878
10.13140/RG.2.2.36475.59683). 879
HG192 [116] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 880
10.13140/RG.2.2.29764.71046). 882
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 884
2023, (doi: 10.13140/RG.2.2.18780.87683). 885
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 887
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 890
10.13140/RG.2.2.26134.01603). 891
HG188 [120] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 892
10.13140/RG.2.2.27392.30721). 894
HG187 [121] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 895
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 896
10.13140/RG.2.2.33028.40321). 897

Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 899
10.13140/RG.2.2.21389.20966). 900
HG185 [123] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 901
10.13140/RG.2.2.16356.04489). 903
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 905
10.13140/RG.2.2.21756.21129). 906
HG183 [125] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 907
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 908
10.13140/RG.2.2.30983.68009). 909
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 911
10.13140/RG.2.2.28552.29445). 912
HG181 [127] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 913
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 914
(doi: 10.13140/RG.2.2.10936.21761). 915
By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 917
10.13140/RG.2.2.35105.89447). 918
HG179 [129] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 919
(doi: 10.13140/RG.2.2.30072.72960). 921
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 923
10.13140/RG.2.2.31147.52003). 924
HG177 [131] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 925
10.13140/RG.2.2.32825.24163). 927
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 929
10.13140/RG.2.2.13059.58401). 930
HG175 [133] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 931
10.13140/RG.2.2.11172.14720). 933
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 935
2023, (doi: 10.13140/RG.2.2.22011.80165). 936

HG173 [135] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 937
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 938
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 939
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 941
2023, (doi: 10.13140/RG.2.2.10493.84962). 942
HG171 [137] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 943
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 945
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 947
2023, (doi: 10.13140/RG.2.2.19944.14086). 948
HG169 [139] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 949
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 951
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 953
(doi: 10.13140/RG.2.2.33103.76968). 954
HG167 [141] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 955
(doi: 10.13140/RG.2.2.23037.44003). 957
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 959
(doi: 10.13140/RG.2.2.35646.56641). 960
HG165 [143] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 961
10.13140/RG.2.2.18030.48967). 963
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 965
(doi: 10.13140/RG.2.2.13973.81121). 966
HG163 [145] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 967
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 968
2023, (doi: 10.13140/RG.2.2.34106.47047). 969
HG162 [146] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 970
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 971
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 974
2023, (doi: 10.13140/RG.2.2.31956.88961). 975

HG160 [148] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 976
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 977
2023, (doi: 10.13140/RG.2.2.15179.67361). 978
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 980
10.13140/RG.2.2.21510.45125). 981
HG158 [150] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 982
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 983
2023, (doi: 10.13140/RG.2.2.13121.84321). 984
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 986
10.13140/RG.2.2.11758.69441). 987
HG156 [152] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 988
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 989
2023, (doi: 10.13140/RG.2.2.31891.35367). 990
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 992
10.13140/RG.2.2.19360.87048). 993
HG154 [154] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 994
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 995
10.13140/RG.2.2.32363.21286). 996
HG153 [155] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 997
10.13140/RG.2.2.23266.81602). 999
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 1001
10.13140/RG.2.2.19911.37285). 1002
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 1004
10.13140/RG.2.2.11050.90569). 1005
HG150 [158] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 1006
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 1007
2023, (doi: 10.13140/RG.2.2.17761.79206). 1008
HG149 [159] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 1009
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1010
HG148 [160] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 1012
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 1013
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 1014

By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 1016
(doi: 10.13140/RG.2.2.30182.50241). 1017
HG146 [162] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 1018
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1019
HG145 [163] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1021
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1022
HG144 [164] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1024
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1025
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1026
HG143 [165] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1027
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1028
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1029
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1032
Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1035
HG140 [168] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1036
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1037
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1038
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1041
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1044
HG137 [171] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1045
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1046
HG136 [172] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1048
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1049
2023, (doi: 10.13140/RG.2.2.17252.24968). 1050
HG135 [173] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1051
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1052
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1053

HG134 [174] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1054
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1055
HG132 [175] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1057
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1058

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

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

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

Cancer’s Recognitions To Fail Forcing Style As the Super Classes With Hyper Effects 1068
In The Background of the Framework is So-Called (Neutrosophic) SuperHyperGraphs”, 1069

HG128 [179] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1071
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1072

Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1073
HG127 [180] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1074
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1075
2023,(doi: 10.13140/RG.2.2.36745.93289). 1076
HG126 [181] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1077
HG125 [182] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1080
10.20944/preprints202301.0282.v1). 1083
HG124 [183] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1084
10.20944/preprints202301.0267.v1).). 1086
(doi: 10.20944/preprints202301.0265.v1). 1091

HG122 [185] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1092
prints202301.0262.v1). 1095

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1103
10.13140/RG.2.2.35061.65767). 1104
HG25 [189] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1105
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1106
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1107

10.13140/RG.2.2.18494.15680). 1108
HG26 [190] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1109
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1110
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1111
10.13140/RG.2.2.32530.73922). 1112
HG27 [191] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1113
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1114
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1115

10.13140/RG.2.2.15897.70243). 1116
10.13140/RG.2.2.32530.73922). 1120

prints202301.0105.v1). 1123
HG28 [194] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1124
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1125
HG29 [195] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1127
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1128
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1129
10.13140/RG.2.2.23172.19849). 1130

HG30 [198] Henry Garrett,“Different Neutrosophic Types of Neutrosophic Regions titled neut- 1137
rosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled 1138
in the Form of Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1139
10.13140/RG.2.2.17385.36968). 1140
Preprints 2023, 2023010044 1143
10.20944/preprints202301.0043.v1). 1146
HG31 [201] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1147
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1148
2023, (doi: 10.13140/RG.2.2.28945.92007). 1149
SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1154
10.13140/RG.2.2.35774.77123). 1155

HG35 [205] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1159
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1160
10.13140/RG.2.2.29430.88642). 1161
(doi: 10.20944/preprints202212.0549.v1). 1167

(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1169
10.13140/RG.2.2.19380.94084). 1170
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1178
(doi: 10.20944/preprints202212.0500.v1). 1181
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1183
10.13140/RG.2.2.20993.12640). 1184
HG952 [213] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1185

HG95 [214] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1188
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1189
ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1190
HG37 [217] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1197
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1198

10.13140/RG.2.2.29173.86244). 1199
HG38 [218] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1200
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1201

Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1202
HG182b [219] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry 1203
Garrett, 2023 (doi: 10.5281/zenodo.8072310). 1204
HG181b [220] Henry Garrett, “Equal Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1205
2023 (doi: 10.5281/zenodo.8067469). 1206

HG180b [221] Henry Garrett, “Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1207
(doi: 10.5281/zenodo.8062076). 1208
HG179b [222] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1209
HG178b [223] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1211
2023 (doi: 10.5281/zenodo.8052976). 1212
HG177b [224] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1213
(doi: 10.5281/zenodo.8051368). 1214
HG176b [225] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1215
(doi: 10.5281/zenodo.8027488). 1216
HG175b [226] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1217
10.5281/zenodo.8020181). 1218
HG174b [227] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1219
10.5281/zenodo.7978921). 1220
HG173b [228] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1221
odo.7943878). 1222
HG172b [229] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1223
10.5281/zenodo.7943871). 1224
HG171b [230] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1225
10.5281/zenodo.7923786). 1226
HG170b [231] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1227
2023 (doi: 10.5281/zenodo.7905287). 1228
HG169b [232] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1229
HG168b [233] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1231
2023 (doi: 10.5281/zenodo.7874677). 1232
HG167b [234] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1233
(doi: 10.5281/zenodo.7857906). 1234
HG166b [235] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1235
2023 (doi: 10.5281/zenodo.7856329). 1236
HG165b [236] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1237
10.5281/zenodo.7854561). 1238
HG164b [237] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1239
2023 (doi: 10.5281/zenodo.7851893). 1240
HG163b [238] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1241

HG162b [239] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1243
(doi: 10.5281/zenodo.7835063). 1244
HG161b [240] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1245
(doi: 10.5281/zenodo.7826705). 1246
HG160b [241] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1247
2023 (doi: 10.5281/zenodo.7820680). 1248
HG159b [242] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1249
10.5281/zenodo.7812750). 1250
HG158b [243] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1251

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

HG156b [245] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1255
2023 (doi: 10.5281/zenodo.7807782). 1256
HG155b [246] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1257
2023 (doi: 10.5281/zenodo.7804449). 1258
HG154b [247] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1259
HG153b [248] Henry Garrett, “Hamiltonian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1261
(doi: 10.5281/zenodo.7792307). 1262
HG152b [249] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1263
(doi: 10.5281/zenodo.7790728). 1264
HG151b [250] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1265
2023 (doi: 10.5281/zenodo.7787712). 1266
HG150b [251] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1267
10.5281/zenodo.7783791). 1268
HG149b [252] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1269
10.5281/zenodo.7780123). 1270
HG148b [253] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1271
(doi: 10.5281/zenodo.7773119). 1272
HG147b [254] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1273
odo.7637762). 1274
HG146b [255] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1275
10.5281/zenodo.7766174). 1276
HG145b [256] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1277
10.5281/zenodo.7762232). 1278

HG144b [257] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1279
(doi: 10.5281/zenodo.7758601). 1280
HG143b [258] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1281
10.5281/zenodo.7754661). 1282
HG142b [259] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1283
10.5281/zenodo.7750995) . 1284
HG141b [260] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1285
(doi: 10.5281/zenodo.7749875). 1286
HG140b [261] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1287
10.5281/zenodo.7747236). 1288
HG139b [262] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1289
10.5281/zenodo.7742587). 1290
HG138b [263] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1291
(doi: 10.5281/zenodo.7738635). 1292
HG137b [264] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1293
10.5281/zenodo.7734719). 1294
HG136b [265] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1295
10.5281/zenodo.7730484). 1296
HG135b [266] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1297
(doi: 10.5281/zenodo.7730469). 1298
HG134b [267] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1299
10.5281/zenodo.7722865). 1300
HG133b [268] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1301
odo.7713563). 1302
odo.7709116). 1304
HG131b [270] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1305
10.5281/zenodo.7706415). 1306
HG130b [271] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1307
10.5281/zenodo.7706063). 1308
HG129b [272] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1309
10.5281/zenodo.7701906). 1310
HG128b [273] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1311
odo.7700205). 1312
HG127b [274] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1313
10.5281/zenodo.7694876). 1314

HG126b [275] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1315
10.5281/zenodo.7679410). 1316
HG125b [276] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1317
10.5281/zenodo.7675982). 1318
HG124b [277] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1319
10.5281/zenodo.7672388). 1320
HG123b [278] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1321
odo.7668648). 1322
HG122b [279] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1323
10.5281/zenodo.7662810). 1324
HG121b [280] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1325
10.5281/zenodo.7659162). 1326
HG120b [281] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1327
odo.7653233). 1328
HG119b [282] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1329
odo.7653204). 1330
HG118b [283] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1331
odo.7653142). 1332
HG117b [284] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1333
odo.7653117). 1334
HG116b [285] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1335
HG115b [286] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1336
odo.7651687). 1337
HG114b [287] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1338
odo.7651619). 1339
HG113b [288] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1340
odo.7651439). 1341
HG112b [289] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1342
odo.7650729). 1343
HG111b [290] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1344
odo.7647868). 1345
HG110b [291] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.7647017). 1347
HG109b [292] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1348
odo.7644894). 1349

HG108b [293] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1350
HG107b [294] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1351
odo.7632923). 1352
HG106b [295] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1353
odo.7623459). 1354
HG105b [296] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1355
10.5281/zenodo.7606416). 1356
HG104b [297] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1357
10.5281/zenodo.7606416). 1358
HG103b [298] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1359
odo.7606404). 1360
HG102b [299] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1361
10.5281/zenodo.7580018). 1362
HG101b [300] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1363
odo.7580018). 1364
odo.7580018). 1366
odo.7579929). 1368
HG98b [303] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1369
10.5281/zenodo.7563170). 1370
HG97b [304] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1371
odo.7563164). 1372
HG96b [305] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1373
odo.7563160). 1374
odo.7563160). 1376
HG94b [307] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1377
10.5281/zenodo.7563160). 1378
HG93b [308] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1379
10.5281/zenodo.7557063). 1380
HG92b [309] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1381
10.5281/zenodo.7557009). 1382
HG91b [310] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1383
10.5281/zenodo.7539484). 1384

HG90b [311] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1385
10.5281/zenodo.7523390). 1386
HG89b [312] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1387
10.5281/zenodo.7523390). 1388
HG88b [313] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1389
10.5281/zenodo.7523390). 1390
HG87b [314] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1391
odo.7574952). 1392
HG86b [315] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1393
10.5281/zenodo.7574992). 1394
odo.7523357). 1396
HG84b [317] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1397
10.5281/zenodo.7523357). 1398
HG83b [318] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1399
10.5281/zenodo.7504782). 1400
HG82b [319] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1401
10.5281/zenodo.7504782). 1402
HG81b [320] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1403
10.5281/zenodo.7504782). 1404
HG80b [321] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1405
10.5281/zenodo.7499395). 1406
HG79b [322] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1407
odo.7499395). 1408
HG78b [323] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1409
10.5281/zenodo.7499395). 1410
HG77b [324] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1411
10.5281/zenodo.7497450). 1412
HG76b [325] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1413
10.5281/zenodo.7497450). 1414
HG75b [326] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1415
10.5281/zenodo.7494862). 1416
HG74b [327] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1417
odo.7494862). 1418
HG73b [328] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1419
10.5281/zenodo.7494862). 1420

HG72b [329] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1421
10.5281/zenodo.7493845). 1422
HG71b [330] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1423
odo.7493845). 1424
HG70b [331] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1425
10.5281/zenodo.7493845). 1426
HG69b [332] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1427
odo.7539484). 1428
HG68b [333] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1429
odo.7523390). 1430
HG67b [334] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1431
odo.7523357). 1432
HG66b [335] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1433
odo.7504782). 1434
HG65b [336] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1435
odo.7499395). 1436
HG64b [337] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1437
odo.7497450). 1438
HG63b [338] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1439
odo.7494862). 1440
HG62b [339] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1441
odo.7493845). 1442
HG61b [340] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1443
odo.7480110). 1444
HG60b [341] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1445
odo.7378758). 1446
HG32b [342] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1447
odo.6320305). 1448
HG44b [343] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1449
odo.6677173). 1450

CHAPTER 3 1451
Acknowledgements 1452
The author is going to express his gratitude and his appreciation about the brains and their 1453
hands which are showing the importance of words in the framework of every wisdom, knowledge, 1454
arts, and emotions which are streaming in the lines from the words, notions, ideas and approaches The
1455 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
1456
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 1457
of acknowledgements
minds for surviving from them and making the outstanding experiences about the tools and the 1458
ideas to be on the star lines of words and shining like stars, forever. 1459
45
CHAPTER 4 1460
Cancer In Extreme SuperHyperGraph 1461
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 1462
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 1463
as the consequences of the model, some parameters are used. The cells are under attack of this 1464
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 1465
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 1466
In the following, some Extreme steps are Extreme devised on this disease. 1467
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 1468
function. 1469
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 1470
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 1471
effects of the cancer on that region; this event leads us to choose another model [it’s said 1474
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 1475
what’s done. 1476
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 1477
they’ve got the names, and some general Extreme models. The moves and the Extreme 1478
traces of the cancer on the complex tracks and between complicated groups of cells could be 1479
fantasized by an Extreme SuperHyperPath(-/SuperHyperK-Domination, SuperHyperStar, 1480
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find 1481
either the Extreme SuperHyperK-Domination or the Extreme SuperHyperK-Domination 1482
in those Extreme Extreme SuperHyperModels. 1483
Some cells have been faced with some attacks from the situation which is caused by the 1484
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 1485
which in that, the cells could be labelled as some groups and some groups or individuals have 1486
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 1487
the embedded situations, the individuals of cells and the groups of cells could be considered 1488
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 1489
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially 1490
called “SuperHyperGraphs” and “Extreme SuperHyperGraphs”. In this SuperHyperModel, the 1491
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between 1492
47
the individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s 1493
another motivation for us to do research on this SuperHyperModel based on the “Cancer’s 1494
Recognition”. Sometimes, the situations get worst. The situation is passed from the certainty 1495
and precise style. Thus it’s the beyond them. There are three descriptions, namely, the 1496
degrees of determinacy, indeterminacy and neutrality, for any object based on vague forms, 1497
namely, incomplete data, imprecise data, and uncertain analysis. The latter model could be 1498
considered on the previous SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph 1499

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1500
is going to figure out what’s going on this phenomenon. The special case of this disease is 1501
considered and as the consequences of the model, some parameters are used. The cells are 1502
under attack of this disease but the moves of the cancer in the special region are the matter of 1503
mind. The recognition of the cancer could help to find some treatments for this disease. The 1504
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1505
Recognition” and both bases are the background of this research. Sometimes the cancer has 1506
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1507
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1508
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1509
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1510
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1511
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1512
and neutrality about the moves and the effects of the cancer on that region; this event leads 1516
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1517
perception on what’s happened and what’s done. There are some specific models, which 1518
are well-known and they’ve got the names, and some general models. The moves and the 1519
traces of the cancer on the complex tracks and between complicated groups of cells could 1520
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1521
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1522
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1523

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1524
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1525
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1526
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1527
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1528
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1529
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1530
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1531
based on the fixed groups of cells or the fixed groups of group of cells? 1532
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1533
messy and dense SuperHyperModels where embedded notions are illustrated? 1534
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1535
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1536
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1537

research has taken more motivations to define SuperHyperClasses and to find some connections 1538
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1539
instances and examples to make clarifications about the framework of this research. The general 1540
results and some results about some connections are some avenues to make key point of this 1541
research, “Cancer’s Recognition”, more understandable and more clear. 1542
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1543
on the modeling of the regions where are under the attacks of the cancer to recognize 1544
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1545
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1546
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1547
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1548
instances and literature reviews have taken the whole way through. In this scientific research, 1549
the literature reviews have fulfilled the lines containing the notions and the results. The 1550
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1551
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1552
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1553
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1554
of the moves of the cancer in the longest and strongest styles with the formation of the design 1555
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1556
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1557
out the background for the SuperHyperNotions. 1558

CHAPTER 5 1559
Extreme Reverse Dimension Dominating 1560
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1561
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1562
2023, (doi: 10.13140/RG.2.2.34953.52320). 1563

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1564
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1565
(doi: 10.13140/RG.2.2.33275.80161). 1566
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1567
10.13140/RG.2.2.11050.90569). 1569
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1570
10.13140/RG.2.2.17761.79206). 1572
10.13140/RG.2.2.19911.37285). 1575
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1576
10.13140/RG.2.2.23266.81602). 1578
10.13140/RG.2.2.19360.87048). 1581
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1582
10.13140/RG.2.2.32363.21286). 1584
10.13140/RG.2.2.11758.69441). 1587
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1588
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1589
10.13140/RG.2.2.31891.35367). 1590
10.13140/RG.2.2.21510.45125). 1593
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1594
10.13140/RG.2.2.13121.84321). 1596

CHAPTER 6 1597
New Ideas On Super Dimity By Hyper 1598
Dimple Of Reverse Dimension 1599
Dominating In Recognition of Cancer 1600
With (Neutrosophic) SuperHyperGraph 1601
53
CHAPTER 7 1602
ABSTRACT 1603
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 1604

Dimension Dominating). Let a Neutrosophic SuperHyperGraph (NSHG) S be a Reverse Dimension 1605
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1606
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Dimension 1607
Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Dimension Dominating 1608
criteria holds 1609
∀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 Dimension Dominating if the following expression is called 1610

Neutrosophic e-SuperHyperReverse Dimension Dominating criteria holds 1611

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

SuperHyperReverse Dimension Dominating if the following expression is called Neutrosophic v- 1613
SuperHyperReverse Dimension Dominating criteria holds 1614
∀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 Dimension Dominating if the following expression is called 1615
Neutrosophic v-SuperHyperReverse Dimension Dominating criteria holds 1616

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1617
HyperReverse Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, 1618
Neutrosophic re-SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension 1619
Dominating, and Neutrosophic rv-SuperHyperReverse Dimension Dominating. ((Neutrosophic) SuperHy- 1620
perReverse Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 1621
55
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 1622

E is called an Extreme SuperHyperReverse Dimension Dominating if it’s either of Neutrosophic e- 1623
SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimension Dominating, Neut- 1624
rosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Dimen- 1625
sion Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 1626
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 1627
the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHy- 1628
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 1629
Dimension Dominating; a Neutrosophic SuperHyperReverse Dimension Dominating if it’s either of Neutro- 1630
sophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimension Dominat- 1631
ing, Neutrosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv-SuperHyperReverse 1632
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1633
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1634

sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 1635
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1636
SuperHyperReverse Dimension Dominating; an Extreme SuperHyperReverse Dimension Dominating SuperHy- 1637
perPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic 1638
re-SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension Dominating, and 1639
Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme Super- 1640
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 1641
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Ex- 1642
treme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality con- 1643
secutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1644
the Extreme SuperHyperReverse Dimension Dominating; and the Extreme power is corresponded 1645
to its Extreme coefficient; a Neutrosophic SuperHyperReverse Dimension Dominating SuperHyper- 1646

Polynomial if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic 1647
Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for a Neutrosophic SuperHy- 1649
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1650
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1651
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1652

cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1653
such that they form the Neutrosophic SuperHyperReverse Dimension Dominating; and the Neutrosophic 1654
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Dimen- 1655
sion Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic 1656

Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme SuperHy- 1658
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1659
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1660
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1661
the Extreme SuperHyperReverse Dimension Dominating; a Neutrosophic V-SuperHyperReverse Dimension 1662
Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re- 1663
SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension Dominating, and 1664
Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for a Neutrosophic Supe- 1665
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1666
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1667

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1668
the Neutrosophic SuperHyperReverse Dimension Dominating; an Extreme V-SuperHyperReverse Dimension 1669
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dom- 1670
inating, Neutrosophic re-SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse 1671
Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for 1672
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 1673
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 1674
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinal- 1675
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1676
form the Extreme SuperHyperReverse Dimension Dominating; and the Extreme power is corresponded 1677

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 1684
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 1687
introduced for new SuperHyperNotions, namely, a SuperHyperReverse Dimension Dominating and Neut- 1688
rosophic SuperHyperReverse Dimension Dominating. Two different types of SuperHyperDefinitions are 1689
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 1690
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 1691
implemented in the whole of this research. For shining the elegancy and the significancy of this 1692
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 1693
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 1694
and the instances thus the clarifications are driven with different tools. The applications are 1695
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 1696
Recognition” are the under research to figure out the challenges make sense about ongoing and 1697
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 1698
are different types of them. Some of them are individuals and some of them are well-modeled 1699
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 1700
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 1701
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 1702
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 1703
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 1704
this research. It’s also officially collected in the form of some questions and some problems. 1705
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Dimension 1706
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1707
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1708
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1709
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1710
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Dimension Dominating is 1711
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1712
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1713

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

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1715
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1716
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1717
SuperHyperReverse Dimension Dominating . Since there’s more ways to get type-results to make a 1718
SuperHyperReverse Dimension Dominating more understandable. For the sake of having Neutrosophic 1719
SuperHyperReverse Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHy- 1720
perReverse Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 1721
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1722
position of labels to assign to the values. Assume a SuperHyperReverse Dimension Dominating . It’s 1723
redefined a Neutrosophic SuperHyperReverse Dimension Dominating if the mentioned Table holds, 1724
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1725
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1726
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1727
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1728
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 1729
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 1730
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1731
on a SuperHyperReverse Dimension Dominating . It’s the main. It’ll be disciplinary to have the 1732
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1733
SuperHyperReverse Dimension Dominating until the SuperHyperReverse Dimension Dominating, then it’s offi- 1734
cially called a “SuperHyperReverse Dimension Dominating” but otherwise, it isn’t a SuperHyperReverse 1735
Dimension Dominating . There are some instances about the clarifications for the main definition 1736
titled a “SuperHyperReverse Dimension Dominating ”. These two examples get more scrutiny and 1737
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 1738
based on a SuperHyperReverse Dimension Dominating . For the sake of having a Neutrosophic Su- 1739
perHyperReverse Dimension Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 1740
SuperHyperReverse Dimension Dominating” and a “Neutrosophic SuperHyperReverse Dimension Dominating ”. 1741
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1742
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 1743
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 1744
rHyperGraph” if the intended Table holds. And a SuperHyperReverse Dimension Dominating are 1745
redefined to a “Neutrosophic SuperHyperReverse Dimension Dominating” if the intended Table holds. 1746
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1747
to get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Dimension Dominating 1748
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1749
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 1750
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 1751
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse Dimension 1752
Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 1753
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 1754
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Dimension Dominating” where 1755

it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse Dimension 1756
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperReverse 1757
Dimension Dominating .] SuperHyperReverse Dimension Dominating . A graph is a SuperHyperUniform 1758
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1759

with two exceptions; it’s SuperHyperReverse Dimension Dominating if it’s only one SuperVertex as 1762
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1763
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1764
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1765
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1766
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1768

be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1778
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1779
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1780
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1781
identified since there are some determinacy, indeterminacy and neutrality about the moves 1782
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1783
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1784

and what’s done. There are some specific models, which are well-known and they’ve got the 1785
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1786
cancer on the complex tracks and between complicated groups of cells could be fantasized 1787
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Dimension Dominating, SuperHyperStar, 1788
the longest SuperHyperReverse Dimension Dominating or the strongest SuperHyperReverse Dimension 1790
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Dimen- 1791
sion Dominating, called SuperHyperReverse Dimension Dominating, and the strongest SuperHyperReverse 1792
Dimension Dominating, called Neutrosophic SuperHyperReverse Dimension Dominating, some general results 1793
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 1794
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1795
to form any style of a SuperHyperReverse Dimension Dominating. There isn’t any formation of any 1796
SuperHyperReverse Dimension Dominating but literarily, it’s the deformation of any SuperHyperReverse 1797
Dimension Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 1798
rosophic SuperHyperReverse Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic 1799
SuperHyperGraphs theory are proposed. 1800
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Dimension Dominating, Cancer’s 1801
Neutrosophic Recognition 1802


CHAPTER 8 1804
Applied Notions Under The Scrutiny Of 1805
The Motivation Of This Scientific 1806
Research 1807
In this scientific research, there are some ideas in the featured frameworks of motivations. I 1808
try to bring the motivations in the narrative ways. Some cells have been faced with some 1809
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 1810
some embedded analysis on the ongoing situations which in that, the cells could be labelled 1811
as some groups and some groups or individuals have excessive labels which all are raised from 1812
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 1813
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 1814
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 1815
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Extreme 1816
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined 1817
as “SuperHyperVertices” and the relations between the individuals of cells and the groups of 1818
cells are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research 1819
on this SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations 1820
get worst. The situation is passed from the certainty and precise style. Thus it’s the beyond 1821
them. There are three descriptions, namely, the degrees of determinacy, indeterminacy and 1822
neutrality, for any object based on vague forms, namely, incomplete data, imprecise data, and 1823
uncertain analysis. The latter model could be considered on the previous SuperHyperModel. It’s 1824
SuperHyperModel. It’s SuperHyperGraph but it’s officially called “Extreme SuperHyperGraphs”. 1825
The cancer is the disease but the model is going to figure out what’s going on this phenomenon. 1826
The special case of this disease is considered and as the consequences of the model, some 1827
parameters are used. The cells are under attack of this disease but the moves of the cancer in 1828
the special region are the matter of mind. The recognition of the cancer could help to find some 1829
treatments for this disease. The SuperHyperGraph and Extreme SuperHyperGraph are the 1830
SuperHyperModels on the “Cancer’s Recognition” and both bases are the background of this 1831
research. Sometimes the cancer has been happened on the region, full of cells, groups of cells 1832
and embedded styles. In this segment, the SuperHyperModel proposes some SuperHyperNotions 1833
based on the connectivities of the moves of the cancer in the forms of alliances’ styles with the 1834
formation of the design and the architecture are formally called “ SuperHyperReverse Dimension 1835
Dominating” in the themes of jargons and buzzwords. The prefix “SuperHyper” refers to the 1836
61
theme of the embedded styles to figure out the background for the SuperHyperNotions. The 1837
recognition of the cancer in the long-term function. The specific region has been assigned by 1838
the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is 1839
identified by this research. Sometimes the move of the cancer hasn’t be easily identified since 1840
there are some determinacy, indeterminacy and neutrality about the moves and the effects of 1841
the cancer on that region; this event leads us to choose another model [it’s said to be Extreme 1842
SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There 1843
are some specific models, which are well-known and they’ve got the names, and some general 1844
models. The moves and the traces of the cancer on the complex tracks and between complicated 1845
groups of cells could be fantasized by an Extreme SuperHyperPath (-/SuperHyperReverse Dimension 1846
Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). 1847
The aim is to find either the optimal SuperHyperReverse Dimension Dominating or the Extreme 1848
SuperHyperReverse Dimension Dominating in those Extreme SuperHyperModels. Some general results 1849
are introduced. Beyond that in SuperHyperStar, all possible Extreme SuperHyperPath s 1850
have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three 1851
SuperHyperEdges to form any style of a SuperHyperReverse Dimension Dominating. There isn’t any 1852
formation of any SuperHyperReverse Dimension Dominating but literarily, it’s the deformation of any 1853
SuperHyperReverse Dimension Dominating. It, literarily, deforms and it doesn’t form. 1854
amount of SuperHyperReverse Dimension Dominating” of either individual of cells or the groups of cells 1856
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperReverse 1857
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 1858
Question 8.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1859
messy and dense SuperHyperModels where embedded notions are illustrated? 1860
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. Thus 1861
it motivates us to define different types of “ SuperHyperReverse Dimension Dominating” and “Extreme 1862
SuperHyperReverse Dimension Dominating” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. 1863

Then the research has taken more motivations to define SuperHyperClasses and to find some 1864
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1865
some instances and examples to make clarifications about the framework of this research. The 1866
general results and some results about some connections are some avenues to make key point of 1867
this research, “Cancer’s Recognition”, more understandable and more clear. 1868
The framework of this research is as follows. In the beginning, I introduce basic definitions 1869
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1870
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1871
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1872
review literature are applied to make sense about what’s going to figure out about the 1873
upcoming sections. The main definitions and their clarifications alongside some results 1874
about new notions, SuperHyperReverse Dimension Dominating and Extreme SuperHyperReverse Dimension 1875
Dominating, are figured out in sections “ SuperHyperReverse Dimension Dominating” and “Extreme 1876
SuperHyperReverse Dimension Dominating”. In the sense of tackling on getting results and in Reverse 1877
Dimension Dominating to make sense about continuing the research, the ideas of SuperHyperUniform 1878
and Extreme SuperHyperUniform are introduced and as their consequences, corresponded 1879
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 1880
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to origin of 1881

the notions, there are some smart steps toward the common notions to extend the new notions 1882
in new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results 1883
on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1884
about the general SuperHyperRelations and as concluding and closing section of theoretical 1885
research are contained in the section “General Results”. Some general SuperHyperRelations 1886
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1887
and discussed in the sections, “General Results”, “ SuperHyperReverse Dimension Dominating”, 1888
“Extreme SuperHyperReverse Dimension Dominating”, “Results on SuperHyperClasses” and “Results 1889
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1890
SuperHyperNotions to make sense about excellency of this research and going to figure out 1891
the word “best” as the description and adjective for this research as presented in section, 1892
“ SuperHyperReverse Dimension Dominating”. The keyword of this research debut in the section 1893
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1894
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1895
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1896
are some scrutiny and discernment on what’s done and what’s happened in this research in 1897
the terms of “questions” and “problems” to make sense to figure out this research in featured 1898
style. The advantages and the limitations of this research alongside about what’s done in this 1899
research to make sense and to get sense about what’s figured out are included in the section, 1900
“Conclusion and Closing Remarks”. 1901

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1908
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1909
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1910
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1911
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1912
ideas and their clarifications are addressed to Ref.[HG38]. 1913

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

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

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

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1927
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1928
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 . 1929
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1930
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1931
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1932
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1933

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1934
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1935
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1936
(NSHE) E. Thus, the ii0 th element of the Reverse Dimension Dominating of Neutrosophic 1937
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1938
are crisp sets. 1939

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

(Ref.[HG11s],Definition 2.7,p.3). 1941
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1942
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1943
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1944
(i) If |Vi | = 1, then Vi is called vertex; 1945
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1946
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1947
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1948
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1949
SuperEdge; 1950
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1951
SuperHyperEdge. 1952
If we choose different types of binary operations, then we could get hugely diverse types of 1953
general forms of Neutrosophic SuperHyperGraph (NSHG). 1954
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1955

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1956
x, y, z, w ∈ [0, 1]: 1957
(i) 1 ⊗ x = x; 1958
(ii) x ⊗ y = y ⊗ x; 1959
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1960
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1961

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

where 1964

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1965
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1968
1, 2, . . . , n0 ); 1969
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1970
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1971
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1972
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1973
0

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

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 2000
of elements of SuperHyperEdges are the same. 2001
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 2002
makes to have SuperHyperUniform more understandable. 2003
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 2004
Classes as follows. 2005
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 2006
two given SuperHyperEdges with two exceptions; 2007
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 2008
SuperHyperEdges; 2009
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 2010
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 2011
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 2012
in common; 2013
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 2014
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 2015
SuperHyperEdge in common; 2016
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 2017
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 2018
SuperVertex. 2019
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 2020
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 2021
(i) Vi , Vi+1 ∈ Ei0 ; 2022
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 2023
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 2024
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 2025
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 2026
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2027
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2028
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2029
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2031
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2032
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2033
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2034
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2035
perPath . 2036
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 2037
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2038
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2039
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2040
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2041
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2042

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 2055
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 2056
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 2057
Definition 9.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Dimension 2058

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

or E 0 is called 2062
(i) Neutrosophic e-SuperHyperReverse Dimension Dominating if the following expression is 2063

called Neutrosophic e-SuperHyperReverse Dimension Dominating criteria holds 2064

(ii) Neutrosophic re-SuperHyperReverse Dimension Dominating if the following expression is 2065

called Neutrosophic re-SuperHyperReverse Dimension Dominating criteria holds 2066

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2067
(iii) Neutrosophic v-SuperHyperReverse Dimension Dominating if the following expression is 2068
called Neutrosophic v-SuperHyperReverse Dimension Dominating criteria holds 2069

(iv) Neutrosophic rv-SuperHyperReverse Dimension Dominating if the following expression is 2070

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

e-SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimension Dom- 2074
inating, Neutrosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv- 2075
SuperHyperReverse Dimension Dominating. 2076

Definition 9.0.19. ((Neutrosophic) SuperHyperReverse Dimension Dominating). 2077

(i) an Extreme SuperHyperReverse Dimension Dominating if it’s either of Neutrosophic 2080

SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme SuperHyperGraph 2083
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2084

high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2085
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2086
form the Extreme SuperHyperReverse Dimension Dominating; 2087
(ii) a Neutrosophic SuperHyperReverse Dimension Dominating if it’s either of Neutro- 2088
sophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimen- 2089

sion Dominating, Neutrosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv- 2090
SuperHyperReverse Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 2091
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 2092
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2093
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 2094
form the Neutrosophic SuperHyperReverse Dimension Dominating; 2095
(iii) an Extreme SuperHyperReverse Dimension Dominating SuperHyperPolynomial if 2096

it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re- 2097
SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension Dominating, 2098
and Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme 2099
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2100
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2101
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 2102
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2103
that they form the Extreme SuperHyperReverse Dimension Dominating; and the Extreme power 2104
is corresponded to its Extreme coefficient; 2105
(iv) a Neutrosophic SuperHyperReverse Dimension Dominating SuperHyperPolynomial 2106

if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re- 2107
and Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for a Neutro- 2109
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2110

contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 2111
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2112
SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2113
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2114
SuperHyperReverse Dimension Dominating; and the Neutrosophic power is corresponded to its 2115
Neutrosophic coefficient; 2116
(v) an Extreme V-SuperHyperReverse Dimension Dominating if it’s either of Neutro- 2117



high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2122
(vi) a Neutrosophic V-SuperHyperReverse Dimension Dominating if it’s either of Neutro- 2125

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 2129
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2130
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2131
that they form the Neutrosophic SuperHyperReverse Dimension Dominating; 2132
(vii) an Extreme V-SuperHyperReverse Dimension Dominating SuperHyperPolynomial 2133

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

(viii) a Neutrosophic SuperHyperReverse Dimension Dominating SuperHyperPolynomial 2143

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2149
Neutrosophic coefficient. 2153
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Dimension Dominating). 2154

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

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

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

The Values of The SuperVertices The maximum Values of Its Vertices
The Values of The Edges The maximum Values of Its Vertices
The Values of The HyperEdges The maximum Values of Its Vertices
136TBL3
The Values of The SuperHyperEdges The maximum Values of Its Endpoints
(ii) a Neutrosophic δ−SuperHyperReverse Dimension Dominating is a Neutrosophic kind 2161

of Neutrosophic SuperHyperReverse Dimension Dominating such that either of the following 2162
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2163
of s ∈ S : 2164
|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 2165

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2166
For the sake of having a Neutrosophic SuperHyperReverse Dimension Dominating, there’s a need to 2167
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2168
there’s the usage of the position of labels to assign to the values. 2170
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2171
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2172
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2173
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2174
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2175

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2176
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Dimension Dominating, SuperHyperStar, 2177

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2178
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2179
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2180
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2181
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Dimension 2182
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 2183
Dimension Dominating more Neutrosophicly understandable. 2184
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Dimension Dominating”. The 2186
2189

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

136TBL4

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

CHAPTER 10 2192
Extreme SuperHyper But As The Reverse Dimension Dominating 2193
Extensions Excerpt From Dense And 2194
Super Forms 2195
Definition 10.0.1. (Extreme event). 2196
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2197
is a probability Reverse Dimension Dominating. Any Extreme k-subset of A of V is called Extreme 2198
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2199
expression is called Extreme probability of A. 2200
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2201

is a probability Reverse Dimension Dominating. s Extreme k-events Ai , i ∈ I is called Extreme 2203

s-independent if the following expression is called Extreme s-independent criteria 2204
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 2205
following expression is called Extreme independent criteria 2206
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2207

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2208
a probability Reverse Dimension Dominating. Any k-function Reverse Dimension Dominating like E is called 2209
Extreme k-Variable. If k = 2, then any 2-function Reverse Dimension Dominating like E is called 2210
Extreme Variable. 2211
The notion of independent on Extreme Variable is likewise. 2212
Definition 10.0.4. (Extreme Expectation). 2213
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2214
77
probability Reverse Dimension Dominating. an Extreme k-Variable E has a number is called Extreme 2215
Expectation if the following expression is called Extreme Expectation criteria 2216
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2217

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2218
a probability Reverse Dimension Dominating. an Extreme number is called Extreme Crossing if the 2219
following expression is called Extreme Crossing criteria 2220
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 2221
S = (V, E) is a probability Reverse Dimension Dominating. Let m and n propose special Reverse Dimension 2222
Dominating. Then with m ≥ 4n, 2223
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 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: 2224
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2225
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2226
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let P be a SuperHyperSet of n 2227
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 2228
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2229
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2230

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2249
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2250
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2251
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2252
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2253
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let X be a nonnegative Extreme 2254
Variable and t a positive real number. Then 2255
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. 2256
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2257
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let Xn be a nonnegative integer- 2258
valued variable in a probability Reverse Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2259
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2260
Proof. 2261
Consider S = (V, E) is a probability Reverse Dimension Dominating. A special SuperHyperGraph in 2263
Gn,p almost surely has stability number at most d2p−1 log ne. 2264

S = (V, E) is a probability Reverse Dimension Dominating. A special SuperHyperGraph in Gn,p is 2266
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2267
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2268
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2269
SuperHyperEdge of the Extreme SuperHyperGraph G. 2270
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2271
Extreme Variable for this Extreme Event. By equation, we have 2272
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 2273
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2274
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: 2275
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2276
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 2277
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2278
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2279
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2280
Definition 10.0.12. (Extreme Variance). 2281

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

S = (V, E) is a probability Reverse Dimension Dominating. Let X be an Extreme Variable and let t be 2289
a positive real number. Then 2290
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2291
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let Xn be an Extreme Variable in 2293
a probability Reverse Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2294
then 2295
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 2297
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2298
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2299
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2301
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 2302
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2303
S = (V, E) is a probability Reverse Dimension Dominating. As in the proof of related Theorem, the 2305
result is straightforward. 2306
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 2308
as defined in previous Theorem. Then either: 2309
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2310
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2311
S = (V, E) is a probability Reverse Dimension Dominating. The latter is straightforward. 2313
Definition 10.0.17. (Extreme Threshold). 2314

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

Definition 10.0.18. (Extreme Balanced). 2321

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

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2329
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2332
the mentioned Extreme Figures in every Extreme items. 2333
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperReverse 2334
Dimension Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2335
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2336
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2337
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2338
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2339
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2340
Extreme SuperHyperReverse Dimension Dominating. 2341
C(N SHG)Extreme Reverse Dimension Dominating =

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

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

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2354



{}.
= 0z 0 .
{}.
= 0z 0 .
2357

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

= z 7−c .
2360

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

{EN SHG − {Ei }}.

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

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

= z 3−a .
2369

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

{EN SHG − {E1 , E5 }}.



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

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


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

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


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

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2396

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


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

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


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

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


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

all minus all Extreme SuperHypeNeighbors to any amount of them. 2416

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2418
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2419
quasi-R-Reverse Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2420
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2421
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Dimension Dominating, 2422
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2423
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 Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Dimension Dominating 2424
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2425
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2426

SuperHyperReverse Dimension Dominating in the Extreme Example (42.0.3) 95NHG2
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2427
of Extreme SuperHyperVertices are renamed to Extreme Reverse Dimension Dominating in some cases 2428
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2429
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2430
R-Reverse Dimension Dominating. 2431
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Reverse 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 Dimension Dominating with the least Extreme cardinality, 2432
the lower sharp Extreme bound for cardinality. 2433
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2434
Then in the worst case, literally, 2435
C(N SHG)ExtremeQuasi−ReverseDimensionDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseDimensionDominatingSuperHyperP olynomial = z 5 .

Is an Extreme type-result-Reverse Dimension Dominating. In other words, the least cardinality, the 2436
lower sharp bound for the cardinality, of an Extreme type-result-Reverse Dimension Dominating is the 2437
cardinality of 2438
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseDimensionDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseDimensionDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseDimensionDominatingSuperHyperP 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 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 Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of a quasi-R-Reverse 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 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 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 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 Dimension Dominating has the Extreme cardinality of an Extreme
SuperHyperEdge. Thus, an Extreme R-Reverse 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 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 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 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 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 Dimension Dominating. Those Extreme
SuperHyperVertices are potentially included in an Extreme style-R-Reverse 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 Dimension Dominating is
{aE , bE , cE , . . . , zE } .
This definition coincides with the definition of the Extreme R-Reverse 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 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, 2439
Extreme R-Reverse Dimension Dominating =

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

2440
Extreme R-Reverse Dimension Dominating =

Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Reverse 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 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 Dimension Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Dimension Dominating 2441
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2442
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2443
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2444
number of Extreme SuperHyperVertices are renamed to Extreme Reverse Dimension Dominating in 2445
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2446
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2447
contained in an Extreme R-Reverse Dimension Dominating. 2448
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious 2449
Extreme SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 2450
the Extreme optimal SuperHyperObject. It specially delivers some remarks on the Extreme 2451
SuperHyperSet of the Extreme SuperHyperVertices such that there’s distinct amount of Extreme 2452
SuperHyperEdges for distinct amount of Extreme SuperHyperVertices up to all taken from that 2453
Extreme SuperHyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of 2454
the Extreme SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or 2455
it doesn’t have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, 2456
there’s at least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. 2457
Thus it forms an Extreme quasi-R-Reverse Dimension Dominating where the Extreme completion of the 2458
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Reverse Dimension 2459
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 2460
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 2461
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those 2462
SuperHyperSets have the maximum Extreme SuperHyperCardinality and they’re Extreme 2463
SuperHyperOptimal. The less than two distinct types of Extreme SuperHyperVertices are 2464
included in the minimum Extreme style of the embedded Extreme R-Reverse Dimension Dominating. 2465
The interior types of the Extreme SuperHyperVertices are deciders. Since the Extreme number 2466
of SuperHyperNeighbors are only affected by the interior Extreme SuperHyperVertices. The 2467
common connections, more precise and more formal, the perfect unique connections inside 2468
the Extreme SuperHyperSet for any distinct types of Extreme SuperHyperVertices pose the 2469
Extreme R-Reverse Dimension Dominating. Thus Extreme exterior SuperHyperVertices could be used 2470
only in one Extreme SuperHyperEdge and in Extreme SuperHyperRelation with the interior 2471
Extreme SuperHyperVertices in that Extreme SuperHyperEdge. In the embedded Extreme 2472
Reverse Dimension Dominating, there’s the usage of exterior Extreme SuperHyperVertices since they’ve 2473

more connections inside more than outside. Thus the title “exterior” is more relevant than 2474
the title “interior”. One Extreme SuperHyperVertex has no connection, inside. Thus, the 2475
Extreme SuperHyperSet of the Extreme SuperHyperVertices with one SuperHyperElement 2476
has been ignored in the exploring to lead on the optimal case implying the Extreme R-Reverse 2477
Dimension Dominating. The Extreme R-Reverse Dimension Dominating with the exclusion of the exclusion 2478
of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge and with other terms, 2479
the Extreme R-Reverse Dimension Dominating with the inclusion of all Extreme SuperHyperVertices 2480
in one Extreme SuperHyperEdge, is an Extreme quasi-R-Reverse Dimension Dominating. To sum 2481
them up, in a connected non-obvious Extreme SuperHyperGraph ESHG : (V, E). There’s 2482
only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities of 2483
the distinct interior Extreme SuperHyperVertices inside of any given Extreme quasi-R-Reverse 2484
Dimension Dominating minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2485
In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only two 2486
distinct Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Dimension Dominating, minus all 2487
Extreme SuperHypeNeighbor to some of them but not all of them. 2488
The main definition of the Extreme R-Reverse Dimension Dominating has two titles. an Extreme quasi-R- 2489
Reverse Dimension Dominating and its corresponded quasi-maximum Extreme R-SuperHyperCardinality 2490
are two titles in the terms of quasi-R-styles. For any Extreme number, there’s an Extreme 2491
quasi-R-Reverse Dimension Dominating with that quasi-maximum Extreme SuperHyperCardinality 2492

in the terms of the embedded Extreme SuperHyperGraph. If there’s an embedded Extreme 2493
SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to take the collection of 2494
all the Extreme quasi-R-Reverse Dimension Dominatings for all Extreme numbers less than its Extreme 2495
corresponded maximum number. The essence of the Extreme Reverse Dimension Dominating ends up 2496
but this essence starts up in the terms of the Extreme quasi-R-Reverse Dimension Dominating, again 2497
and more in the operations of collecting all the Extreme quasi-R-Reverse Dimension Dominatings acted 2498
on the all possible used formations of the Extreme SuperHyperGraph to achieve one Extreme 2499
number. This Extreme number is 2500
considered as the equivalence class for all corresponded quasi-R-Reverse Dimension Dominatings. 2501
Let zExtreme Number , SExtreme SuperHyperSet and GExtreme Reverse Dimension Dominating be an Extreme 2502
number, an Extreme SuperHyperSet and an Extreme Reverse Dimension Dominating. Then 2503
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Reverse Dimension Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Reverse Dimension Dominating is re-formalized 2504
and redefined as follows. 2505
GExtreme Reverse 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 2506
definition for the Extreme Reverse Dimension Dominating. 2507
GExtreme Reverse 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 2508
poses the upcoming expressions.
Dimension Dominating 2509

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

= max zExtreme Number

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


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


2513

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

2514


2515


Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2516
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2517
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2518
It’s, literarily, another name for “Extreme Quasi-Reverse Dimension Dominating” but, precisely, it’s the 2519
generalization of “Extreme Quasi-Reverse Dimension Dominating” since “Extreme Quasi-Reverse Dimension 2520
Dominating” happens “Extreme Reverse Dimension Dominating” in an Extreme SuperHyperGraph as 2521

initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2522
“Extreme Reverse Dimension Dominating” in an Extreme SuperHyperGraph as initial framework and 2523
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2524
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2525
“Extreme Quasi-Reverse Dimension Dominating”, and “Extreme Reverse Dimension Dominating” are up. 2526
Thus, let 2527

zExtreme Number , NExtreme SuperHyperNeighborhood and 2528
GExtreme Reverse Dimension Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2529
and an Extreme Reverse Dimension Dominating and the new terms are up. 2530
GExtreme Reverse Dimension Dominating ∈ ∪zExtreme Number

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


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

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

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

2534

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

2535


2536


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

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

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

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

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

includes only one Extreme SuperHyperVertex. But the Extreme SuperHyperSet of Extreme
SuperHyperVertices,
doesn’t have less than two SuperHyperVertices inside the intended Extreme SuperHyperSet
since they’ve come from at least so far an SuperHyperEdge. Thus the non-obvious simple
Extreme type-SuperHyperSet of the Extreme R-Reverse 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 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 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 Dimension Dominating and
it’s an Extreme Reverse 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 Dimension Dominating. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Reverse Dimension Dominating,

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

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

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

Modeling. It’s also, not only an Extreme free-triangle embedded SuperHyperModel and an
Extreme on-triangle embedded SuperHyperModel but also it’s an Extreme stable embedded
SuperHyperModel. But all only non-obvious simple Extreme type-SuperHyperSets of the
Extreme R-Reverse Dimension Dominating amid those obvious simple Extreme type-SuperHyperSets of
the Extreme Reverse 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 Dimension Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Reverse Dimension Dominating is the cardinality of
2544
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2545
Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Dimension Dominating if for any 2546
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2547
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2548
all minus all Extreme SuperHypeNeighbors to any amount of them. 2549

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2550
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2551
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2552
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2553
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2554
R-Reverse Dimension Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2555
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2556
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2557
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2558
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Reverse Dimension Dominating. 2559
Since it doesn’t have 2560
2561

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

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2563
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2564
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Super- 2565
HyperVertices but it isn’t an Extreme R-Reverse Dimension Dominating. Since it doesn’t do the 2566
Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have some 2567
Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyperVertex outside 2568
implying there’s, sometimes in the connected Extreme SuperHyperGraph ESHG : (V, E), 2569
an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to that Extreme 2570
SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the Extreme pro- 2571
cedure”.]. There’s only one Extreme SuperHyperVertex outside the intended Extreme 2572
SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. Thus 2573
the obvious Extreme R-Reverse Dimension Dominating, VESHE is up. The obvious simple Extreme 2574
type-SuperHyperSet of the Extreme R-Reverse Dimension Dominating, VESHE , is an Extreme SuperHy- 2575
perSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of Extreme 2576
pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyperGraph 2577
ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE , 2578
is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet S of 2579
Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have some 2580
Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2581
ESHG : (V, E). Any Extreme R-Reverse Dimension Dominating only contains all interior Extreme 2582
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2583
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2584
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2585
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2586
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2587
The SuperHyperNotion, namely, Reverse Dimension Dominating, is up. There’s neither empty 2588
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2589
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2590
the Extreme Reverse Dimension Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2591
perEdges[SuperHyperVertices], 2592
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ReverseDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ReverseDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ReverseDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Reverse Dimension Dominating. The Extreme 2593
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2594

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2596
2597
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2598
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2599

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2600
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2601
Extreme SuperHyperSet. Thus the non-obvious Extreme Reverse Dimension Dominating is up. The 2602
obvious simple Extreme type-SuperHyperSet called the Extreme Reverse Dimension Dominating is an 2603
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2604
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2605
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 SuperHyper- 2606
Set. Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Dimension 2607
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2608
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 Dimension Dominating. 2610
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2611
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Reverse Dimension Dominating C(ESHG) for an Extreme SuperHyperGraph 2612
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2613

that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given 2614
by that Extreme type-SuperHyperSet called the Extreme Reverse Dimension Dominating and it’s an 2615
Extreme Reverse Dimension Dominating. Since it’s 2616
2617
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2618
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2619

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2620
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2621
intended Extreme SuperHyperSet, 2622
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Reverse Dimension Dominating , 2623
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 Dimension Dominating, 2624
not: 2625
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2626
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 2627
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2628
SuperHyperSet called the 2629
“Extreme Reverse Dimension Dominating ” 2630
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2631
Extreme Reverse Dimension Dominating , 2632
is only and only 2633
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2634

CHAPTER 11 2635
The Extreme Departures on The 2636
Theoretical Results Toward Theoretical 2637
Motivations 2638
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2639
SuperHyperClasses. 2640
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2641

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

perReverse 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 2644
new way to redefine as 2645
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 2646
to ViEXT ERN AL in the literatures of SuperHyperReverse Dimension Dominating. The latter is 2647
straightforward. 2648
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2649
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2650
(31.1), is the SuperHyperReverse Dimension Dominating. 2651
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2652

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

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

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

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

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

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

SuperHyperReverse 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 2666
way to redefine as 2667

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2671
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2672
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2673
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperReverse 2674
Dimension Dominating. 2675
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2676

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


= z b−a .
{VN SHG − {VPi , VPj }i6=j }.
= z b−a .
Proof. Let 2677
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
2678
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 2679
a new way to redefine as 2680

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

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

Extreme SuperHyperReverse Dimension Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2690
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2691
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2692
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2693
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2694
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperReverse Dimension Dominating. 2695
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2696
Then 2697

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

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

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

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

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

SuperHyperReverse Dimension Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2713
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2714
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2715
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2716
the Extreme SuperHyperReverse Dimension Dominating. 2717
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2718

Then, 2719

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

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

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

straightforward. Then there’s at least one SuperHyperReverse Dimension Dominating. Thus the notion 2725
of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Dimension Dominating 2726
could be applied. The unique embedded SuperHyperReverse Dimension Dominating proposes some 2727
longest SuperHyperReverse Dimension Dominating excerpt from some representatives. The latter is 2728
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2730
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2731
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2732
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2733
Extreme SuperHyperReverse Dimension Dominating. 2734

CHAPTER 12 2735
The Surveys of Mathematical Sets On 2736
The Results But As The Initial Motivation 2737
For the SuperHyperReverse Dimension Dominating, Extreme SuperHyperReverse Dimension Dominating, and 2738
the Extreme SuperHyperReverse Dimension Dominating, some general results are introduced. 2739
Remark 12.0.1. Let remind that the Extreme SuperHyperReverse Dimension Dominating is “redefined” 2740
on the positions of the alphabets. 2741
Corollary 12.0.2. Assume Extreme SuperHyperReverse Dimension Dominating. Then 2742
Extreme SuperHyperReverseDimensionDominating =
{theSuperHyperReverseDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseDimensionDominating
|ExtremecardinalityamidthoseSuperHyperReverseDimensionDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2743
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2744
and the neutrality, for i = 1, 2, 3, respectively. 2745
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2746
alphabet. Then the notion of Extreme SuperHyperReverse Dimension Dominating and SuperHyperReverse 2747
Dimension Dominating coincide. 2748
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperReverse 2750
Dimension Dominating if and only if it’s a SuperHyperReverse Dimension Dominating. 2751
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 2753
Dimension Dominating if and only if it’s a longest SuperHyperReverse Dimension Dominating. 2754
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2755
identical letter of the alphabet. Then its Extreme SuperHyperReverse Dimension Dominating is its 2756
SuperHyperReverse Dimension Dominating and reversely. 2757
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Dimension Dominating, 2758

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2759
identical letter of the alphabet. Then its Extreme SuperHyperReverse Dimension Dominating is its 2760
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2762
isn’t well-defined if and only if its SuperHyperReverse Dimension Dominating isn’t
well-defined. 2764
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2765

Extreme SuperHyperReverse Dimension Dominating isn’t well-defined if and only if its SuperHyperReverse 2766
Dimension Dominating isn’t well-defined. 2767

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2769
Extreme SuperHyperReverse Dimension Dominating isn’t well-defined if and only if its SuperHyperReverse 2770
Dimension Dominating isn’t well-defined. 2771
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2772
is well-defined if and only if its SuperHyperReverse Dimension Dominating is well-
defined. 2774
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2775
Extreme SuperHyperReverse Dimension Dominating is well-defined if and only if its SuperHyperReverse 2776
Dimension Dominating is well-defined. 2777
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2779

Extreme SuperHyperReverse Dimension Dominating is well-defined if and only if its SuperHyperReverse 2780
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2782
(i) : the dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2783
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2784
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2785
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2786
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2787
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2788
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2789
(i) : the SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2790
(ii) : the strong SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2791
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2792
(iv) : the δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2793

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

independent SuperHyperSet is 2797
(iii) : the connected SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2800
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2804

which is a SuperHyperReverse Dimension Dominating/SuperHyperPath. Then V is a maximal 2805
(i) : SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2806
(ii) : strong SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2807
(iii) : connected SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2808
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2809
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2810
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2811
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2812
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2813
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2814
(i) : dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2815
(ii) : strong dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2816
(iii) : connected dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2817
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2818
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2819
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2820
which is a SuperHyperReverse Dimension Dominating/SuperHyperPath. Then the number of 2823

(i) : the SuperHyperReverse Dimension Dominating; 2824
(ii) : the SuperHyperReverse Dimension Dominating; 2825
(iii) : the connected SuperHyperReverse Dimension Dominating; 2826
(iv) : the O(ESHG)-SuperHyperReverse Dimension Dominating; 2827
(v) : the strong O(ESHG)-SuperHyperReverse Dimension Dominating; 2828
(vi) : the connected O(ESHG)-SuperHyperReverse Dimension Dominating. 2829
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2830
coincide. 2831

which is a SuperHyperWheel. Then the number of 2833
(i) : the dual SuperHyperReverse Dimension Dominating; 2834
(ii) : the dual SuperHyperReverse Dimension Dominating; 2835
(iii) : the dual connected SuperHyperReverse Dimension Dominating; 2836
(iv) : the dual O(ESHG)-SuperHyperReverse Dimension Dominating; 2837
(v) : the strong dual O(ESHG)-SuperHyperReverse Dimension Dominating; 2838
(vi) : the connected dual O(ESHG)-SuperHyperReverse Dimension Dominating. 2839
coincide. 2841

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2843
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2844
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2845
is a 2846
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2850
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2851
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2852


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2855
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2856
SuperHyperPart is a 2857
(iv) : δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2861
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2862
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2863

SuperHyperMultipartite. Then Then the number of 2866
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2873
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2874
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2876
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2877
(iv) : SuperHyperReverse Dimension Dominating; 2881
(v) : strong 1-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2882
(vi) : connected 1-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2883

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2884
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2885
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2886
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2887

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

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

2 + 1)-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2894
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2895
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2896
dual 2897
(iv) : 0-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2901
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2904
perComplete. Then there’s no independent SuperHyperSet. 2905
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2906
HyperReverse Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2907
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2908
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2912
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2913
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2914

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2925
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2926
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2927
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2928
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2929
SuperHyperDefensive SuperHyperReverse Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2930
(i) v ∈ Ns (x); 2931
(ii) vx ∈ E. 2932
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2933
SuperHyperDefensive SuperHyperReverse Dimension Dominating, then 2934
(i) S is SuperHyperReverse Dimension Dominating set; 2935
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2936
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2937
(i) Γ ≤ O; 2938
(ii) Γs ≤ On . 2939
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2940
connected. Then 2941
(i) Γ ≤ O − 1; 2942
(ii) Γs ≤ On − Σ3i=1 σi (x). 2943
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2944
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperReverse 2945
Dimension Dominating; 2946

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2947
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2948
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2949
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2951
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Dimension 2952
Dominating; 2953
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2954
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2955
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2956
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Dimension Dominating. Then 2958
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 2959
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2961
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2962
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2963
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Dimension Dominating. Then 2965

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2969
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2970
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2972
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Dimension Dominating; 2973
(ii) Γ = 1; 2974
(iii) Γs = Σ3i=1 σi (c); 2975
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Dimension Dominating. 2976
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2977

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2978
SuperHyperDefensive SuperHyperReverse Dimension Dominating; 2979
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2980
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2981
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2982
SuperHyperDefensive SuperHyperReverse Dimension Dominating. 2983
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2984
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperReverse Dimension 2985
Dominating; 2986
(ii) Γ = b n2 c + 1; 2987
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

b n c+1 ; 2988
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 2989
Proposition 12.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 2991
bnc
2
Dominating; 2993
(ii) Γ = b n2 c; 2994

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

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

Dimension Dominating for N SHF; 3001
(ii) Γ = m for N SHF : (V, E); 3002
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 3003
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse 3004
Dimension Dominating for N SHF : (V, E). 3005
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 3006
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 3007

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

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

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

bnc for N SHF : (V, E); 3019
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Dimension Dominating 3020
for N SHF : (V, E). 3021
following statements hold; 3023
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3024

SuperHyperReverse Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 3025
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Su- 3027

perHyperReverse Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperReverse 3028
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3032
SuperHyperReverse Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 3033


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 13 3098
Extreme Applications in Cancer’s 3099
Extreme Recognition 3100
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3101
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3102
as the consequences of the model, some parameters are used. The cells are under attack of this 3103
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3104
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3105
In the following, some Extreme steps are Extreme devised on this disease. 3106
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3107
function. 3108
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3109
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3110
effects of the cancer on that region; this event leads us to choose another model [it’s said 3113
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3114
what’s done. 3115
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3116
they’ve got the names, and some general Extreme models. The moves and the Extreme 3117
traces of the cancer on the complex tracks and between complicated groups of cells 3118
could be fantasized by an Extreme SuperHyperPath(-/SuperHyperReverse Dimension Dominating, 3119
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3120
aim is to find either the Extreme SuperHyperReverse Dimension Dominating or the Extreme 3121
SuperHyperReverse Dimension Dominating in those Extreme Extreme SuperHyperModels. 3122
141
CHAPTER 14 3123
Case 1: The Initial Extreme Steps 3124
Toward Extreme SuperHyperBipartite 3125
as Extreme SuperHyperModel 3126
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3127
is Extreme highlighted and Extreme featured. 3128
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3129
partite is obtained. 3130
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3131
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperReverse Dimension Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3135
Case 2: The Increasing Extreme Steps 3136
Toward Extreme 3137
SuperHyperMultipartite as Extreme 3138
SuperHyperModel 3139
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3140
ite is Extreme highlighted and Extreme featured. 3141
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3142
partite is obtained. 3143
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3144
Figure 15.1: an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

145
Belong to The Extreme SuperHyperMultipartite

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

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

CHAPTER 16 3148
Wondering Open Problems But As The 3149
Directions To Forming The Motivations 3150
In what follows, some “problems” and some “questions” are proposed. 3151
The SuperHyperReverse Dimension Dominating and the Extreme SuperHyperReverse Dimension Dominating 3152
are defined on a real-world application, titled “Cancer’s Recognitions”. 3153
Question 16.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 3154
recognitions? 3155
Question 16.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Dimension 3156
and the Extreme SuperHyperReverse Dimension Dominating?
Dominating 3157
Question 16.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 3158
them? 3159
Question 16.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse 3160
and the Extreme SuperHyperReverse Dimension Dominating?
Problem 16.0.5. The SuperHyperReverse Dimension Dominating and the Extreme SuperHyperReverse 3162
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperReverse Dimension Dominating, are there else? 3164
Problem 16.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 3165
Numbers types-results? 3166
Problem 16.0.7. What’s the independent research based on Cancer’s recognitions concerning 3167
the multiple types of SuperHyperNotions? 3168
147
CHAPTER 17 3169
Conclusion and Closing Remarks 3170
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 3171
research are illustrated. Some benefits and some advantages of this research are highlighted. 3172
This research uses some approaches to make Extreme SuperHyperGraphs more understandable. 3173
In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse Dimension 3174
Dominating. For that sake in the second definition, the main definition of the Extreme 3175
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 3176
for the Extreme SuperHyperGraph, the new SuperHyperNotion, Extreme SuperHyperReverse 3177
Dimension Dominating, finds the convenient background to implement some results based on that. 3178
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 3179
on the modeling of the regions where are under the attacks of the cancer to recognize this 3180
disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances on 3181
the SuperHyperNotion, SuperHyperReverse Dimension Dominating, the new SuperHyperClasses and 3182
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 3183
SuperHyperReverse Dimension Dominating and the Extreme SuperHyperReverse Dimension Dominating. The 3184
clarifications, instances and literature reviews have taken the whole way through. In this 3185
research, the literature reviews have fulfilled the lines containing the notions and the results. 3186
The SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the 3187
“Cancer’s Recognitions” and both bases are the background of this research. Sometimes the 3188
cancer has been happened on the region, full of cells, groups of cells and embedded styles. In this 3189
and the architecture are formally called “ SuperHyperReverse Dimension Dominating” in the themes of 3192
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 3193
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 3194
for this research are, figured out, pointed out and spoken out. 3195
149
Table 17.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Extreme SuperHyperGraph 1. General Results
2. SuperHyperReverse Dimension Dominating
3. Extreme SuperHyperReverse Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 18 3196
Extreme SuperHyperDuality But As The 3197
Super Forms 3199
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3200

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

Va ∈ Ei , Ej ; 3204
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3205
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3206
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3207
Vi , Vj ∈ Ea ; 3208
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3209
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3210
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3211
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3212

SuperHyperDuality. 3213
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3214

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3219
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3220
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3221
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3222
Extreme SuperHyperDuality; 3223
151
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3224

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3225
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3226
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3227
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3228
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3229
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3230

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3231
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3232
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3233
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3234
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3235
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3237
coefficient; 3238
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3239

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3275
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3276
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3277
Extreme coefficient. 3278
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3279
mentioned Extreme Figures in every Extreme items. 3280
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3281
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3282
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3283
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3284
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3285
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- 3289
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3290
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3291
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3292
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3293
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3294
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3295


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

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 3339
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 3342
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3343
(31.1), is the SuperHyperDuality. 3346
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 3348
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3365
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 3367
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. 3371
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3372
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3373
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3374
representative in the 3375
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 : 3376

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3388

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

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

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

∃!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 3413
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3414
Extreme SuperHyperDuality. 3420

CHAPTER 19 3421
Extreme SuperHyperJoin But As The 3422
Super Forms 3424
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3425

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3436
|Vj |Extreme CARDINALITY ; 3437
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3438
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3439
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3440

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3444
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3445
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3446
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3447
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3448
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3449

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3456
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3457
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3458
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3459
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3460
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3461
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3462
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3463

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3479
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3480
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3482
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3483
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3484

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3487

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

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

SuperHyperJoin. 3508
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 3510
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3511
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3512
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3513
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3514
V3 , is excluded in every given Extreme SuperHyperJoin. 3515

is up. The Extreme Algorithm is Extremely straightforward. 3517


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3638
Extreme SuperHyperPerfect But As The 3639
Super Forms 3641
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3642

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3654
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3655

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3659
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3660
Extreme SuperHyperPerfect; 3664
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3665

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3672
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3673
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3678
coefficient; 3679
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3680

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3716
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3717
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3718
Extreme coefficient. 3719
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3722
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3723
SuperHyperPerfect. 3729
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 3731
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3732
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3736


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

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

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

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

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



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

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

Then 3827

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



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

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

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


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

CHAPTER 21 3862
Extreme SuperHyperTotal But As The 3863
Super Forms 3865
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3866
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3869
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3870

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3876
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3877

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3881
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3884
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3885
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3886

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal 3887
193

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3901
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3903
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3904
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3905
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3907
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3908

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3909
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3912
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3913
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3914

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3921
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3922
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3925
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3926
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3927
coefficient; 3928
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3929

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3932
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3933
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3934
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3936
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3939
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3940
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3941
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3942
SuperHyperTotal. 3946
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 3948
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3949
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3950
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3951
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3952
V3 , is excluded in every given Extreme SuperHyperTotal. 3953



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 4001
(31.1), is the SuperHyperTotal. 4004
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 4006
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. 4013
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 4015
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4077
Extreme SuperHyperConnected But As 4078
The Extensions Excerpt From Dense And 4079
Super Forms 4080
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4081

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4095
SuperHyperConnected. 4096
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4097
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4100

SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 4102
207
Extreme SuperHyperConnected; 4106
(ii) a Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4107

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4114
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4115
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4116
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4117
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4118
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4119
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4120
corresponded to its Extreme coefficient; 4121
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4122


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

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

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

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

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

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

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

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

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


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

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

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 4222
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. 4226
(31.1), is the SuperHyperConnected. 4229
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 4231
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. 4238
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 4240



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4259

ESHB : (V, E). Thus only some SuperHyperVertices and only minimum-Extreme-of- 4260
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperConnected. 4267
Then 4269
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 4270
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Extreme SuperHyperMultipartite 4271


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4294
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4295
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4296
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4297
some representatives. The latter is straightforward. 4298
Extreme SuperHyperConnected. 4303

CHAPTER 23 4304
Background 4305
221












HG280; HG281; HG282; HG283], there are some endeavors to formalize the basic Super- 4457
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 4458


HG179b; HG180b; HG181b]. Two popular scientific research books in Scribd in the terms 4473
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 4474


HG277; HG278; HG279; HG280; HG281; HG282; HG283] alongside scientific re- 4511
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4512




Bibliography 4528
10.33140/JMTCM.01.03.09) 4551
227



10.20944/preprints202301.0282.v1). 4567

10.20944/preprints202301.0267.v1). 4570

(doi: 10.20944/preprints202301.0265.v1). 4575
prints202301.0262.v1). 4579
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4585

prints202301.0105.v1). 4588

Preprints 2023, 2023010044 4594
10.20944/preprints202301.0043.v1). 4597

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

(doi: 10.20944/preprints202212.0500.v1). 4613
10.5281/zenodo.8067384). 4622

2023, (doi: 10.5281/zenodo.8067409). 4625
10.5281/zenodo.8061927). 4628
10.5281/zenodo.8062016). 4631
10.5281/zenodo.8057696). 4634

2023, (doi: 10.5281/zenodo.8057753). 4637
10.5281/zenodo.8052893). 4640
2023, (doi: 10.5281/zenodo.8052925). 4643
10.5281/zenodo.8051346). 4646
10.5281/zenodo.8051360). 4649
10.5281/zenodo.8025707). 4652
10.5281/zenodo.8027275). 4655
odo.8017246). 4658
10.5281/zenodo.8020128). 4661
odo.7978571). 4664
10.5281/zenodo.7978857). 4667
10.5281/zenodo.7940830). 4670
10.5281/zenodo.7943578). 4673

odo.7916595). 4676
odo.7923632). 4679
(doi: 10.5281/zenodo.7904698). 4682
2023, (doi: 10.5281/zenodo.7904671). 4685
10.5281/zenodo.7871026). 4694
2023, (doi: 10.5281/zenodo.7874647). 4697
10.5281/zenodo.7857856). 4700
2023, (doi: 10.5281/zenodo.7857841). 4703
10.5281/zenodo.7853867). 4712

10.5281/zenodo.7853922). 4715
(doi: 10.5281/zenodo.7851519). 4718
(doi: 10.5281/zenodo.7851550). 4721
10.5281/zenodo.7834229). 4730
10.5281/zenodo.7834261). 4733
10.5281/zenodo.7824560). 4736
(doi: 10.5281/zenodo.7824623). 4739

2023, (doi: 10.5281/zenodo.7809365). 4750

2023, (doi: 10.5281/zenodo.7809358). 4753
10.5281/zenodo.7809219). 4756
10.5281/zenodo.7809328). 4759
2023, (doi: 10.5281/zenodo.7806767). 4762
2023, (doi: 10.5281/zenodo.7806838). 4765
10.5281/zenodo.7799902). 4774
(doi: 10.5281/zenodo.7804218). 4777
(doi: 10.5281/zenodo.7796334). 4780
10.5281/zenodo.7791952). 4786
10.5281/zenodo.7791982). 4789

10.5281/zenodo.7790026). 4792
10.5281/zenodo.7790052). 4795
2023, (doi: 10.5281/zenodo.7787066). 4798
10.5281/zenodo.7781476). 4804
10.5281/zenodo.7783082). 4807
10.5281/zenodo.7777857). 4810
10.5281/zenodo.7779286). 4813
(doi: 10.5281/zenodo.7771831). 4816
2023, (doi: 10.5281/zenodo.7772468). 4819
10.13140/RG.2.2.20913.25446). 4822
odo.7764916). 4825
10.13140/RG.2.2.11770.98247). 4828

10.13140/RG.2.2.12400.12808). 4831
2023, (doi: 10.13140/RG.2.2.22545.10089). 4834
10.13140/RG.2.2.11377.76644). 4840
10.13140/RG.2.2.23750.96329). 4843
10.13140/RG.2.2.31366.24641). 4846
10.13140/RG.2.2.34721.68960). 4849
2023, (doi: 10.13140/RG.2.2.30212.81289). 4852
10.13140/RG.2.2.24288.35842). 4858
10.13140/RG.2.2.32467.25124). 4861
10.13140/RG.2.2.31025.45925). 4864
10.13140/RG.2.2.17184.25602). 4867

10.13140/RG.2.2.23423.28327). 4870
10.13140/RG.2.2.28456.44805). 4873
10.13140/RG.2.2.23525.68320). 4876
10.13140/RG.2.2.20170.24000). 4879
10.13140/RG.2.2.36475.59683). 4882
10.13140/RG.2.2.29764.71046). 4885
2023, (doi: 10.13140/RG.2.2.18780.87683). 4888
10.13140/RG.2.2.26134.01603). 4894
10.13140/RG.2.2.27392.30721). 4897
10.13140/RG.2.2.33028.40321). 4900
10.13140/RG.2.2.21389.20966). 4903
10.13140/RG.2.2.16356.04489). 4906

10.13140/RG.2.2.21756.21129). 4909
10.13140/RG.2.2.30983.68009). 4912
10.13140/RG.2.2.28552.29445). 4915
(doi: 10.13140/RG.2.2.10936.21761). 4918
10.13140/RG.2.2.35105.89447). 4921
(doi: 10.13140/RG.2.2.30072.72960). 4924
10.13140/RG.2.2.31147.52003). 4927
10.13140/RG.2.2.32825.24163). 4930
10.13140/RG.2.2.13059.58401). 4933
10.13140/RG.2.2.11172.14720). 4936
2023, (doi: 10.13140/RG.2.2.22011.80165). 4939
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4942
2023, (doi: 10.13140/RG.2.2.10493.84962). 4945

ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4948
2023, (doi: 10.13140/RG.2.2.19944.14086). 4951
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4954
(doi: 10.13140/RG.2.2.33103.76968). 4957
(doi: 10.13140/RG.2.2.23037.44003). 4960
(doi: 10.13140/RG.2.2.35646.56641). 4963
10.13140/RG.2.2.18030.48967). 4966
(doi: 10.13140/RG.2.2.13973.81121). 4969
2023, (doi: 10.13140/RG.2.2.34106.47047). 4972
2023, (doi: 10.13140/RG.2.2.31956.88961). 4978
2023, (doi: 10.13140/RG.2.2.15179.67361). 4981
10.13140/RG.2.2.21510.45125). 4984

2023, (doi: 10.13140/RG.2.2.13121.84321). 4987
10.13140/RG.2.2.11758.69441). 4990
2023, (doi: 10.13140/RG.2.2.31891.35367). 4993
10.13140/RG.2.2.19360.87048). 4996
10.13140/RG.2.2.32363.21286). 4999
10.13140/RG.2.2.23266.81602). 5002
10.13140/RG.2.2.19911.37285). 5005
10.13140/RG.2.2.11050.90569). 5008
2023, (doi: 10.13140/RG.2.2.17761.79206). 5011
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 5017
(doi: 10.13140/RG.2.2.30182.50241). 5020

2023, (doi: 10.13140/RG.2.2.17252.24968). 5053
2023010396 (doi: 10.20944/preprints202301.0396.v1). 5062

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5065

2023,(doi: 10.13140/RG.2.2.36745.93289). 5079
10.20944/preprints202301.0282.v1). 5086
10.20944/preprints202301.0267.v1).). 5089

(doi: 10.20944/preprints202301.0265.v1). 5094
prints202301.0262.v1). 5098

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

10.13140/RG.2.2.35061.65767). 5107

10.13140/RG.2.2.18494.15680). 5111

10.13140/RG.2.2.32530.73922). 5115

10.13140/RG.2.2.15897.70243). 5119
10.13140/RG.2.2.32530.73922). 5123
prints202301.0105.v1). 5126


10.13140/RG.2.2.23172.19849). 5133


10.13140/RG.2.2.17385.36968). 5143
Preprints 2023, 2023010044 5146
10.20944/preprints202301.0043.v1). 5149
2023, (doi: 10.13140/RG.2.2.28945.92007). 5152
10.13140/RG.2.2.35774.77123). 5158
10.13140/RG.2.2.29430.88642). 5164
(doi: 10.20944/preprints202212.0549.v1). 5170
10.13140/RG.2.2.19380.94084). 5173

(doi: 10.20944/preprints202212.0500.v1). 5184
10.13140/RG.2.2.20993.12640). 5187

10.13140/RG.2.2.29173.86244). 5202
2023 (doi: 10.5281/zenodo.8067469). 5207
(doi: 10.5281/zenodo.8062076). 5209
2023 (doi: 10.5281/zenodo.8052976). 5213
(doi: 10.5281/zenodo.8051368). 5215

(doi: 10.5281/zenodo.8027488). 5217
10.5281/zenodo.8020181). 5219
10.5281/zenodo.7978921). 5221
odo.7943878). 5223
10.5281/zenodo.7943871). 5225
10.5281/zenodo.7923786). 5227
2023 (doi: 10.5281/zenodo.7905287). 5229

2023 (doi: 10.5281/zenodo.7874677). 5233
(doi: 10.5281/zenodo.7857906). 5235
2023 (doi: 10.5281/zenodo.7856329). 5237
10.5281/zenodo.7854561). 5239
2023 (doi: 10.5281/zenodo.7851893). 5241

(doi: 10.5281/zenodo.7835063). 5245
(doi: 10.5281/zenodo.7826705). 5247
2023 (doi: 10.5281/zenodo.7820680). 5249
10.5281/zenodo.7812750). 5251



2023 (doi: 10.5281/zenodo.7807782). 5257
2023 (doi: 10.5281/zenodo.7804449). 5259

(doi: 10.5281/zenodo.7792307). 5263
(doi: 10.5281/zenodo.7790728). 5265
2023 (doi: 10.5281/zenodo.7787712). 5267
10.5281/zenodo.7783791). 5269
10.5281/zenodo.7780123). 5271
(doi: 10.5281/zenodo.7773119). 5273
odo.7637762). 5275
10.5281/zenodo.7766174). 5277
10.5281/zenodo.7762232). 5279
(doi: 10.5281/zenodo.7758601). 5281
10.5281/zenodo.7754661). 5283
10.5281/zenodo.7750995) . 5285
(doi: 10.5281/zenodo.7749875). 5287

10.5281/zenodo.7747236). 5289
10.5281/zenodo.7742587). 5291
(doi: 10.5281/zenodo.7738635). 5293
10.5281/zenodo.7734719). 5295
10.5281/zenodo.7730484). 5297
(doi: 10.5281/zenodo.7730469). 5299
10.5281/zenodo.7722865). 5301
odo.7713563). 5303
odo.7709116). 5305
10.5281/zenodo.7706415). 5307
10.5281/zenodo.7706063). 5309
10.5281/zenodo.7701906). 5311
odo.7700205). 5313
10.5281/zenodo.7694876). 5315
10.5281/zenodo.7679410). 5317
10.5281/zenodo.7675982). 5319
10.5281/zenodo.7672388). 5321
odo.7668648). 5323

10.5281/zenodo.7662810). 5325
10.5281/zenodo.7659162). 5327
odo.7653233). 5329
odo.7653204). 5331
odo.7653142). 5333
odo.7653117). 5335
odo.7651687). 5338
odo.7651619). 5340
odo.7651439). 5342
odo.7650729). 5344
odo.7647868). 5346
odo.7647017). 5348
odo.7644894). 5350
odo.7632923). 5353
odo.7623459). 5355
10.5281/zenodo.7606416). 5357

10.5281/zenodo.7606416). 5359
odo.7606404). 5361
10.5281/zenodo.7580018). 5363
odo.7580018). 5365
odo.7580018). 5367
odo.7579929). 5369
10.5281/zenodo.7563170). 5371
odo.7563164). 5373
odo.7563160). 5375
odo.7563160). 5377
10.5281/zenodo.7563160). 5379
10.5281/zenodo.7557063). 5381
10.5281/zenodo.7557009). 5383
10.5281/zenodo.7539484). 5385
10.5281/zenodo.7523390). 5387
10.5281/zenodo.7523390). 5389
10.5281/zenodo.7523390). 5391
odo.7574952). 5393

10.5281/zenodo.7574992). 5395
odo.7523357). 5397
10.5281/zenodo.7523357). 5399
10.5281/zenodo.7504782). 5401
10.5281/zenodo.7504782). 5403
10.5281/zenodo.7504782). 5405
10.5281/zenodo.7499395). 5407
odo.7499395). 5409
10.5281/zenodo.7499395). 5411
10.5281/zenodo.7497450). 5413
10.5281/zenodo.7497450). 5415
10.5281/zenodo.7494862). 5417
odo.7494862). 5419
10.5281/zenodo.7494862). 5421
10.5281/zenodo.7493845). 5423
odo.7493845). 5425
10.5281/zenodo.7493845). 5427
odo.7539484). 5429

odo.7523390). 5431
odo.7523357). 5433
odo.7504782). 5435
odo.7499395). 5437
odo.7497450). 5439
odo.7494862). 5441
odo.7493845). 5443
odo.7480110). 5445
odo.7378758). 5447
odo.6320305). 5449
odo.6677173). 5451

CHAPTER 24 5452
Cancer In Neutrosophic 5453
SuperHyperGraph 5454
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5455
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5456
disease is considered and as the consequences of the model, some parameters are used. The cells 5457
are under attack of this disease but the moves of the cancer in the special region are the matter 5458
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5459
treatments for this Neutrosophic disease. 5460
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5461
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5462
term Neutrosophic function. 5463
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5464
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5465
move from the cancer is identified by this research. Sometimes the move of the cancer 5466
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5467
about the moves and the effects of the cancer on that region; this event leads us to 5468
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5469
perception on what’s happened and what’s done. 5470
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5471
known and they’ve got the names, and some general Neutrosophic models. The moves 5472
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5473
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5474
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5475
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5476
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5477
Models. 5478
Some cells have been faced with some attacks from the situation which is caused by the 5479
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5480
which in that, the cells could be labelled as some groups and some groups or individuals have 5481
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5482
the embedded situations, the individuals of cells and the groups of cells could be considered 5483
253
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5484
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5485
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5486
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5487
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5488
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5489
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5490
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5491
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5492
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5493
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5494
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5495
out what’s going on this phenomenon. The special case of this disease is considered and as the 5496
consequences of the model, some parameters are used. The cells are under attack of this disease 5497
but the moves of the cancer in the special region are the matter of mind. The recognition of 5498
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5499
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5500
both bases are the background of this research. Sometimes the cancer has been happened on the 5501
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5502
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5503
in the forms of alliances’ styles with the formation of the design and the architecture are 5504
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5505
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5506
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5507
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5508
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5509
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5510
names, and some general models. The moves and the traces of the cancer on the complex tracks 5514
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5515
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5516
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5517
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5518
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5519
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5520
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5521
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5522
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5523
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5525
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5526
based on the fixed groups of cells or the fixed groups of group of cells? 5527
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5528

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5532
Then the research has taken more motivations to define SuperHyperClasses and to find some 5533
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5534
some instances and examples to make clarifications about the framework of this research. The 5535
general results and some results about some connections are some avenues to make key point of 5536
this research, “Cancer’s Recognition”, more understandable and more clear. 5537
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5538
research on the modeling of the regions where are under the attacks of the cancer to 5539
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5540
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5541
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5542
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5543

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

CHAPTER 25 5554
Neutrosophic Reverse Dimension 5555
Dominating 5556
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5557
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5558
2023, (doi: 10.13140/RG.2.2.34953.52320). 5559
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5560
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5561
(doi: 10.13140/RG.2.2.33275.80161). 5562
10.13140/RG.2.2.11050.90569). 5565
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5566
10.13140/RG.2.2.17761.79206). 5568
10.13140/RG.2.2.19911.37285). 5571
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5572
10.13140/RG.2.2.23266.81602). 5574
10.13140/RG.2.2.19360.87048). 5577
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5578
10.13140/RG.2.2.32363.21286). 5580
10.13140/RG.2.2.11758.69441). 5583
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5584
10.13140/RG.2.2.31891.35367). 5586
257

10.13140/RG.2.2.21510.45125). 5589
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5590
10.13140/RG.2.2.13121.84321). 5592

CHAPTER 26 5593
New Ideas In Recognition of Cancer And 5594
Neutrosophic SuperHyperGraph By 5595
Reverse Dimension Dominating As Hyper 5596
Dimple On Super Dimity 5597
259
CHAPTER 27 5598
ABSTRACT 5599
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 5600

Dimension Dominating). Let a Neutrosophic SuperHyperGraph (NSHG) S be a Reverse Dimension 5601
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5602
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Dimension 5603
Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Dimension Dominating 5604
criteria holds 5605

Neutrosophic re-SuperHyperReverse Dimension Dominating if the following expression is called 5606

Neutrosophic e-SuperHyperReverse Dimension Dominating criteria holds 5607

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

SuperHyperReverse Dimension Dominating if the following expression is called Neutrosophic v- 5609
SuperHyperReverse Dimension Dominating criteria holds 5610

Neutrosophic rv-SuperHyperReverse Dimension Dominating if the following expression is called 5611
Neutrosophic v-SuperHyperReverse Dimension Dominating criteria holds 5612

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5613
HyperReverse Dimension Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, 5614
Neutrosophic re-SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension 5615
Dominating, and Neutrosophic rv-SuperHyperReverse Dimension Dominating. ((Neutrosophic) SuperHy- 5616
perReverse Dimension Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5617
261
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 5618

E is called an Extreme SuperHyperReverse Dimension Dominating if it’s either of Neutrosophic e- 5619
SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimension Dominating, Neut- 5620
rosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Dimen- 5621
sion Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the max- 5622
imum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of 5623
the Extreme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHy- 5624
perEdges and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse 5625
Dimension Dominating; a Neutrosophic SuperHyperReverse Dimension Dominating if it’s either of Neutro- 5626
sophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re-SuperHyperReverse Dimension Dominat- 5627
ing, Neutrosophic v-SuperHyperReverse Dimension Dominating, and Neutrosophic rv-SuperHyperReverse 5628
Dimension Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 5629
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5630

sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 5631
HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5632
SuperHyperReverse Dimension Dominating; an Extreme SuperHyperReverse Dimension Dominating SuperHy- 5633
perPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic 5634
Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme Super- 5636
HyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme 5637
coefficients defined as the Extreme number of the maximum Extreme cardinality of the Ex- 5638
treme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality con- 5639
secutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5640
the Extreme SuperHyperReverse Dimension Dominating; and the Extreme power is corresponded 5641

the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5648

power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Dimen- 5651
sion Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic 5652

Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for an Extreme SuperHy- 5654
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5655
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5656
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5657
the Extreme SuperHyperReverse Dimension Dominating; a Neutrosophic V-SuperHyperReverse Dimension 5658
Dominating if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re- 5659
SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse Dimension Dominating, and 5660
Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for a Neutrosophic Supe- 5661
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5662
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5663

utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5664
the Neutrosophic SuperHyperReverse Dimension Dominating; an Extreme V-SuperHyperReverse Dimension 5665
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Dimension Dom- 5666
inating, Neutrosophic re-SuperHyperReverse Dimension Dominating, Neutrosophic v-SuperHyperReverse 5667
Dimension Dominating, and Neutrosophic rv-SuperHyperReverse Dimension Dominating and C(N SHG) for 5668
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains 5669
the Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 5670
of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinal- 5671
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5672
form the Extreme SuperHyperReverse Dimension Dominating; and the Extreme power is corresponded 5673

the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic 5680
power is corresponded to its Neutrosophic coefficient. In this scientific research, new setting is 5683
introduced for new SuperHyperNotions, namely, a SuperHyperReverse Dimension Dominating and Neut- 5684
rosophic SuperHyperReverse Dimension Dominating. Two different types of SuperHyperDefinitions are 5685
debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, 5686
and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is 5687
implemented in the whole of this research. For shining the elegancy and the significancy of this 5688
research, the comparison between this SuperHyperNotion with other SuperHyperNotions and 5689
fundamental SuperHyperNumbers are featured. The definitions are followed by the examples 5690
and the instances thus the clarifications are driven with different tools. The applications are 5691
figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s 5692
Recognition” are the under research to figure out the challenges make sense about ongoing and 5693
upcoming research. The special case is up. The cells are viewed in the deemed ways. There 5694
are different types of them. Some of them are individuals and some of them are well-modeled 5695
by the group of cells. These types are all officially called “SuperHyperVertex” but the rela- 5696
tions amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” 5697
and “Neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s 5698
Recognition”. Thus these complex and dense SuperHyperModels open up some avenues to 5699
research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue 5700
this research. It’s also officially collected in the form of some questions and some problems. 5701
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Dimension 5702
Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5703
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5704
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5705
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5706
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Dimension Dominating is 5707
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5708
such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5709

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

and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5711
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5712
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5713
SuperHyperReverse Dimension Dominating . Since there’s more ways to get type-results to make a 5714
SuperHyperReverse Dimension Dominating more understandable. For the sake of having Neutrosophic 5715
SuperHyperReverse Dimension Dominating, there’s a need to “redefine” the notion of a “SuperHy- 5716
perReverse Dimension Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 5717
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5718
position of labels to assign to the values. Assume a SuperHyperReverse Dimension Dominating . It’s 5719
redefined a Neutrosophic SuperHyperReverse Dimension Dominating if the mentioned Table holds, 5720
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5721
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5722
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5723
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5724
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5725
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5726
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5727
on a SuperHyperReverse Dimension Dominating . It’s the main. It’ll be disciplinary to have the 5728
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5729
SuperHyperReverse Dimension Dominating until the SuperHyperReverse Dimension Dominating, then it’s offi- 5730
cially called a “SuperHyperReverse Dimension Dominating” but otherwise, it isn’t a SuperHyperReverse 5731
Dimension Dominating . There are some instances about the clarifications for the main definition 5732
titled a “SuperHyperReverse Dimension Dominating ”. These two examples get more scrutiny and 5733
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 5734
based on a SuperHyperReverse Dimension Dominating . For the sake of having a Neutrosophic Su- 5735
perHyperReverse Dimension Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 5736
SuperHyperReverse Dimension Dominating” and a “Neutrosophic SuperHyperReverse Dimension Dominating ”. 5737
The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5738
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5739
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 5740
rHyperGraph” if the intended Table holds. And a SuperHyperReverse Dimension Dominating are 5741
redefined to a “Neutrosophic SuperHyperReverse Dimension Dominating” if the intended Table holds. 5742
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5743
to get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Dimension Dominating 5744
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5745
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 5746
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 5747
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse Dimension 5748
Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 5749
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 5750
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Dimension Dominating” where 5751

it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse Dimension 5752
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperReverse 5753
Dimension Dominating .] SuperHyperReverse Dimension Dominating . A graph is a SuperHyperUniform 5754
if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5755

with two exceptions; it’s SuperHyperReverse Dimension Dominating if it’s only one SuperVertex as 5758
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5759
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5760
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5761
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5762
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5764

be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5774
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5775
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5776
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5777
identified since there are some determinacy, indeterminacy and neutrality about the moves 5778

names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5782
cancer on the complex tracks and between complicated groups of cells could be fantasized 5783
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Dimension Dominating, SuperHyperStar, 5784
the longest SuperHyperReverse Dimension Dominating or the strongest SuperHyperReverse Dimension 5786
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Dimen- 5787
sion Dominating, called SuperHyperReverse Dimension Dominating, and the strongest SuperHyperReverse 5788
Dimension Dominating, called Neutrosophic SuperHyperReverse Dimension Dominating, some general results 5789
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 5790
Dimension Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 5794
rosophic SuperHyperReverse Dimension Dominating theory, SuperHyperGraphs, and Neutrosophic 5795
SuperHyperGraphs theory are proposed. 5796
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Dimension Dominating, Cancer’s 5797


CHAPTER 28 5800
Applied Notions Under The Scrutiny Of 5801
The Motivation Of This Scientific 5802
Research 5803
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5804
try to bring the motivations in the narrative ways. Some cells have been faced with some 5805
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5806
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5807
as some groups and some groups or individuals have excessive labels which all are raised from 5808
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5809
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5810
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5811
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5812
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5813
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5814
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5815
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5816
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5817
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5818
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5819
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5820
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5821
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5822
case of this disease is considered and as the consequences of the model, some parameters are used. 5823
The cells are under attack of this disease but the moves of the cancer in the special region are the 5824
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5825
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5826
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5827
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5829
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5830
architecture are formally called “ SuperHyperReverse Dimension Dominating” in the themes of jargons 5831
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5832
267
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5833
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5837
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5838
perception on what’s happened and what’s done. There are some specific models, which are 5839
well-known and they’ve got the names, and some general models. The moves and the traces of 5840
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5841
by a Neutrosophic SuperHyperPath (-/SuperHyperReverse Dimension Dominating, SuperHyperStar, 5842
the optimal SuperHyperReverse Dimension Dominating or the Neutrosophic SuperHyperReverse Dimension 5844
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5845
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5846
Dimension Dominating. It, literarily, deforms and it doesn’t form. 5850
amount of SuperHyperReverse Dimension Dominating” of either individual of cells or the groups of cells 5852
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperReverse 5853
Dimension Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5854
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5855
these messy and dense SuperHyperModels where embedded notions are illustrated? 5856
Thus it motivates us to define different types of “ SuperHyperReverse Dimension Dominating” and 5858
“Neutrosophic SuperHyperReverse Dimension Dominating” on “SuperHyperGraph” and “Neutrosophic 5859

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5860
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5861
motivates us to get some instances and examples to make clarifications about the framework of 5862
this research. The general results and some results about some connections are some avenues to 5863
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5864
The framework of this research is as follows. In the beginning, I introduce basic definitions 5865
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5866
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5867
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5868
review literature are applied to make sense about what’s going to figure out about the 5869
upcoming sections. The main definitions and their clarifications alongside some results 5870
about new notions, SuperHyperReverse Dimension Dominating and Neutrosophic SuperHyperReverse 5871
Dimension Dominating, are figured out in sections “ SuperHyperReverse Dimension Dominating” and 5872
“Neutrosophic SuperHyperReverse Dimension Dominating”. In the sense of tackling on getting 5873
results and in Reverse Dimension Dominating to make sense about continuing the research, the 5874
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5875
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5876
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5877

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5878
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5879
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5880
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5881
and as concluding and closing section of theoretical research are contained in the section 5882
“General Results”. Some general SuperHyperRelations are fundamental and they are well- 5883
known as fundamental SuperHyperNotions as elicited and discussed in the sections, “General 5884
Results”, “ SuperHyperReverse Dimension Dominating”, “Neutrosophic SuperHyperReverse Dimension 5885
Dominating”, “Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. 5886
There are curious questions about what’s done about the SuperHyperNotions to make sense 5887
about excellency of this research and going to figure out the word “best” as the description 5888
and adjective for this research as presented in section, “ SuperHyperReverse Dimension Dominating”. 5889
The keyword of this research debut in the section “Applications in Cancer’s Recognition” 5890
with two cases and subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as 5891
SuperHyperModel” and “Case 2: The Increasing Steps Toward SuperHyperMultipartite as 5892
SuperHyperModel”. In the section, “Open Problems”, there are some scrutiny and discernment 5893
on what’s done and what’s happened in this research in the terms of “questions” and “problems” 5894
to make sense to figure out this research in featured style. The advantages and the limitations 5895
of this research alongside about what’s done in this research to make sense and to get sense 5896
about what’s figured out are included in the section, “Conclusion and Closing Remarks”. 5897

CHAPTER 29 5898
Neutrosophic Preliminaries Of This 5899
Scientific Research On the Redeemed 5900
Ways 5901
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5902
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5903

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5904
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5905
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5906
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5907
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5908
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5909

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

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

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

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 5914
2.5,p.2). 5915
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5916
S = (V, E), where 5917
1, 2, . . . , n0 ); 5922
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5923
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5924

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5954
x, y, z, w ∈ [0, 1]: 5955
(i) 1 ⊗ x = x; 5956
(ii) x ⊗ y = y ⊗ x; 5957
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5958
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5959

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

where 5962

1, 2, . . . , n0 ); 5967
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5968
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5969
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5970
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5971
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5998
of elements of SuperHyperEdges are the same. 5999
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 6000
makes to have SuperHyperUniform more understandable. 6001
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 6002
Classes as follows. 6003
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 6004
two given SuperHyperEdges with two exceptions; 6005
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 6006
SuperHyperEdges; 6007
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 6008
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 6009
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 6010
in common; 6011
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 6012
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 6013
SuperHyperEdge in common; 6014
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 6015
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 6016
SuperVertex. 6017
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 6018
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 6019
(i) Vi , Vi+1 ∈ Ei0 ; 6020
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 6021
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 6022
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 6023
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 6024
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 6025
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 6026
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 6027
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 6029
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 6030
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 6031
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 6032
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 6033
perPath . 6034
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 6035
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 6036
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 6037
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 6038
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 6039
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 6040

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

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


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

(xii) Neutrosophic Connective if (T (E), I(E), F (E)) ≥ maximum number of Neutrosophic 6053
strength of SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi 6054
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s. 6055
Definition 29.0.18. (Different Neutrosophic Types of Neutrosophic SuperHyperReverse Dimension 6056

Dominating). 6057

(i) Neutrosophic e-SuperHyperReverse Dimension Dominating if the following expression is 6061

called Neutrosophic e-SuperHyperReverse Dimension Dominating criteria holds 6062

(ii) Neutrosophic re-SuperHyperReverse Dimension Dominating if the following expression is 6063

called Neutrosophic re-SuperHyperReverse Dimension Dominating criteria holds 6064

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6065
(iii) Neutrosophic v-SuperHyperReverse Dimension Dominating if the following expression is 6066

(iv) Neutrosophic rv-SuperHyperReverse Dimension Dominating if the following expression is 6068

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


Definition 29.0.19. ((Neutrosophic) SuperHyperReverse Dimension Dominating). 6075

(i) an Extreme SuperHyperReverse Dimension Dominating if it’s either of Neutrosophic 6078


(ii) a Neutrosophic SuperHyperReverse Dimension Dominating if it’s either of Neutro- 6086

form the Neutrosophic SuperHyperReverse Dimension Dominating; 6093
(iii) an Extreme SuperHyperReverse Dimension Dominating SuperHyperPolynomial if 6094

it’s either of Neutrosophic e-SuperHyperReverse Dimension Dominating, Neutrosophic re- 6095
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6100
(iv) a Neutrosophic SuperHyperReverse Dimension Dominating SuperHyperPolynomial 6104


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



high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 6120
(vi) a Neutrosophic V-SuperHyperReverse Dimension Dominating if it’s either of Neutro- 6123

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 6127
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6128
that they form the Neutrosophic SuperHyperReverse Dimension Dominating; 6130
(vii) an Extreme V-SuperHyperReverse Dimension Dominating SuperHyperPolynomial 6131


(viii) a Neutrosophic SuperHyperReverse Dimension Dominating SuperHyperPolynomial 6141

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Dimension Dominating). 6152

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

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


136TBL3
(ii) a Neutrosophic δ−SuperHyperReverse Dimension Dominating is a Neutrosophic kind 6159

of Neutrosophic SuperHyperReverse Dimension Dominating such that either of the following 6160
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6161
of s ∈ S : 6162
|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 6163

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6164
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6166
there’s the usage of the position of labels to assign to the values. 6168
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6169
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6170
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6171
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6172
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6173

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6174
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Dimension Dominating, SuperHyperStar, 6175

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6176
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6177
Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6178
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6179
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Dimension 6180
Dominating. Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 6181
Dimension Dominating more Neutrosophicly understandable. 6182
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Dimension Dominating”. The 6184
6187

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

136TBL4

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

CHAPTER 30 6190
Neutrosophic SuperHyper But Reverse Dimension Dominating 6191
As The Extensions Excerpt From Dense 6192
And Super Forms 6193
Definition 30.0.1. (Neutrosophic event). 6194

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6195
is a probability Reverse Dimension Dominating. Any Neutrosophic k-subset of A of V is called 6196
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6197
Neutrosophic event. The following expression is called Neutrosophic probability of 6198

A. 6199
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6200

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 6201
a probability Reverse Dimension Dominating. s Neutrosophic k-events Ai , i ∈ I is called Neutrosophic 6202
s-independent if the following expression is called Neutrosophic s-independent criteria 6203
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. 6204

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

is a probability Reverse Dimension Dominating. Any k-function Reverse Dimension Dominating like E is called 6208
Neutrosophic k-Variable. If k = 2, then any 2-function Reverse Dimension Dominating like E is 6209
called Neutrosophic Variable. 6210
The notion of independent on Neutrosophic Variable is likewise. 6211
283
Definition 30.0.4. (Neutrosophic Expectation). 6212

is a probability Reverse Dimension Dominating. A Neutrosophic k-Variable E has a number is called 6214
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6215
criteria 6216
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6217

is a probability Reverse Dimension Dominating. A Neutrosophic number is called Neutrosophic 6219

Crossing if the following expression is called Neutrosophic Crossing criteria 6220
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). 6221
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let m and n propose special Reverse 6222
Dimension Dominating. Then with m ≥ 4n, 6223
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 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: 6224
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6225
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6226
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6228
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6229

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

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6238
Then k < 5n4/3 . 6239
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6240
S = (V, E) is a probability Reverse Dimension Dominating. Draw a SuperHyperUnit SuperHyperCircle 6241
around each SuperHyperPoint of P. Let ni be the P Neutrosophic number of these P SuperHyper- 6242
Circles passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . 6243
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6244
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6245
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6246
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 6247
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6248

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6258
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let Xn be a nonnegative integer- 6259
valued variable in a probability Reverse Dimension Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6260
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6261
Proof. 6262
Consider S = (V, E) is a probability Reverse Dimension Dominating. A special SuperHyperGraph in 6264
Gn,p almost surely has stability number at most d2p−1 log ne. 6265
S = (V, E) is a probability Reverse Dimension Dominating. A special SuperHyperGraph in Gn,p is 6267
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6268
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6269
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6270
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6271
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6272
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6273
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 6274
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6275

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

Consider S = (V, E) is a probability Reverse Dimension Dominating. Let X be a Neutrosophic Variable 6288
and let t be a positive real number. Then 6289
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Reverse Dimension Dominating. Let X be a Neutrosophic Variable and let t 6291
be a positive real number. Then 6292
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6293
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let Xn be a Neutrosophic Variable 6295
in a probability Reverse Dimension Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6296
then 6297
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Dimension Dominating. Set X := Xn and t := |Ex(Xn )| in 6299
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6300
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6301
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6303
f (k) := (n choose k)2−(k choose 2) and let k ∗ be the least value of k for which f (k) is less than 6304
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6305
S = (V, E) is a probability Reverse Dimension Dominating. As in the proof of related Theorem, the 6307
result is straightforward. 6308
Consider S = (V, E) is a probability Reverse Dimension Dominating. Let G ∈ Gn,1/2 and let f and k ∗ be 6310
as defined in previous Theorem. Then either: 6311
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6312
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6313

Definition 30.0.17. (Neutrosophic Threshold). 6316

is a probability Reverse Dimension Dominating. Let P be a monotone property of SuperHyperGraphs 6318
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6319
for P is a function f (n) such that: 6320
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6321
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6322
Definition 30.0.18. (Neutrosophic Balanced). 6323
is a probability Reverse Dimension Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. 6325
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6326
SubSuperHyperGraph is called Neutrosophic Balanced. 6327
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6328

(V, E). Consider S = (V, E) is a probability Reverse Dimension Dominating. Let F be a nonempty 6329
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6330
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6331
SubSuperHyperGraph. 6332
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6335
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6336
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6337
SuperHyperReverse Dimension Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6338

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6339
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6340
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6341
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6342
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6343
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6344

Neutrosophic SuperHyperReverse Dimension Dominating. 6345
C(N SHG)Neutrosophic Reverse Dimension Dominating =

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

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

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6349
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6350
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6351
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6352
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6353
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperReverse Dimension 6354

Dominating. 6355

{}.
= 0z 0 .
{}.
= 0z 0 .
6356



{}.
= 0z 0 .
{}.
= 0z 0 .
6360


{}.
= 0z 0 .




{}.
= 0z 0 .
6364




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


{Ei }22
i=12 .



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


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


= z 7−c .
6376


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



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

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


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


= z 3−a .
6388


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






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


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



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


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




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




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


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



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


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






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


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



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


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


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


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


Neutrosophic SuperHyperReverse Dimension Dominating in the Neutrosophic Example (42.0.3) 95NHG2
6436
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6437
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Dimension 6438
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6439
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6440
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6441
of them. 6442
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6443

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

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Dimension 6451
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6452
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6453
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6454
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6455
Neutrosophic Reverse Dimension Dominating in some cases but the maximum number of the Neutrosophic 6456
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6457

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Dimension 6458
Dominating. 6459
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Reverse 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 Dimension Dominating with the least Neutrosophic 6460
cardinality, the lower sharp Neutrosophic bound for cardinality. 6461
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6462
(V, E). Then in the worst case, literally, 6463
C(N SHG)N eutrosophicQuasi−ReverseDimensionDominating

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

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

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

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Reverse 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 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 Dimension
Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Dimension 6469
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6470
the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6471
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6472

the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6473
rosophic Reverse Dimension Dominating in some cases but the maximum number of the Neutrosophic 6474
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6475
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Dimension 6476
Dominating. 6477
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6478
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues 6479

about the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on 6480
the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s 6481
distinct amount of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic Supe- 6482
rHyperVertices up to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic 6483
SuperHyperVertices but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyper- 6484
Vertices is either has the maximum Neutrosophic SuperHyperCardinality or it doesn’t have 6485
maximum Neutrosophic SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 6486
least one Neutrosophic SuperHyperEdge containing at least all Neutrosophic SuperHyperVer- 6487
tices. Thus it forms a Neutrosophic quasi-R-Reverse Dimension Dominating where the Neutrosophic 6488
completion of the Neutrosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic 6489
embedded R-Reverse Dimension Dominating. The SuperHyperNotions of embedded SuperHyperSet 6490
and quasi-SuperHyperSet coincide. In the original setting, these types of SuperHyperSets only 6491
don’t satisfy on the maximum SuperHyperCardinality. Thus the embedded setting is elected 6492
such that those SuperHyperSets have the maximum Neutrosophic SuperHyperCardinality and 6493
they’re Neutrosophic SuperHyperOptimal. The less than two distinct types of Neutrosophic 6494
SuperHyperVertices are included in the minimum Neutrosophic style of the embedded Neutro- 6495
sophic R-Reverse Dimension Dominating. The interior types of the Neutrosophic SuperHyperVertices 6496
are deciders. Since the Neutrosophic number of SuperHyperNeighbors are only affected by 6497
the interior Neutrosophic SuperHyperVertices. The common connections, more precise and 6498
more formal, the perfect unique connections inside the Neutrosophic SuperHyperSet for any 6499
distinct types of Neutrosophic SuperHyperVertices pose the Neutrosophic R-Reverse Dimension Dom- 6500
inating. Thus Neutrosophic exterior SuperHyperVertices could be used only in one Neutrosophic 6501
SuperHyperEdge and in Neutrosophic SuperHyperRelation with the interior Neutrosophic Su- 6502
perHyperVertices in that Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Reverse 6503

Dimension Dominating, there’s the usage of exterior Neutrosophic SuperHyperVertices since they’ve 6504
more connections inside more than outside. Thus the title “exterior” is more relevant than the 6505
title “interior”. One Neutrosophic SuperHyperVertex has no connection, inside. Thus, the Neut- 6506
rosophic SuperHyperSet of the Neutrosophic SuperHyperVertices with one SuperHyperElement 6507
has been ignored in the exploring to lead on the optimal case implying the Neutrosophic R-Reverse 6508
Dimension Dominating. The Neutrosophic R-Reverse Dimension Dominating with the exclusion of the exclu- 6509
sion of all Neutrosophic SuperHyperVertices in one Neutrosophic SuperHyperEdge and with 6510
other terms, the Neutrosophic R-Reverse Dimension Dominating with the inclusion of all Neutrosophic 6511
SuperHyperVertices in one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Reverse 6512
Dimension Dominating. To sum them up, in a connected non-obvious Neutrosophic SuperHyperGraph 6513
ESHG : (V, E). There’s only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the 6514
maximum possibilities of the distinct interior Neutrosophic SuperHyperVertices inside of any 6515
given Neutrosophic quasi-R-Reverse Dimension Dominating minus all Neutrosophic SuperHypeNeighbor 6516
to some of them but not all of them. In other words, there’s only an unique Neutrosophic 6517
SuperHyperEdge E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in 6518

an Neutrosophic quasi-R-Reverse Dimension Dominating, minus all Neutrosophic SuperHypeNeighbor 6519

to some of them but not all of them. 6520
The main definition of the Neutrosophic R-Reverse Dimension Dominating has two titles. a Neut- 6521
rosophic quasi-R-Reverse Dimension Dominating and its corresponded quasi-maximum Neutrosophic 6522
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6523
number, there’s a Neutrosophic quasi-R-Reverse Dimension Dominating with that quasi-maximum 6524
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6525

perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6526
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Reverse 6527
Dimension Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded max- 6528
imum number. The essence of the Neutrosophic Reverse Dimension Dominating ends up but this essence 6529
starts up in the terms of the Neutrosophic quasi-R-Reverse Dimension Dominating, again and more in 6530
the operations of collecting all the Neutrosophic quasi-R-Reverse Dimension Dominatings acted on the 6531
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6532
number. This Neutrosophic number is 6533
considered as the equivalence class for all corresponded quasi-R-Reverse Dimension Dominatings. 6534
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Reverse Dimension Dominating be 6535
a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Reverse Dimension 6536
Dominating. Then 6537
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Reverse Dimension Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Reverse Dimension Dominating is re- 6538
formalized and redefined as follows. 6539
GNeutrosophic Reverse 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 6540
definition for the Neutrosophic Reverse Dimension Dominating. 6541
GNeutrosophic Reverse 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 6542
Dimension Dominating poses the upcoming expressions. 6543

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

= max zNeutrosophic Number

And then, 6545


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

6547

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


6548


6549


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6550
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6551
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6552
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Reverse 6553
Dimension Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Reverse Dimension 6554
Dominating” since “Neutrosophic Quasi-Reverse Dimension Dominating” happens “Neutrosophic Reverse 6555
Dimension Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background but 6556
“Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Reverse Dimension Domin- 6557
ating” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily background 6558

since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise from it. 6559
To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neutrosophic 6560
Quasi-Reverse Dimension Dominating”, and “Neutrosophic Reverse Dimension Dominating” are up. 6561
Thus, let 6562
zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6563

GNeutrosophic Reverse Dimension Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6564
Neighborhood and a Neutrosophic Reverse Dimension Dominating and the new terms are up. 6565
GNeutrosophic Reverse Dimension Dominating ∈ ∪zNeutrosophic Number

[zNeutrosophic Number ]Neutrosophic Class =
∪zNeutrosophic Number {NNeutrosophic SuperHyperNeighborhood |
|NNeutrosophic SuperHyperNeighborhood |Neutrosophic Cardinality
6566

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

6567

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

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

6570

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

6571



6572


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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Reverse Dimension Dominating C(ESHG) for an Neutrosophic SuperHy-

perGraph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut-

rosophic SuperHyperVertices such that there’s no a Neutrosophic SuperHyperEdge amid some
Neutrosophic SuperHyperVertices instead of all given by
Neutrosophic Reverse 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 Dimension Dominating is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse 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 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 Dimen-

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
sion Dominating
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Reverse Dimension Dominating C(ESHG) for an Neutrosophic SuperHyperGraph
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices
instead of all given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse
Dimension Dominating and it’s an Neutrosophic Reverse 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 Dimension Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Reverse Dimension Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse
Dimension Dominating, not:
Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6573
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6574
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6575
type-SuperHyperSet called the 6576
“Neutrosophic R-Reverse Dimension Dominating” 6577

amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6578
Neutrosophic R-Reverse Dimension Dominating, 6579
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 Dimension Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Reverse 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 Dimension Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of a Neutrosophic R-Reverse Dimension Dominating is the cardinality
of
6580
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6581
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Dimension 6582
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6583
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6584
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6585
amount of them. 6586
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic Supe- 6587
rHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices r. Consider 6588
all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that Neutrosophic 6589
SuperHyperEdge excluding excluding more than r distinct Neutrosophic SuperHyperVertices, 6590
exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices. 6591
Consider there’s a Neutrosophic R-Reverse Dimension Dominating with the least cardinality, the lower 6592
sharp Neutrosophic bound for Neutrosophic cardinality. Assume a connected Neutrosophic 6593
SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet of the Neutrosophic 6594
SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the Neutrosophic Su- 6595
perHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some Neutrosophic 6596
SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Reverse Dimension Dominating. Since it 6597
doesn’t have 6598
6599

the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6600

rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6601
some SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic 6602
SuperHyperVertices VESHE ∪{z} is the maximum Neutrosophic cardinality of a Neutrosophic Su- 6603
perHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Reverse Dimension 6604
Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s a Neut- 6605
rosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there are at 6606
least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the connected 6607
Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, titled its 6608
Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the Neutrosophic 6609
SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s only one Neutro- 6610
sophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, VESHE ∪ {z}, in 6611
the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious Neutrosophic R-Reverse 6612
Dimension Dominating, VESHE is up. The obvious simple Neutrosophic type-SuperHyperSet of the 6613
Neutrosophic R-Reverse Dimension Dominating, VESHE , is a Neutrosophic SuperHyperSet, VESHE , 6614
includes only all Neutrosophic SuperHyperVertices does forms any kind of Neutrosophic pairs 6615
are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic SuperHyperGraph 6616
ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVer- 6617
tices VESHE , is the maximum Neutrosophic SuperHyperCardinality of a Neutrosophic 6618

SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a Neutrosophic 6619
SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, in a connected 6620
Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Reverse Dimension Dominating 6621
only contains all interior Neutrosophic SuperHyperVertices and all exterior Neutrosophic 6622
SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s any of them 6623
has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic SuperHy- 6624
perNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors to some of 6625
them not all of them but everything is possible about Neutrosophic SuperHyperNeighborhoods 6626
and Neutrosophic SuperHyperNeighbors out. 6627
The SuperHyperNotion, namely, Reverse Dimension Dominating, is up. There’s neither empty SuperHy- 6628
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6629
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6630

the Neutrosophic Reverse Dimension Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6631
SuperHyperEdges[SuperHyperVertices], 6632

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)N eutrosophicQuasi−ReverseDimensionDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−ReverseDimensionDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−ReverseDimensionDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse Dimension Dominating . 6633

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6634

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Dimension Dominating C(ESHG) for an Neutrosophic SuperHyper- 6635

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6636
6637
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6639
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6640
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6641
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6642
non-obvious Neutrosophic Reverse Dimension Dominating is up. The obvious simple Neutrosophic 6643
type-SuperHyperSet called the Neutrosophic Reverse Dimension Dominating is a Neutrosophic Su- 6644
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6645
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6646

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Neutrosophic SuperHyper- 6647
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse 6648
Dimension Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6649
SuperHyperEdges[SuperHyperVertices], 6650

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 6651

Dimension Dominating. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy- 6652

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

that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6656
given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Dimension Dominating 6657
and it’s an Neutrosophic Reverse Dimension Dominating. Since it’s 6658
6659
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6661

HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6662
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6663
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6664

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

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 Dimension 6666
, not:
Dominating 6667

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

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- 6669
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6670
Neutrosophic type-SuperHyperSet called the 6671
“Neutrosophic Reverse Dimension Dominating ” 6672
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6673
Neutrosophic ,
Reverse Dimension Dominating 6674
is only and only 6675

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.


= az s + bz t .
In a connected Neutrosophic SuperHyperGraph ESHG : (V, E). 6676

CHAPTER 31 6677
The Neutrosophic Departures on The 6678
Theoretical Results Toward Theoretical 6679
Motivations 6680
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6681
Neutrosophic SuperHyperClasses. 6682
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6683

|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 6684
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6685
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
327
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). 6686

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

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6702
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6703
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperReverse Dimension Dominating. 6704
6705

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

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

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

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

Neutrosophic SuperHyperReverse 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 6709

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6714
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6715
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6716
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6717
the Neutrosophic SuperHyperReverse Dimension Dominating. 6718
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6719

Then 6720

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

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

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Dimension Dominating in the Example (42.0.11) 136NSHG21a
is a longest SuperHyperReverse Dimension Dominating taken from a connected Neutrosophic 6731

SuperHyperBipartite ESHB : (V, E). Thus only some SuperHyperVertices and only minimum- 6732
Neutrosophic-of-SuperHyperPart SuperHyperEdges are attained in any solution 6733
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM21a Example 31.0.8. In the Neutrosophic Figure (31.4), the connected Neutrosophic SuperHy- 6735
perBipartite ESHB : (V, E), is Neutrosophic highlighted and Neutrosophic featured. The 6736
obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous Neutrosophic 6737

result, of the Neutrosophic SuperHyperVertices of the connected Neutrosophic SuperHyper- 6738
Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6739
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6741
Then 6742


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

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6751
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6753
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6754
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 6758
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6759
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6760
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6761
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperReverse Dimension 6762
Dominating. 6763
∗
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ). 6764
Then, 6765

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

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

straightforward. Then there’s at least one SuperHyperReverse Dimension Dominating. Thus the notion 6772
of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Dimension Dominating 6773
could be applied. The unique embedded SuperHyperReverse Dimension Dominating proposes some 6774
longest SuperHyperReverse Dimension Dominating excerpt from some representatives. The latter is 6775
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6777
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6778
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6779
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6780
SuperHyperModel (31.6), is the Neutrosophic SuperHyperReverse Dimension Dominating. 6781

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6782
The Surveys of Mathematical Sets On 6783
The Results But As The Initial Motivation 6784
For the SuperHyperReverse Dimension Dominating, Neutrosophic SuperHyperReverse Dimension Dominating, 6785
and the Neutrosophic SuperHyperReverse Dimension Dominating, some general results are introduced. 6786
6787
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperReverse Dimension Dominating is 6788
“redefined” on the positions of the alphabets. 6789
Corollary 32.0.2. Assume Neutrosophic SuperHyperReverse Dimension Dominating. Then 6790
N eutrosophic SuperHyperReverseDimensionDominating =
{theSuperHyperReverseDimensionDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseDimensionDominating
|N eutrosophiccardinalityamidthoseSuperHyperReverseDimensionDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6791
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6792
the neutrality, for i = 1, 2, 3, respectively. 6793
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6794
of the alphabet. Then the notion of Neutrosophic SuperHyperReverse Dimension Dominating and 6795
SuperHyperReverse Dimension Dominating coincide. 6796
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6797
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6798

SuperHyperReverse Dimension Dominating if and only if it’s a SuperHyperReverse Dimension Dominating. 6799
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6800
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 6801
Dimension Dominating if and only if it’s a longest SuperHyperReverse Dimension Dominating. 6802
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6803

identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Dimension Dominating is its 6804
339
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Dimension Dominating, 6806

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6807
identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Dimension Dominating is its 6808
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6810
perReverse Dimension Dominating isn’t well-defined if and only if its SuperHyperReverse Dimension Dominating 6811
isn’t well-defined. 6812
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6813

its Neutrosophic SuperHyperReverse Dimension Dominating isn’t well-defined if and only if its 6814
SuperHyperReverse Dimension Dominating isn’t well-defined. 6815
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Dimension Dominat- 6816

ing, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then 6817
its Neutrosophic SuperHyperReverse Dimension Dominating isn’t well-defined if and only if its SuperHy- 6818
perReverse Dimension Dominating isn’t well-defined. 6819
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6820
perReverse Dimension Dominating is well-defined if and only if its SuperHyperReverse Dimension Dominating is 6821
well-defined. 6822
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6823
Neutrosophic SuperHyperReverse Dimension Dominating is well-defined if and only if its SuperHyperReverse 6824
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Dimension Dominat- 6826
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its

ing 6827
Neutrosophic SuperHyperReverse Dimension Dominating is well-defined if and only if its SuperHyperReverse 6828
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6830
(i) : the dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6831
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6832
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6833
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6834
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6835
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating. 6836
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6837
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6840

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

independent SuperHyperSet is 6845
(iii) : the connected SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6848
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6852

Graph which is a SuperHyperReverse Dimension Dominating/SuperHyperPath. Then V is a maximal 6853
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6857
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6858
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6859
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6861

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6862
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6866
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6867
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6868
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6870

perGraph which is a SuperHyperReverse Dimension Dominating/SuperHyperPath. Then the number 6871
of 6872

(i) : the SuperHyperReverse Dimension Dominating; 6873
(ii) : the SuperHyperReverse Dimension Dominating; 6874
(iii) : the connected SuperHyperReverse Dimension Dominating; 6875
(iv) : the O(ESHG)-SuperHyperReverse Dimension Dominating; 6876
(v) : the strong O(ESHG)-SuperHyperReverse Dimension Dominating; 6877
(vi) : the connected O(ESHG)-SuperHyperReverse Dimension Dominating. 6878
coincide. 6880

Graph which is a SuperHyperWheel. Then the number of 6882
(i) : the dual SuperHyperReverse Dimension Dominating; 6883
(ii) : the dual SuperHyperReverse Dimension Dominating; 6884
(iii) : the dual connected SuperHyperReverse Dimension Dominating; 6885
(iv) : the dual O(ESHG)-SuperHyperReverse Dimension Dominating; 6886
(v) : the strong dual O(ESHG)-SuperHyperReverse Dimension Dominating; 6887
(vi) : the connected dual O(ESHG)-SuperHyperReverse Dimension Dominating. 6888
coincide. 6890
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6891

perGraph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyper- 6892
Complete SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter 6893
and] the half of multiplying r with the number of all the SuperHyperEdges plus one of all the 6894
SuperHyperVertices is a 6895
O(ESHG)
O(ESHG)
O(ESHG)


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6903
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6904
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6905
SuperHyperPart is a 6906
(iv) : δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6910
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6911
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 6912
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6914

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6933
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6934
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6935
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6936

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6944
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6945
of dual 6946
(iv) : 0-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6950

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6954
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is Supe- 6955
rHyperReverse Dimension Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6956
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6957
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6961
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating; 6962
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Dimension Dominating. 6963


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


Proposition 32.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 6974
Neutrosophic SuperHyperGraphs which are from one-type SuperHyperClass which the result is 6975
obtained for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) 6976
of these specific SuperHyperClasses of the Neutrosophic SuperHyperGraphs. 6977
Proposition 32.0.32. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6978
a dual SuperHyperDefensive SuperHyperReverse Dimension Dominating, then ∀v ∈ V \ S, ∃x ∈ S such 6979

that 6980
(i) v ∈ Ns (x); 6981
(ii) vx ∈ E. 6982
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6983

a dual SuperHyperDefensive SuperHyperReverse Dimension Dominating, then 6984
(i) S is SuperHyperReverse Dimension Dominating set; 6985
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6986
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6987
(i) Γ ≤ O; 6988
(ii) Γs ≤ On . 6989
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6990
connected. Then 6991
(i) Γ ≤ O − 1; 6992
(ii) Γs ≤ On − Σ3i=1 σi (x). 6993
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6994


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6998
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6999
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 7001
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Dimension 7002
Dominating; 7003
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 7004
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7005
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7006
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Dimension Dominating. Then 7008
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 7009
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 7011
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 7012
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 7013
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Dimension Dominating. Then 7015

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 7019
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 7020
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 7022
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Dimension Dominating; 7023
(ii) Γ = 1; 7024
(iii) Γs = Σ3i=1 σi (c); 7025

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Dimension Dominating. 7026
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 7027
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 7028
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 7030
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 7031
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 7032
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 7034
b n c+1
2
Dominating; 7036
(ii) Γ = b n2 c + 1; 7037

b n c+1 ; 7038
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 7039
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 7041
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperReverse Dimension 7042
Dominating; 7043
(ii) Γ = b n2 c; 7044

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7049
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 7050
Dimension Dominating for N SHF; 7051
(ii) Γ = m for N SHF : (V, E); 7052
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7053
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse 7054
Dimension Dominating for N SHF : (V, E). 7055

Proposition 32.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 7056

plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7057
bn
2 c+1
(i) the SuperHyperSet S = {vi }i=1 is a dual maximal SuperHyperDefensive SuperHy- 7058
perReverse Dimension Dominating for N SHF; 7059
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 7060

b n c+1 for N SHF : (V, E); 7061
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperReverse Dimension 7062
Dominating for N SHF : (V, E). 7063
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7064
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7065
bnc
Dominating for N SHF : (V, E); 7067
(ii) Γ = b n2 c for N SHF : (V, E); 7068

bnc for N SHF : (V, E); 7069
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Dimension Dominating 7070
for N SHF : (V, E). 7071
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7074

SuperHyperReverse Dimension Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 7075

perHyperReverse Dimension Dominating, then S is a dual s-SuperHyperDefensive SuperHyperReverse 7078
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7082

SuperHyperReverse Dimension Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 7083

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

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

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

Proposition 32.0.50. Let ESHG : (V, E) is a[an] [V-]SuperHyperUniform-strong-Neutrosophic 7098
(i) ∀a ∈ S, |Ns (a) ∩ S| b 2r c + 1 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7102

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


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

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


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

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

(i) ∀a ∈ S, |Ns (a) ∩ S| < 2 if ESHG : (V, E)) is an 2-SuperHyperDefensive SuperHyperReverse 7130
(ii) ∀a ∈ V \ S, |Ns (a) ∩ S| > 2 if ESHG : (V, E) is a dual 2-SuperHyperDefensive 7132

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

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


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

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

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


CHAPTER 33 7148
Neutrosophic Applications in Cancer’s 7149
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7151
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7152
disease is considered and as the consequences of the model, some parameters are used. The cells 7153
are under attack of this disease but the moves of the cancer in the special region are the matter 7154
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7155
treatments for this Neutrosophic disease. 7156
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7157
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7158
term Neutrosophic function. 7159
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7160
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7161
move from the cancer is identified by this research. Sometimes the move of the cancer 7162
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7163
about the moves and the effects of the cancer on that region; this event leads us to 7164
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7165
perception on what’s happened and what’s done. 7166
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7167
known and they’ve got the names, and some general Neutrosophic models. The moves 7168
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7169
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse 7170
Dimension Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 7171
perHyperWheel). The aim is to find either the Neutrosophic SuperHyperReverse Dimension 7172
Dominating or the Neutrosophic SuperHyperReverse Dimension Dominating in those Neutrosophic 7173
Neutrosophic SuperHyperModels. 7174
351
CHAPTER 34 7175
Case 1: The Initial Neutrosophic Steps 7176
Toward Neutrosophic 7177
SuperHyperBipartite as Neutrosophic 7178
SuperHyperModel 7179
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7180
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7181
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

353
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7182
perBipartite is obtained. 7183
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7184
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7185
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7186
(34.1), is the Neutrosophic SuperHyperReverse Dimension Dominating. 7187

CHAPTER 35 7188
Case 2: The Increasing Neutrosophic 7189
Steps Toward Neutrosophic 7190
SuperHyperMultipartite as 7191
Neutrosophic SuperHyperModel 7192
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7193
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7194
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7195
perMultipartite is obtained. 7196
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7197
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

355
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7199
Neutrosophic SuperHyperReverse Dimension Dominating. 7200

CHAPTER 36 7201
Wondering Open Problems But As The 7202
Directions To Forming The Motivations 7203
In what follows, some “problems” and some “questions” are proposed. 7204
The SuperHyperReverse Dimension Dominating and the Neutrosophic SuperHyperReverse Dimension 7205
Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 7206
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7207
recognitions? 7208
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Dimension 7209
and the Neutrosophic SuperHyperReverse Dimension Dominating?
Dominating 7210
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7211
them? 7212
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse 7213
and the Neutrosophic SuperHyperReverse Dimension Dominating?
Problem 36.0.5. The SuperHyperReverse Dimension Dominating and the Neutrosophic SuperHyperReverse 7215
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperReverse Dimension Dominating, are there else? 7217
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7218
Numbers types-results? 7219
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7220
the multiple types of SuperHyperNotions? 7221
357
CHAPTER 37 7222
Conclusion and Closing Remarks 7223
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7224
research are illustrated. Some benefits and some advantages of this research are highlighted. 7225
This research uses some approaches to make Neutrosophic SuperHyperGraphs more under- 7226
standable. In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse 7227
Dimension Dominating. For that sake in the second definition, the main definition of the Neutrosophic 7228
SuperHyperGraph is redefined on the position of the alphabets. Based on the new definition 7229
for the Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHy- 7230
perReverse Dimension Dominating, finds the convenient background to implement some results based on 7231
that. Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7232
research on the modeling of the regions where are under the attacks of the cancer to recognize 7233
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7234
on the SuperHyperNotion, SuperHyperReverse Dimension Dominating, the new SuperHyperClasses and 7235
SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7236
SuperHyperReverse Dimension Dominating and the Neutrosophic SuperHyperReverse Dimension Dominating. 7237
The clarifications, instances and literature reviews have taken the whole way through. In this 7238
research, the literature reviews have fulfilled the lines containing the notions and the results. 7239
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7240
and the architecture are formally called “ SuperHyperReverse Dimension Dominating” in the themes of 7245
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7246
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7247
for this research are, figured out, pointed out and spoken out. 7248
359
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperReverse Dimension Dominating
3. Neutrosophic SuperHyperReverse Dimension Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7249
Neutrosophic SuperHyperDuality But As 7250
Super Forms 7252
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7253

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7266
sophic rv-SuperHyperDuality. 7267
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7268

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7273
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7274
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7275
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7276
361
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7278

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7280
form the Neutrosophic SuperHyperDuality; 7284
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7285
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7286

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7296
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7297
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7302
coefficient; 7303
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7304

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7312
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7313
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7314
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7315
that they form the Neutrosophic SuperHyperDuality; 7317
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7318

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

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7322
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7325
power is corresponded to its Extreme coefficient; 7326
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7327

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

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7335
coefficient. 7336
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7337
the mentioned Neutrosophic Figures in every Neutrosophic items. 7338

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7340
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7341
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7342
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7343
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7344
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7345
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7346
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 7350
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7351
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7352
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7353
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7354

every given Neutrosophic SuperHyperDuality. 7355




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

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


the Neutrosophic SuperHyperDuality. 7426
Then 7428
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 7429
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7449

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


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

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

in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperDuality. 7468
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7469
Then, 7470
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 7471
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 7472


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

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

CHAPTER 39 7485
Neutrosophic SuperHyperJoin But As 7486
Super Forms 7488
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7489

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7504
rv-SuperHyperJoin. 7505
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7506

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

375

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7518
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7519
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7520
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7521
Neutrosophic SuperHyperJoin; 7522
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7523

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7524
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7525
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7530
coefficient; 7531
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7532

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7533
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7534
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7535
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7536
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7537
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7538

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

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

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

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

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

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

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7568
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7569
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7572
coefficient. 7573
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7577

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

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7643

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

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

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


the Neutrosophic SuperHyperJoin. 7663
Then 7665
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 7666
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 7672
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7674

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


(V, E). Then 7685

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7687


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

Then, 7705

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

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


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

CHAPTER 40 7719
Neutrosophic SuperHyperPerfect But As 7720
Super Forms 7722
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7723

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7736
rv-SuperHyperPerfect. 7737
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7738

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7743
389
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7748

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7750
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7751
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7752
form the Neutrosophic SuperHyperPerfect; 7754
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7755

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7756
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7757
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7760
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7764

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7766
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7772
coefficient; 7773
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7774

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7782
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7783
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7784
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7785
that they form the Neutrosophic SuperHyperPerfect; 7787
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7788

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7790

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7793
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7797

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7799

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7805
coefficient. 7806

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7810

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7876
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 7878
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7896
Then 7898
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 7899
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 7903
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7904
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7905
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7908

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

(V, E). Then 7919

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7942


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7945
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7946
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7947
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7948
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7954

CHAPTER 41 7955
Neutrosophic SuperHyperTotal But As 7956
Super Forms 7958
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7959

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

Va ∈ Ei , Ej ; 7964
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7965

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

Vi , Vj ∈ Ea ; 7968
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7969

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7970
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7971

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7972
rv-SuperHyperTotal. 7973
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7974

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7979
Extreme SuperHyperTotal; 7983
403
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7984

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7986
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7987
Neutrosophic SuperHyperTotal; 7990
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7991
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7992

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7993
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7998
coefficient; 7999
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8000
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8001

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8002
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8004
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 8005
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 8006
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 8007
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 8008
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8009

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 8011
Extreme SuperHyperTotal; 8015
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 8016

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 8018
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 8019
Neutrosophic SuperHyperTotal; 8022
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 8023

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8024
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 8025

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 8030
its Extreme coefficient; 8031
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 8032
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 8033

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 8034
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 8036
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 8037
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 8038
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 8039
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 8040

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8044

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8110
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 8112
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. 8119
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 8121


the Neutrosophic SuperHyperTotal. 8130
Then 8132
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 8133
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8139
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8141

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8152

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8154


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8159
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. 8170
Then, 8172
∗
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 8173
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8174


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8178
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8179
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8180
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8186

CHAPTER 42 8187
Neutrosophic SuperHyperConnected But 8188
As The Extensions Excerpt From Dense 8189
And Super Forms 8190
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8191

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8195
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8196
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8197

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8198
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8199
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8200

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

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

8205
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8206
rosophic rv-SuperHyperConnected. 8207
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8208

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

8211
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8212
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8213
417
form the Extreme SuperHyperConnected; 8217
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8218

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8219
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8220
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8221
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8222
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8223

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8224
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8225
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8226

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8227
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8228
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 8229
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8234

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8235
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8236
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8237
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8238
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8239
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8240

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8241
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8242
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8244

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8246
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8247
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8248
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8249
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8250
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8251

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8253
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8254
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8255
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8256
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8257

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8258

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8261
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8262

and the Extreme power is corresponded to its Extreme coefficient; 8266
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8267

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8270
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8271
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8272
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8273

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8274
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8275
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8279
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8280
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8282
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8283

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8284
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8285
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8286
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. 8294


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 8338
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. 8345
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 8347
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. 8354
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 8356



the Neutrosophic SuperHyperConnected. 8365
Then 8367
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 8368
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 8373
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8374
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8377

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8388
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 8389
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8390


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8394
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8395
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8396
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. 8407
Then, 8409
∗
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 8410
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8411


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8414
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8415
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8416
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8417
some representatives. The latter is straightforward. 8418
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8423

CHAPTER 43 8424
Background 8425
431












HG280; HG281; HG282; HG283], there are some endeavors to formalize the basic Super- 8577
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 8578




HG277; HG278; HG279; HG280; HG281; HG282; HG283] alongside scientific re- 8631
search books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8632




Bibliography 8648
10.33140/JMTCM.01.03.09) 8671
437



10.20944/preprints202301.0282.v1). 8687

10.20944/preprints202301.0267.v1). 8690

(doi: 10.20944/preprints202301.0265.v1). 8695
prints202301.0262.v1). 8699
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8705

prints202301.0105.v1). 8708

Preprints 2023, 2023010044 8714
10.20944/preprints202301.0043.v1). 8717

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

(doi: 10.20944/preprints202212.0500.v1). 8733
10.5281/zenodo.8067384). 8742

2023, (doi: 10.5281/zenodo.8067409). 8745
10.5281/zenodo.8061927). 8748
10.5281/zenodo.8062016). 8751
10.5281/zenodo.8057696). 8754

2023, (doi: 10.5281/zenodo.8057753). 8757
10.5281/zenodo.8052893). 8760
2023, (doi: 10.5281/zenodo.8052925). 8763
10.5281/zenodo.8051346). 8766
10.5281/zenodo.8051360). 8769
10.5281/zenodo.8025707). 8772
10.5281/zenodo.8027275). 8775
odo.8017246). 8778
10.5281/zenodo.8020128). 8781
odo.7978571). 8784
10.5281/zenodo.7978857). 8787
10.5281/zenodo.7940830). 8790
10.5281/zenodo.7943578). 8793

odo.7916595). 8796
odo.7923632). 8799
(doi: 10.5281/zenodo.7904698). 8802
2023, (doi: 10.5281/zenodo.7904671). 8805
10.5281/zenodo.7871026). 8814
2023, (doi: 10.5281/zenodo.7874647). 8817
10.5281/zenodo.7857856). 8820
2023, (doi: 10.5281/zenodo.7857841). 8823
10.5281/zenodo.7853867). 8832

10.5281/zenodo.7853922). 8835
(doi: 10.5281/zenodo.7851519). 8838
(doi: 10.5281/zenodo.7851550). 8841
10.5281/zenodo.7834229). 8850
10.5281/zenodo.7834261). 8853
10.5281/zenodo.7824560). 8856
(doi: 10.5281/zenodo.7824623). 8859

2023, (doi: 10.5281/zenodo.7809365). 8870

2023, (doi: 10.5281/zenodo.7809358). 8873
10.5281/zenodo.7809219). 8876
10.5281/zenodo.7809328). 8879
2023, (doi: 10.5281/zenodo.7806767). 8882
2023, (doi: 10.5281/zenodo.7806838). 8885
10.5281/zenodo.7799902). 8894
(doi: 10.5281/zenodo.7804218). 8897
(doi: 10.5281/zenodo.7796334). 8900
10.5281/zenodo.7791952). 8906
10.5281/zenodo.7791982). 8909

10.5281/zenodo.7790026). 8912
10.5281/zenodo.7790052). 8915
2023, (doi: 10.5281/zenodo.7787066). 8918
10.5281/zenodo.7781476). 8924
10.5281/zenodo.7783082). 8927
10.5281/zenodo.7777857). 8930
10.5281/zenodo.7779286). 8933
(doi: 10.5281/zenodo.7771831). 8936
2023, (doi: 10.5281/zenodo.7772468). 8939
10.13140/RG.2.2.20913.25446). 8942
odo.7764916). 8945
10.13140/RG.2.2.11770.98247). 8948

10.13140/RG.2.2.12400.12808). 8951
2023, (doi: 10.13140/RG.2.2.22545.10089). 8954
10.13140/RG.2.2.11377.76644). 8960
10.13140/RG.2.2.23750.96329). 8963
10.13140/RG.2.2.31366.24641). 8966
10.13140/RG.2.2.34721.68960). 8969
2023, (doi: 10.13140/RG.2.2.30212.81289). 8972
10.13140/RG.2.2.24288.35842). 8978
10.13140/RG.2.2.32467.25124). 8981
10.13140/RG.2.2.31025.45925). 8984
10.13140/RG.2.2.17184.25602). 8987

10.13140/RG.2.2.23423.28327). 8990
10.13140/RG.2.2.28456.44805). 8993
10.13140/RG.2.2.23525.68320). 8996
10.13140/RG.2.2.20170.24000). 8999
10.13140/RG.2.2.36475.59683). 9002
10.13140/RG.2.2.29764.71046). 9005
2023, (doi: 10.13140/RG.2.2.18780.87683). 9008
10.13140/RG.2.2.26134.01603). 9014
10.13140/RG.2.2.27392.30721). 9017
10.13140/RG.2.2.33028.40321). 9020
10.13140/RG.2.2.21389.20966). 9023
10.13140/RG.2.2.16356.04489). 9026

10.13140/RG.2.2.21756.21129). 9029
10.13140/RG.2.2.30983.68009). 9032
10.13140/RG.2.2.28552.29445). 9035
(doi: 10.13140/RG.2.2.10936.21761). 9038
10.13140/RG.2.2.35105.89447). 9041
(doi: 10.13140/RG.2.2.30072.72960). 9044
10.13140/RG.2.2.31147.52003). 9047
10.13140/RG.2.2.32825.24163). 9050
10.13140/RG.2.2.13059.58401). 9053
10.13140/RG.2.2.11172.14720). 9056
2023, (doi: 10.13140/RG.2.2.22011.80165). 9059
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 9062
2023, (doi: 10.13140/RG.2.2.10493.84962). 9065

ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 9068
2023, (doi: 10.13140/RG.2.2.19944.14086). 9071
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9074
(doi: 10.13140/RG.2.2.33103.76968). 9077
(doi: 10.13140/RG.2.2.23037.44003). 9080
(doi: 10.13140/RG.2.2.35646.56641). 9083
10.13140/RG.2.2.18030.48967). 9086
(doi: 10.13140/RG.2.2.13973.81121). 9089
2023, (doi: 10.13140/RG.2.2.34106.47047). 9092
2023, (doi: 10.13140/RG.2.2.31956.88961). 9098
2023, (doi: 10.13140/RG.2.2.15179.67361). 9101
10.13140/RG.2.2.21510.45125). 9104

2023, (doi: 10.13140/RG.2.2.13121.84321). 9107
10.13140/RG.2.2.11758.69441). 9110
2023, (doi: 10.13140/RG.2.2.31891.35367). 9113
10.13140/RG.2.2.19360.87048). 9116
10.13140/RG.2.2.32363.21286). 9119
10.13140/RG.2.2.23266.81602). 9122
10.13140/RG.2.2.19911.37285). 9125
10.13140/RG.2.2.11050.90569). 9128
2023, (doi: 10.13140/RG.2.2.17761.79206). 9131
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9137
(doi: 10.13140/RG.2.2.30182.50241). 9140

2023, (doi: 10.13140/RG.2.2.17252.24968). 9173
2023010396 (doi: 10.20944/preprints202301.0396.v1). 9182

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9185

2023,(doi: 10.13140/RG.2.2.36745.93289). 9199
10.20944/preprints202301.0282.v1). 9206
10.20944/preprints202301.0267.v1).). 9209

(doi: 10.20944/preprints202301.0265.v1). 9214
prints202301.0262.v1). 9218

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

10.13140/RG.2.2.35061.65767). 9227

10.13140/RG.2.2.18494.15680). 9231

10.13140/RG.2.2.32530.73922). 9235

10.13140/RG.2.2.15897.70243). 9239
10.13140/RG.2.2.32530.73922). 9243
prints202301.0105.v1). 9246


10.13140/RG.2.2.23172.19849). 9253


10.13140/RG.2.2.17385.36968). 9263
Preprints 2023, 2023010044 9266
10.20944/preprints202301.0043.v1). 9269
2023, (doi: 10.13140/RG.2.2.28945.92007). 9272
10.13140/RG.2.2.35774.77123). 9278
10.13140/RG.2.2.29430.88642). 9284
(doi: 10.20944/preprints202212.0549.v1). 9290
10.13140/RG.2.2.19380.94084). 9293

(doi: 10.20944/preprints202212.0500.v1). 9304
10.13140/RG.2.2.20993.12640). 9307

10.13140/RG.2.2.29173.86244). 9322
2023 (doi: 10.5281/zenodo.8067469). 9327
(doi: 10.5281/zenodo.8062076). 9329
2023 (doi: 10.5281/zenodo.8052976). 9333
(doi: 10.5281/zenodo.8051368). 9335

(doi: 10.5281/zenodo.8027488). 9337
10.5281/zenodo.8020181). 9339
10.5281/zenodo.7978921). 9341
odo.7943878). 9343
10.5281/zenodo.7943871). 9345
10.5281/zenodo.7923786). 9347
2023 (doi: 10.5281/zenodo.7905287). 9349

2023 (doi: 10.5281/zenodo.7874677). 9353
(doi: 10.5281/zenodo.7857906). 9355
2023 (doi: 10.5281/zenodo.7856329). 9357
10.5281/zenodo.7854561). 9359
2023 (doi: 10.5281/zenodo.7851893). 9361

(doi: 10.5281/zenodo.7835063). 9365
(doi: 10.5281/zenodo.7826705). 9367
2023 (doi: 10.5281/zenodo.7820680). 9369
10.5281/zenodo.7812750). 9371



2023 (doi: 10.5281/zenodo.7807782). 9377
2023 (doi: 10.5281/zenodo.7804449). 9379

(doi: 10.5281/zenodo.7792307). 9383
(doi: 10.5281/zenodo.7790728). 9385
2023 (doi: 10.5281/zenodo.7787712). 9387
10.5281/zenodo.7783791). 9389
10.5281/zenodo.7780123). 9391
(doi: 10.5281/zenodo.7773119). 9393
odo.7637762). 9395
10.5281/zenodo.7766174). 9397
10.5281/zenodo.7762232). 9399
(doi: 10.5281/zenodo.7758601). 9401
10.5281/zenodo.7754661). 9403
10.5281/zenodo.7750995) . 9405
(doi: 10.5281/zenodo.7749875). 9407

10.5281/zenodo.7747236). 9409
10.5281/zenodo.7742587). 9411
(doi: 10.5281/zenodo.7738635). 9413
10.5281/zenodo.7734719). 9415
10.5281/zenodo.7730484). 9417
(doi: 10.5281/zenodo.7730469). 9419
10.5281/zenodo.7722865). 9421
odo.7713563). 9423
odo.7709116). 9425
10.5281/zenodo.7706415). 9427
10.5281/zenodo.7706063). 9429
10.5281/zenodo.7701906). 9431
odo.7700205). 9433
10.5281/zenodo.7694876). 9435
10.5281/zenodo.7679410). 9437
10.5281/zenodo.7675982). 9439
10.5281/zenodo.7672388). 9441
odo.7668648). 9443

10.5281/zenodo.7662810). 9445
10.5281/zenodo.7659162). 9447
odo.7653233). 9449
odo.7653204). 9451
odo.7653142). 9453
odo.7653117). 9455
odo.7651687). 9458
odo.7651619). 9460
odo.7651439). 9462
odo.7650729). 9464
odo.7647868). 9466
odo.7647017). 9468
odo.7644894). 9470
odo.7632923). 9473
odo.7623459). 9475
10.5281/zenodo.7606416). 9477

10.5281/zenodo.7606416). 9479
odo.7606404). 9481
10.5281/zenodo.7580018). 9483
odo.7580018). 9485
odo.7580018). 9487
odo.7579929). 9489
10.5281/zenodo.7563170). 9491
odo.7563164). 9493
odo.7563160). 9495
odo.7563160). 9497
10.5281/zenodo.7563160). 9499
10.5281/zenodo.7557063). 9501
10.5281/zenodo.7557009). 9503
10.5281/zenodo.7539484). 9505
10.5281/zenodo.7523390). 9507
10.5281/zenodo.7523390). 9509
10.5281/zenodo.7523390). 9511
odo.7574952). 9513

10.5281/zenodo.7574992). 9515
odo.7523357). 9517
10.5281/zenodo.7523357). 9519
10.5281/zenodo.7504782). 9521
10.5281/zenodo.7504782). 9523
10.5281/zenodo.7504782). 9525
10.5281/zenodo.7499395). 9527
odo.7499395). 9529
10.5281/zenodo.7499395). 9531
10.5281/zenodo.7497450). 9533
10.5281/zenodo.7497450). 9535
10.5281/zenodo.7494862). 9537
odo.7494862). 9539
10.5281/zenodo.7494862). 9541
10.5281/zenodo.7493845). 9543
odo.7493845). 9545
10.5281/zenodo.7493845). 9547
odo.7539484). 9549

odo.7523390). 9551
odo.7523357). 9553
odo.7504782). 9555
odo.7499395). 9557
odo.7497450). 9559
odo.7494862). 9561
odo.7493845). 9563
odo.7480110). 9565
odo.7378758). 9567
odo.6320305). 9569
odo.6677173). 9571

CHAPTER 44 9572
Books’ Contributions 9573
“Books’ Contributions”: | Featured Threads 9574

The following references are cited by chapters. 9575
9576
[Ref284] 9577
Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension Domin- 9578
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9579
10.5281/zenodo.8072267). 9580
9581
[Ref285] 9582
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9583
By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”, Zenodo 2023, (doi: 9584
10.5281/zenodo.8072171). 9585
9586
The links to the contributions of this scientific research book are listed below. 9587
[HG284] 9588
10.5281/zenodo.8072267). 9591
9592
[TITLE] “New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension Domin- 9593
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9594

9595
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9596
https://www.researchgate.net/publication/371783312 9597
9598
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9599
https://www.scribd.com/document/654804676 9600
9601
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9602
https://zenodo.org/record/8072267 9603
9604
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9605
https://www.academia.edu/103734333 9606
463
Figure 44.1: [HG284] Henry Garrett, “New Ideas On Super Dimity By Hyper Dimple Of Reverse
Dimension Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8072267).
9607
[ADDRESSED CITATION] 9608
10.5281/zenodo.8072267). 9611
[ASSIGNED NUMBER] #284 Article 9612
[DATE] June 2023 9613

[DOI] 10.5281/zenodo.8072267 9614
[LICENSE] CC BY-NC-ND 4.0 9615
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9616
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9617
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9618
9619
[HG285] 9620
10.5281/zenodo.8072171). 9623
9624
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9625

Reverse Dimension Dominating As Hyper Dimple On Super Dimity” 9626
9627
https://www.researchgate.net/publication/371783534 9629
9630
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9631


Figure 44.4: [HG285] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Dimension Dominating As Hyper Dimple On Super Dimity”,
https://www.scribd.com/document/654800474 9632
9633
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9634
9636
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9637
https://www.academia.edu/103733426 9638
9639
10.5281/zenodo.8072171). 9643
[ASSIGNED NUMBER] #285 Article 9644
[DATE] June 2023 9645
[DOI] 10.5281/zenodo.8072171 9646
[LICENSE] CC BY-NC-ND 4.0 9647

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9648
[AVAILABLE AT TWITTER’S IDS] 9649
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9650
googlebooks GooglePlay 9651
9652
[ASSIGNED NUMBER] | Book #182 9653

HG182b
Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9655
2023 (doi: 10.5281/zenodo.8072310). 9656


[TITLE] Reverse Dimension Dominating In SuperHyperGraphs 9657

#Latest_Updates 9658
#The_Links 9659
9663
9665
#The_Links 9666
9667
[ASSIGNED NUMBER] | Book #182 9668

9669
[TITLE] Reverse Dimension Dominating In SuperHyperGraphs 9670
9671
9675
– 9676
9677
[PUBLISHER] 9678
(Paperback): https://www.amazon.com/dp/- 9679
(Hardcover): https://www.amazon.com/dp/- 9680

(Kindle Edition): https://www.amazon.com/dp/- 9681
9682
– 9683
9684
[ISBN] 9685
(Paperback): - 9686
(Hardcover): - 9687
(Kindle Edition): CC BY-NC-ND 4.0 9688
(EBook): CC BY-NC-ND 4.0 9689
9690
– 9691
9692
[PRINT LENGTH] 9693
(Paperback): - pages 9694
(Hardcover): - pages 9695
(Kindle Edition): - pages 9696
(E-Book): - pages 9697
9698
– 9699
9700
9702

#The_Links 9703
9704
https://www.researchgate.net/publication/- 9706
9707
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9708
https://drhenrygarrett.wordpress.com/2023/07/22/ 9709
Reverse-Dimension-Dominating-In-SuperHyperGraphs/ 9710
9711
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9712
https://www.scribd.com/document/- 9713
9714
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9715
https://www.academia.edu/- 9716
9717
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9718
9720
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9721
https://books.google.com/books/about?id=- 9722
9723
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9724
https://play.google.com/store/books/details?id=- 9725

[TITLE] Reverse Dimension Dominating In SuperHyperGraphs (Published Version) 9726

9727
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9728
9729
https://drhenrygarrett.wordpress.com/2023/07/22/ 9730
Reverse-Dimension-Dominating-In-SuperHyperGraphs/ 9731
9732
– 9733
9734
[POSTED BY] Dr. Henry Garrett 9735
9736
[DATE] June 022, 2023 9737

9738
[POSTED IN] 182 | Reverse Dimension Dominating In SuperHyperGraphs 9739
9740
[TAGS] 9741
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9742
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9743
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9744
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9745
neutrosophic SuperHyperGraphs, Neutrosophic Reverse Dimension Dominating In SuperHyper- 9746
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9747
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9748
scientific research Articles, scientific research Book, scientific research Chapter, scientific research 9749
Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyper- 9750

Graph Theory, SuperHyperGraphs, Reverse Dimension Dominating In SuperHyperGraphs, 9751
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9752
In this scientific research book, there are some scientific research chapters on “Extreme Reverse 9753
Dimension Dominating In SuperHyperGraphs” and “Neutrosophic Reverse Dimension Dominat- 9754
ing In SuperHyperGraphs” about some scientific research on Reverse Dimension Dominating 9755
In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme Reverse 9756

Dimension Dominating In SuperHyperGraphs and Neutrosophic Reverse Dimension Dominating 9757
In SuperHyperGraphs. With scientific research on the basic scientific research properties, the 9758
scientific research book starts to make Extreme Reverse Dimension Dominating In SuperHyper- 9759
Graphs theory and Neutrosophic Reverse Dimension Dominating In SuperHyperGraphs theory 9760
more (Extremely/Neutrosophicly) understandable. 9761

HG182b1.png
Figure 44.7: [HG182b] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8072310).

HG182b2.png


HG182b3.png


CHAPTER 45 9762
“SuperHyperGraph-Based Books”: | 9763
Featured Tweets 9764
“SuperHyperGraph-Based Books”: | Featured Tweets 9765
475
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 9766
CV 9767
503
9768
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
9769
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)
9770
Publications: Articles
2023 245 Manuscript
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph

By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi:
10.5281/zenodo.7824560).
@ResearchGate: https://www.researchgate.net/publication/369977142
@Scribd: https://www.scribd.com/document/637993759
@ZENODO_ORG: https://zenodo.org/record/7824560
@academia: https://www.academia.edu/100136177
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).
2023 243 Manuscript

By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo
2023, (doi: 10.5281/zenodo.7819531).
2023 242 Manuscript
Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian-

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

9771

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

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

9772
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
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

9773
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-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(doi: 10.5281/zenodo.7796354).
2023 228 Manuscript

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

9774
Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle-
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
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
Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-

Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023,
(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

9775
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-

Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7783082).
2023 218 Manuscript

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

In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
10.5281/zenodo.7779286).
2023 216 Article

9776
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/-
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).
9777
2023 212 Manuscript
Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut

In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi:
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

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

9778
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

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

9779
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
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

9780
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

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

9781
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

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

9782
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
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

9783
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

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

9784
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
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

9785
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

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

9786
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
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

9787
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
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).
9788
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
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

9789

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

9790
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

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

9791

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
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: -
9792
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
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

9793
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
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).
9794
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).
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
9795
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
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
9796
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”,
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
9797
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”,
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).
9798
2022 0093 | Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic Numbers in the Setting Article
of Some Classes Related to Neutrosophic Hypergraphs
Henry Garrett, “Neutrosophic Co-degree and Neutrosophic Degree alongside Chromatic
Numbers in the Setting of Some Classes Related to Neutrosophic Hypergraphs”, J Curr Trends
Comp Sci Res 1(1) (2022) 06-14.
PDF,Abstract,Issue.
2022 0092 | Recognition of the Pattern for Vertices to Make Dimension by Resolving in some Classes of Manuscript
Neutrosophic Graphs
Henry Garrett, “Recognition of the Pattern for Vertices to Make Dimension
by Resolving in some Classes of Neutrosophic Graphs”, ResearchGate 2022 (doi:
10.13140/RG.2.2.27281.51046).
2022 0091 | Regularity of Every Element to Function in the Type of Domination in Neutrosophic Graphs Manuscript
Henry Garrett, “Regularity of Every Element to Function in the Type of Domination in

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

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

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

9799
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
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).
9800
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
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”,

9801
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).
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).
9802
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).
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).
9803
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).
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
9804
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
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).
9805

(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).
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).
9806
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).
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).
9807
Publications: Books
2023 161 | Eulerian-Path-Neighbor In SuperHyperGraphs Amazon
[ADDRESSED CITATION]
[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/
@academia:https://www.academia.edu/100157960
(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
(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 160 | Eulerian-Path-Decomposition In SuperHyperGraphs Amazon
[HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry
Garrett, 2023 (doi: 10.5281/zenodo.7820680).
@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-
Decomposition-In-SuperHyperGraphs/
(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

9808
[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.
Henry Garrett, 2023 (doi: 10.5281/zenodo.7812142).
@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-
Neighbor-In-SuperHyperGraphs/
(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

9809
[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

9810
[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-
Neighbor-In-SuperHyperGraphs/
(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

9811
[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

9812
[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

9813
[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

9814
[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

9815
[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

9816
[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

9817
[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

9818
[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

9819
[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

9820
[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

9821
[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

9822
[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

9823
[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

9824
[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

9825
[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

9826
[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

9827
[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

9828
[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

9829
[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

9830
[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

9831
[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

9832
[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

9833
[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
9834
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

9835
[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

9836
[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

9837
[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

9838
[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

9839
[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
9840
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

9841
“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

9842
[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
9843
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

9844
[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

9845
[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

9846
[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

9847
[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

9848
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

9849
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
9850
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
9851
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

9852
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

9853
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
-
9854
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

9855
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9856
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
9857
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
9858
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

9859
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
9860
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
...
9861
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/
9862
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
9863
9864
9865
Henry Garrett
01/23/2022
9866
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
9867
View publication stats

Reverse 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 Dimension Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Reverse Dimension Dominating In SuperHyperGraphs

Book · June 2023

504 PUBLICATIONS 21,753 CITATIONS

On Fuzzy Logic View project

On Algebraic Structures and Algebraic Hyperstructures View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Reverse Dimension Dominating 51

6 New Ideas On Super Dimity By Hyper Dimple Of Reverse Dimension

8 Applied Notions Under The Scrutiny Of The Motivation Of This

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

10 Extreme SuperHyperReverse Dimension Dominating But As The Extensions

11 The Extreme Departures on The Theoretical Results Toward Theoretical

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

13 Extreme Applications in Cancer’s Extreme Recognition 141

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 149

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 253

25 Neutrosophic Reverse Dimension Dominating 257

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 Dimension Dominating But As The Exten-

31 The Neutrosophic Departures on The Theoretical Results Toward

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

33 Neutrosophic Applications in Cancer’s Neutrosophic Recognition 351

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 359

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 463

45 “SuperHyperGraph-Based Books”: | Featured Tweets 475

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

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.7 [HG182b] Henry Garrett, “Reverse Dimension Dominating In SuperHyperGraphs”.