Reverse Connective Dominating in SuperHyperGraphs

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

DOI: 10.5281/zenodo.8057817
CITATIONS
1 author:
Henry Garrett
495 PUBLICATIONS 20,213 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Featured Articles View project
Metric Dimension in fuzzy(neutrosophic) Graphs View project
All content following this page was uploaded by Henry Garrett on 19 June 2023.
The user has requested enhancement of the downloaded file.

Reverse Connective
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 Connective Dominating 51
6 New Ideas On Super Con By Hyper Conceit Of Reverse Connective

Dominating In Recognition of Cancer With (Extreme) SuperHyperGraph 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 Connective 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 251
25 Neutrosophic Reverse Connective Dominating 255
26 New Ideas In Recognition of Cancer And Neutrosophic SuperHyper-

Graph By Reverse Connective Dominating As Hyper Conceit On Super
Con 257
27 ABSTRACT 259
28 Applied Notions Under The Scrutiny Of The Motivation Of This

Scientific Research 265

29 Neutrosophic Preliminaries Of This Scientific Research On the Re-

deemed Ways 269
30 Neutrosophic SuperHyperReverse Connective Dominating But As The Exten-

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

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

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

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

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

Motivations 355
37 Conclusion and Closing Remarks 357
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 415
43 Background 429
Bibliography 435
44 Books’ Contributions 459
45 “SuperHyperGraph-Based Books”: | Featured Tweets 471
46 CV 499

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

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

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

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

Neutrosophic SuperHyperReverse Connective Dominating in the Neutrosophic Example
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290


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


(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 304
(42.0.3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

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

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

44.1 [HG278] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of
Reverse Connective Dominating In Recognition of Cancer With (Neutrosophic)
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.8057753). . . . . . . . . . 460
44.4 [HG279] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Connective Dominating As Hyper Conceit On Super
Con”, Zenodo 2023, (doi: 10.5281/zenodo.8057696). . . . . . . . . . . . . . . . . . 462

44.7 [HG179b] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8057817). . . . . . . . . . . . . . . . 467
45.1 “SuperHyperGraph-Based Books”: | Featured Tweets . . . . . . . . . . . . . . . . 472

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

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

Belong to The Neutrosophic SuperHyperBipartite . . . . . . . . . . . . . . . . . . 352

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

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

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

The literature review is implemented in the whole of this research. For shining the elegancy 16
and the significancy of this research, the comparison between this SuperHyperNotion with 17
other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions 18
are followed by the examples and the instances thus the clarifications are driven with different 19
tools. The applications are figured out to make sense about the theoretical aspect of this 20
ongoing research. The “Cancer’s Recognition” are the under scientific research to figure 21
out the challenges make sense about ongoing and upcoming research. The special case is 22
up. The cells are viewed in the deemed ways. There are different types of them. Some of 23
them are individuals and some of them are well-modeled by the group of cells. These types 24
are all officially called “SuperHyperVertex” but the relations amid them all officially called 25
“SuperHyperEdge”. The frameworks “SuperHyperGraph” and “Neutrosophic SuperHyper- 26
Graph” are chosen and elected to scientific research about “Cancer’s Recognition”. Thus 27
these complex and dense SuperHyperModels open up some avenues to scientific research on 28
theoretical segments and “Cancer’s Recognition”. Some avenues are posed to pursue this 29
research. It’s also officially collected in the form of some questions and some problems. Assume 30
a SuperHyperGraph. Then δ−Reverse Connective Dominating In SuperHyperGraphs is a 31
maximal of SuperHyperVertices with a maximum cardinality such that either of the following 32
expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of s ∈ S : there 33
1
are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The first 34
Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds if S 35
is an δ−SuperHyperDefensive; a Neutrosophic δ−Reverse Connective Dominating In Super- 36
HyperGraphs is a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic 37
cardinality such that either of the following expressions hold for the Neutrosophic cardinalities of 38
SuperHyperNeighbors of s ∈ S there are: |S ∩N (s)|N eutrosophic > |S ∩(V \N (s))|N eutrosophic +δ; 39
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds if S is a 40
Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a Neutrosophic 41
δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a Reverse Connective 42
Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to make a 43
Reverse Connective Dominating In SuperHyperGraphs more understandable. For the sake of 44
having Neutrosophic Reverse Connective Dominating In SuperHyperGraphs, there’s a need 45
to “redefine” the notion of a “Reverse Connective 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 Connective Dominating In SuperHyperGraphs . It’s redefined a Neutrosophic 49
Reverse Connective Dominating In SuperHyperGraphs if the mentioned Table holds, concerning, 50
“The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong 51
to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices 52
& The Number of Position in Alphabet”, “The Values of The SuperVertices&The maximum 53
Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its Vertices”, 54
“The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values of The 55
SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples and 56
instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on a 57
Reverse Connective 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 Connective Dominating In SuperHyperGraphs until the Reverse 60
Connective Dominating In SuperHyperGraphs, then it’s officially called a “Reverse Connective 61
Dominating In SuperHyperGraphs” but otherwise, it isn’t a Reverse Connective Dominating In 62
SuperHyperGraphs . There are some instances about the clarifications for the main definition 63
titled a “Reverse Connective 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 Connective Dominating In SuperHyperGraphs . For the 66
sake of having a Neutrosophic Reverse Connective Dominating In SuperHyperGraphs, there’s a 67
need to “redefine” the notion of a “Neutrosophic Reverse Connective Dominating In SuperHy- 68
perGraphs” and a “Neutrosophic Reverse Connective Dominating In SuperHyperGraphs ”. The 69

Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic SuperHyperGraph” 72
if the intended Table holds. And a Reverse Connective Dominating In SuperHyperGraphs 73
are redefined to a “Neutrosophic Reverse Connective 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
Connective Dominating In SuperHyperGraphs more understandable. Assume a Neutrosophic 77
SuperHyperGraph. There are some Neutrosophic SuperHyperClasses if the intended Table holds. 78
Thus SuperHyperPath, Reverse Connective Dominating In SuperHyperGraphs, SuperHyperStar, 79

SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “Neutrosophic 80

SuperHyperPath”, “Neutrosophic Reverse Connective 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 Connective Dominating In SuperHyperGraphs” 84
where it’s the strongest [the maximum Neutrosophic value from all the Reverse Connective 85
Dominating In SuperHyperGraphs amid the maximum value amid all SuperHyperVertices from 86
a Reverse Connective Dominating In SuperHyperGraphs .] Reverse Connective 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
Connective 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 Connective Dominating In SuperHyperGraphs, SuperHyperStar, 118
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either 119
the longest Reverse Connective Dominating In SuperHyperGraphs or the strongest Reverse 120
Connective Dominating In SuperHyperGraphs in those Neutrosophic SuperHyperModels. For 121

the longest Reverse Connective Dominating In SuperHyperGraphs, called Reverse Connective 122
Dominating In SuperHyperGraphs, and the strongest Reverse Connective Dominating In Super- 123
HyperGraphs, called Neutrosophic Reverse Connective 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 Connective Dominating In SuperHyperGraphs. 127
There isn’t any formation of any Reverse Connective Dominating In SuperHyperGraphs but 128
literarily, it’s the deformation of any Reverse Connective 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 Connective 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 Connective 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
Connective Dominating In SuperHyperGraphs” is a maximal Reverse Connective 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 Connective Dominating In 161
SuperHyperGraphs” is a maximal Neutrosophic Reverse Connective 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 Connective 168
Dominating In SuperHyperGraphs . Since there’s more ways to get type-results to make 169
Reverse Connective Dominating In SuperHyperGraphs more understandable. For the sake of 170

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

to “redefine” the notion of “Reverse Connective Dominating In SuperHyperGraphs ”. The 172
Assume a Reverse Connective Dominating In SuperHyperGraphs . It’s redefined Neutrosophic 175
Reverse Connective 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 Connective 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 Connective Dominating In SuperHyperGraphs until the Reverse Connective 186
Dominating In SuperHyperGraphs, then it’s officially called “Reverse Connective Dominating 187
In SuperHyperGraphs” but otherwise, it isn’t Reverse Connective Dominating In SuperHyper- 188
Graphs . There are some instances about the clarifications for the main definition titled “Reverse 189
Connective 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 Connective Dominating In SuperHyperGraphs . For the sake of having Neutrosophic 192
Reverse Connective Dominating In SuperHyperGraphs, there’s a need to “redefine” the notion 193
of “Neutrosophic Reverse Connective Dominating In SuperHyperGraphs” and “Neutrosophic 194
Reverse Connective 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 Connective Dominating In SuperHyperGraphs are redefined “Neutrosophic Reverse 199
Connective 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 Connective Dominating In SuperHyperGraphs more 202
understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 203
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, Reverse Connective 204
Dominating In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMulti- 205
Partite, and SuperHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic Reverse 206

Connective Dominating In SuperHyperGraphs”, “Neutrosophic SuperHyperStar”, “Neutro- 207
sophic SuperHyperBipartite”, “Neutrosophic SuperHyperMultiPartite”, and “Neutrosophic 208
SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “Neutrosophic Reverse 209
Connective Dominating In SuperHyperGraphs” where it’s the strongest [the maximum Neutro- 210
sophic value from all Reverse Connective Dominating In SuperHyperGraphs amid the maximum 211
value amid all SuperHyperVertices from a Reverse Connective Dominating In SuperHyperGraphs 212
.] Reverse Connective 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 Connective 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 Connective Dominat- 243
ing In SuperHyperGraphs, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 244
SuperHyperWheel). The aim is to find either the longest Reverse Connective Dominating In 245
SuperHyperGraphs or the strongest Reverse Connective Dominating In SuperHyperGraphs in 246
those Neutrosophic SuperHyperModels. For the longest Reverse Connective Dominating In 247
SuperHyperGraphs, called Reverse Connective Dominating In SuperHyperGraphs, and the 248
strongest Reverse Connective Dominating In SuperHyperGraphs, called Neutrosophic Reverse 249
Connective 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 Connective Dominating In SuperHyperGraphs. There isn’t any formation of any 253
Reverse Connective Dominating In SuperHyperGraphs but literarily, it’s the deformation of any 254
Reverse Connective 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 Connective 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 Connective 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 SuperHyper- 385
Graph and Neutrosophic SuperHyperGraph With SuperHyperModeling of Cancer’s Recognitions” 386

in Ref. [HG21] by Henry Garrett (2022), “Some SuperHyperDegrees and Co-SuperHyperDegrees 387
on Neutrosophic SuperHyperGraphs and SuperHyperGraphs Alongside Applications in Cancer’s 388
Treatments” in Ref. [HG22] by Henry Garrett (2022), “SuperHyperDominating and SuperHy- 389
perResolving on Neutrosophic SuperHyperGraphs And Their Directions in Game Theory and 390
Neutrosophic SuperHyperClasses” in Ref. [HG23] by Henry Garrett (2022), “SuperHyperMatch- 391
ing By (R-)Definitions And Polynomials To Monitor Cancer’s Recognition In Neutrosophic 392

SuperHyperGraphs” in Ref. [HG24] by Henry Garrett (2023), “The Focus on The Partitions 393
Obtained By Parallel Moves In The Cancer’s Extreme Recognition With Different Types of 394
Extreme SuperHyperMatching Set and Polynomial on (Neutrosophic) SuperHyperGraphs” in 395
Ref. [HG25] by Henry Garrett (2023), “Extreme Failed SuperHyperClique Decides the Failures 396
on the Cancer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHyper- 397
Models Named (Neutrosophic) SuperHyperGraphs” in Ref. [HG26] by Henry Garrett (2023), 398
“Indeterminacy On The All Possible Connections of Cells In Front of Cancer’s Attacks In The 399
Terms of Neutrosophic Failed SuperHyperClique on Cancer’s Recognition called Neutrosophic 400
SuperHyperGraphs” in Ref. [HG27] by Henry Garrett (2023), “Perfect Directions Toward 401
Idealism in Cancer’s Neutrosophic Recognition Forwarding Neutrosophic SuperHyperClique on 402
Neutrosophic SuperHyperGraphs” in Ref. [HG28] by Henry Garrett (2023), “Demonstrating 403
Complete Connections in Every Embedded Regions and Sub-Regions in the Terms of Cancer’s 404
Recognition and (Neutrosophic) SuperHyperGraphs With (Neutrosophic) SuperHyperClique” in 405
Ref. [HG29] by Henry Garrett (2023), “Different Neutrosophic Types of Neutrosophic Regions 406
titled neutrosophic Failed SuperHyperStable in Cancer’s Neutrosophic Recognition modeled in the 407
Form of Neutrosophic SuperHyperGraphs” in Ref. [HG30] by Henry Garrett (2023), “Using 408
the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHyperModel Cancer’s Recognition 409

Titled (Neutrosophic) SuperHyperGraphs” in Ref. [HG31] by Henry Garrett (2023), “Neut- 410
(2023), “(Neutrosophic) SuperHyperStable on Cancer’s Recognition by Well-SuperHyperModelled 413
(Neutrosophic) SuperHyperGraphs” in Ref. [HG33] by Henry Garrett (2023), “Neutrosophic 414
1-Failed SuperHyperForcing in the SuperHyperFunction To Use Neutrosophic SuperHyperGraphs 415

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

(Neutrosophic) SuperHyperGraphs” in Ref. [HG36] by Henry Garrett (2022), “Basic Neutro- 420
sophic Notions Concerning SuperHyperDominating and Neutrosophic SuperHyperResolving in 421
SuperHyperGraph” in Ref. [HG37] by Henry Garrett (2022), “Initial Material of Neutrosophic 422
Preliminaries to Study Some Neutrosophic Notions Based on Neutrosophic SuperHyperEdge 423
(NSHE) in Neutrosophic SuperHyperGraph (NSHG)” in Ref. [HG38] by Henry Garrett 424
(2022), and [HG44s; HG55s; HG4; HG5; HG6; HG7; HG8; HG9; HG10; HG11; HG12; 425
HG13; HG14; HG15; HG16; HG17; HG18; HG19; HG20; HG21; HG22; HG23; 426
HG972; HG98; HG982; HG106; HG107; HG111; HG112; HG115; HG116; HG120; 429
HG274; HG275; HG276; HG277; HG278; HG279], there are some endeavors to formalize 445
the basic SuperHyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph 446
alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; 447
HG66b; HG67b; HG68b; HG69b; HG70b; HG71b; HG72b; HG73b; HG74b; HG75b; 448
HG96b; HG97b; HG98b; HG99b; HG100b; HG101b; HG102b; HG103b; HG104b; 451
HG105b; HG106b; HG107b; HG108b; HG109b; HG110b; HG111b; HG112b; 452

HG177b; HG178b; HG179b]. Two popular scientific research books in Scribd in the terms 461
of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; HG44b]. 462
Some scientific studies and scientific researches about neutrosophic graphs, are proposed as 463
book in Ref. [HG32b] by Henry Garrett (2023) which is indexed by Google Scholar and has 464
more than 4728 readers in Scribd. It’s titled “Beyond Neutrosophic Graphs” and published 465

by Dr. Henry Garrett. This research book covers different types of notions and settings in 466
neutrosophic graph theory and neutrosophic SuperHyperGraph theory. 467
Also, some scientific studies and scientific researches about neutrosophic graphs, are proposed 468
as book in Ref. [HG44b] by Henry Garrett (2023) which is indexed by Google Scholar and 469
has more than 5721 readers in Scribd. It’s titled “Neutrosophic Duality” and published by Dr. 470
Henry Garrett. This research book presents different types of notions SuperHyperResolving and 471
SuperHyperDominating in the setting of duality in neutrosophic graph theory and neutrosophic 472
SuperHyperGraph theory. This research book has scrutiny on the complement of the intended set 473
and the intended set, simultaneously. It’s smart to consider a set but acting on its complement 474
that what’s done in this research book which is popular in the terms of high readers in Scribd. 475
See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the notions 476
on the framework of notions in SuperHyperGraphs, Neutrosophic notions in SuperHyperGraphs 477
theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; HG4; HG5; HG6; 478
HG7; HG8; HG9; HG10; HG11; HG12; HG13; HG14; HG15; HG16; HG17; HG18; 479
HG279] alongside scientific research books at [HG60b; HG61b; HG62b; HG63b; HG64b; 499



HG176b; HG177b; HG178b; HG179b]. Two popular scientific research books in Scribd in 513
the terms of high readers, 4728 and 5721 respectively, on neutrosophic science is on [HG32b; 514
HG44b]. 515

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

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

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

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

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

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

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

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

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

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

2023, (doi: 10.5281/zenodo.8057753). 613
By Equal Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 615
10.5281/zenodo.8052893). 616
HG276 [29] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Equal Connective 617
2023, (doi: 10.5281/zenodo.8052925). 619
By Connective Dominating As Hyper Conceit On Super Con”, Zenodo 2023, (doi: 621
10.5281/zenodo.8051346). 622

HG274 [31] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Connective Dominating 623
In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 624
10.5281/zenodo.8051360). 625
HG273 [32] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyper- 626
Graph By United Dominating As Hyper Ultra On Super Units”, Zenodo 2023, (doi: 627
10.5281/zenodo.8025707). 628
HG272 [33] Henry Garrett, “New Ideas On Super Units By Hyper Ultra Of United Dominating 629
10.5281/zenodo.8027275). 631
By Zero Forcing As Hyper ford On Super forceps”, Zenodo 2023, (doi: 10.5281/zen- 633
odo.8017246). 634
HG270 [35] Henry Garrett, “New Ideas On Super forceps By Hyper ford Of Zero Forcing In 635
Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 636
10.5281/zenodo.8020128). 637
By Matrix-Based As Hyper mat On Super matte”, Zenodo 2023, (doi: 10.5281/zen- 639
odo.7978571). 640
HG268 [37] Henry Garrett, “New Ideas On Super mat By Hyper matte Of Matrix-Based In 641
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 642
10.5281/zenodo.7978857). 643
Graph By Dominating-Edges As Hyper Dome On Super Eddy”, Zenodo 2023, (doi: 645
10.5281/zenodo.7940830). 646
HG266 [39] Henry Garrett, “New Ideas On Super Eddy By Hyper Dome Of Dominating-Edges 647
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 648
10.5281/zenodo.7943578). 649
Graph By Edge-Gap As Hyper Gape On Super Gab”, Zenodo 2023, (doi: 10.5281/zen- 651
odo.7916595). 652
HG264 [41] Henry Garrett, “New Ideas On Super Gab By Hyper Gape Of Edge-Gap In Cancer’s 653
Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zen- 654
odo.7923632). 655
By Eulerian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 657
(doi: 10.5281/zenodo.7904698). 658
HG262 [43] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type- 659
Cycle-Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 660
2023, (doi: 10.5281/zenodo.7904671). 661

By Eulerian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 663
Zenodo 2023, (doi: 10.5281/zenodo.7904529). 664
HG260 [45] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Eulerian- 665
Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyper- 666
Graph”, Zenodo 2023, (doi: 10.5281/zenodo.7904401). 667
By Eulerian-Type-Cycle-Cut As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 669
10.5281/zenodo.7871026). 670
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 672
2023, (doi: 10.5281/zenodo.7874647). 673
By Eulerian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 675
10.5281/zenodo.7857856). 676
HG256 [49] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Cycle- 677
Neighbor In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 678
2023, (doi: 10.5281/zenodo.7857841). 679
By Eulerian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 681
Cycle-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, 684
Graph By Eulerian-Cycle-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 687
10.5281/zenodo.7853867). 688
HG252 [53] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Cycle-Cut 689
10.5281/zenodo.7853922). 691
By Eulerian-Type-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 693
(doi: 10.5281/zenodo.7851519). 694
HG250 [55] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Type-Path- 695
Neighbor In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 696
(doi: 10.5281/zenodo.7851550). 697
By Eulerian-Type-Path-Decomposition As Hyper Decompress On Super Decompensation”, 699

Type-Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 702
By Eulerian-Type-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 705
10.5281/zenodo.7834229). 706
HG246 [59] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Type-Path-Cut 707
10.5281/zenodo.7834261). 709
By Eulerian-Path-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 711
10.5281/zenodo.7824560). 712
HG244 [61] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Eulerian-Path- 713
(doi: 10.5281/zenodo.7824623). 715
By Eulerian-Path-Decomposition As Hyper Decompress On Super Decompensation”, 717
Path-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 720
As Hyper Tool On Super Toot”, Zenodo 2023, (doi: 10.5281/zenodo.7812236). 723
By initial Eulerian-Path-Cut As Hyper initial Eulogy On Super initial EULA”, Zenodo 725
2023, (doi: 10.5281/zenodo.7809365). 726
By Eulerian-Path-Cut As Hyper Eulogy-Path-Cut On Super EULA-Path-Cut”, Zenodo 728
2023, (doi: 10.5281/zenodo.7809358). 729
HG238 [67] Henry Garrett, “New Ideas On Super EULA By Hyper Eulogy Of Eulerian-Path-Cut 730
10.5281/zenodo.7809219). 732
Graph By Eulerian-Path-Cut As Hyper Eulogy On Super EULA”, Zenodo 2023, (doi: 734
10.5281/zenodo.7809328). 735
By Hamiltonian-Type-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 737
2023, (doi: 10.5281/zenodo.7806767). 738

HG235 [70] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Type- 739
2023, (doi: 10.5281/zenodo.7806838). 741
By Hamiltonian-Type-Cycle-Decomposition As Hyper Decompress On Super Decompensa- 743
tion”, Zenodo 2023, (doi: 10.5281/zenodo.7804238). 744
HG233 [72] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of 745
Hamiltonian-Type-Cycle-Decomposition In Cancer’s Recognition With (Neutrosophic) 746
SuperHyperGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7804228). 747
By Hamiltonian-Type-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 749
10.5281/zenodo.7799902). 750
HG231 [74] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Type- 751
Cycle-Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, 752
(doi: 10.5281/zenodo.7804218). 753
By Hamiltonian-Cycle-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, 755
(doi: 10.5281/zenodo.7796334). 756
By Hamiltonian-Cycle-Decomposition As Hyper Decompress On Super Decompensation”, 758
By Hamiltonian-Cycle-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 761
10.5281/zenodo.7791952). 762
HG225 [78] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cycle- 763
Cut In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 764
10.5281/zenodo.7791982). 765
By Hamiltonian-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 767
10.5281/zenodo.7790026). 768
HG223 [80] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Hamiltonian-Neighbor 769
10.5281/zenodo.7790052). 771
By Hamiltonian-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 773
2023, (doi: 10.5281/zenodo.7787066). 774
Hamiltonian-Decomposition In Recognition of Cancer With (Neutrosophic) SuperHy- 776
perGraph”, Zenodo 2023, (doi: 10.5281/zenodo.7787094). 777

By Hamiltonian-Cut As Hyper Hamper On Super Hammy”, Zenodo 2023, (doi: 779
10.5281/zenodo.7781476). 780
HG219 [84] Henry Garrett, “New Ideas On Super Hammy By Hyper Hamper Of Hamiltonian-Cut 781
10.5281/zenodo.7783082). 783
Graph By Trace-Neighbor As Hyper Nebbish On Super Nebulous”, Zenodo 2023, (doi: 785
10.5281/zenodo.7777857). 786
HG217 [86] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Trace-Neighbor 787
10.5281/zenodo.7779286). 789
HG215 [87] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 790
By Trace-Decomposition As Hyper Decompress On Super Decompensation”, Zenodo 2023, 791
(doi: 10.5281/zenodo.7771831). 792
HG214 [88] Henry Garrett, “New Ideas On Super Decompensation By Hyper Decompress Of Trace- 793
Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, Zenodo 794
2023, (doi: 10.5281/zenodo.7772468). 795
By Trace-Cut As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 797
10.13140/RG.2.2.20913.25446). 798
HG212 [90] Henry Garrett, “New Ideas On Super Tract By Hyper Track Of Trace-Cut In Cancer’s 799
odo.7764916). 801
By Edge-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 803
10.13140/RG.2.2.11770.98247). 804
HG210 [92] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Edge-Neighbor In 805
Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 806
10.13140/RG.2.2.12400.12808). 807
By Edge-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 809
2023, (doi: 10.13140/RG.2.2.22545.10089). 810
Edge-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 812
ResearchGate 2023, (doi: 10.13140/RG.2.2.29544.34564). 813
HG207 [95] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyper- 814
Graph By Edge-Cut As Hyper Edify On Super Eddy”, ResearchGate 2023, (doi: 815
10.13140/RG.2.2.11377.76644). 816

HG206 [96] Henry Garrett, “New Ideas On Super Eddy By Hyper Edify Of Edge-Cut In Can- 817
cer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 818
10.13140/RG.2.2.23750.96329). 819
By Vertex-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 821
10.13140/RG.2.2.31366.24641). 822
HG204 [98] Henry Garrett, “New Ideas On Super Nebulous By Hyper Nebbish Of Vertex-Neighbor In 823
10.13140/RG.2.2.34721.68960). 825
By Vertex-Decomposition As Hyper Decompress On Super Decompensation”, ResearchGate 827
2023, (doi: 10.13140/RG.2.2.30212.81289). 828
Vertex-Decomposition In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 830
Graph By Vertex-Cut As Hyper Vertu On Super Vertigo”, ResearchGate 2023, (doi: 833
10.13140/RG.2.2.24288.35842). 834
HG200 [102] Henry Garrett, “New Ideas On Super Vertigo By Hyper Vertu Of Vertex-Cut In 835
10.13140/RG.2.2.32467.25124). 837
By Stable-Neighbor As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 839
10.13140/RG.2.2.31025.45925). 840
HG198 [104] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Stable-Neighbor In 841
10.13140/RG.2.2.17184.25602). 843
By Stable-Decompositions As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 845
10.13140/RG.2.2.23423.28327). 846
HG196 [106] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Decompositions In 847
10.13140/RG.2.2.28456.44805). 849
Graph By Stable-Cut As Hyper Stain On Super Stagy”, ResearchGate 2023, (doi: 851
10.13140/RG.2.2.23525.68320). 852
HG194 [108] Henry Garrett, “New Ideas On Super Stale By Hyper Stalk Of Stable-Cut In Can- 853
10.13140/RG.2.2.20170.24000). 855

By Clique-Neighbors As Hyper Nebbish On Super Nebulous”, ResearchGate 2023, (doi: 857
10.13140/RG.2.2.36475.59683). 858
HG192 [110] Henry Garrett, “New Ideas On Super Nebulizer By Hyper Nub Of Clique-Neighbors In 859
10.13140/RG.2.2.29764.71046). 861
By Clique-Decompositions As Hyper Decompile On Super Decommission”, ResearchGate 863
2023, (doi: 10.13140/RG.2.2.18780.87683). 864
Clique- Decompositions In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, 866
Graph By Clique-Cut As Hyper Click On Super Cliche”, ResearchGate 2023, (doi: 869
10.13140/RG.2.2.26134.01603). 870
HG188 [114] Henry Garrett, “New Ideas On Super Cliff By Hyper Cling Of Clique-Cut In Can- 871
10.13140/RG.2.2.27392.30721). 873
HG187 [115] Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHy- 874
perGraph By Space As Hyper Spin On Super Spacy”, ResearchGate 2023, (doi: 875
10.13140/RG.2.2.33028.40321). 876
Graph By List- Coloring As Hyper List On Super Lisle”, ResearchGate 2023, (doi: 878
10.13140/RG.2.2.21389.20966). 879
HG185 [117] Henry Garrett, “New Ideas On Super Lith By Hyper Lite Of List-Coloring In 880
10.13140/RG.2.2.16356.04489). 882
perGraph By Space As Hyper Sparse On Super Spark”, ResearchGate 2023, (doi: 884
10.13140/RG.2.2.21756.21129). 885
HG183 [119] Henry Garrett, “New Ideas On Super Solidarity By Hyper Soul Of Space In 886
Cancer’s Recognition With (Extreme) SuperHyperGraph”, ResearchGate 2023, (doi: 887
10.13140/RG.2.2.30983.68009). 888
By Edge-Connectivity As Hyper Disclosure On Super Closure”, ResearchGate 2023, (doi: 890
10.13140/RG.2.2.28552.29445). 891
HG181 [121] Henry Garrett, “New Ideas On Super Uniform By Hyper Deformation Of Edge-Connectivity 892
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, 893
(doi: 10.13140/RG.2.2.10936.21761). 894

By Vertex-Connectivity As Hyper Leak On Super Structure”, ResearchGate 2023, (doi: 896
10.13140/RG.2.2.35105.89447). 897
HG179 [123] Henry Garrett, “New Ideas On Super System By Hyper Explosions Of Vertex-Connectivity 898
(doi: 10.13140/RG.2.2.30072.72960). 900
By Tree-Decomposition As Hyper Forward On Super Returns”, ResearchGate 2023, (doi: 902
10.13140/RG.2.2.31147.52003). 903
HG177 [125] Henry Garrett, “New Ideas On Super Nodes By Hyper Moves Of Tree-Decomposition In 904
10.13140/RG.2.2.32825.24163). 906
Graph By Chord As Hyper Excellence On Super Excess”, ResearchGate 2023, (doi: 908
10.13140/RG.2.2.13059.58401). 909
HG175 [127] Henry Garrett, “New Ideas On Super Gap By Hyper Navigations Of Chord In 910
10.13140/RG.2.2.11172.14720). 912
By SuperHyper(i,j)-Domination As Hyper Controller On Super Waves”, ResearchGate 914
2023, (doi: 10.13140/RG.2.2.22011.80165). 915
HG173 [129] Henry Garrett, “New Ideas On Super Coincidence By Hyper Routes Of SuperHyper(i,j)- 916
Domination In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchG- 917
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 918
By SuperHyperEdge-Domination As Hyper Reversion On Super Indirection”, ResearchGate 920
2023, (doi: 10.13140/RG.2.2.10493.84962). 921
HG171 [131] Henry Garrett, “New Ideas On Super Obstacles By Hyper Model Of SuperHyperEdge- 922
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 924
By SuperHyperK-Domination As Hyper k-Actions On Super Patterns”, ResearchGate 926
2023, (doi: 10.13140/RG.2.2.19944.14086). 927
HG169 [133] Henry Garrett, “New Ideas On Super Harmony By Hyper k-Function Of SuperHyperK- 928
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 930
By SuperHyperK-Number As Hyper k-Partition On Super Layers”, ResearchGate 2023, 932
(doi: 10.13140/RG.2.2.33103.76968). 933

HG167 [135] Henry Garrett, “New Ideas On Super Gradient By Hyper k-Class Of SuperHyperK-Number 934
(doi: 10.13140/RG.2.2.23037.44003). 936
By SuperHyperOrder As Hyper Enumerations On Super Landmarks”, ResearchGate 2023, 938
(doi: 10.13140/RG.2.2.35646.56641). 939
HG165 [137] Henry Garrett, “New Ideas On Super Analogous By Hyper Visions Of SuperHyperOrder In 940
10.13140/RG.2.2.18030.48967). 942
By SuperHyperColoring As Hyper Categories On Super Neighbors”, ResearchGate 2023, 944
(doi: 10.13140/RG.2.2.13973.81121). 945
HG163 [139] Henry Garrett, “New Ideas On Super Relations By Hyper Identifications Of SuperHyper- 946
Coloring In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 947
2023, (doi: 10.13140/RG.2.2.34106.47047). 948
HG162 [140] Henry Garrett, “New Ideas On Super Contradiction By Hyper Detection of SuperHyper- 949
Defensive In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 950
By SuperHyperDimension As Hyper Distinguishing On Super Distances”, ResearchGate 953
2023, (doi: 10.13140/RG.2.2.31956.88961). 954
HG160 [142] Henry Garrett, “New Ideas On Super Locations By Hyper Differing Of SuperHyperDi- 955
mension In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 956
2023, (doi: 10.13140/RG.2.2.15179.67361). 957
By SuperHyperDominating As Hyper Closing On Super Messy”, ResearchGate 2023, (doi: 959
10.13140/RG.2.2.21510.45125). 960
HG158 [144] Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDom- 961
inating In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 962
2023, (doi: 10.13140/RG.2.2.13121.84321). 963
By SuperHyperConnected As Hyper Group On Super Surge”, ResearchGate 2023, (doi: 965
10.13140/RG.2.2.11758.69441). 966
HG156 [146] Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperCon- 967
nected In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 968
2023, (doi: 10.13140/RG.2.2.31891.35367). 969
By SuperHyperTotal As Hyper Covering On Super Infections”, ResearchGate 2023, (doi: 971
10.13140/RG.2.2.19360.87048). 972

HG154 [148] Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 973
In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 974
10.13140/RG.2.2.32363.21286). 975
HG153 [149] Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 976
10.13140/RG.2.2.23266.81602). 978
By SuperHyperPerfect As Hyper Idealism On Super Vacancy”, ResearchGate 2023, (doi: 980
10.13140/RG.2.2.19911.37285). 981
By SuperHyperJoin As Hyper Separations On Super Sorts”, ResearchGate 2023, (doi: 983
10.13140/RG.2.2.11050.90569). 984
HG150 [152] Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHy- 985
perJoin In Cancer’s Recognition with (Neutrosophic) SuperHyperGraph”, ResearchGate 986
2023, (doi: 10.13140/RG.2.2.17761.79206). 987
HG149 [153] Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of Super- 988
HyperDuality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 989
HG148 [154] Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph 991
By SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchG- 992
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 993
By Path SuperHyperColoring As Hyper Correction On Super Faults”, ResearchGate 2023, 995
(doi: 10.13140/RG.2.2.30182.50241). 996
HG146 [156] Henry Garrett, “New Ideas On Super Reflections By Hyper Rotations Of Path SuperHy- 997
perColoring In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 998
HG145 [157] Henry Garrett, “New Ideas As Hyper Deformations On Super Chains In Cancer’s 1000
Neutrosophic Recognition and Neutrosophic SuperHyperGraph By SuperHyperDensity”, 1001
HG144 [158] Henry Garrett, “New Ideas As Hyper Ignorance By SuperHyperDensity On Super 1003
Resistances In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, 1004
ResearchGate 2023, (doi:10.13140/RG.2.2.16800.05123). 1005
HG143 [159] Henry Garrett, “New Research On Cancer’s Recognition and Neutrosophic SuperHyper- 1006
Graph By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus 1007
Super separations-VI ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.29913.80482). 1008
Super separations-V ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.33269.24809). 1011

Super separations-IV ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.34946.96960). 1014
HG140 [162] Henry Garrett, “A Research On Cancer’s Recognition and Neutrosophic SuperHyperGraph 1015
By Eulerian SuperHyperCycles and Hamiltonian Sets As Hyper Covering Versus Super 1016
separations-III ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.14814.31040). 1017
separations-II ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.15653.17125). 1020
separations-I ”, ResearchGate 2023, (doi: 10.13140/RG.2.2.25719.50089). 1023
HG137 [165] Henry Garrett, “New Ideas On Super Disruptions In Cancer’s Extreme Recognition 1024
As Neutrosophic SuperHyperGraph By Hyper Plans Called SuperHyperConnectivities”, 1025
HG136 [166] Henry Garrett, “Cancer’s Neutrosophic Recognition As Neutrosophic SuperHyperGraph 1027
By SuperHyperConnectivities As Hyper Diagnosis On Super Mechanism”, ResearchGate 1028

2023, (doi: 10.13140/RG.2.2.17252.24968). 1029
HG135 [167] Henry Garrett,“Cancer’s Recognition and (Neutrosophic) SuperHyperGraph By the Criteria 1030
of Eulerian and Hamiltonian Type-Sets As Hyper Modified Cycles On Super Mess”, 1031
ResearchGate 2023,(doi: 10.13140/RG.2.2.16652.59525). 1032
HG134 [168] Henry Garrett,“Eulerian and Hamiltonian In Cancer’s Neutrosophic Recognition and 1033
Neutrosophic SuperHyperGraph On Super Interactions By Hyper Extensions of Cycles”, 1034
HG132 [169] Henry Garrett,“SuperHyperGirth Type-Results on extreme SuperHyperGirth theory and 1036
(Neutrosophic) SuperHyperGraphs Toward Cancer’s extreme Recognition”, Preprints 2023, 1037
2023010396 (doi: 10.20944/preprints202301.0396.v1). 1038
HG131 [170] Henry Garrett,“Neutrosophic SuperHyperGraphs Warns Hyper Landmark of neutrosophic 1039
SuperHyperGirth In Super Type-Versions of Cancer’s neutrosophic Recognition”, Preprints 1040

2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 1041
HG130 [171] Henry Garrett,“The Constructions of (Neutrosophic) SuperHyperGraphs on the Cancer’s 1042
Recognition in The Confrontation With Super Attacks In Hyper Situations By Implementing 1043
(Neutrosophic) 1-Failed SuperHyperForcing in The Technical Approaches to Neutralize 1044
SuperHyperViews”, ResearchGate 2023, (doi: 10.13140/RG.2.2.26240.51204). 1045
HG129 [172] Henry Garrett,“(Neutrosophic) 1-Failed SuperHyperForcing As the Entrepreneurs on 1046

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

HG128 [173] Henry Garrett,“Super Actions On The Types of Hyper Levels In The Sensible Neutrosophic 1050
SuperHyperGirth On Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyper- 1051
Graph”, ResearchGate 2023,(doi: 10.13140/RG.2.2.26836.88960). 1052
HG127 [174] Henry Garrett,“SuperHyperGirth Approaches on the Super Challenges on the Cancer’s 1053
Recognition In the Hyper Model of (Neutrosophic) SuperHyperGraph”, ResearchGate 1054

2023,(doi: 10.13140/RG.2.2.36745.93289). 1055
HG126 [175] Henry Garrett,“Extreme SuperHyperClique as the Firm Scheme of Confrontation under 1056

HG125 [176] Henry Garrett,“Uncertainty On The Act And Effect Of Cancer Alongside The Foggy 1059

10.20944/preprints202301.0282.v1). 1062
HG124 [177] Henry Garrett,“Neutrosophic Version Of Separates Groups Of Cells In Cancer’s 1063
10.20944/preprints202301.0267.v1).). 1065

(doi: 10.20944/preprints202301.0265.v1). 1070
HG122 [179] Henry Garrett,“Breaking the Continuity and Uniformity of Cancer In The Worst Case of 1071
prints202301.0262.v1). 1074

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

Cancer’s Recognition In Neutrosophic SuperHyperGraphs”, ResearchGate 2023,(doi: 1082
10.13140/RG.2.2.35061.65767). 1083
HG25 [183] Henry Garrett,“The Focus on The Partitions Obtained By Parallel Moves In The 1084
Cancer’s Extreme Recognition With Different Types of Extreme SuperHyperMatching 1085
Set and Polynomial on (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1086
10.13140/RG.2.2.18494.15680). 1087

HG26 [184] Henry Garrett,“Extreme Failed SuperHyperClique Decides the Failures on the Can- 1088
cer’s Recognition in the Perfect Connections of Cancer’s Attacks By SuperHy- 1089
perModels Named (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1090
10.13140/RG.2.2.32530.73922). 1091
HG27 [185] Henry Garrett,“Indeterminacy On The All Possible Connections of Cells In Front 1092
of Cancer’s Attacks In The Terms of Neutrosophic Failed SuperHyperClique on Can- 1093
cer’s Recognition called Neutrosophic SuperHyperGraphs”, ResearchGate 2023, (doi: 1094
10.13140/RG.2.2.15897.70243). 1095
10.13140/RG.2.2.32530.73922). 1099
prints202301.0105.v1). 1102
HG28 [188] Henry Garrett,“Perfect Directions Toward Idealism in Cancer’s Neutrosophic Recogni- 1103
tion Forwarding Neutrosophic SuperHyperClique on Neutrosophic SuperHyperGraphs”, 1104
HG29 [189] Henry Garrett,“Demonstrating Complete Connections in Every Embedded Regions 1106
and Sub-Regions in the Terms of Cancer’s Recognition and (Neutrosophic) Su- 1107
perHyperGraphs With (Neutrosophic) SuperHyperClique”, ResearchGate 2023, (doi: 1108
10.13140/RG.2.2.23172.19849). 1109

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

10.13140/RG.2.2.17385.36968). 1119

Preprints 2023, 2023010044 1122
10.20944/preprints202301.0043.v1). 1125

HG31 [195] Henry Garrett, “Using the Tool As (Neutrosophic) Failed SuperHyperStable To SuperHy- 1126
perModel Cancer’s Recognition Titled (Neutrosophic) SuperHyperGraphs”, ResearchGate 1127
2023, (doi: 10.13140/RG.2.2.28945.92007). 1128

SuperHyperModelled (Neutrosophic) SuperHyperGraphs”, ResearchGate 2023, (doi: 1133
10.13140/RG.2.2.35774.77123). 1134
HG35 [199] Henry Garrett, “(Neutrosophic) 1-Failed SuperHyperForcing in Cancer’s Re- 1138
cognitions And (Neutrosophic) SuperHyperGraphs”, ResearchGate 2022, (doi: 1139
10.13140/RG.2.2.29430.88642). 1140

(doi: 10.20944/preprints202212.0549.v1). 1146
(Neutrosophic) SuperHyperDefensive SuperHyperAlliances”, ResearchGate 2022, (doi: 1148
10.13140/RG.2.2.19380.94084). 1149
SuperHyperClasses”, ResearchGate 2022, (doi: 10.13140/RG.2.2.14426.41923). 1157

(doi: 10.20944/preprints202212.0500.v1). 1160
Graph With SuperHyperModeling of Cancer’s Recognitions”, ResearchGate 2022 (doi: 1162
10.13140/RG.2.2.20993.12640). 1163

HG952 [207] Henry Garrett,“Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic 1164

HG95 [208] Henry Garrett, “Some SuperHyperDegrees and Co-SuperHyperDegrees on Neutrosophic Su- 1167
perHyperGraphs And SuperHyperGraphs Alongside Applications in Cancer’s Treatments”, 1168

ResearchGate 2022 (doi: 10.13140/RG.2.2.23123.04641). 1169
HG37 [211] Henry Garrett, “Basic Neutrosophic Notions Concerning SuperHyperDominating and 1176
Neutrosophic SuperHyperResolving in SuperHyperGraph”, ResearchGate 2022 (doi: 1177
10.13140/RG.2.2.29173.86244). 1178
HG38 [212] Henry Garrett, “Initial Material of Neutrosophic Preliminaries to Study Some Neutrosophic 1179
Notions Based on Neutrosophic SuperHyperEdge (NSHE) in Neutrosophic SuperHyper- 1180
Graph (NSHG)”, ResearchGate 2022 (doi: 10.13140/RG.2.2.25385.88160). 1181
HG179b [213] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry 1182
Garrett, 2023 (doi: 10.5281/zenodo.8057817). 1183
HG178b [214] Henry Garrett, “Equal Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 1184
2023 (doi: 10.5281/zenodo.8052976). 1185
HG177b [215] Henry Garrett, “Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1186
(doi: 10.5281/zenodo.8051368). 1187
HG176b [216] Henry Garrett, “United Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1188
(doi: 10.5281/zenodo.8027488). 1189
HG175b [217] Henry Garrett, “Zero Forcing In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1190
10.5281/zenodo.8020181). 1191
HG174b [218] Henry Garrett, “Matrix-Based In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1192
10.5281/zenodo.7978921). 1193
HG173b [219] Henry Garrett, “Collections of Math II”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1194
odo.7943878). 1195
HG172b [220] Henry Garrett, “Dominating-Edges In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1196
10.5281/zenodo.7943871). 1197
HG171b [221] Henry Garrett, “Edge-Gap In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1198
10.5281/zenodo.7923786). 1199

HG170b [222] Henry Garrett, “Eulerian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1200
2023 (doi: 10.5281/zenodo.7905287). 1201
HG169b [223] Henry Garrett, “Eulerian-Type-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1202

HG168b [224] Henry Garrett, “Eulerian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1204
2023 (doi: 10.5281/zenodo.7874677). 1205
HG167b [225] Henry Garrett, “Eulerian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1206
(doi: 10.5281/zenodo.7857906). 1207
HG166b [226] Henry Garrett, “Eulerian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1208
2023 (doi: 10.5281/zenodo.7856329). 1209
HG165b [227] Henry Garrett, “Eulerian-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1210
10.5281/zenodo.7854561). 1211
HG164b [228] Henry Garrett, “Eulerian-Type-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1212
2023 (doi: 10.5281/zenodo.7851893). 1213
HG163b [229] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry 1214

HG162b [230] Henry Garrett, “Eulerian-Type-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1216
(doi: 10.5281/zenodo.7835063). 1217
HG161b [231] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1218
(doi: 10.5281/zenodo.7826705). 1219
HG160b [232] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1220
2023 (doi: 10.5281/zenodo.7820680). 1221
HG159b [233] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1222
10.5281/zenodo.7812750). 1223
HG158b [234] Henry Garrett, “Hamiltonian-Type-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry 1224

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

HG156b [236] Henry Garrett, “Hamiltonian-Type-Cycle-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 1228
2023 (doi: 10.5281/zenodo.7807782). 1229
HG155b [237] Henry Garrett, “Hamiltonian-Cycle-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 1230
2023 (doi: 10.5281/zenodo.7804449). 1231
HG154b [238] Henry Garrett, “Hamiltonian-Cycle-Decomposition In SuperHyperGraphs”. Dr. Henry 1232

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

HG152b [240] Henry Garrett, “Hamiltonian-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1236
(doi: 10.5281/zenodo.7790728). 1237
HG151b [241] Henry Garrett, “Hamiltonian-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 1238
2023 (doi: 10.5281/zenodo.7787712). 1239
HG150b [242] Henry Garrett, “Hamiltonian-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1240
10.5281/zenodo.7783791). 1241
HG149b [243] Henry Garrett, “Trace-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1242
10.5281/zenodo.7780123). 1243
HG148b [244] Henry Garrett, “Trace-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1244
(doi: 10.5281/zenodo.7773119). 1245
HG147b [245] Henry Garrett, “SuperHyperDuality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1246
odo.7637762). 1247
HG146b [246] Henry Garrett, “Trace-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1248
10.5281/zenodo.7766174). 1249
HG145b [247] Henry Garrett, “Edge-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1250
10.5281/zenodo.7762232). 1251
HG144b [248] Henry Garrett, “Edge-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1252
(doi: 10.5281/zenodo.7758601). 1253
HG143b [249] Henry Garrett, “Edge-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1254
10.5281/zenodo.7754661). 1255
HG142b [250] Henry Garrett, “Vertex-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1256
10.5281/zenodo.7750995) . 1257
HG141b [251] Henry Garrett, “Vertex-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1258
(doi: 10.5281/zenodo.7749875). 1259
HG140b [252] Henry Garrett, “Vertex-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1260
10.5281/zenodo.7747236). 1261
HG139b [253] Henry Garrett, “Stable-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1262
10.5281/zenodo.7742587). 1263
HG138b [254] Henry Garrett, “Stable-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1264
(doi: 10.5281/zenodo.7738635). 1265
HG137b [255] Henry Garrett, “Stable-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1266
10.5281/zenodo.7734719). 1267
HG136b [256] Henry Garrett, “Clique-Neighbors In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1268
10.5281/zenodo.7730484). 1269
HG135b [257] Henry Garrett, “Clique-Decompositions In SuperHyperGraphs”. Dr. Henry Garrett, 2023 1270
(doi: 10.5281/zenodo.7730469). 1271

HG134b [258] Henry Garrett, “Clique-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1272
10.5281/zenodo.7722865). 1273
HG133b [259] Henry Garrett, “Space In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1274
odo.7713563). 1275
odo.7709116). 1277
HG131b [261] Henry Garrett, “Edge-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1278
10.5281/zenodo.7706415). 1279
HG130b [262] Henry Garrett, “Vertex-Connectivity In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1280
10.5281/zenodo.7706063). 1281
HG129b [263] Henry Garrett, “Tree-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1282
10.5281/zenodo.7701906). 1283
HG128b [264] Henry Garrett, “Chord In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1284
odo.7700205). 1285
HG127b [265] Henry Garrett, “(i,j)-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1286
10.5281/zenodo.7694876). 1287
HG126b [266] Henry Garrett, “Edge-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1288
10.5281/zenodo.7679410). 1289
HG125b [267] Henry Garrett, “K-Domination In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1290
10.5281/zenodo.7675982). 1291
HG124b [268] Henry Garrett, “K-Number In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1292
10.5281/zenodo.7672388). 1293
HG123b [269] Henry Garrett, “Order In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1294
odo.7668648). 1295
HG122b [270] Henry Garrett, “Coloring In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1296
10.5281/zenodo.7662810). 1297
HG121b [271] Henry Garrett, “Dimension In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 1298
10.5281/zenodo.7659162). 1299
HG120b [272] Henry Garrett, “Cancer In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1300
odo.7653233). 1301
HG119b [273] Henry Garrett, “SuperHyperWheel”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1302
odo.7653204). 1303
HG118b [274] Henry Garrett, “SuperHyperMultipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1304
odo.7653142). 1305
HG117b [275] Henry Garrett, “SuperHyperBipartite”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1306
odo.7653117). 1307

HG116b [276] Henry Garrett, “SuperHyperStar”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7653089). 1308
HG115b [277] Henry Garrett, “SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1309
odo.7651687). 1310
HG114b [278] Henry Garrett, “SuperHyperPath”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1311
odo.7651619). 1312
HG113b [279] Henry Garrett, “SuperHyperDomination”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1313
odo.7651439). 1314
HG112b [280] Henry Garrett, “SuperHyperDominating”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1315
odo.7650729). 1316
HG111b [281] Henry Garrett, “SuperHyperConnected”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1317
odo.7647868). 1318
HG110b [282] Henry Garrett, “SuperHyperTotal”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1319
odo.7647017). 1320
HG109b [283] Henry Garrett, “SuperHyperPerfect”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1321
odo.7644894). 1322
HG108b [284] Henry Garrett, “SuperHyperJoin”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7641880). 1323
HG107b [285] Henry Garrett, “Path SuperHyperColoring”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1324
odo.7632923). 1325
HG106b [286] Henry Garrett, “SuperHyperDensity”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1326
odo.7623459). 1327
HG105b [287] Henry Garrett, “Neutrosophic SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1328
10.5281/zenodo.7606416). 1329
HG104b [288] Henry Garrett, “Extreme SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 1330
10.5281/zenodo.7606416). 1331
HG103b [289] Henry Garrett, “SuperHyperConnectivities”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1332
odo.7606404). 1333
HG102b [290] Henry Garrett, “Neutrosophic SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 1334
10.5281/zenodo.7580018). 1335
HG101b [291] Henry Garrett, “Extreme SuperHyperCycle”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1336
odo.7580018). 1337
odo.7580018). 1339
odo.7579929). 1341

HG98b [294] Henry Garrett, “Neutrosophic SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1342
10.5281/zenodo.7563170). 1343
HG97b [295] Henry Garrett, “Extreme SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1344
odo.7563164). 1345
HG96b [296] Henry Garrett, “SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1346
odo.7563160). 1347
odo.7563160). 1349
HG94b [298] Henry Garrett, “Overlook On SuperHyperGirth”. Dr. Henry Garrett, 2023 (doi: 1350
10.5281/zenodo.7563160). 1351
HG93b [299] Henry Garrett, “Neutrosophic SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1352
10.5281/zenodo.7557063). 1353
HG92b [300] Henry Garrett, “Extreme SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1354
10.5281/zenodo.7557009). 1355
HG91b [301] Henry Garrett, “Overlook On SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 1356
10.5281/zenodo.7539484). 1357
HG90b [302] Henry Garrett, “Neutrosophic Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1358
10.5281/zenodo.7523390). 1359
HG89b [303] Henry Garrett, “Extreme Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1360
10.5281/zenodo.7523390). 1361
HG88b [304] Henry Garrett, “Overlook On Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1362
10.5281/zenodo.7523390). 1363
HG87b [305] Henry Garrett, “Extreme SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1364
odo.7574952). 1365
HG86b [306] Henry Garrett, “Neutrosophic SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1366
10.5281/zenodo.7574992). 1367
odo.7523357). 1369
HG84b [308] Henry Garrett, “Overlook On SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 1370
10.5281/zenodo.7523357). 1371
HG83b [309] Henry Garrett, “Neutrosophic Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1372
10.5281/zenodo.7504782). 1373
HG82b [310] Henry Garrett, “Extreme Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1374
10.5281/zenodo.7504782). 1375
HG81b [311] Henry Garrett, “Overlook On Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1376
10.5281/zenodo.7504782). 1377

HG80b [312] Henry Garrett, “Neutrosophic SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1378
10.5281/zenodo.7499395). 1379
HG79b [313] Henry Garrett, “Extreme SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1380
odo.7499395). 1381
HG78b [314] Henry Garrett, “Overlook On SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 1382
10.5281/zenodo.7499395). 1383
HG77b [315] Henry Garrett, “Neutrosophic Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1384
10.5281/zenodo.7497450). 1385
HG76b [316] Henry Garrett, “Extreme Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1386
10.5281/zenodo.7497450). 1387
HG75b [317] Henry Garrett, “Neutrosophic SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1388
10.5281/zenodo.7494862). 1389
HG74b [318] Henry Garrett, “Extreme SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1390
odo.7494862). 1391
HG73b [319] Henry Garrett, “Overlook On SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 1392
10.5281/zenodo.7494862). 1393
HG72b [320] Henry Garrett, “Neutrosophic SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1394
10.5281/zenodo.7493845). 1395
HG71b [321] Henry Garrett, “Extreme SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1396
odo.7493845). 1397
HG70b [322] Henry Garrett, “Overlook On SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 1398
10.5281/zenodo.7493845). 1399
HG69b [323] Henry Garrett, “SuperHyperMatching”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1400
odo.7539484). 1401
HG68b [324] Henry Garrett, “Failed SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1402
odo.7523390). 1403
HG67b [325] Henry Garrett, “SuperHyperClique”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1404
odo.7523357). 1405
HG66b [326] Henry Garrett, “Failed SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1406
odo.7504782). 1407
HG65b [327] Henry Garrett, “SuperHyperStable”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1408
odo.7499395). 1409
HG64b [328] Henry Garrett, “Failed SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1410
odo.7497450). 1411
HG63b [329] Henry Garrett, “SuperHyperForcing”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1412
odo.7494862). 1413

HG62b [330] Henry Garrett, “SuperHyperAlliances”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1414
odo.7493845). 1415
HG61b [331] Henry Garrett, “SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1416
odo.7480110). 1417
HG60b [332] Henry Garrett, “Neut. SuperHyperEdges”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1418
odo.7378758). 1419
HG32b [333] Henry Garrett, “Beyond Neutrosophic Graphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1420
odo.6320305). 1421
HG44b [334] Henry Garrett, “Neutrosophic Duality”. Dr. Henry Garrett, 2023 (doi: 10.5281/zen- 1422
odo.6677173). 1423

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

but it’s officially called “Extreme SuperHyperGraphs”. The cancer is the disease but the model 1473
is going to figure out what’s going on this phenomenon. The special case of this disease is 1474
considered and as the consequences of the model, some parameters are used. The cells are 1475
under attack of this disease but the moves of the cancer in the special region are the matter of 1476
mind. The recognition of the cancer could help to find some treatments for this disease. The 1477
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1478
Recognition” and both bases are the background of this research. Sometimes the cancer has 1479
been happened on the region, full of cells, groups of cells and embedded styles. In this segment, 1480
the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of the 1481
moves of the cancer in the forms of alliances’ styles with the formation of the design and the 1482
architecture are formally called “ SuperHyperK-Domination” in the themes of jargons and 1483
buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure out 1484
the background for the SuperHyperNotions. The recognition of the cancer in the long-term 1485
and neutrality about the moves and the effects of the cancer on that region; this event leads 1489
us to choose another model [it’s said to be Extreme SuperHyperGraph] to have convenient 1490
perception on what’s happened and what’s done. There are some specific models, which 1491
are well-known and they’ve got the names, and some general models. The moves and the 1492
traces of the cancer on the complex tracks and between complicated groups of cells could 1493
be fantasized by an Extreme SuperHyperPath (-/SuperHyperK-Domination, SuperHyperStar, 1494
SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the 1495
optimal SuperHyperK-Domination or the Extreme SuperHyperK-Domination in those Extreme 1496

SuperHyperModels. Some general results are introduced. Beyond that in SuperHyperStar, 1497
all possible Extreme SuperHyperPath s have only two SuperHyperEdges but it’s not enough 1498
since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperK- 1499
Domination. There isn’t any formation of any SuperHyperK-Domination but literarily, it’s the 1500
deformation of any SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 1501
Question 4.0.1. How to define the SuperHyperNotions and to do research on them to find the “ 1502
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 1503
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 1504
based on the fixed groups of cells or the fixed groups of group of cells? 1505
Question 4.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of these 1506
messy and dense SuperHyperModels where embedded notions are illustrated? 1507
It’s motivation to find notions to use in this dense model is titled “SuperHyperGraphs”. 1508
Thus it motivates us to define different types of “ SuperHyperK-Domination” and “Extreme 1509
SuperHyperK-Domination” on “SuperHyperGraph” and “Extreme SuperHyperGraph”. Then the 1510

research has taken more motivations to define SuperHyperClasses and to find some connections 1511
amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get some 1512
instances and examples to make clarifications about the framework of this research. The general 1513
results and some results about some connections are some avenues to make key point of this 1514
research, “Cancer’s Recognition”, more understandable and more clear. 1515
Some SuperHyperClasses and some Extreme SuperHyperClasses are the cases of this research 1516
on the modeling of the regions where are under the attacks of the cancer to recognize 1517
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the 1518
instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 1519
and SuperHyperClasses, are introduced. Some general results are gathered in the section on 1520
the SuperHyperK-Domination and the Extreme SuperHyperK-Domination. The clarifications, 1521
instances and literature reviews have taken the whole way through. In this scientific research, 1522
the literature reviews have fulfilled the lines containing the notions and the results. The 1523
SuperHyperGraph and Extreme SuperHyperGraph are the SuperHyperModels on the “Cancer’s 1524
Recognitions” and both bases are the background of this research. Sometimes the cancer has 1525
been happened on the region, full of cells, groups of cells and embedded styles. In this scientific 1526
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities 1527
of the moves of the cancer in the longest and strongest styles with the formation of the design 1528
and the architecture are formally called “ SuperHyperK-Domination” in the themes of jargons 1529
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 1530
out the background for the SuperHyperNotions. 1531

CHAPTER 5 1532
Extreme Reverse Connective Dominating 1533
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 1534
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 1535
2023, (doi: 10.13140/RG.2.2.34953.52320). 1536

Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 1537
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 1538
(doi: 10.13140/RG.2.2.33275.80161). 1539
Henry Garrett, “New Ideas In Cancer’s Recognition And Neutrosophic SuperHyperGraph 1540
10.13140/RG.2.2.11050.90569). 1542
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 1543
10.13140/RG.2.2.17761.79206). 1545
10.13140/RG.2.2.19911.37285). 1548
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 1549
10.13140/RG.2.2.23266.81602). 1551
10.13140/RG.2.2.19360.87048). 1554
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 1555
10.13140/RG.2.2.32363.21286). 1557
10.13140/RG.2.2.11758.69441). 1560
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 1561
In Cancer’s Recognition With (Neutrosophic) SuperHyperGraph”, ResearchGate 2023, (doi: 1562
10.13140/RG.2.2.31891.35367). 1563
10.13140/RG.2.2.21510.45125). 1566
51
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 1567
10.13140/RG.2.2.13121.84321). 1569

CHAPTER 6 1570
New Ideas On Super Con By Hyper 1571
Conceit Of Reverse Connective 1572
Dominating In Recognition of Cancer 1573
With (Extreme) SuperHyperGraph 1574
53
CHAPTER 7 1575
ABSTRACT 1576
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 1577

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Connective 1578
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 1579
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Connective 1580
Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Connective Dominating 1581
criteria holds 1582
∀Ea ∈ EN SHG , ∃Eb ∈ E 0 : ∃Vc ∈ VN SHG , Vc ∈ Ea , Eb

And ∀Ea ∈ EN SHG : (T (E), I(E), F (E)) ≤
maximum number of Neutrosophic strength of
SuperHyperPath (NSHP) from Neutrosophic SuperHyperVertex (NSHV) Vi
to Neutrosophic SuperHyperVertex (NSHV) Vj where 1 ≤ i, j ≤ s.;
Neutrosophic re-SuperHyperReverse Connective Dominating if the following expression is called 1583
Neutrosophic e-SuperHyperReverse Connective Dominating criteria holds 1584

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

SuperHyperReverse Connective Dominating if the following expression is called Neutrosophic v- 1586
SuperHyperReverse Connective Dominating criteria holds 1587
∀Va , ∃Vb ∈ V 0 : ∃Ed ∈ EN SHG , Va , Vc ∈ Ed

55
Neutrosophic rv-SuperHyperReverse Connective Dominating if the following expression is called 1588

Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 1589

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 1590
HyperReverse Connective Dominating if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, 1591
Neutrosophic re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective 1592
Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating. ((Neutrosophic) SuperHy- 1593
perReverse Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 1594
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 1595
E is called an Extreme SuperHyperReverse Connective Dominating if it’s either of Neutrosophic e- 1596

SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dominating, Neut- 1597
rosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv-SuperHyperReverse Connective 1598
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 1599
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 1600
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 1601
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse Connective 1602
Dominating; a Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutrosophic 1603
e-SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dominating, 1604
Neutrosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv-SuperHyperReverse 1605
Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 1606
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 1607
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 1608

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 1609
SuperHyperReverse Connective Dominating; an Extreme SuperHyperReverse Connective Dominating Super- 1610
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutro- 1611
sophic re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Domin- 1612
ating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme 1613
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Ex- 1614
treme coefficients defined as the Extreme number of the maximum Extreme cardinality of 1615
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 1616
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 1617
form the Extreme SuperHyperReverse Connective Dominating; and the Extreme power is corresponded 1618
to its Extreme coefficient; a Neutrosophic SuperHyperReverse Connective Dominating SuperHyper- 1619
Polynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic 1620

re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Dominating, and 1621
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutrosophic SuperHy- 1622
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 1623
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 1624
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 1625
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 1626

such that they form the Neutrosophic SuperHyperReverse Connective Dominating; and the Neutrosophic 1627
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Connective 1628
Dominating if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic re- 1629
SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Dominating, and 1630
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme SuperHy- 1631
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 1632
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 1633
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 1634
the Extreme SuperHyperReverse Connective Dominating; a Neutrosophic V-SuperHyperReverse Connective 1635
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutrosophic Supe- 1638
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 1639
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 1640
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 1641
the Neutrosophic SuperHyperReverse Connective Dominating; an Extreme V-SuperHyperReverse Connective 1642
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dom- 1643
inating, Neutrosophic re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse 1644
Connective Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) 1645
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 1646
contains the Extreme coefficients defined as the Extreme number of the maximum Extreme 1647
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Ex- 1648
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 1649
such that they form the Extreme SuperHyperReverse Connective Dominating; and the Extreme power 1650
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Connective Dominat- 1651

ing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, 1652
Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutro- 1654
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 1655
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 1656
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 1657

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 1658
HyperVertices such that they form the Neutrosophic SuperHyperReverse Connective Dominating; and 1659
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 1660
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperReverse Connective 1661
Dominating and Neutrosophic SuperHyperReverse Connective Dominating. Two different types of Super- 1662
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 1663
The literature review is implemented in the whole of this research. For shining the elegancy and 1665
the significancy of this research, the comparison between this SuperHyperNotion with other 1666
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 1667
followed by the examples and the instances thus the clarifications are driven with different tools. 1668
The applications are figured out to make sense about the theoretical aspect of this ongoing 1669
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 1670
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 1671
deemed ways. There are different types of them. Some of them are individuals and some of them 1672

are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 1673
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHy- 1674
perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 1675
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 1676
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 1677
pursue this research. It’s also officially collected in the form of some questions and some problems. 1678
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Connective 1679

Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 1680
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 1681
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 1682
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 1683
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Connective Dominating is 1684
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 1685

such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 1686
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 1687
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 1688
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 1689
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 1690
SuperHyperReverse Connective Dominating . Since there’s more ways to get type-results to make a 1691
SuperHyperReverse Connective Dominating more understandable. For the sake of having Neutrosophic 1692
SuperHyperReverse Connective Dominating, there’s a need to “redefine” the notion of a “SuperHy- 1693
perReverse Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 1694
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 1695
position of labels to assign to the values. Assume a SuperHyperReverse Connective Dominating . It’s 1696
redefined a Neutrosophic SuperHyperReverse Connective Dominating if the mentioned Table holds, 1697
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 1698
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 1699
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 1700
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 1701
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 1702
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 1703
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 1704
on a SuperHyperReverse Connective Dominating . It’s the main. It’ll be disciplinary to have the 1705
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 1706
SuperHyperReverse Connective Dominating until the SuperHyperReverse Connective Dominating, then it’s offi- 1707
cially called a “SuperHyperReverse Connective Dominating” but otherwise, it isn’t a SuperHyperReverse 1708
Connective Dominating . There are some instances about the clarifications for the main definition 1709
titled a “SuperHyperReverse Connective Dominating ”. These two examples get more scrutiny and 1710
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 1711
based on a SuperHyperReverse Connective Dominating . For the sake of having a Neutrosophic Su- 1712
perHyperReverse Connective Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 1713
SuperHyperReverse Connective Dominating” and a “Neutrosophic SuperHyperReverse Connective Dominating 1714

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 1715
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 1716
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 1717
rHyperGraph” if the intended Table holds. And a SuperHyperReverse Connective Dominating are 1718

redefined to a “Neutrosophic SuperHyperReverse Connective Dominating” if the intended Table holds. 1719
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 1720
to get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Connective Dominating 1721
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 1722
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 1723
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 1724
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse Connective 1725

Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 1726
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 1727
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Connective Dominating” where 1728
it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse Connective 1729
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperReverse 1730
Connective Dominating .] SuperHyperReverse Connective Dominating . A graph is a SuperHyperUniform 1731

if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 1732
with two exceptions; it’s SuperHyperReverse Connective Dominating if it’s only one SuperVertex as 1735
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 1736
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 1737
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 1738
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 1739
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 1741
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 1751
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 1752
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 1753
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 1754
identified since there are some determinacy, indeterminacy and neutrality about the moves 1755
and the effects of the cancer on that region; this event leads us to choose another model [it’s 1756
said to be Neutrosophic SuperHyperGraph] to have convenient perception on what’s happened 1757
and what’s done. There are some specific models, which are well-known and they’ve got the 1758
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 1759
cancer on the complex tracks and between complicated groups of cells could be fantasized 1760
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Connective Dominating, SuperHyperStar, 1761
the longest SuperHyperReverse Connective Dominating or the strongest SuperHyperReverse Connective 1763
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Connective 1764

Dominating , called SuperHyperReverse Connective Dominating, and the strongest SuperHyperReverse Con- 1765
nective Dominating, called Neutrosophic SuperHyperReverse Connective Dominating, some general results 1766
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 1767
SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges 1768
to form any style of a SuperHyperReverse Connective Dominating. There isn’t any formation of any 1769
SuperHyperReverse Connective Dominating but literarily, it’s the deformation of any SuperHyperReverse 1770
Connective Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 1771
rosophic SuperHyperReverse Connective Dominating theory, SuperHyperGraphs, and Neutrosophic 1772
SuperHyperGraphs theory are proposed. 1773
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Connective Dominating, Cancer’s 1774
Neutrosophic Recognition 1775


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

Then the research has taken more motivations to define SuperHyperClasses and to find some 1837
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 1838
some instances and examples to make clarifications about the framework of this research. The 1839
general results and some results about some connections are some avenues to make key point of 1840
this research, “Cancer’s Recognition”, more understandable and more clear. 1841
The framework of this research is as follows. In the beginning, I introduce basic definitions 1842
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 1843
SuperHyperGraphs and Extreme SuperHyperGraph are deeply-introduced and in-depth- 1844
discussed. The elementary concepts are clarified and illustrated completely and sometimes 1845
review literature are applied to make sense about what’s going to figure out about the 1846
upcoming sections. The main definitions and their clarifications alongside some results 1847
about new notions, SuperHyperReverse Connective Dominating and Extreme SuperHyperReverse Connective 1848
Dominating, are figured out in sections “ SuperHyperReverse Connective Dominating” and “Extreme 1849
SuperHyperReverse Connective Dominating”. In the sense of tackling on getting results and in Reverse 1850
Connective Dominating to make sense about continuing the research, the ideas of SuperHyperUniform 1851
and Extreme SuperHyperUniform are introduced and as their consequences, corresponded 1852
SuperHyperClasses are figured out to debut what’s done in this section, titled “Results on 1853
SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. As going back to origin of 1854

the notions, there are some smart steps toward the common notions to extend the new notions 1855
in new frameworks, SuperHyperGraph and Extreme SuperHyperGraph, in the sections “Results 1856
on SuperHyperClasses” and “Results on Extreme SuperHyperClasses”. The starter research 1857
about the general SuperHyperRelations and as concluding and closing section of theoretical 1858
research are contained in the section “General Results”. Some general SuperHyperRelations 1859
are fundamental and they are well-known as fundamental SuperHyperNotions as elicited 1860
and discussed in the sections, “General Results”, “ SuperHyperReverse Connective Dominating”, 1861
“Extreme SuperHyperReverse Connective Dominating”, “Results on SuperHyperClasses” and “Results 1862
on Extreme SuperHyperClasses”. There are curious questions about what’s done about the 1863
SuperHyperNotions to make sense about excellency of this research and going to figure out 1864
the word “best” as the description and adjective for this research as presented in section, 1865
“ SuperHyperReverse Connective Dominating”. The keyword of this research debut in the section 1866
“Applications in Cancer’s Recognition” with two cases and subsections “Case 1: The Initial 1867
Steps Toward SuperHyperBipartite as SuperHyperModel” and “Case 2: The Increasing Steps 1868
Toward SuperHyperMultipartite as SuperHyperModel”. In the section, “Open Problems”, there 1869
are some scrutiny and discernment on what’s done and what’s happened in this research in 1870
the terms of “questions” and “problems” to make sense to figure out this research in featured 1871
style. The advantages and the limitations of this research alongside about what’s done in this 1872
research to make sense and to get sense about what’s figured out are included in the section, 1873
“Conclusion and Closing Remarks”. 1874

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

terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 1881
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 1882
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 1883
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 1884
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 1885
ideas and their clarifications are addressed to Ref.[HG38]. 1886

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

Let X be a Reverse Connective 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 [. 1889
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). 1890
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E), 1891
where 1892
0
(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V ; 1893
(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); 1894
(iii) E = {E1 , E2 , . . . , En0 } a finite set of finite single valued Neutrosophic subsets of V ; 1895
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i 0
= 1896
0
1, 2, . . . , n ); 1897
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1898
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1899

P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1900
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ); 1901
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 . 1902
Here the Neutrosophic SuperHyperEdges (NSHE) Ej 0 and the Neutrosophic SuperHyperVertices 1903
(NSHV) Vj are single valued Neutrosophic sets. TV 0 (Vi ), IV 0 (Vi ), and FV 0 (Vi ) denote the 1904
degree of truth-membership, the degree of indeterminacy-membership and the degree of 1905
falsity-membership the Neutrosophic SuperHyperVertex (NSHV) Vi to the Neutrosophic 1906

SuperHyperVertex (NSHV) V. TV0 (Ei0 ), TV0 (Ei0 ), and TV0 (Ei0 ) denote the degree of truth- 1907
membership, the degree of indeterminacy-membership and the degree of falsity-membership 1908
of the Neutrosophic SuperHyperEdge (NSHE) Ei0 to the Neutrosophic SuperHyperEdge 1909
(NSHE) E. Thus, the ii0 th element of the Reverse Connective Dominating of Neutrosophic 1910
SuperHyperGraph (NSHG) are of the form (Vi , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )), the sets V and E 1911
are crisp sets. 1912

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

(Ref.[HG11s],Definition 2.7,p.3). 1914
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). The Neutro- 1915
sophic SuperHyperEdges (NSHE) Ei0 and the Neutrosophic SuperHyperVertices (NSHV) Vi of 1916
Neutrosophic SuperHyperGraph (NSHG) S = (V, E) could be characterized as follow-up items. 1917
(i) If |Vi | = 1, then Vi is called vertex; 1918
(ii) if |Vi | ≥ 1, then Vi is called SuperVertex; 1919
(iii) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | = 2, then Ei0 is called edge; 1920
(iv) if for all Vi s are incident in Ei0 , |Vi | = 1, and |Ei0 | ≥ 2, then Ei0 is called HyperEdge; 1921
(v) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | = 2, then Ei0 is called 1922
SuperEdge; 1923
(vi) if there’s a Vi is incident in Ei0 such that |Vi | ≥ 1, and |Ei0 | ≥ 2, then Ei0 is called 1924
SuperHyperEdge. 1925
If we choose different types of binary operations, then we could get hugely diverse types of 1926
general forms of Neutrosophic SuperHyperGraph (NSHG). 1927
Definition 9.0.7 (t-norm). (Ref.[HG11s], Definition 2.7, p.3). 1928

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 1929
x, y, z, w ∈ [0, 1]: 1930
(i) 1 ⊗ x = x; 1931
(ii) x ⊗ y = y ⊗ x; 1932
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 1933
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 1934

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

where 1937

(i) V = {V1 , V2 , . . . , Vn } a finite set of finite single valued Neutrosophic subsets of V 0 ; 1938
(iv) E = {(Ei0 , TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 )) : TV0 (Ei0 ), IV0 (Ei0 ), FV0 (Ei0 ) ≥ 0}, (i0 = 1941
1, 2, . . . , n0 ); 1942
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 1943
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 1944
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 1945
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 1946
0

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

Definition 9.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 1973
of elements of SuperHyperEdges are the same. 1974
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 1975
makes to have SuperHyperUniform more understandable. 1976
Definition 9.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 1977
Classes as follows. 1978
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 1979
two given SuperHyperEdges with two exceptions; 1980
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 1981
SuperHyperEdges; 1982
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 1983
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 1984
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 1985
in common; 1986
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 1987
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 1988
SuperHyperEdge in common; 1989
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 1990
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 1991
SuperVertex. 1992
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 1993
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 1994
(i) Vi , Vi+1 ∈ Ei0 ; 1995
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 1996
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 1997
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 1998
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 1999
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 2000
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 2001
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 2002
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 2004
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 2005
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 2006
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 2007
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 2008
perPath . 2009
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 2010
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 2011
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 2012
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 2013
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 2014
Definition 9.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 2015

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

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


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

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

Dominating). 2032
Neutrosophic SuperHyperSet V 0 = {V1 , V2 , . . . , Vs } and E 0 = {E1 , E2 , . . . , Ez }. Then either V 0 2034
or E 0 is called 2035
(i) Neutrosophic e-SuperHyperReverse Connective Dominating if the following expression is 2036

called Neutrosophic e-SuperHyperReverse Connective Dominating criteria holds 2037

(ii) Neutrosophic re-SuperHyperReverse Connective Dominating if the following expression is 2038

called Neutrosophic re-SuperHyperReverse Connective Dominating criteria holds 2039

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 2040
(iii) Neutrosophic v-SuperHyperReverse Connective Dominating if the following expression is 2041

called Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 2042


(iv) Neutrosophic rv-SuperHyperReverse Connective Dominating if the following expression 2043

is called Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 2044

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 2045
(v) Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutro- 2046

sophic e-SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connect- 2047
ive Dominating, Neutrosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv- 2048
SuperHyperReverse Connective Dominating. 2049
Definition 9.0.19. ((Neutrosophic) SuperHyperReverse Connective Dominating). 2050

(i) an Extreme SuperHyperReverse Connective Dominating if it’s either of Neutrosophic 2053

e-SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dom- 2054
inating, Neutrosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv- 2055
SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme SuperHyperGraph 2056
N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of 2057
high Extreme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme 2058
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 2059
form the Extreme SuperHyperReverse Connective Dominating; 2060
(ii) a Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutro- 2061

SuperHyperReverse Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph 2064
N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHy- 2065
perEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 2066
Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they 2067
form the Neutrosophic SuperHyperReverse Connective Dominating; 2068
(iii) an Extreme SuperHyperReverse Connective Dominating SuperHyperPolynomial if 2069

it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic re- 2070
SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Dominating, 2071
and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme 2072
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the 2073
Extreme coefficients defined as the Extreme number of the maximum Extreme cardinality 2074
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 2075
cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such 2076
that they form the Extreme SuperHyperReverse Connective Dominating; and the Extreme power 2077
is corresponded to its Extreme coefficient; 2078

(iv) a Neutrosophic SuperHyperReverse Connective Dominating SuperHyperPolynomial 2079

if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic re- 2080
and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutro- 2082
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 2083
contains the Neutrosophic coefficients defined as the Neutrosophic number of the max- 2084
imum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic 2085

SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHy- 2086
perEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 2087
SuperHyperReverse Connective Dominating; and the Neutrosophic power is corresponded to its 2088
Neutrosophic coefficient; 2089
(v) an Extreme V-SuperHyperReverse Connective Dominating if it’s either of Neutro- 2090

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 2095
(vi) a Neutrosophic V-SuperHyperReverse Connective Dominating if it’s either of Neutro- 2098

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 2102
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 2103
consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such 2104
that they form the Neutrosophic SuperHyperReverse Connective Dominating; 2105
(vii) an Extreme V-SuperHyperReverse Connective Dominating SuperHyperPolynomial 2106


of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 2112
(viii) a Neutrosophic SuperHyperReverse Connective Dominating SuperHyperPolynomial 2116

imum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 2122

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

Neutrosophic coefficient. 2126
Definition 9.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Connective Dominating). 2127
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 2128
(i) an δ−SuperHyperReverse Connective Dominating is a Neutrosophic kind of Neutrosophic 2129
SuperHyperReverse Connective Dominating such that either of the following expressions hold for 2130
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 2131
|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 2132

(29.1), holds if S is an δ−SuperHyperDefensive; 2133
(ii) a Neutrosophic δ−SuperHyperReverse Connective Dominating is a Neutrosophic kind 2134

of Neutrosophic SuperHyperReverse Connective Dominating such that either of the following 2135
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 2136

of s ∈ S : 2137
|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 2138

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 2139
For the sake of having a Neutrosophic SuperHyperReverse Connective Dominating, there’s a need to 2140
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 2141
there’s the usage of the position of labels to assign to the values. 2143
136DEF1 Definition 9.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 2144
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 2145
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 2146
to get Neutrosophic type-results to make a Neutrosophic more understandable. 2147

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

136TBL4

136TBL1
136DEF2 Definition 9.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 2148

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 2149
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Connective Dominating, SuperHyperStar, 2150
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 2151
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 2152

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 2153
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 2154
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Connective 2155

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 2156
Connective Dominating more Neutrosophicly understandable. 2157
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Connective Dominating”. The 2159
2162
136DEF1 Definition 9.0.23. Assume a SuperHyperReverse Connective Dominating. It’s redefined a Neutro- 2163
sophic SuperHyperReverse Connective Dominating if the Table (29.3) holds. 2164

CHAPTER 10 2165
Extreme SuperHyper But As Reverse Connective Dominating 2166
The Extensions Excerpt From Dense And 2167
Super Forms 2168
Definition 10.0.1. (Extreme event). 2169
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2170
is a probability Reverse Connective Dominating. Any Extreme k-subset of A of V is called Extreme 2171
k-event and if k = 2, then Extreme subset of A of V is called Extreme event. The following 2172
expression is called Extreme probability of A. 2173
X
E(A) = E(a). (10.1)
a∈A
Definition 10.0.2. (Extreme Independent). 2174

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 2175
is a probability Reverse Connective Dominating. s Extreme k-events Ai , i ∈ I is called Extreme 2176

s-independent if the following expression is called Extreme s-independent criteria 2177
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 2178
following expression is called Extreme independent criteria 2179
E(A ∩ B) = P (A)P (B). (10.2)
Definition 10.0.3. (Extreme Variable). 2180

Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is 2181
a probability Reverse Connective Dominating. Any k-function Reverse Connective Dominating like E is called 2182
Extreme k-Variable. If k = 2, then any 2-function Reverse Connective Dominating like E is called 2183
Extreme Variable. 2184
The notion of independent on Extreme Variable is likewise. 2185
Definition 10.0.4. (Extreme Expectation). 2186
Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) is a 2187
77
probability Reverse Connective Dominating. an Extreme k-Variable E has a number is called Extreme 2188
Expectation if the following expression is called Extreme Expectation criteria 2189
X
Ex(E) = E(α)P (α).
α∈V
Definition 10.0.5. (Extreme Crossing). 2190

a probability Reverse Connective Dominating. an Extreme number is called Extreme Crossing if the 2192
following expression is called Extreme Crossing criteria 2193
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 2194
S = (V, E) is a probability Reverse Connective Dominating. Let m and n propose special Reverse Connective 2195
Dominating. Then with m ≥ 4n, 2196
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 Connective 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: 2197
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
2198
Theorem 10.0.7. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2199
Consider S = (V, E) is a probability Reverse Connective Dominating. Let P be a SuperHyperSet of n 2200
points in the plane, and let l be the Extreme number of √ SuperHyperLines in the plane passing 2201
through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 2202
Proof. Form an Extreme SuperHyperGraph G with SuperHyperVertex SuperHyperSet P whose 2203

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

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

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

as to obtain a simple Extreme SuperHyperGraph G with e(G) ≥ k − n. Now cr(G) ≤ n(n − 1) 2222
because G is formed from at most n SuperHyperCircles, and any two SuperHyperCircles cross 2223
at most twice. Thus either e(G) < 4n, in which case k < 5n < 5n4/3 , or n2 > n(n − 1) ≥ 2224
3
cr(G) ≥ (k − n) /64n2 by the Extreme Crossing Lemma, and k < 4n4/3 + n < 5n4/3 . 2225
Proposition 10.0.9. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2226
Consider S = (V, E) is a probability Reverse Connective Dominating. Let X be a nonnegative Extreme 2227
Variable and t a positive real number. Then 2228
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. 2229
Corollary 10.0.10. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E). 2230
Consider S = (V, E) is a probability Reverse Connective Dominating. Let Xn be a nonnegative integer- 2231
valued variable in a probability Reverse Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 2232
n → ∞, then P (Xn = 0) → 1 as n → ∞. 2233
Proof. 2234
Consider S = (V, E) is a probability Reverse Connective Dominating. A special SuperHyperGraph in 2236
Gn,p almost surely has stability number at most d2p−1 log ne. 2237

S = (V, E) is a probability Reverse Connective Dominating. A special SuperHyperGraph in Gn,p is 2239
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 2240
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 2241
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 2242
SuperHyperEdge of the Extreme SuperHyperGraph G. 2243
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 2244
Extreme Variable for this Extreme Event. By equation, we have 2245
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 2246
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 2247
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: 2248
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 2249
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 2250
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 2251
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, an 2252
Extreme SuperHyperGraph in Gn,p almost surely has stability number at most k. 2253
Definition 10.0.12. (Extreme Variance). 2254

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

S = (V, E) is a probability Reverse Connective Dominating. Let X be an Extreme Variable and let t 2262
be a positive real number. Then 2263
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
2264
Consider S = (V, E) is a probability Reverse Connective Dominating. Let Xn be an Extreme Variable in 2266
a probability Reverse Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 2267
then 2268
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 2270
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 2271
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 2272
Consider S = (V, E) is a probability Reverse Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 2274
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 2275
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 2276
S = (V, E) is a probability Reverse Connective Dominating. As in the proof of related Theorem, the 2278
result is straightforward. 2279
Consider S = (V, E) is a probability Reverse Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 2281
be as defined in previous Theorem. Then either: 2282
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 2283
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 2284
S = (V, E) is a probability Reverse Connective Dominating. The latter is straightforward. 2286
Definition 10.0.17. (Extreme Threshold). 2287

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

Definition 10.0.18. (Extreme Balanced). 2294

probability Reverse Connective Dominating. Let F be a fixed Extreme SuperHyperGraph. Then 2296
there is a threshold function for the property of containing a copy of F as an Extreme 2297
SubSuperHyperGraph is called Extreme Balanced. 2298
Consider S = (V, E) is a probability Reverse Connective Dominating. Let F be a nonempty balanced 2300
Extreme SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. Then n−k/l 2301

is a threshold function for the property of containing F as an Extreme SubSuperHyperGraph. 2302
136EXM1 Example 10.0.20. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in 2305
the mentioned Extreme Figures in every Extreme items. 2306
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperReverse 2307
Connective Dominating, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 2308
are some empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and 2309
E4 is an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, 2310
there’s only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, 2311
V3 is Extreme isolated means that there’s no Extreme SuperHyperEdge has it as an 2312
Extreme endpoint. Thus the Extreme SuperHyperVertex, V3 , is excluded in every given 2313
Extreme SuperHyperReverse Connective Dominating. 2314
C(N SHG)Extreme Reverse Connective Dominating =

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

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

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

{}.
= 0z 0 .
{}.
= 0z 0 .
2327



{}.
= 0z 0 .
{}.
= 0z 0 .
2330

{E2 }.
= z 6−c .
{V5 }.

= z 7−c .
2333

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

{E15 , E16 , E17 }.

= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2339

{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.

= z 3−a .
2342

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

{E1 , E2 , E3 }.



= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
2348

{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
2351


{E1 }.
= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
2354

{E9 , E3 }.
= z 3−a .


{V1 , V6 }.
= z 5−a .
2357

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


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

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


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

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


{V2 , V17 , V7 , V27 }.

= z 2−a .
2369

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


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

{E6 }.
= z 4−a .


{V1 }.
= z 6−a .
2378

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


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

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

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

(V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum 2391
possibilities of the distinct interior Extreme SuperHyperVertices inside of any given Extreme 2392
quasi-R-Reverse Connective Dominating minus all Extreme SuperHypeNeighbor to some of them but not 2393
all of them. In other words, there’s only an unique Extreme SuperHyperEdge E ∈ EESHG:(V,E) 2394
has only two distinct Extreme SuperHyperVertices in an Extreme quasi-R-Reverse Connective Dominating, 2395
minus all Extreme SuperHypeNeighbor to some of them but not all of them. 2396
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 Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Connective Dominating 2397
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2398
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other words, 2399

SuperHyperReverse Connective Dominating in the Extreme Example (42.0.3) 95NHG2
the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme number 2400
of Extreme SuperHyperVertices are renamed to Extreme Reverse Connective Dominating in some cases 2401
but the maximum number of the Extreme SuperHyperEdge with the maximum Extreme number of 2402
Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are contained in an Extreme 2403
R-Reverse Connective Dominating. 2404
Proposition 10.0.24. Assume a simple Extreme SuperHyperGraph ESHG : (V, E). Then the
Extreme number of type-result-R-Reverse Connective 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 Connective Dominating with the least Extreme cardinality, 2405
the lower sharp Extreme bound for cardinality. 2406
Proposition 10.0.25. Assume a connected loopless Extreme SuperHyperGraph ESHG : (V, E). 2407
Then in the worst case, literally, 2408
C(N SHG)ExtremeQuasi−ReverseConnectiveDominating
= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)ExtremeQuasi−ReverseConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)ExtremeQuasi−ReverseConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)ExtremeR−Quasi−ReverseConnectiveDominatingSuperHyperP olynomial = z 5 .

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

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

2413
Extreme R-Reverse Connective Dominating =

Thus E ∈ EESHG:(V,E) is an Extreme quasi-R-Reverse Connective 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 Connective 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 Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Extreme cardinality of the Extreme R-Reverse Connective Dominating 2414
is at least the maximum Extreme number of Extreme SuperHyperVertices of the Extreme 2415
SuperHyperEdges with the maximum number of the Extreme SuperHyperEdges. In other 2416
words, the maximum number of the Extreme SuperHyperEdges contains the maximum Extreme 2417
number of Extreme SuperHyperVertices are renamed to Extreme Reverse Connective Dominating in 2418
some cases but the maximum number of the Extreme SuperHyperEdge with the maximum 2419
Extreme number of Extreme SuperHyperVertices, has the Extreme SuperHyperVertices are 2420
contained in an Extreme R-Reverse Connective Dominating. 2421
The obvious SuperHyperGraph has no Extreme SuperHyperEdges. But the non-obvious Extreme 2422
SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about the Extreme 2423
optimal SuperHyperObject. It specially delivers some remarks on the Extreme SuperHyperSet of 2424
the Extreme SuperHyperVertices such that there’s distinct amount of Extreme SuperHyperEdges 2425
for distinct amount of Extreme SuperHyperVertices up to all taken from that Extreme Super- 2426
HyperSet of the Extreme SuperHyperVertices but this Extreme SuperHyperSet of the Extreme 2427
SuperHyperVertices is either has the maximum Extreme SuperHyperCardinality or it doesn’t 2428

have maximum Extreme SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at 2429
least one Extreme SuperHyperEdge containing at least all Extreme SuperHyperVertices. Thus 2430
it forms an Extreme quasi-R-Reverse Connective Dominating where the Extreme completion of the 2431
Extreme incidence is up in that. Thus it’s, literarily, an Extreme embedded R-Reverse Connective 2432
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet coin- 2433
cide. In the original setting, these types of SuperHyperSets only don’t satisfy on the maximum 2434
SuperHyperCardinality. Thus the embedded setting is elected such that those SuperHyperSets 2435
have the maximum Extreme SuperHyperCardinality and they’re Extreme SuperHyperOptimal. 2436
The less than two distinct types of Extreme SuperHyperVertices are included in the minimum 2437
Extreme style of the embedded Extreme R-Reverse Connective Dominating. The interior types of the 2438
Extreme SuperHyperVertices are deciders. Since the Extreme number of SuperHyperNeighbors 2439
are only affected by the interior Extreme SuperHyperVertices. The common connections, more 2440
precise and more formal, the perfect unique connections inside the Extreme SuperHyperSet for 2441
any distinct types of Extreme SuperHyperVertices pose the Extreme R-Reverse Connective Dominating. 2442
Thus Extreme exterior SuperHyperVertices could be used only in one Extreme SuperHyperEdge 2443
and in Extreme SuperHyperRelation with the interior Extreme SuperHyperVertices in that 2444
Extreme SuperHyperEdge. In the embedded Extreme Reverse Connective Dominating, there’s the 2445
usage of exterior Extreme SuperHyperVertices since they’ve more connections inside more 2446

than outside. Thus the title “exterior” is more relevant than the title “interior”. One Extreme 2447
SuperHyperVertex has no connection, inside. Thus, the Extreme SuperHyperSet of the Extreme 2448
SuperHyperVertices with one SuperHyperElement has been ignored in the exploring to lead 2449
on the optimal case implying the Extreme R-Reverse Connective Dominating. The Extreme R-Reverse 2450
Connective Dominating with the exclusion of the exclusion of all Extreme SuperHyperVertices in one 2451
Extreme SuperHyperEdge and with other terms, the Extreme R-Reverse Connective Dominating with 2452
the inclusion of all Extreme SuperHyperVertices in one Extreme SuperHyperEdge, is an Extreme 2453
quasi-R-Reverse Connective Dominating. To sum them up, in a connected non-obvious Extreme Super- 2454
HyperGraph ESHG : (V, E). There’s only one Extreme SuperHyperEdge E ∈ EESHG:(V,E) has 2455
only the maximum possibilities of the distinct interior Extreme SuperHyperVertices inside of 2456
any given Extreme quasi-R-Reverse Connective Dominating minus all Extreme SuperHypeNeighbor to 2457
some of them but not all of them. In other words, there’s only an unique Extreme SuperHy- 2458
perEdge E ∈ EESHG:(V,E) has only two distinct Extreme SuperHyperVertices in an Extreme 2459
quasi-R-Reverse Connective Dominating, minus all Extreme SuperHypeNeighbor to some of them but 2460
not all of them. 2461
The main definition of the Extreme R-Reverse Connective Dominating has two titles. an Ex- 2462
treme quasi-R-Reverse Connective Dominating and its corresponded quasi-maximum Extreme R- 2463
SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Extreme number, 2464
there’s an Extreme quasi-R-Reverse Connective Dominating with that quasi-maximum Extreme Supe- 2465
rHyperCardinality in the terms of the embedded Extreme SuperHyperGraph. If there’s an 2466
embedded Extreme SuperHyperGraph, then the Extreme quasi-SuperHyperNotions lead us to 2467
take the collection of all the Extreme quasi-R-Reverse Connective Dominatings for all Extreme numbers 2468
less than its Extreme corresponded maximum number. The essence of the Extreme Reverse 2469
Connective Dominating ends up but this essence starts up in the terms of the Extreme quasi-R-Reverse 2470
Connective Dominating, again and more in the operations of collecting all the Extreme quasi-R-Reverse 2471
Connective Dominatings acted on the all possible used formations of the Extreme SuperHyperGraph 2472
to achieve one Extreme number. This Extreme number is 2473
considered as the equivalence class for all corresponded quasi-R-Reverse Connective Dominatings. Let 2474
zExtreme Number , SExtreme SuperHyperSet and GExtreme Reverse Connective Dominating be an Extreme num- 2475
ber, an Extreme SuperHyperSet and an Extreme Reverse Connective Dominating. Then 2476
[zExtreme Number ]Extreme Class = {SExtreme SuperHyperSet |

SExtreme SuperHyperSet = GExtreme Reverse Connective Dominating ,
|SExtreme SuperHyperSet |Extreme Cardinality
= zExtreme Number }.
As its consequences, the formal definition of the Extreme Reverse Connective Dominating is re-formalized 2477
and redefined as follows. 2478
GExtreme Reverse Connective 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 2479
definition for the Extreme Reverse Connective Dominating. 2480
GExtreme Reverse Connective 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 2481
poses the upcoming expressions.
Connective Dominating 2482

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

= max zExtreme Number

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


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


2486

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

2487


2488


Now, the extension of these types of approaches is up. Since the new term, “Extreme SuperHy- 2489
perNeighborhood”, could be redefined as the collection of the Extreme SuperHyperVertices such 2490
that any amount of its Extreme SuperHyperVertices are incident to an Extreme SuperHyperEdge. 2491
It’s, literarily, another name for “Extreme Quasi-Reverse Connective Dominating” but, precisely, it’s the 2492
generalization of “Extreme Quasi-Reverse Connective Dominating” since “Extreme Quasi-Reverse Connective 2493
Dominating” happens “Extreme Reverse Connective Dominating” in an Extreme SuperHyperGraph as 2494

initial framework and background but “Extreme SuperHyperNeighborhood” may not happens 2495
“Extreme Reverse Connective Dominating” in an Extreme SuperHyperGraph as initial framework and 2496
preliminarily background since there are some ambiguities about the Extreme SuperHyperCar- 2497
dinality arise from it. To get orderly keywords, the terms, “Extreme SuperHyperNeighborhood”, 2498
“Extreme Quasi-Reverse Connective Dominating”, and “Extreme Reverse Connective Dominating” are up. 2499
Thus, let 2500

zExtreme Number , NExtreme SuperHyperNeighborhood and 2501
GExtreme Reverse Connective Dominating be an Extreme number, an Extreme SuperHyperNeighborhood 2502
and an Extreme Reverse Connective Dominating and the new terms are up. 2503
GExtreme Reverse Connective 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 |
2504

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

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

2507

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

2508


2509


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

Is the simple Extreme type-SuperHyperSet of the Extreme R-Reverse Connective Dominating. The
Extreme SuperHyperSet of the Extreme SuperHyperVertices,
Is an Extreme R-Reverse Connective 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 Connective 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 Connective Dominating is up. The obvious simple Extreme

type-SuperHyperSet called the Extreme Reverse Connective 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 Connective 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 Connective

. 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 Connective 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 Connective Dominating
and it’s an Extreme Reverse Connective 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 Connective Dominating. There isn’t only less than two Extreme SuperHyperVertices inside
the intended Extreme SuperHyperSet,
Thus the non-obvious Extreme R-Reverse Connective Dominating,

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

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

“Extreme R-Reverse Connective Dominating” 2514
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2515
Extreme R-Reverse Connective Dominating, 2516
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 Connective Dominating amid those obvious simple Extreme type-SuperHyperSets
of the Extreme Reverse Connective 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 Connective Dominating. In other words, the least cardinality, the lower sharp
bound for the cardinality, of an Extreme R-Reverse Connective Dominating is the cardinality of
2517
To sum them up, in a connected Extreme SuperHyperGraph ESHG : (V, E). The all interior 2518
Extreme SuperHyperVertices belong to any Extreme quasi-R-Reverse Connective Dominating if for any 2519
of them, and any of other corresponded Extreme SuperHyperVertex, some interior Extreme 2520
SuperHyperVertices are mutually Extreme SuperHyperNeighbors with no Extreme exception at 2521
all minus all Extreme SuperHypeNeighbors to any amount of them. 2522

Assume a connected Extreme SuperHyperGraph ESHG : (V, E). Let an Extreme SuperHy- 2523
perEdge ESHE : E ∈ EESHG:(V,E) has some Extreme SuperHyperVertices r. Consider all 2524
Extreme numbers of those Extreme SuperHyperVertices from that Extreme SuperHyperEdge 2525
excluding excluding more than r distinct Extreme SuperHyperVertices, exclude to any given 2526
Extreme SuperHyperSet of the Extreme SuperHyperVertices. Consider there’s an Extreme 2527
R-Reverse Connective Dominating with the least cardinality, the lower sharp Extreme bound for Extreme 2528
cardinality. Assume a connected Extreme SuperHyperGraph ESHG : (V, E). The Extreme 2529
SuperHyperSet of the Extreme SuperHyperVertices VESHE \ {z} is an Extreme SuperHyperSet 2530
S of the Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2531
some Extreme SuperHyperVertices uniquely but it isn’t an Extreme R-Reverse Connective Dominating. 2532
Since it doesn’t have 2533
2534

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

perVertices such that there’s an Extreme SuperHyperEdge to have some SuperHyperVertices 2536
uniquely. The Extreme SuperHyperSet of the Extreme SuperHyperVertices VESHE ∪ {z} 2537
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Supe- 2538
rHyperVertices but it isn’t an Extreme R-Reverse Connective Dominating. Since it doesn’t do 2539
the Extreme procedure such that such that there’s an Extreme SuperHyperEdge to have 2540
some Extreme SuperHyperVertices uniquely [there are at least one Extreme SuperHyper- 2541
Vertex outside implying there’s, sometimes in the connected Extreme SuperHyperGraph 2542
ESHG : (V, E), an Extreme SuperHyperVertex, titled its Extreme SuperHyperNeighbor, to 2543
that Extreme SuperHyperVertex in the Extreme SuperHyperSet S so as S doesn’t do “the 2544
Extreme procedure”.]. There’s only one Extreme SuperHyperVertex outside the intended 2545
Extreme SuperHyperSet, VESHE ∪ {z}, in the terms of Extreme SuperHyperNeighborhood. 2546
Thus the obvious Extreme R-Reverse Connective Dominating, VESHE is up. The obvious simple 2547
Extreme type-SuperHyperSet of the Extreme R-Reverse Connective Dominating, VESHE , is an Extreme 2548
SuperHyperSet, VESHE , includes only all Extreme SuperHyperVertices does forms any kind of 2549
Extreme pairs are titled Extreme SuperHyperNeighbors in a connected Extreme SuperHyper- 2550
Graph ESHG : (V, E). Since the Extreme SuperHyperSet of the Extreme SuperHyperVertices 2551
VESHE , is the maximum Extreme SuperHyperCardinality of an Extreme SuperHyperSet 2552
S of Extreme SuperHyperVertices such that there’s an Extreme SuperHyperEdge to have 2553

some Extreme SuperHyperVertices uniquely. Thus, in a connected Extreme SuperHyperGraph 2554
ESHG : (V, E). Any Extreme R-Reverse Connective Dominating only contains all interior Extreme 2555
SuperHyperVertices and all exterior Extreme SuperHyperVertices from the unique Extreme 2556
SuperHyperEdge where there’s any of them has all possible Extreme SuperHyperNeighbors in 2557
and there’s all Extreme SuperHyperNeighborhoods in with no exception minus all Extreme 2558
SuperHypeNeighbors to some of them not all of them but everything is possible about Extreme 2559
SuperHyperNeighborhoods and Extreme SuperHyperNeighbors out. 2560
The SuperHyperNotion, namely, Reverse Connective Dominating, is up. There’s neither empty 2561
SuperHyperEdge nor loop SuperHyperEdge. The following Extreme SuperHyperSet of Ex- 2562
treme SuperHyperEdges[SuperHyperVertices] is the simple Extreme type-SuperHyperSet of 2563
the Extreme Reverse Connective Dominating. The Extreme SuperHyperSet of Extreme SuperHy- 2564
perEdges[SuperHyperVertices], 2565
|EESHG:(V,E) |Extreme Cardinality
b c
= {E2i−1 }i=1 2
.
C(N SHG)ExtremeQuasi−ReverseConnectiveDominatingSuperHyperP olynomial
= 2z b 2 c
.
C(N SHG)ExtremeR−Quasi−ReverseConnectiveDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)ExtremeR−Quasi−ReverseConnectiveDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Extreme type-SuperHyperSet of the Extreme Reverse Connective Dominating. The Extreme 2566
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2567

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

ESHG : (V, E) is an Extreme type-SuperHyperSet with 2569
2570
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2571
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2572

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2573
SuperHyperVertices. There are not only two Extreme SuperHyperVertices inside the intended 2574
Extreme SuperHyperSet. Thus the non-obvious Extreme Reverse Connective Dominating is up. The 2575
obvious simple Extreme type-SuperHyperSet called the Extreme Reverse Connective Dominating is an 2576
Extreme SuperHyperSet includes only two Extreme SuperHyperVertices. But the Extreme 2577
SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2578
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Doesn’t have less than three SuperHyperVertices inside the intended Extreme SuperHyperSet. 2579
Thus the non-obvious simple Extreme type-SuperHyperSet of the Extreme Reverse Connective 2580
Dominating is up. To sum them up, the Extreme SuperHyperSet of the Extreme SuperHy- 2581
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 Connective Dominating. 2583
Since the Extreme SuperHyperSet of the Extreme SuperHyperEdges[SuperHyperVertices], 2584
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Extreme Reverse Connective Dominating C(ESHG) for an Extreme SuperHyperGraph 2585
ESHG : (V, E) is the Extreme SuperHyperSet S of Extreme SuperHyperVertices such 2586

that there’s no an Extreme SuperHyperEdge for some Extreme SuperHyperVertices given by 2587
that Extreme type-SuperHyperSet called the Extreme Reverse Connective Dominating and it’s an 2588
Extreme Reverse Connective Dominating. Since it’s 2589
2590
the maximum Extreme cardinality of an Extreme SuperHyperSet S of Extreme Su- 2591
perHyperEdges[SuperHyperVertices] such that there’s no Extreme SuperHyperVertex of an 2592

Extreme SuperHyperEdge is common and there’s an Extreme SuperHyperEdge for all Extreme 2593
SuperHyperVertices. There aren’t only less than three Extreme SuperHyperVertices inside the 2594
intended Extreme SuperHyperSet, 2595
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Thus the non-obvious Extreme Reverse Connective Dominating , 2596
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 Connective Dominating, 2597
not: 2598
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is the Extreme SuperHyperSet, not: 2599
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 2600
ESHG : (V, E). It’s interesting to mention that the only non-obvious simple Extreme type- 2601
SuperHyperSet called the 2602
“Extreme Reverse Connective Dominating ” 2603
amid those obvious[non-obvious] simple Extreme type-SuperHyperSets called the 2604
Extreme ,
Reverse Connective Dominating 2605
is only and only 2606
b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
In a connected Extreme SuperHyperGraph ESHG : (V, E). 2607

CHAPTER 11 2608
The Extreme Departures on The 2609
Theoretical Results Toward Theoretical 2610
Motivations 2611
The previous Extreme approach apply on the upcoming Extreme results on Extreme 2612
SuperHyperClasses. 2613
Proposition 11.0.1. Assume a connected Extreme SuperHyperPath ESHP : (V, E). Then 2614

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

perReverse Connective 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 2617
new way to redefine as 2618
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 2619
to ViEXT ERN AL in the literatures of SuperHyperReverse Connective Dominating. The latter is 2620
straightforward. 2621
136EXM18a Example 11.0.2. In the Figure (31.1), the connected Extreme SuperHyperPath ESHP : (V, E), 2622
is highlighted and featured. The Extreme SuperHyperSet, in the Extreme SuperHyperModel 2623
(31.1), is the SuperHyperReverse Connective Dominating. 2624
Proposition 11.0.3. Assume a connected Extreme SuperHyperCycle ESHC : (V, E). Then 2625

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

136EXM19a Example 11.0.4. In the Figure (31.2), the connected Extreme SuperHyperCycle N SHC : 2633
(V, E), is highlighted and featured. The obtained Extreme SuperHyperSet, in the Extreme 2634
SuperHyperModel (31.2), is the Extreme SuperHyperReverse Connective Dominating. 2635

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

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

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2637
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
2638
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

SuperHyperReverse Connective 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 2639
way to redefine as 2640

136EXM20a Example 11.0.6. In the Figure (31.3), the connected Extreme SuperHyperStar ESHS : (V, E), 2644
is highlighted and featured. The obtained Extreme SuperHyperSet, by the Algorithm in previous 2645
Extreme result, of the Extreme SuperHyperVertices of the connected Extreme SuperHyperStar 2646
ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperReverse 2647
Connective Dominating. 2648
Proposition 11.0.7. Assume a connected Extreme SuperHyperBipartite ESHB : (V, E). Then 2649

|P min |
{E3i+2 }i=0
ESHP
.


| min |EESHP | |Ei |
{P min }
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
| min |P min | |Vi |
=z 2i+2 i=0 .
Proof. Let 2650
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
2651
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 2652
a new way to redefine as 2653

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

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

Extreme SuperHyperReverse Connective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
The latter is straightforward. 2663
136EXM21a Example 11.0.8. In the Extreme Figure (31.4), the connected Extreme SuperHyperBipartite 2664
ESHB : (V, E), is Extreme highlighted and Extreme featured. The obtained Extreme 2665
SuperHyperSet, by the Extreme Algorithm in previous Extreme result, of the Extreme 2666
SuperHyperVertices of the connected Extreme SuperHyperBipartite ESHB : (V, E), in the 2667
Extreme SuperHyperModel (31.4), is the Extreme SuperHyperReverse Connective Dominating. 2668
Proposition 11.0.9. Assume a connected Extreme SuperHyperMultipartite ESHM : (V, E). 2669
Then 2670

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.

=z 2i+2 i=0 .
Proof. Let 2671
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
2672
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 2674

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

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

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

SuperHyperReverse Connective Dominating in the Example (42.0.13) 136NSHG22a
136EXM22a Example 11.0.10. In the Figure (31.5), the connected Extreme SuperHyperMultipartite 2686
ESHM : (V, E), is highlighted and Extreme featured. The obtained Extreme SuperHyperSet, by 2687
the Algorithm in previous Extreme result, of the Extreme SuperHyperVertices of the connected 2688
Extreme SuperHyperMultipartite ESHM : (V, E), in the Extreme SuperHyperModel (31.5), is 2689
the Extreme SuperHyperReverse Connective Dominating. 2690
Proposition 11.0.11. Assume a connected Extreme SuperHyperWheel ESHW : (V, E ∪ E ∗ ). 2691

Then, 2692

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 2693
P :
V1EXT ERN AL , E1∗ ,
CEN T ER, E2∗

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

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

straightforward. Then there’s at least one SuperHyperReverse Connective Dominating. Thus the notion 2699
of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Connective Dominating 2700
could be applied. The unique embedded SuperHyperReverse Connective Dominating proposes some 2701
longest SuperHyperReverse Connective Dominating excerpt from some representatives. The latter is 2702
136EXM23a Example 11.0.12. In the Extreme Figure (31.6), the connected Extreme SuperHyperWheel 2704
N SHW : (V, E), is Extreme highlighted and featured. The obtained Extreme SuperHyperSet, 2705
by the Algorithm in previous result, of the Extreme SuperHyperVertices of the connected 2706
Extreme SuperHyperWheel ESHW : (V, E), in the Extreme SuperHyperModel (31.6), is the 2707
Extreme SuperHyperReverse Connective Dominating. 2708

CHAPTER 12 2709
The Surveys of Mathematical Sets On 2710
The Results But As The Initial Motivation 2711
For the SuperHyperReverse Connective Dominating, Extreme SuperHyperReverse Connective Dominating, and 2712
the Extreme SuperHyperReverse Connective Dominating, some general results are introduced. 2713
Remark 12.0.1. Let remind that the Extreme SuperHyperReverse Connective Dominating is “redefined” 2714
on the positions of the alphabets. 2715
Corollary 12.0.2. Assume Extreme SuperHyperReverse Connective Dominating. Then 2716
Extreme SuperHyperReverseConnectiveDominating =
{theSuperHyperReverseConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseConnectiveDominating
|ExtremecardinalityamidthoseSuperHyperReverseConnectiveDominating. }
plus one Extreme SuperHypeNeighbor to one. Where σi is the unary operation on the 2717
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy 2718
and the neutrality, for i = 1, 2, 3, respectively. 2719
Corollary 12.0.3. Assume an Extreme SuperHyperGraph on the same identical letter of the 2720
alphabet. Then the notion of Extreme SuperHyperReverse Connective Dominating and SuperHyperReverse 2721
Connective Dominating coincide. 2722
alphabet. Then a consecutive sequence of the SuperHyperVertices is an Extreme SuperHyperReverse 2724
Connective Dominating if and only if it’s a SuperHyperReverse Connective Dominating. 2725
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 2727
Connective Dominating if and only if it’s a longest SuperHyperReverse Connective Dominating. 2728
Corollary 12.0.6. Assume SuperHyperClasses of an Extreme SuperHyperGraph on the same 2729
identical letter of the alphabet. Then its Extreme SuperHyperReverse Connective Dominating is its 2730
SuperHyperReverse Connective Dominating and reversely. 2731
129
Corollary 12.0.7. Assume an Extreme SuperHyperPath(-/SuperHyperReverse Connective Dominating, 2732

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 2733
identical letter of the alphabet. Then its Extreme SuperHyperReverse Connective Dominating is its 2734
Corollary 12.0.8. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2736
isn’t well-defined if and only if its SuperHyperReverse Connective Dominating isn’t
well-defined. 2738
Corollary 12.0.9. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2739

Extreme SuperHyperReverse Connective Dominating isn’t well-defined if and only if its SuperHyperReverse 2740
Connective Dominating isn’t well-defined. 2741

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2743
Extreme SuperHyperReverse Connective Dominating isn’t well-defined if and only if its SuperHyperReverse 2744
Connective Dominating isn’t well-defined. 2745
Corollary 12.0.11. Assume an Extreme SuperHyperGraph. Then its Extreme SuperHyperReverse 2746
is well-defined if and only if its SuperHyperReverse Connective Dominating is well-
defined. 2748
Corollary 12.0.12. Assume SuperHyperClasses of an Extreme SuperHyperGraph. Then its 2749
Extreme SuperHyperReverse Connective Dominating is well-defined if and only if its SuperHyperReverse 2750
Connective Dominating is well-defined. 2751
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its 2753

Extreme SuperHyperReverse Connective Dominating is well-defined if and only if its SuperHyperReverse 2754
Proposition 12.0.14. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then V is 2756
(i) : the dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2757
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2758
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2759
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2760
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2761
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating. 2762
Proposition 12.0.15. Let N T G : (V, E, σ, µ) be an Extreme SuperHyperGraph. Then ∅ is 2763
(i) : the SuperHyperDefensive SuperHyperReverse Connective Dominating; 2764
(ii) : the strong SuperHyperDefensive SuperHyperReverse Connective Dominating; 2765
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Connective Dominating; 2766
(iv) : the δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2767

(v) : the strong δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2768
(vi) : the connected δ-SuperHyperDefensive SuperHyperReverse Connective Dominating. 2769
Proposition 12.0.16. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then an 2770

independent SuperHyperSet is 2771
(iii) : the connected SuperHyperDefensive SuperHyperReverse Connective Dominating; 2774
Proposition 12.0.17. Let ESHG : (V, E) be an Extreme SuperHyperUniform SuperHyperGraph 2778

which is a SuperHyperReverse Connective Dominating/SuperHyperPath. Then V is a maximal 2779
(i) : SuperHyperDefensive SuperHyperReverse Connective Dominating; 2780
(ii) : strong SuperHyperDefensive SuperHyperReverse Connective Dominating; 2781
(iii) : connected SuperHyperDefensive SuperHyperReverse Connective Dominating; 2782
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2783
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2784
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2785
Where the exterior SuperHyperVertices and the interior SuperHyperVertices coincide. 2786
Proposition 12.0.18. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is a 2787
SuperHyperUniform SuperHyperWheel. Then V is a maximal 2788
(i) : dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2789
(ii) : strong dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2790
(iii) : connected dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2791
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2792
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2793
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2794
which is a SuperHyperReverse Connective Dominating/SuperHyperPath. Then the number of 2797

(i) : the SuperHyperReverse Connective Dominating; 2798
(ii) : the SuperHyperReverse Connective Dominating; 2799
(iii) : the connected SuperHyperReverse Connective Dominating; 2800
(iv) : the O(ESHG)-SuperHyperReverse Connective Dominating; 2801
(v) : the strong O(ESHG)-SuperHyperReverse Connective Dominating; 2802
(vi) : the connected O(ESHG)-SuperHyperReverse Connective Dominating. 2803
is one and it’s only V. Where the exterior SuperHyperVertices and the interior SuperHyperVertices 2804
coincide. 2805

which is a SuperHyperWheel. Then the number of 2807
(i) : the dual SuperHyperReverse Connective Dominating; 2808
(ii) : the dual SuperHyperReverse Connective Dominating; 2809
(iii) : the dual connected SuperHyperReverse Connective Dominating; 2810
(iv) : the dual O(ESHG)-SuperHyperReverse Connective Dominating; 2811
(v) : the strong dual O(ESHG)-SuperHyperReverse Connective Dominating; 2812
(vi) : the connected dual O(ESHG)-SuperHyperReverse Connective Dominating. 2813
coincide. 2815

which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperComplete 2817
SuperHyperMultipartite. Then a SuperHyperSet contains [the SuperHyperCenter and] the half of 2818
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices 2819
is a 2820
O(ESHG)
(iv) : 2 + 1-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2824
O(ESHG)
(v) : strong 2 + 1-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 2825
O(ESHG)
(vi) : connected 2 + 1-dual SuperHyperDefensive SuperHyperReverse Connective Dominating. 2826


SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with the 2829
number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 2830
SuperHyperPart is a 2831
(iv) : δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2835
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2836
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Connective Dominating. 2837

SuperHyperMultipartite. Then Then the number of 2840
O(ESHG)
O(ESHG)
O(ESHG)
is one and it’s only S, a SuperHyperSet contains [the SuperHyperCenter and] the half of 2847
multiplying r with the number of all the SuperHyperEdges plus one of all the SuperHyperVertices. 2848
Proposition 12.0.24. Let ESHG : (V, E) be an Extreme SuperHyperGraph. The number of 2850
connected component is |V − S| if there’s a SuperHyperSet which is a dual 2851
(iv) : SuperHyperReverse Connective Dominating; 2855
(v) : strong 1-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2856
(vi) : connected 1-SuperHyperDefensive SuperHyperReverse Connective Dominating. 2857

Proposition 12.0.25. Let ESHG : (V, E) be an Extreme SuperHyperGraph. Then the number 2858
is at most O(ESHG) and the Extreme number is at most On (ESHG). 2859
Proposition 12.0.26. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is 2860
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Extreme number is 2861

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

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

2 + 1)-SuperHyperDefensive SuperHyperReverse Connective Dominating. 2868
Proposition 12.0.27. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is ∅. The 2869
number is 0 and the Extreme number is 0, for an independent SuperHyperSet in the setting of 2870
dual 2871
(iv) : 0-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2875
Proposition 12.0.28. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is SuperHy- 2878
perComplete. Then there’s no independent SuperHyperSet. 2879
Proposition 12.0.29. Let ESHG : (V, E) be an Extreme SuperHyperGraph which is Super- 2880
HyperReverse Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 2881
(V, E)) and the Extreme number is On (ESHG : (V, E)), in the setting of a dual 2882
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2886
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating; 2887
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating. 2888

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


Proposition 12.0.31. Let N SHF : (V, E) be a SuperHyperFamily of the ESHGs : (V, E) 2899
Extreme SuperHyperGraphs which are from one-type SuperHyperClass which the result is obtained 2900
for the individuals. Then the results also hold for the SuperHyperFamily N SHF : (V, E) of 2901
these specific SuperHyperClasses of the Extreme SuperHyperGraphs. 2902
Proposition 12.0.32. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2903
SuperHyperDefensive SuperHyperReverse Connective Dominating, then ∀v ∈ V \ S, ∃x ∈ S such that 2904
(i) v ∈ Ns (x); 2905
(ii) vx ∈ E. 2906
Proposition 12.0.33. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. If S is a dual 2907
SuperHyperDefensive SuperHyperReverse Connective Dominating, then 2908
(i) S is SuperHyperReverse Connective Dominating set; 2909
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 2910
Proposition 12.0.34. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph. Then 2911
(i) Γ ≤ O; 2912
(ii) Γs ≤ On . 2913
Proposition 12.0.35. Let ESHG : (V, E) be a strong Extreme SuperHyperGraph which is 2914
connected. Then 2915
(i) Γ ≤ O − 1; 2916
(ii) Γs ≤ On − Σ3i=1 σi (x). 2917
Proposition 12.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 2918
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn−1 } is a dual SuperHyperDefensive SuperHyperReverse 2919
Connective Dominating; 2920

(ii) Γ = b n2 c + 1 and corresponded SuperHyperSet is S = {v2 , v4 , · · · , vn−1 }; 2921
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 2922
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 2923
Proposition 12.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 2925
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Connective 2926
Dominating; 2927
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 2928
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2929
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2930
Proposition 12.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Connective Dominating. Then 2932
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 2933
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 2935
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 2936
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 2937
Proposition 12.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Connective Dominating. Then 2939

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 2943
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 2944
Proposition 12.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 2946
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Connective Dominating; 2947
(ii) Γ = 1; 2948
(iii) Γs = Σ3i=1 σi (c); 2949
(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Connective Dominating. 2950
Proposition 12.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 2951

6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 2952
SuperHyperDefensive SuperHyperReverse Connective Dominating; 2953
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 2954
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 2955
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 2956
SuperHyperDefensive SuperHyperReverse Connective Dominating. 2957
Proposition 12.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 2958
b n c+1
(i) the SuperHyperSet S = {vi }i=1
2
is a dual SuperHyperDefensive SuperHyperReverse Connective 2959
Dominating; 2960
(ii) Γ = b n2 c + 1; 2961
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} 2

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

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

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

Connective Dominating for N SHF; 2975
(ii) Γ = m for N SHF : (V, E); 2976
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 2977
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse 2978
Connective Dominating for N SHF : (V, E). 2979
Proposition 12.0.45. Let N SHF : (V, E) be an m-SuperHyperFamily of odd SuperHyperCom- 2980
plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2981

b n c+1
(i) the SuperHyperSet S = {vi }i=1 2
is a dual maximal SuperHyperDefensive SuperHy- 2982
perReverse Connective Dominating for N SHF; 2983
(ii) Γ = b n2 c + 1 for N SHF : (V, E); 2984
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} b n c+1

2
for N SHF : (V, E); 2985
S={vi }i=1
b n c+1
(iv) the SuperHyperSets S = {vi }i=12
are only a dual maximal SuperHyperReverse Connective 2986
Dominating for N SHF : (V, E). 2987
Proposition 12.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 2988

plete SuperHyperGraphs with common Extreme SuperHyperVertex SuperHyperSet. Then 2989
bnc
Dominating for N SHF : (V, E); 2991
(ii) Γ = b n2 c for N SHF : (V, E); 2992
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 2993
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Connective Dominating 2994
for N SHF : (V, E). 2995
following statements hold; 2997
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 2998

SuperHyperReverse Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 2999
(ii) if s ≤ t and a SuperHyperSet S of SuperHyperVertices is a dual t-SuperHyperDefensive Su- 3001

perHyperReverse Connective Dominating, then S is a dual s-SuperHyperDefensive SuperHyperReverse 3002
(i) if s ≥ t + 2 and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 3006
SuperHyperReverse Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 3007


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

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

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

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

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

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

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

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

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


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

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


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

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

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


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

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

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


CHAPTER 13 3072
Extreme Applications in Cancer’s 3073
Extreme Recognition 3074
The cancer is the Extreme disease but the Extreme model is going to figure out what’s going on 3075
this Extreme phenomenon. The special Extreme case of this Extreme disease is considered and 3076
as the consequences of the model, some parameters are used. The cells are under attack of this 3077
disease but the moves of the cancer in the special region are the matter of mind. The Extreme 3078
recognition of the cancer could help to find some Extreme treatments for this Extreme disease. 3079
In the following, some Extreme steps are Extreme devised on this disease. 3080
Step 1. (Extreme Definition) The Extreme recognition of the cancer in the long-term Extreme 3081
function. 3082
Step 2. (Extreme Issue) The specific region has been assigned by the Extreme model [it’s 3083
called Extreme SuperHyperGraph] and the long Extreme cycle of the move from the cancer 3084
effects of the cancer on that region; this event leads us to choose another model [it’s said 3087
to be Extreme SuperHyperGraph] to have convenient perception on what’s happened and 3088
what’s done. 3089
Step 3. (Extreme Model) There are some specific Extreme models, which are well-known and 3090
they’ve got the names, and some general Extreme models. The moves and the Extreme 3091
traces of the cancer on the complex tracks and between complicated groups of cells could 3092
be fantasized by an Extreme SuperHyperPath(-/SuperHyperReverse Connective Dominating, 3093
SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The 3094
aim is to find either the Extreme SuperHyperReverse Connective Dominating or the Extreme 3095
SuperHyperReverse Connective Dominating in those Extreme Extreme SuperHyperModels. 3096
141
CHAPTER 14 3097
Case 1: The Initial Extreme Steps 3098
Toward Extreme SuperHyperBipartite 3099
as Extreme SuperHyperModel 3100
Step 4. (Extreme Solution) In the Extreme Figure (34.1), the Extreme SuperHyperBipartite 3101
is Extreme highlighted and Extreme featured. 3102
By using the Extreme Figure (34.1) and the Table (34.1), the Extreme SuperHyperBi- 3103
partite is obtained. 3104
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous Extreme 3105
Figure 14.1: an Extreme SuperHyperBipartite Associated to the Notions of Extreme

SuperHyperReverse Connective Dominating 136NSHGaa21aa
143
Belong to The Extreme SuperHyperBipartite

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

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

CHAPTER 15 3109
Case 2: The Increasing Extreme Steps 3110
Toward Extreme 3111
SuperHyperMultipartite as Extreme 3112
SuperHyperModel 3113
Step 4. (Extreme Solution) In the Extreme Figure (35.1), the Extreme SuperHyperMultipart- 3114
ite is Extreme highlighted and Extreme featured. 3115
By using the Extreme Figure (35.1) and the Table (35.1), the Extreme SuperHyperMulti- 3116
partite is obtained. 3117
The obtained Extreme SuperHyperSet, by the Extreme Algorithm in previous result, 3118
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 3119

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

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

CHAPTER 18 3170
Extreme SuperHyperDuality But As The 3171
Extensions Excerpt From Dense And 3172
Super Forms 3173
Definition 18.0.1. (Different Extreme Types of Extreme SuperHyperDuality). 3174

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

Va ∈ Ei , Ej ; 3178
(ii) Extreme re-SuperHyperDuality if ∀Ei ∈ E 0 , ∃Ej ∈ EESHG:(V,E) \ E 0 such that 3179
Va ∈ Ei , Ej and |Ei |Extreme CARDINALITY = |Ej |Extreme CARDINALITY ; 3180
(iii) Extreme v-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3181
Vi , Vj ∈ Ea ; 3182
(iv) Extreme rv-SuperHyperDuality if ∀Vi ∈ V 0 , ∃Vj ∈ VESHG:(V,E) \ V 0 such that 3183
Vi , Vj ∈ Ea and |Vi |Extreme CARDINALITY = |Vj |Extreme CARDINALITY ; 3184
(v) Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, 3185
Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv- 3186

SuperHyperDuality. 3187
Definition 18.0.2. ((Extreme) SuperHyperDuality). 3188

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

SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3193
is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Extreme 3194
cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence of 3195
Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 3196
Extreme SuperHyperDuality; 3197
151
(ii) a Extreme SuperHyperDuality if it’s either of Extreme e-SuperHyperDuality, Extreme 3198

re-SuperHyperDuality, Extreme v-SuperHyperDuality, and Extreme rv-SuperHyperDuality 3199
and C(N SHG) for a Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3200
Extreme cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet 3201
S of high Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme 3202
SuperHyperVertices such that they form the Extreme SuperHyperDuality; 3203
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3204

e-SuperHyperDuality, Extreme re-SuperHyperDuality, Extreme v-SuperHyperDuality, 3205
and Extreme rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph 3206
N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients 3207
defined as the Extreme number of the maximum Extreme cardinality of the Extreme 3208
SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive 3209
Extreme SuperHyperDuality; and the Extreme power is corresponded to its Extreme 3211
coefficient; 3212
(iv) a Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Extreme 3213

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3249
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3250
form the Extreme SuperHyperDuality; and the Extreme power is corresponded to its 3251
Extreme coefficient. 3252
136EXM1 Example 18.0.3. Assume an Extreme SuperHyperGraph (NSHG) S is a pair S = (V, E) in the 3253
mentioned Extreme Figures in every Extreme items. 3254
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperDu- 3255
ality, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3256
empty Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is 3257
an Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3258
only one Extreme SuperHyperEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is 3259
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- 3263
Duality, is up. The Extreme Algorithm is Extremely straightforward. E1 , E2 and E3 3264
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3265
Thus in the terms of Extreme SuperHyperNeighbor, there’s only one Extreme SuperHy- 3266
perEdge, namely, E4 . The Extreme SuperHyperVertex, V3 is Extreme isolated means that 3267
there’s no Extreme SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme 3268
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperDuality. 3269


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

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 3313
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 3316
ViEXT ERN AL in the literatures of SuperHyperDuality. The latter is straightforward. 3317
(31.1), is the SuperHyperDuality. 3320
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 3322
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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



ESHS : (V, E), in the Extreme SuperHyperModel (31.3), is the Extreme SuperHyperDuality. 3339
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 3341
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. 3345
Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and the 3346
SuperHyperNotions based on SuperHyperDuality could be applied. There are only two 3347
SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 3348
representative in the 3349
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 : 3350

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

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

is a longest SuperHyperDuality taken from a connected Extreme SuperHyperMultipartite 3362

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

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

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

∃!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 3387
SuperHyperDuality proposes some longest SuperHyperDuality excerpt from some representatives. 3388
Extreme SuperHyperDuality. 3394

CHAPTER 19 3395
Extreme SuperHyperJoin But As The 3396
Super Forms 3398
Definition 19.0.1. (Different Extreme Types of Extreme SuperHyperJoin). 3399

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

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

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

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

Vi , Vj ∈ Ea ; ∀Vi , Vj ∈ V 0 , such that Vi , Vj 6∈ Ea ; and |Vi |Extreme CARDINALITY = 3410
|Vj |Extreme CARDINALITY ; 3411
(v) Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme re- 3412
SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin. 3413
Definition 19.0.2. ((Extreme) SuperHyperJoin). 3414

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

re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme rv-SuperHyperJoin and 3418
C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme 3419
cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme 3420
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3421
Extreme SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3422
165
(ii) a Extreme SuperHyperJoin if it’s either of Extreme e-SuperHyperJoin, Extreme 3423

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

SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3430
rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3431
is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as the 3432
Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperEdges 3433
of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3434
SuperHyperEdges and Extreme SuperHyperVertices such that they form the Extreme 3435
SuperHyperJoin; and the Extreme power is corresponded to its Extreme coefficient; 3436
(iv) a Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme e- 3437

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


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

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 3453
Extreme cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet 3454
SuperHyperVertices such that they form the Extreme SuperHyperJoin; 3456
(vii) an Extreme R-SuperHyperJoin SuperHyperPolynomial if it’s either of Extreme 3457
e-SuperHyperJoin, Extreme re-SuperHyperJoin, Extreme v-SuperHyperJoin, and Extreme 3458

Extreme number of the maximum Extreme cardinality of the Extreme SuperHyperVertices 3461

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

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

SuperHyperJoin. 3482
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 3484
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3485
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3486
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3487
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3488
V3 , is excluded in every given Extreme SuperHyperJoin. 3489

is up. The Extreme Algorithm is Extremely straightforward. 3491


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

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

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


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

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



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

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

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


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

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

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

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

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

CHAPTER 20 3612
Extreme SuperHyperPerfect But As The 3613
Super Forms 3615
Definition 20.0.1. (Different Extreme Types of Extreme SuperHyperPerfect). 3616

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

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

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

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

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

re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv-SuperHyperPerfect. 3628
Definition 20.0.2. ((Extreme) SuperHyperPerfect). 3629

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

Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, and Extreme rv- 3633
SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 3634
Extreme SuperHyperPerfect; 3638
179
(ii) a Extreme SuperHyperPerfect if it’s either of Extreme e-SuperHyperPerfect, Extreme 3639

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

e-SuperHyperPerfect, Extreme re-SuperHyperPerfect, Extreme v-SuperHyperPerfect, 3646
and Extreme rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph 3647
Extreme SuperHyperPerfect; and the Extreme power is corresponded to its Extreme 3652
coefficient; 3653
(iv) a Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Extreme 3654

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

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

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

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

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


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

SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality 3690
consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 3691
form the Extreme SuperHyperPerfect; and the Extreme power is corresponded to its 3692
Extreme coefficient. 3693
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperPer- 3696
fect, is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some 3697
SuperHyperPerfect. 3703
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 3705
are some empty Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. 3706
SuperHyperVertex, V3 , is excluded in every given Extreme SuperHyperPerfect. 3710


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

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

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

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

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



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

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

Then 3801

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



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

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

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


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

CHAPTER 21 3836
Extreme SuperHyperTotal But As The 3837
Super Forms 3839
Definition 21.0.1. (Different Extreme Types of Extreme SuperHyperTotal). 3840
(i) Extreme e-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ Ei , Ej ; 3843
(ii) Extreme re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that Va ∈ 3844

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

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal. 3850
Definition 21.0.2. ((Extreme) SuperHyperTotal). 3851

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

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3855
SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges and 3858
Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3859
(ii) a Extreme SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3860

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

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

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

SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Ex- 3875
(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined 3877
as the Extreme number of the maximum Extreme cardinality of the Extreme SuperHy- 3878
perEdges of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3879
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient; 3881
(v) an Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3882

re-SuperHyperTotal, Extreme v-SuperHyperTotal, and Extreme rv-SuperHyperTotal and 3883
SuperHyperVertices in the consecutive Extreme sequence of Extreme SuperHyperEdges 3886
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperTotal; 3887
(vi) a Extreme R-SuperHyperTotal if it’s either of Extreme e-SuperHyperTotal, Extreme 3888

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

treme e-SuperHyperTotal, Extreme re-SuperHyperTotal, Extreme v-SuperHyperTotal, 3895
and Extreme rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 3896
SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme cardinality consec- 3899
utive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 3900
the Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 3901
coefficient; 3902
(viii) a Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Extreme e- 3903

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

(V, E) is the Extreme SuperHyperPolynomial contains the Extreme coefficients defined as 3906
the Extreme number of the maximum Extreme cardinality of the Extreme SuperHyper- 3907
Vertices of an Extreme SuperHyperSet S of high Extreme cardinality consecutive Extreme 3908
SuperHyperTotal; and the Extreme power is corresponded to its Extreme coefficient. 3910
• On the Figure (30.1), the Extreme SuperHyperNotion, namely, Extreme SuperHyperTotal, 3913
is up. The Extreme Algorithm is Extremely straightforward. E1 and E3 are some empty 3914
Extreme SuperHyperEdges but E2 is a loop Extreme SuperHyperEdge and E4 is an 3915
Extreme SuperHyperEdge. Thus in the terms of Extreme SuperHyperNeighbor, there’s 3916
SuperHyperTotal. 3920
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 3922
Extreme SuperHyperEdges but E4 is an Extreme SuperHyperEdge. Thus in the terms of 3923
Extreme SuperHyperNeighbor, there’s only one Extreme SuperHyperEdge, namely, E4 . 3924
The Extreme SuperHyperVertex, V3 is Extreme isolated means that there’s no Extreme 3925
SuperHyperEdge has it as an Extreme endpoint. Thus the Extreme SuperHyperVertex, 3926
V3 , is excluded in every given Extreme SuperHyperTotal. 3927



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

ViEXT ERN AL in the literatures of SuperHyperTotal. The latter is straightforward. 3975
(31.1), is the SuperHyperTotal. 3978
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 3980
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. 3987
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 3989
P : ViEXT ERN AL , Ei , CEN T ER, Ej .

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

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

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

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

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



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

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



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

CHAPTER 22 4051
Extreme SuperHyperConnected But As 4052
Super Forms 4054
Definition 22.0.1. (Different Extreme Types of Extreme SuperHyperConnected). 4055

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

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

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

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

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

Extreme re-SuperHyperConnected, Extreme v-SuperHyperConnected, and Extreme rv- 4069
SuperHyperConnected. 4070
Definition 22.0.2. ((Extreme) SuperHyperConnected). 4071
(i) an Extreme SuperHyperConnected if it’s either of Extreme e-SuperHyperConnected, 4074

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

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

Extreme e-SuperHyperConnected, Extreme re-SuperHyperConnected, Extreme v- 4088
SuperHyperConnected, and Extreme rv-SuperHyperConnected and C(N SHG) for an 4089
Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial con- 4090
tains the Extreme coefficients defined as the Extreme number of the maximum Extreme 4091
cardinality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high 4092
Extreme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVer- 4093
tices such that they form the Extreme SuperHyperConnected; and the Extreme power is 4094
corresponded to its Extreme coefficient; 4095
(iv) a Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of 4096


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

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

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

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

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

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

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

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

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


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

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

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 4196
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. 4200
(31.1), is the SuperHyperConnected. 4203
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 4205
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. 4212
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 4214



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

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

is a longest SuperHyperConnected taken from a connected Extreme SuperHyperBipartite 4233

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


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

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

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


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 4268
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 4269
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 4270
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 4271
some representatives. The latter is straightforward. 4272
Extreme SuperHyperConnected. 4277

CHAPTER 23 4278
Background 4279
221











HG274; HG275; HG276; HG277], there are some endeavors to formalize the basic Super- 4430
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 4431
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 4432

HG171b; HG172b; HG173b; HG174b; HG175b; HG176b; HG177b; HG178b]. Two 4445
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 4446
ively, on neutrosophic science is on [HG32b; HG44b]. 4447

See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the 4461
notions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Supe- 4462
rHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; 4463





Bibliography 4500
10.33140/JMTCM.01.03.09) 4523
227



10.20944/preprints202301.0282.v1). 4539

10.20944/preprints202301.0267.v1). 4542

(doi: 10.20944/preprints202301.0265.v1). 4547
prints202301.0262.v1). 4551
2023010224, (doi: 10.20944/preprints202301.0224.v1). 4557

prints202301.0105.v1). 4560

Preprints 2023, 2023010044 4566
10.20944/preprints202301.0043.v1). 4569

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

(doi: 10.20944/preprints202212.0500.v1). 4585
10.5281/zenodo.8052893). 4594

2023, (doi: 10.5281/zenodo.8052925). 4597
10.5281/zenodo.8051346). 4600
10.5281/zenodo.8051360). 4603
10.5281/zenodo.8025707). 4606

10.5281/zenodo.8027275). 4609
odo.8017246). 4612
10.5281/zenodo.8020128). 4615
odo.7978571). 4618
10.5281/zenodo.7978857). 4621
10.5281/zenodo.7940830). 4624
10.5281/zenodo.7943578). 4627
odo.7916595). 4630
odo.7923632). 4633
(doi: 10.5281/zenodo.7904698). 4636
2023, (doi: 10.5281/zenodo.7904671). 4639

10.5281/zenodo.7871026). 4648
2023, (doi: 10.5281/zenodo.7874647). 4651
10.5281/zenodo.7857856). 4654
2023, (doi: 10.5281/zenodo.7857841). 4657
10.5281/zenodo.7853867). 4666
10.5281/zenodo.7853922). 4669
(doi: 10.5281/zenodo.7851519). 4672
(doi: 10.5281/zenodo.7851550). 4675
10.5281/zenodo.7834229). 4684

10.5281/zenodo.7834261). 4687
10.5281/zenodo.7824560). 4690
(doi: 10.5281/zenodo.7824623). 4693
2023, (doi: 10.5281/zenodo.7809365). 4704
2023, (doi: 10.5281/zenodo.7809358). 4707
10.5281/zenodo.7809219). 4710
10.5281/zenodo.7809328). 4713
2023, (doi: 10.5281/zenodo.7806767). 4716
2023, (doi: 10.5281/zenodo.7806838). 4719

10.5281/zenodo.7799902). 4728
(doi: 10.5281/zenodo.7804218). 4731
(doi: 10.5281/zenodo.7796334). 4734
10.5281/zenodo.7791952). 4740
10.5281/zenodo.7791982). 4743
10.5281/zenodo.7790026). 4746
10.5281/zenodo.7790052). 4749
2023, (doi: 10.5281/zenodo.7787066). 4752
10.5281/zenodo.7781476). 4758
10.5281/zenodo.7783082). 4761

10.5281/zenodo.7777857). 4764
10.5281/zenodo.7779286). 4767
(doi: 10.5281/zenodo.7771831). 4770
2023, (doi: 10.5281/zenodo.7772468). 4773
10.13140/RG.2.2.20913.25446). 4776
odo.7764916). 4779
10.13140/RG.2.2.11770.98247). 4782
10.13140/RG.2.2.12400.12808). 4785
2023, (doi: 10.13140/RG.2.2.22545.10089). 4788
10.13140/RG.2.2.11377.76644). 4794
10.13140/RG.2.2.23750.96329). 4797
10.13140/RG.2.2.31366.24641). 4800

10.13140/RG.2.2.34721.68960). 4803
2023, (doi: 10.13140/RG.2.2.30212.81289). 4806
10.13140/RG.2.2.24288.35842). 4812
10.13140/RG.2.2.32467.25124). 4815
10.13140/RG.2.2.31025.45925). 4818
10.13140/RG.2.2.17184.25602). 4821
10.13140/RG.2.2.23423.28327). 4824
10.13140/RG.2.2.28456.44805). 4827
10.13140/RG.2.2.23525.68320). 4830
10.13140/RG.2.2.20170.24000). 4833
10.13140/RG.2.2.36475.59683). 4836
10.13140/RG.2.2.29764.71046). 4839

2023, (doi: 10.13140/RG.2.2.18780.87683). 4842
10.13140/RG.2.2.26134.01603). 4848
10.13140/RG.2.2.27392.30721). 4851
10.13140/RG.2.2.33028.40321). 4854
10.13140/RG.2.2.21389.20966). 4857
10.13140/RG.2.2.16356.04489). 4860
10.13140/RG.2.2.21756.21129). 4863
10.13140/RG.2.2.30983.68009). 4866
10.13140/RG.2.2.28552.29445). 4869
(doi: 10.13140/RG.2.2.10936.21761). 4872
10.13140/RG.2.2.35105.89447). 4875
(doi: 10.13140/RG.2.2.30072.72960). 4878

10.13140/RG.2.2.31147.52003). 4881
10.13140/RG.2.2.32825.24163). 4884
10.13140/RG.2.2.13059.58401). 4887
10.13140/RG.2.2.11172.14720). 4890
2023, (doi: 10.13140/RG.2.2.22011.80165). 4893
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 4896
2023, (doi: 10.13140/RG.2.2.10493.84962). 4899
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 4902
2023, (doi: 10.13140/RG.2.2.19944.14086). 4905
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 4908
(doi: 10.13140/RG.2.2.33103.76968). 4911
(doi: 10.13140/RG.2.2.23037.44003). 4914
(doi: 10.13140/RG.2.2.35646.56641). 4917

10.13140/RG.2.2.18030.48967). 4920
(doi: 10.13140/RG.2.2.13973.81121). 4923
2023, (doi: 10.13140/RG.2.2.34106.47047). 4926
2023, (doi: 10.13140/RG.2.2.31956.88961). 4932
2023, (doi: 10.13140/RG.2.2.15179.67361). 4935
10.13140/RG.2.2.21510.45125). 4938
2023, (doi: 10.13140/RG.2.2.13121.84321). 4941
10.13140/RG.2.2.11758.69441). 4944
2023, (doi: 10.13140/RG.2.2.31891.35367). 4947
10.13140/RG.2.2.19360.87048). 4950
10.13140/RG.2.2.32363.21286). 4953
10.13140/RG.2.2.23266.81602). 4956

10.13140/RG.2.2.19911.37285). 4959
10.13140/RG.2.2.11050.90569). 4962
2023, (doi: 10.13140/RG.2.2.17761.79206). 4965
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 4971
(doi: 10.13140/RG.2.2.30182.50241). 4974

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 5016
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 5019


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


10.20944/preprints202301.0282.v1). 5040

10.20944/preprints202301.0267.v1).). 5043

(doi: 10.20944/preprints202301.0265.v1). 5048
prints202301.0262.v1). 5052

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

10.13140/RG.2.2.35061.65767). 5061
10.13140/RG.2.2.18494.15680). 5065
10.13140/RG.2.2.32530.73922). 5069
10.13140/RG.2.2.15897.70243). 5073

10.13140/RG.2.2.32530.73922). 5077
prints202301.0105.v1). 5080
10.13140/RG.2.2.23172.19849). 5087

10.13140/RG.2.2.17385.36968). 5097
Preprints 2023, 2023010044 5100

10.20944/preprints202301.0043.v1). 5103

2023, (doi: 10.13140/RG.2.2.28945.92007). 5106
10.13140/RG.2.2.35774.77123). 5112


10.13140/RG.2.2.29430.88642). 5118
(doi: 10.20944/preprints202212.0549.v1). 5124
10.13140/RG.2.2.19380.94084). 5127


(doi: 10.20944/preprints202212.0500.v1). 5138
10.13140/RG.2.2.20993.12640). 5141




10.13140/RG.2.2.29173.86244). 5156
2023 (doi: 10.5281/zenodo.8052976). 5161
(doi: 10.5281/zenodo.8051368). 5163
(doi: 10.5281/zenodo.8027488). 5165
10.5281/zenodo.8020181). 5167
10.5281/zenodo.7978921). 5169
odo.7943878). 5171
10.5281/zenodo.7943871). 5173
10.5281/zenodo.7923786). 5175
2023 (doi: 10.5281/zenodo.7905287). 5177

2023 (doi: 10.5281/zenodo.7874677). 5181
(doi: 10.5281/zenodo.7857906). 5183
2023 (doi: 10.5281/zenodo.7856329). 5185

10.5281/zenodo.7854561). 5187
2023 (doi: 10.5281/zenodo.7851893). 5189

(doi: 10.5281/zenodo.7835063). 5193
(doi: 10.5281/zenodo.7826705). 5195
2023 (doi: 10.5281/zenodo.7820680). 5197
10.5281/zenodo.7812750). 5199

2023 (doi: 10.5281/zenodo.7807782). 5205
2023 (doi: 10.5281/zenodo.7804449). 5207
(doi: 10.5281/zenodo.7792307). 5211
(doi: 10.5281/zenodo.7790728). 5213
2023 (doi: 10.5281/zenodo.7787712). 5215
10.5281/zenodo.7783791). 5217
10.5281/zenodo.7780123). 5219
(doi: 10.5281/zenodo.7773119). 5221

odo.7637762). 5223
10.5281/zenodo.7766174). 5225
10.5281/zenodo.7762232). 5227
(doi: 10.5281/zenodo.7758601). 5229
10.5281/zenodo.7754661). 5231
10.5281/zenodo.7750995) . 5233
(doi: 10.5281/zenodo.7749875). 5235
10.5281/zenodo.7747236). 5237
10.5281/zenodo.7742587). 5239
(doi: 10.5281/zenodo.7738635). 5241
10.5281/zenodo.7734719). 5243
10.5281/zenodo.7730484). 5245
(doi: 10.5281/zenodo.7730469). 5247
10.5281/zenodo.7722865). 5249
odo.7713563). 5251
odo.7709116). 5253
10.5281/zenodo.7706415). 5255
10.5281/zenodo.7706063). 5257

10.5281/zenodo.7701906). 5259
odo.7700205). 5261
10.5281/zenodo.7694876). 5263
10.5281/zenodo.7679410). 5265
10.5281/zenodo.7675982). 5267
10.5281/zenodo.7672388). 5269
odo.7668648). 5271
10.5281/zenodo.7662810). 5273
10.5281/zenodo.7659162). 5275
odo.7653233). 5277
odo.7653204). 5279
odo.7653142). 5281
odo.7653117). 5283
odo.7651687). 5286
odo.7651619). 5288
odo.7651439). 5290
odo.7650729). 5292

odo.7647868). 5294
odo.7647017). 5296
odo.7644894). 5298
odo.7632923). 5301
odo.7623459). 5303
10.5281/zenodo.7606416). 5305
10.5281/zenodo.7606416). 5307
odo.7606404). 5309
10.5281/zenodo.7580018). 5311
odo.7580018). 5313
odo.7580018). 5315
odo.7579929). 5317
10.5281/zenodo.7563170). 5319
odo.7563164). 5321
odo.7563160). 5323
odo.7563160). 5325
10.5281/zenodo.7563160). 5327

10.5281/zenodo.7557063). 5329
10.5281/zenodo.7557009). 5331
10.5281/zenodo.7539484). 5333
10.5281/zenodo.7523390). 5335
10.5281/zenodo.7523390). 5337
10.5281/zenodo.7523390). 5339
odo.7574952). 5341
10.5281/zenodo.7574992). 5343
odo.7523357). 5345
10.5281/zenodo.7523357). 5347
10.5281/zenodo.7504782). 5349
10.5281/zenodo.7504782). 5351
10.5281/zenodo.7504782). 5353
10.5281/zenodo.7499395). 5355
odo.7499395). 5357
10.5281/zenodo.7499395). 5359
10.5281/zenodo.7497450). 5361
10.5281/zenodo.7497450). 5363

10.5281/zenodo.7494862). 5365
odo.7494862). 5367
10.5281/zenodo.7494862). 5369
10.5281/zenodo.7493845). 5371
odo.7493845). 5373
10.5281/zenodo.7493845). 5375
odo.7539484). 5377
odo.7523390). 5379
odo.7523357). 5381
odo.7504782). 5383
odo.7499395). 5385
odo.7497450). 5387
odo.7494862). 5389
odo.7493845). 5391
odo.7480110). 5393
odo.7378758). 5395
odo.6320305). 5397
odo.6677173). 5399

CHAPTER 24 5400
Cancer In Neutrosophic 5401
SuperHyperGraph 5402
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 5403
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 5404
disease is considered and as the consequences of the model, some parameters are used. The cells 5405
are under attack of this disease but the moves of the cancer in the special region are the matter 5406
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 5407
treatments for this Neutrosophic disease. 5408
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 5409
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 5410
term Neutrosophic function. 5411
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 5412
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 5413
move from the cancer is identified by this research. Sometimes the move of the cancer 5414
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 5415
about the moves and the effects of the cancer on that region; this event leads us to 5416
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5417
perception on what’s happened and what’s done. 5418
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 5419
known and they’ve got the names, and some general Neutrosophic models. The moves 5420
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 5421
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperK- 5422
Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHy- 5423
perWheel). The aim is to find either the Neutrosophic SuperHyperK-Domination or the 5424
Neutrosophic SuperHyperK-Domination in those Neutrosophic Neutrosophic SuperHyper- 5425
Models. 5426
Some cells have been faced with some attacks from the situation which is caused by the 5427
cancer’s attacks. In this case, there are some embedded analysis on the ongoing situations 5428
which in that, the cells could be labelled as some groups and some groups or individuals have 5429
excessive labels which all are raised from the behaviors to overcome the cancer’s attacks. In 5430
the embedded situations, the individuals of cells and the groups of cells could be considered 5431
251
as “new groups”. Thus it motivates us to find the proper SuperHyperModels for getting more 5432
proper analysis on this messy story. I’ve found the SuperHyperModels which are officially called 5433
“SuperHyperGraphs” and “Neutrosophic SuperHyperGraphs”. In this SuperHyperModel, the 5434
cells and the groups of cells are defined as “SuperHyperVertices” and the relations between the 5435
individuals of cells and the groups of cells are defined as “SuperHyperEdges”. Thus it’s another 5436
motivation for us to do research on this SuperHyperModel based on the “Cancer’s Recognition”. 5437
Sometimes, the situations get worst. The situation is passed from the certainty and precise style. 5438
Thus it’s the beyond them. There are three descriptions, namely, the degrees of determinacy, 5439
indeterminacy and neutrality, for any object based on vague forms, namely, incomplete data, 5440
imprecise data, and uncertain analysis. The latter model could be considered on the previous 5441
SuperHyperModel. It’s SuperHyperModel. It’s SuperHyperGraph but it’s officially called 5442
“Neutrosophic SuperHyperGraphs”. The cancer is the disease but the model is going to figure 5443
out what’s going on this phenomenon. The special case of this disease is considered and as the 5444
consequences of the model, some parameters are used. The cells are under attack of this disease 5445
but the moves of the cancer in the special region are the matter of mind. The recognition of 5446
the cancer could help to find some treatments for this disease. The SuperHyperGraph and 5447
Neutrosophic SuperHyperGraph are the SuperHyperModels on the “Cancer’s Recognition” and 5448
both bases are the background of this research. Sometimes the cancer has been happened on the 5449
region, full of cells, groups of cells and embedded styles. In this segment, the SuperHyperModel 5450
proposes some SuperHyperNotions based on the connectivities of the moves of the cancer 5451
in the forms of alliances’ styles with the formation of the design and the architecture are 5452
formally called “ SuperHyperK-Domination” in the themes of jargons and buzzwords. The 5453
prefix “SuperHyper” refers to the theme of the embedded styles to figure out the background for 5454
the SuperHyperNotions. The recognition of the cancer in the long-term function. The specific 5455
region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the 5456
move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be 5457
easily identified since there are some determinacy, indeterminacy and neutrality about the moves 5458
names, and some general models. The moves and the traces of the cancer on the complex tracks 5462
and between complicated groups of cells could be fantasized by a Neutrosophic SuperHyperPath 5463
(-/SuperHyperK-Domination, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, 5464
SuperHyperWheel). The aim is to find either the optimal SuperHyperK-Domination or the 5465
Neutrosophic SuperHyperK-Domination in those Neutrosophic SuperHyperModels. Some 5466
general results are introduced. Beyond that in SuperHyperStar, all possible Neutrosophic 5467
SuperHyperPath s have only two SuperHyperEdges but it’s not enough since it’s essential to 5468
have at least three SuperHyperEdges to form any style of a SuperHyperK-Domination. There 5469
isn’t any formation of any SuperHyperK-Domination but literarily, it’s the deformation of any 5470
SuperHyperK-Domination. It, literarily, deforms and it doesn’t form. 5471
amount of SuperHyperK-Domination” of either individual of cells or the groups of cells based on 5473
the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperK-Domination” 5474
based on the fixed groups of cells or the fixed groups of group of cells? 5475
Question 24.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5476

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

SuperHyperK-Domination” on “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. 5480
Then the research has taken more motivations to define SuperHyperClasses and to find some 5481
connections amid this SuperHyperNotion with other SuperHyperNotions. It motivates us to get 5482
some instances and examples to make clarifications about the framework of this research. The 5483
general results and some results about some connections are some avenues to make key point of 5484
this research, “Cancer’s Recognition”, more understandable and more clear. 5485
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 5486
research on the modeling of the regions where are under the attacks of the cancer to 5487
recognize this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize 5488
the instances on the SuperHyperNotion, SuperHyperK-Domination, the new SuperHyperClasses 5489
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 5490
SuperHyperK-Domination and the Neutrosophic SuperHyperK-Domination. The clarifications, 5491

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

CHAPTER 25 5502
Neutrosophic Reverse Connective 5503
Dominating 5504
Henry Garrett, “New Ideas On Super Mixed-Devastations By Hyper Decisions Of SuperHyperDu- 5505
ality In Cancer’s Neutrosophic Recognition and Neutrosophic SuperHyperGraph”, ResearchGate 5506
2023, (doi: 10.13140/RG.2.2.34953.52320). 5507
Henry Garrett, “New Ideas In Cancer’s Recognition As (Neutrosophic) SuperHyperGraph By 5508
SuperHyperDuality As Hyper Imaginations On Super Mixed-Illustrations”, ResearchGate 2023, 5509
(doi: 10.13140/RG.2.2.33275.80161). 5510
10.13140/RG.2.2.11050.90569). 5513
Henry Garrett, “New Ideas On Super connections By Hyper disconnections Of SuperHyperJoin 5514
10.13140/RG.2.2.17761.79206). 5516
10.13140/RG.2.2.19911.37285). 5519
Henry Garrett, “New Ideas On Super Isolation By Hyper Perfectness Of SuperHyperPerfect 5520
10.13140/RG.2.2.23266.81602). 5522
10.13140/RG.2.2.19360.87048). 5525
Henry Garrett, “New Ideas On Super Extremism By Hyper Treatments Of SuperHyperTotal 5526
10.13140/RG.2.2.32363.21286). 5528
10.13140/RG.2.2.11758.69441). 5531
Henry Garrett, “New Ideas On Super Outbreak By Hyper Collections Of SuperHyperConnected 5532
10.13140/RG.2.2.31891.35367). 5534
255

10.13140/RG.2.2.21510.45125). 5537
Henry Garrett, “New Ideas On Super Missing By Hyper Searching Of SuperHyperDominating 5538
10.13140/RG.2.2.13121.84321). 5540

CHAPTER 26 5541
New Ideas In Recognition of Cancer And 5542
Neutrosophic SuperHyperGraph By 5543
Reverse Connective Dominating As 5544
Hyper Conceit On Super Con 5545
257
CHAPTER 27 5546
ABSTRACT 5547
In this scientific research, (Different Neutrosophic Types of Neutrosophic SuperHyperReverse 5548

Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a Reverse Connective 5549
0
Dominating pair S = (V, E). Consider a Neutrosophic SuperHyperSet V = {V1 , V2 , . . . , Vs } and 5550
0 0 0
E = {E1 , E2 , . . . , Ez }. Then either V or E is called Neutrosophic e-SuperHyperReverse Connective 5551
Dominating if the following expression is called Neutrosophic e-SuperHyperReverse Connective Dominating 5552
criteria holds 5553

Neutrosophic re-SuperHyperReverse Connective Dominating if the following expression is called 5554
Neutrosophic e-SuperHyperReverse Connective Dominating criteria holds 5555

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

SuperHyperReverse Connective Dominating if the following expression is called Neutrosophic v- 5557
SuperHyperReverse Connective Dominating criteria holds 5558

259
Neutrosophic rv-SuperHyperReverse Connective Dominating if the following expression is called 5559

Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 5560

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; Neutrosophic Super- 5561
HyperReverse Connective Dominating if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, 5562
Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating. ((Neutrosophic) SuperHy- 5564
perReverse Connective Dominating). Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5565
S = (V, E). Consider a Neutrosophic SuperHyperEdge (NSHE) E = {V1 , V2 , . . . , Vs }. Then 5566
E is called an Extreme SuperHyperReverse Connective Dominating if it’s either of Neutrosophic e- 5567

SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dominating, Neut- 5568
rosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv-SuperHyperReverse Connective 5569
Dominating and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum 5570
Extreme cardinality of an Extreme SuperHyperSet S of high Extreme cardinality of the Ex- 5571
treme SuperHyperEdges in the consecutive Extreme sequence of Extreme SuperHyperEdges 5572
and Extreme SuperHyperVertices such that they form the Extreme SuperHyperReverse Connective 5573
Dominating; a Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutrosophic 5574
e-SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dominating, 5575
Neutrosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv-SuperHyperReverse 5576
Connective Dominating and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is 5577
the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutro- 5578
sophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic Super- 5579

HyperEdges and Neutrosophic SuperHyperVertices such that they form the Neutrosophic 5580
SuperHyperReverse Connective Dominating; an Extreme SuperHyperReverse Connective Dominating Super- 5581
HyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutro- 5582
sophic re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Domin- 5583
ating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme 5584
SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial contains the Ex- 5585
treme coefficients defined as the Extreme number of the maximum Extreme cardinality of 5586
the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme cardinal- 5587
ity consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they 5588
form the Extreme SuperHyperReverse Connective Dominating; and the Extreme power is corresponded 5589
to its Extreme coefficient; a Neutrosophic SuperHyperReverse Connective Dominating SuperHyper- 5590
Polynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic 5591

re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse Connective Dominating, and 5592
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutrosophic SuperHy- 5593
perGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains the Neutrosophic 5594
coefficients defined as the Neutrosophic number of the maximum Neutrosophic cardinality of 5595
the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high Neutrosophic 5596
cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices 5597

such that they form the Neutrosophic SuperHyperReverse Connective Dominating; and the Neutrosophic 5598
power is corresponded to its Neutrosophic coefficient; an Extreme V-SuperHyperReverse Connective 5599
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for an Extreme SuperHy- 5602
perGraph N SHG : (V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet 5603
S of high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 5604
sequence of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form 5605
the Extreme SuperHyperReverse Connective Dominating; a Neutrosophic V-SuperHyperReverse Connective 5606
Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutrosophic Supe- 5609
rHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 5610
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consec- 5611
utive Neutrosophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form 5612
the Neutrosophic SuperHyperReverse Connective Dominating; an Extreme V-SuperHyperReverse Connective 5613
Dominating SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dom- 5614
inating, Neutrosophic re-SuperHyperReverse Connective Dominating, Neutrosophic v-SuperHyperReverse 5615
Connective Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) 5616
for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 5617
cardinality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Ex- 5619
treme cardinality consecutive Extreme SuperHyperEdges and Extreme SuperHyperVertices 5620
such that they form the Extreme SuperHyperReverse Connective Dominating; and the Extreme power 5621
is corresponded to its Extreme coefficient; a Neutrosophic SuperHyperReverse Connective Dominat- 5622

ing SuperHyperPolynomial if it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, 5623
Dominating, and Neutrosophic rv-SuperHyperReverse Connective Dominating and C(N SHG) for a Neutro- 5625
sophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 5626
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutrosophic 5627
cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 5628

Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic Super- 5629
HyperVertices such that they form the Neutrosophic SuperHyperReverse Connective Dominating; and 5630
the Neutrosophic power is corresponded to its Neutrosophic coefficient. In this scientific research, 5631
new setting is introduced for new SuperHyperNotions, namely, a SuperHyperReverse Connective 5632
Dominating and Neutrosophic SuperHyperReverse Connective Dominating. Two different types of Super- 5633
HyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, 5634
The literature review is implemented in the whole of this research. For shining the elegancy and 5636
the significancy of this research, the comparison between this SuperHyperNotion with other 5637
SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are 5638
followed by the examples and the instances thus the clarifications are driven with different tools. 5639
The applications are figured out to make sense about the theoretical aspect of this ongoing 5640
research. The “Cancer’s Recognition” are the under research to figure out the challenges make 5641
sense about ongoing and upcoming research. The special case is up. The cells are viewed in the 5642
deemed ways. There are different types of them. Some of them are individuals and some of them 5643

are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” 5644
but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHy- 5645
perGraph” and “Neutrosophic SuperHyperGraph” are chosen and elected to research about 5646
“Cancer’s Recognition”. Thus these complex and dense SuperHyperModels open up some avenues 5647
to research on theoretical segments and “Cancer’s Recognition”. Some avenues are posed to 5648
pursue this research. It’s also officially collected in the form of some questions and some problems. 5649
Assume a SuperHyperGraph. Assume a SuperHyperGraph. Then δ−SuperHyperReverse Connective 5650

Dominating is a maximal of SuperHyperVertices with a maximum cardinality such that either of 5651
the following expressions hold for the (Neutrosophic) cardinalities of SuperHyperNeighbors of 5652
s ∈ S : there are |S ∩ N (s)| > |S ∩ (V \ N (s))| + δ; and |S ∩ N (s)| < |S ∩ (V \ N (s))| + δ. The 5653
first Expression, holds if S is an δ−SuperHyperOffensive. And the second Expression, holds 5654
if S is an δ−SuperHyperDefensive; a Neutrosophic δ−SuperHyperReverse Connective Dominating is 5655
a maximal Neutrosophic of SuperHyperVertices with maximum Neutrosophic cardinality 5656

such that either of the following expressions hold for the Neutrosophic cardinalities of Super- 5657
HyperNeighbors of s ∈ S there are: |S ∩ N (s)|N eutrosophic > |S ∩ (V \ N (s))|N eutrosophic + δ; 5658
and |S ∩ N (s)|N eutrosophic < |S ∩ (V \ N (s))|N eutrosophic + δ. The first Expression, holds 5659
if S is a Neutrosophic δ−SuperHyperOffensive. And the second Expression, holds if S is a 5660
Neutrosophic δ−SuperHyperDefensive It’s useful to define a “Neutrosophic” version of a 5661
SuperHyperReverse Connective Dominating . Since there’s more ways to get type-results to make a 5662
SuperHyperReverse Connective Dominating more understandable. For the sake of having Neutrosophic 5663
SuperHyperReverse Connective Dominating, there’s a need to “redefine” the notion of a “SuperHy- 5664
perReverse Connective Dominating ”. The SuperHyperVertices and the SuperHyperEdges are assigned 5665
by the labels from the letters of the alphabets. In this procedure, there’s the usage of the 5666
position of labels to assign to the values. Assume a SuperHyperReverse Connective Dominating . It’s 5667
redefined a Neutrosophic SuperHyperReverse Connective Dominating if the mentioned Table holds, 5668
concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges 5669
Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The 5670
Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The 5671
maximum Values of Its Vertices”, “The Values of The Edges&The maximum Values of Its 5672
Vertices”, “The Values of The HyperEdges&The maximum Values of Its Vertices”, “The Values 5673
of The SuperHyperEdges&The maximum Values of Its Endpoints”. To get structural examples 5674
and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based 5675
on a SuperHyperReverse Connective Dominating . It’s the main. It’ll be disciplinary to have the 5676
foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all 5677
SuperHyperReverse Connective Dominating until the SuperHyperReverse Connective Dominating, then it’s offi- 5678
cially called a “SuperHyperReverse Connective Dominating” but otherwise, it isn’t a SuperHyperReverse 5679
Connective Dominating . There are some instances about the clarifications for the main definition 5680
titled a “SuperHyperReverse Connective Dominating ”. These two examples get more scrutiny and 5681
discernment since there are characterized in the disciplinary ways of the SuperHyperClass 5682
based on a SuperHyperReverse Connective Dominating . For the sake of having a Neutrosophic Su- 5683
perHyperReverse Connective Dominating, there’s a need to “redefine” the notion of a “Neutrosophic 5684
SuperHyperReverse Connective Dominating” and a “Neutrosophic SuperHyperReverse Connective Dominating 5685

”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters 5686
of the alphabets. In this procedure, there’s the usage of the position of labels to assign to 5687
the values. Assume a Neutrosophic SuperHyperGraph. It’s redefined “Neutrosophic Supe- 5688
rHyperGraph” if the intended Table holds. And a SuperHyperReverse Connective Dominating are 5689

redefined to a “Neutrosophic SuperHyperReverse Connective Dominating” if the intended Table holds. 5690
It’s useful to define “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 5691
to get Neutrosophic type-results to make a Neutrosophic SuperHyperReverse Connective Dominating 5692
more understandable. Assume a Neutrosophic SuperHyperGraph. There are some Neutrosophic 5693
SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperReverse 5694
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and Supe- 5695
rHyperWheel, are “Neutrosophic SuperHyperPath”, “Neutrosophic SuperHyperReverse Connective 5696

Dominating”, “Neutrosophic SuperHyperStar”, “Neutrosophic SuperHyperBipartite”, “Neutro- 5697
sophic SuperHyperMultiPartite”, and “Neutrosophic SuperHyperWheel” if the intended Table 5698
holds. A SuperHyperGraph has a “Neutrosophic SuperHyperReverse Connective Dominating” where 5699
it’s the strongest [the maximum Neutrosophic value from all the SuperHyperReverse Connective 5700
Dominating amid the maximum value amid all SuperHyperVertices from a SuperHyperReverse 5701
Connective Dominating .] SuperHyperReverse Connective Dominating . A graph is a SuperHyperUniform 5702

if it’s a SuperHyperGraph and the number of elements of SuperHyperEdges are the same. 5703
with two exceptions; it’s SuperHyperReverse Connective Dominating if it’s only one SuperVertex as 5706
intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex 5707
as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVer- 5708
tex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two 5709
separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only 5710
forming multi separate sets, has no SuperHyperEdge in common; it’s a SuperHyperWheel if it’s 5712
be based on the “Cancer’s Recognition” and the results and the definitions will be introduced 5722
in redeemed ways. The recognition of the cancer in the long-term function. The specific region 5723
has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move 5724
from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily 5725
identified since there are some determinacy, indeterminacy and neutrality about the moves 5726
names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the 5730
cancer on the complex tracks and between complicated groups of cells could be fantasized 5731
by a Neutrosophic SuperHyperPath(-/SuperHyperReverse Connective Dominating, SuperHyperStar, 5732
the longest SuperHyperReverse Connective Dominating or the strongest SuperHyperReverse Connective 5734
Dominating in those Neutrosophic SuperHyperModels. For the longest SuperHyperReverse Connective 5735

Dominating , called SuperHyperReverse Connective Dominating, and the strongest SuperHyperReverse Con- 5736
nective Dominating, called Neutrosophic SuperHyperReverse Connective Dominating, some general results 5737
are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two 5738
Connective Dominating. It, literarily, deforms and it doesn’t form. A basic familiarity with Neut- 5742
rosophic SuperHyperReverse Connective Dominating theory, SuperHyperGraphs, and Neutrosophic 5743
SuperHyperGraphs theory are proposed. 5744
Keywords: Neutrosophic SuperHyperGraph, SuperHyperReverse Connective Dominating, Cancer’s 5745


CHAPTER 28 5748
Applied Notions Under The Scrutiny Of 5749
The Motivation Of This Scientific 5750
Research 5751
In this scientific research, there are some ideas in the featured frameworks of motivations. I 5752
try to bring the motivations in the narrative ways. Some cells have been faced with some 5753
attacks from the situation which is caused by the cancer’s attacks. In this case, there are 5754
some embedded analysis on the ongoing situations which in that, the cells could be labelled 5755
as some groups and some groups or individuals have excessive labels which all are raised from 5756
the behaviors to overcome the cancer’s attacks. In the embedded situations, the individuals 5757
of cells and the groups of cells could be considered as “new groups”. Thus it motivates us to 5758
find the proper SuperHyperModels for getting more proper analysis on this messy story. I’ve 5759
found the SuperHyperModels which are officially called “SuperHyperGraphs” and “Neutrosophic 5760
SuperHyperGraphs”. In this SuperHyperModel, the cells and the groups of cells are defined as 5761
“SuperHyperVertices” and the relations between the individuals of cells and the groups of cells 5762
are defined as “SuperHyperEdges”. Thus it’s another motivation for us to do research on this 5763
SuperHyperModel based on the “Cancer’s Recognition”. Sometimes, the situations get worst. 5764
The situation is passed from the certainty and precise style. Thus it’s the beyond them. There 5765
are three descriptions, namely, the degrees of determinacy, indeterminacy and neutrality, for any 5766
object based on vague forms, namely, incomplete data, imprecise data, and uncertain analysis. 5767
The latter model could be considered on the previous SuperHyperModel. It’s SuperHyperModel. 5768
It’s SuperHyperGraph but it’s officially called “Neutrosophic SuperHyperGraphs”. The cancer 5769
is the disease but the model is going to figure out what’s going on this phenomenon. The special 5770
case of this disease is considered and as the consequences of the model, some parameters are used. 5771
The cells are under attack of this disease but the moves of the cancer in the special region are the 5772
matter of mind. The recognition of the cancer could help to find some treatments for this disease. 5773
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 5774
“Cancer’s Recognition” and both bases are the background of this research. Sometimes the 5775
segment, the SuperHyperModel proposes some SuperHyperNotions based on the connectivities of 5777
the moves of the cancer in the forms of alliances’ styles with the formation of the design and the 5778
architecture are formally called “ SuperHyperReverse Connective Dominating” in the themes of jargons 5779
and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to figure 5780
265
out the background for the SuperHyperNotions. The recognition of the cancer in the long-term 5781
and neutrality about the moves and the effects of the cancer on that region; this event leads us 5785
to choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 5786
perception on what’s happened and what’s done. There are some specific models, which are 5787
well-known and they’ve got the names, and some general models. The moves and the traces of 5788
the cancer on the complex tracks and between complicated groups of cells could be fantasized 5789
by a Neutrosophic SuperHyperPath (-/SuperHyperReverse Connective Dominating, SuperHyperStar, 5790
the optimal SuperHyperReverse Connective Dominating or the Neutrosophic SuperHyperReverse Connective 5792
Dominating in those Neutrosophic SuperHyperModels. Some general results are introduced. 5793
Beyond that in SuperHyperStar, all possible Neutrosophic SuperHyperPath s have only two 5794
Connective Dominating. It, literarily, deforms and it doesn’t form. 5798
amount of SuperHyperReverse Connective Dominating” of either individual of cells or the groups of cells 5800
based on the fixed cell or the fixed group of cells, extensively, the “amount of SuperHyperReverse 5801
Connective Dominating” based on the fixed groups of cells or the fixed groups of group of cells? 5802
Question 28.0.2. What are the best descriptions for the “Cancer’s Recognition” in terms of 5803
these messy and dense SuperHyperModels where embedded notions are illustrated? 5804
Thus it motivates us to define different types of “ SuperHyperReverse Connective Dominating” and 5806
“Neutrosophic SuperHyperReverse Connective Dominating” on “SuperHyperGraph” and “Neutrosophic 5807

SuperHyperGraph”. Then the research has taken more motivations to define SuperHyperClasses 5808
and to find some connections amid this SuperHyperNotion with other SuperHyperNotions. It 5809
motivates us to get some instances and examples to make clarifications about the framework of 5810
this research. The general results and some results about some connections are some avenues to 5811
make key point of this research, “Cancer’s Recognition”, more understandable and more clear. 5812
The framework of this research is as follows. In the beginning, I introduce basic definitions 5813
to clarify about preliminaries. In the subsection “Preliminaries”, initial definitions about 5814
SuperHyperGraphs and Neutrosophic SuperHyperGraph are deeply-introduced and in-depth- 5815
discussed. The elementary concepts are clarified and illustrated completely and sometimes 5816
review literature are applied to make sense about what’s going to figure out about the 5817
upcoming sections. The main definitions and their clarifications alongside some results 5818
about new notions, SuperHyperReverse Connective Dominating and Neutrosophic SuperHyperReverse 5819
Connective Dominating, are figured out in sections “ SuperHyperReverse Connective Dominating” and 5820
“Neutrosophic SuperHyperReverse Connective Dominating”. In the sense of tackling on getting 5821
results and in Reverse Connective Dominating to make sense about continuing the research, the 5822
ideas of SuperHyperUniform and Neutrosophic SuperHyperUniform are introduced and 5823
as their consequences, corresponded SuperHyperClasses are figured out to debut what’s 5824
done in this section, titled “Results on SuperHyperClasses” and “Results on Neutrosophic 5825

SuperHyperClasses”. As going back to origin of the notions, there are some smart steps toward 5826
the common notions to extend the new notions in new frameworks, SuperHyperGraph and 5827
Neutrosophic SuperHyperGraph, in the sections “Results on SuperHyperClasses” and “Results on 5828
Neutrosophic SuperHyperClasses”. The starter research about the general SuperHyperRelations 5829
and as concluding and closing section of theoretical research are contained in the section “General 5830
Results”. Some general SuperHyperRelations are fundamental and they are well-known as 5831
fundamental SuperHyperNotions as elicited and discussed in the sections, “General Results”, 5832
“ SuperHyperReverse Connective Dominating”, “Neutrosophic SuperHyperReverse Connective Dominating”, 5833
“Results on SuperHyperClasses” and “Results on Neutrosophic SuperHyperClasses”. There 5834
are curious questions about what’s done about the SuperHyperNotions to make sense about 5835
excellency of this research and going to figure out the word “best” as the description and adjective 5836
for this research as presented in section, “ SuperHyperReverse Connective Dominating”. The keyword 5837
of this research debut in the section “Applications in Cancer’s Recognition” with two cases and 5838
subsections “Case 1: The Initial Steps Toward SuperHyperBipartite as SuperHyperModel” and 5839
“Case 2: The Increasing Steps Toward SuperHyperMultipartite as SuperHyperModel”. In the 5840
section, “Open Problems”, there are some scrutiny and discernment on what’s done and what’s 5841
happened in this research in the terms of “questions” and “problems” to make sense to figure 5842
out this research in featured style. The advantages and the limitations of this research alongside 5843
about what’s done in this research to make sense and to get sense about what’s figured out are 5844
included in the section, “Conclusion and Closing Remarks”. 5845

CHAPTER 29 5846
Neutrosophic Preliminaries Of This 5847
Scientific Research On the Redeemed 5848
Ways 5849
In this section, the basic material in this scientific research, is referred to [Single Valued Neut- 5850
rosophic Set](Ref.[HG11s],Definition 2.2,p.2), [Neutrosophic Set](Ref.[HG11s],Definition 5851

2.1,p.1), [Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.5,p.2), [Charac- 5852
terization of the Neutrosophic SuperHyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), 5853
[t-norm](Ref.[HG11s], Definition 2.7, p.3), and [Characterization of the Neutrosophic Super- 5854
HyperGraph (NSHG)](Ref.[HG11s],Definition 2.7,p.3), [Neutrosophic Strength of the Neutro- 5855
sophic SuperHyperPaths] (Ref.[HG11s],Definition 5.3,p.7), and [Different Neutrosophic Types 5856
of Neutrosophic SuperHyperEdges (NSHE)] (Ref.[HG11s],Definition 5.4,p.7). Also, the new 5857

ideas and their clarifications are addressed to Ref.[HG38]. 5858
In this subsection, the basic material which is used in this scientific research, is presented. Also, 5859
the new ideas and their clarifications are elicited. 5860
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 [. 5861
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}.
269

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 5862
2.5,p.2). 5863
Assume V 0 is a given set. a Neutrosophic SuperHyperGraph (NSHG) S is a pair 5864
S = (V, E), where 5865
1, 2, . . . , n0 ); 5870
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5871
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5872

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



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

A binary operation ⊗ : [0, 1] × [0, 1] → [0, 1] is a t-norm if it satisfies the following for 5902
x, y, z, w ∈ [0, 1]: 5903
(i) 1 ⊗ x = x; 5904
(ii) x ⊗ y = y ⊗ x; 5905
(iii) x ⊗ (y ⊗ z) = (x ⊗ y) ⊗ z; 5906
(iv) If w ≤ x and y ≤ z then w ⊗ y ≤ x ⊗ z. 5907

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

where 5910

1, 2, . . . , n0 ); 5915
(v) Vi 6= ∅, (i = 1, 2, . . . , n); 5916
(vi) Ei0 6= ∅, (i0 = 1, 2, . . . , n0 ); 5917
P
(vii) i supp(Vi ) = V, (i = 1, 2, . . . , n); 5918
0 0
P
(viii) i0 supp(Ei ) = V, (i = 1, 2, . . . , n ). 5919
0

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

Definition 29.0.12. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number 5946
of elements of SuperHyperEdges are the same. 5947
To get more visions on SuperHyperUniform, the some SuperHyperClasses are introduced. It 5948
makes to have SuperHyperUniform more understandable. 5949
Definition 29.0.13. Assume a Neutrosophic SuperHyperGraph. There are some SuperHyper- 5950
Classes as follows. 5951
(i). It’s Neutrosophic SuperHyperPath if it’s only one SuperVertex as intersection amid 5952
two given SuperHyperEdges with two exceptions; 5953
(ii). it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given 5954
SuperHyperEdges; 5955
(iii). it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; 5956
(iv). it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given Supe- 5957
rHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge 5958
in common; 5959
(v). it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two 5960
given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no 5961
SuperHyperEdge in common; 5962
(vi). it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given 5963
SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common 5964
SuperVertex. 5965
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 5966
(NSHV) V1 to Neutrosophic SuperHyperVertex (NSHV) Vs if either of following conditions hold: 5967
(i) Vi , Vi+1 ∈ Ei0 ; 5968
(ii) there’s a vertex vi ∈ Vi such that vi , Vi+1 ∈ Ei0 ; 5969
(iii) there’s a SuperVertex Vi0 ∈ Vi such that Vi0 , Vi+1 ∈ Ei0 ; 5970
(iv) there’s a vertex vi+1 ∈ Vi+1 such that Vi , vi+1 ∈ Ei0 ; 5971
0 0
(v) there’s a SuperVertex Vi+1 ∈ Vi+1 such that Vi , Vi+1 ∈ E i0 ; 5972
(vi) there are a vertex vi ∈ Vi and a vertex vi+1 ∈ Vi+1 such that vi , vi+1 ∈ Ei0 ; 5973
0 0
(vii) there are a vertex vi ∈ Vi and a SuperVertex Vi+1 ∈ Vi+1 such that vi , Vi+1 ∈ Ei0 ; 5974
(viii) there are a SuperVertex Vi0 ∈ Vi and a vertex vi+1 ∈ Vi+1 such that Vi0 , vi+1 ∈ Ei0 ; 5975
(ix) there are a SuperVertex Vi0 ∈ Vi and a SuperVertex Vi+1

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

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. 5977
(i) If for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | = 2, then NSHP is called path; 5978
(ii) if for all Ej 0 , |Ej 0 | = 2, and there’s Vi , |Vi | ≥ 1, then NSHP is called SuperPath; 5979
(iii) if for all Vi , Ej 0 , |Vi | = 1, |Ej 0 | ≥ 2, then NSHP is called HyperPath; 5980
(iv) if there are Vi , Ej 0 , |Vi | ≥ 1, |Ej 0 | ≥ 2, then NSHP is called Neutrosophic SuperHy- 5981
perPath . 5982
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 5983
(i) Neutrosophic t-strength (min{T (Vi )}, m, n)si=1 ; 5984
(ii) Neutrosophic i-strength (m, min{I(Vi )}, n)si=1 ; 5985
(iii) Neutrosophic f-strength (m, n, min{F (Vi )})si=1 ; 5986
(iv) Neutrosophic strength (min{T (Vi )}, min{I(Vi )}, min{F (Vi )})si=1 . 5987
Definition 29.0.17 (Different Neutrosophic Types of Neutrosophic SuperHyperEdges (NSHE)). 5988

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

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


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

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

Dominating). 6005
(i) Neutrosophic e-SuperHyperReverse Connective Dominating if the following expression is 6009

called Neutrosophic e-SuperHyperReverse Connective Dominating criteria holds 6010

(ii) Neutrosophic re-SuperHyperReverse Connective Dominating if the following expression is 6011

called Neutrosophic re-SuperHyperReverse Connective Dominating criteria holds 6012

and |Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 6013
(iii) Neutrosophic v-SuperHyperReverse Connective Dominating if the following expression is 6014

called Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 6015


(iv) Neutrosophic rv-SuperHyperReverse Connective Dominating if the following expression 6016

is called Neutrosophic v-SuperHyperReverse Connective Dominating criteria holds 6017

and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 6018
(v) Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutro- 6019

Definition 29.0.19. ((Neutrosophic) SuperHyperReverse Connective Dominating). 6023

(i) an Extreme SuperHyperReverse Connective Dominating if it’s either of Neutrosophic 6026

e-SuperHyperReverse Connective Dominating, Neutrosophic re-SuperHyperReverse Connective Dom- 6027
inating, Neutrosophic v-SuperHyperReverse Connective Dominating, and Neutrosophic rv- 6028
(ii) a Neutrosophic SuperHyperReverse Connective Dominating if it’s either of Neutro- 6034

form the Neutrosophic SuperHyperReverse Connective Dominating; 6041
(iii) an Extreme SuperHyperReverse Connective Dominating SuperHyperPolynomial if 6042

it’s either of Neutrosophic e-SuperHyperReverse Connective Dominating, Neutrosophic re- 6043
of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 6048

(iv) a Neutrosophic SuperHyperReverse Connective Dominating SuperHyperPolynomial 6052


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

high Extreme cardinality of the Extreme SuperHyperVertices in the consecutive Extreme 6068
(vi) a Neutrosophic V-SuperHyperReverse Connective Dominating if it’s either of Neutro- 6071

N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic Supe- 6075
rHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 6076
that they form the Neutrosophic SuperHyperReverse Connective Dominating; 6078
(vii) an Extreme V-SuperHyperReverse Connective Dominating SuperHyperPolynomial 6079


(viii) a Neutrosophic SuperHyperReverse Connective Dominating SuperHyperPolynomial 6089



136TBL3

Definition 29.0.20. ((Extreme/Neutrosophic)δ−SuperHyperReverse Connective Dominating). 6100
Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Then 6101
(i) an δ−SuperHyperReverse Connective Dominating is a Neutrosophic kind of Neutrosophic 6102
SuperHyperReverse Connective Dominating such that either of the following expressions hold for 6103
the Neutrosophic cardinalities of SuperHyperNeighbors of s ∈ S : 6104
|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 6105

(29.1), holds if S is an δ−SuperHyperDefensive; 6106
(ii) a Neutrosophic δ−SuperHyperReverse Connective Dominating is a Neutrosophic kind 6107

of Neutrosophic SuperHyperReverse Connective Dominating such that either of the following 6108
Neutrosophic expressions hold for the Neutrosophic cardinalities of SuperHyperNeighbors 6109

of s ∈ S : 6110
|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 6111

the Expression (29.1), holds if S is a Neutrosophic δ−SuperHyperDefensive. 6112
“redefine” the notion of “Neutrosophic SuperHyperGraph”. The SuperHyperVertices and the 6114
there’s the usage of the position of labels to assign to the values. 6116
136DEF1 Definition 29.0.21. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6117
It’s redefined Neutrosophic SuperHyperGraph if the Table (29.1) holds. 6118
It’s useful to define a “Neutrosophic” version of SuperHyperClasses. Since there’s more ways 6119
to get Neutrosophic type-results to make a Neutrosophic more understandable. 6120

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

136TBL4

136TBL1
136DEF2 Definition 29.0.22. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6121

(V, E). There are some Neutrosophic SuperHyperClasses if the Table (29.2) holds. 6122
Thus Neutrosophic SuperHyperPath , SuperHyperReverse Connective Dominating, SuperHyperStar, 6123
SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are Neutrosophic 6124
SuperHyperPath, Neutrosophic SuperHyperCycle, Neutrosophic SuperHyperStar, 6125

Neutrosophic SuperHyperBipartite, Neutrosophic SuperHyperMultiPartite, and 6126
Neutrosophic SuperHyperWheel if the Table (29.2) holds. 6127
It’s useful to define a “Neutrosophic” version of a Neutrosophic SuperHyperReverse Connective 6128

Dominating . Since there’s more ways to get type-results to make a Neutrosophic SuperHyperReverse 6129
Connective Dominating more Neutrosophicly understandable. 6130
“redefine” the Neutrosophic notion of “Neutrosophic SuperHyperReverse Connective Dominating”. The 6132
6135
136DEF1 Definition 29.0.23. Assume a SuperHyperReverse Connective Dominating. It’s redefined a Neutro- 6136
sophic SuperHyperReverse Connective Dominating if the Table (29.3) holds. 6137

CHAPTER 30 6138
Neutrosophic SuperHyper But Reverse Connective Dominating 6139
As The Extensions Excerpt From Dense 6140
And Super Forms 6141
Definition 30.0.1. (Neutrosophic event). 6142

Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider S = (V, E) 6143
is a probability Reverse Connective Dominating. Any Neutrosophic k-subset of A of V is called 6144
Neutrosophic k-event and if k = 2, then Neutrosophic subset of A of V is called 6145
Neutrosophic event. The following expression is called Neutrosophic probability of 6146

A. 6147
X
E(A) = E(a). (30.1)
a∈A
Definition 30.0.2. (Neutrosophic Independent). 6148

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

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

is a probability Reverse Connective Dominating. Any k-function Reverse Connective Dominating like E is called 6156
Neutrosophic k-Variable. If k = 2, then any 2-function Reverse Connective Dominating like E is 6157
called Neutrosophic Variable. 6158
The notion of independent on Neutrosophic Variable is likewise. 6159
281
Definition 30.0.4. (Neutrosophic Expectation). 6160

is a probability Reverse Connective Dominating. A Neutrosophic k-Variable E has a number is called 6162
Neutrosophic Expectation if the following expression is called Neutrosophic Expectation 6163
criteria 6164
X
Ex(E) = E(α)P (α).
α∈V
Definition 30.0.5. (Neutrosophic Crossing). 6165

is a probability Reverse Connective Dominating. A Neutrosophic number is called Neutrosophic 6167

Crossing if the following expression is called Neutrosophic Crossing criteria 6168
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). 6169
Consider S = (V, E) is a probability Reverse Connective Dominating. Let m and n propose special Reverse 6170
Connective Dominating. Then with m ≥ 4n, 6171
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 Connective 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: 6172
pm − 3n n 1 3 2
cr(G) ≥ 3
= 3 = m n .
p (4n/m) 64
6173
Theorem 30.0.7. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6174
points in the plane, and let l be the Neutrosophic number of√SuperHyperLines in the plane 6176
passing through at least k + 1 of these points, where 1 ≤ k ≤ 2 2n. Then l < 32n2 /k 3 . 6177

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

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

points in the plane, and let k be the number of pairs of points of P at unit SuperHyperDistance. 6186
Then k < 5n4/3 . 6187
Proof. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). Consider 6188
S = (V, E) is a probability Reverse Connective Dominating. Draw a SuperHyperUnit SuperHyperCircle 6189
around each SuperHyperPoint of P. Let ni be the P Neutrosophic number of these P SuperHyper- 6190
Circles passing through exactly i points of P. Then i = 0n−1 ni = n and k = 12 i = 0n−1 ini . 6191
Now form a Neutrosophic SuperHyperGraph H with SuperHyperVertex SuperHyperSet P 6192
whose SuperHyperEdges are the SuperHyperArcs between consecutive SuperHyperPoints on 6193
the SuperHyperCircles that pass through at least three SuperHyperPoints of P. Then 6194
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 6195
SuperHyperEdges. Delete from H one of each SuperHyperPair of parallel SuperHyperEdges, 6196

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

Corollary 30.0.10. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E). 6206
Consider S = (V, E) is a probability Reverse Connective Dominating. Let Xn be a nonnegative integer- 6207
valued variable in a probability Reverse Connective Dominating (Vn , En ), n ≥ 1. If E(Xn ) → 0 as 6208
n → ∞, then P (Xn = 0) → 1 as n → ∞. 6209
Proof. 6210
Consider S = (V, E) is a probability Reverse Connective Dominating. A special SuperHyperGraph in 6212
Gn,p almost surely has stability number at most d2p−1 log ne. 6213
S = (V, E) is a probability Reverse Connective Dominating. A special SuperHyperGraph in Gn,p is 6215
up. Let G ∈ Gn,p and let S be a given SuperHyperSet of k + 1 SuperHyperVertices of G, 6216
where k ∈ N. The probability that S is a stable SuperHyperSet of G is (1 − p)(k+1)choose2 , this 6217
being the probability that none of the (k + 1)choose2 pairs of SuperHyperVertices of S is a 6218
SuperHyperEdge of the Neutrosophic SuperHyperGraph G. 6219
Let AS denote the event that S is a stable SuperHyperSet of G, and let XS denote the indicator 6220
Neutrosophic Variable for this Neutrosophic Event. By equation, we have 6221
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 6222
X
X= {XS : S ⊆ V, |S| = k + 1}
and so, by those, 6223

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: 6224
nk+1
(n choose k+1) ≤ and1 − p ≤ e−p .
(k + 1)!
This yields the following upper bound on E(X). 6225
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 6226
least as fast as the logarithm of n, implies that E(X) → 0 as n → ∞. Because X is integer-valued 6227
and nonnegative, we deduce from Corollary that P (X = 0) → 1 as n → ∞. Consequently, a 6228
Neutrosophic SuperHyperGraph in Gn,p almost surely has stability number at most k. 6229
Definition 30.0.12. (Neutrosophic Variance). 6230
is a probability Reverse Connective Dominating. A Neutrosophic k-Variable E has a number is 6232
called Neutrosophic Variance if the following expression is called Neutrosophic Variance 6233
criteria 6234
2
V x(E) = Ex((X − Ex(X)) ).

Consider S = (V, E) is a probability Reverse Connective Dominating. Let X be a Neutrosophic Variable 6236
and let t be a positive real number. Then 6237
V (X)
E(|X − Ex(X)| ≥ t) ≤ .
t2
S = (V, E) is a probability Reverse Connective Dominating. Let X be a Neutrosophic Variable and let 6239
t be a positive real number. Then 6240
2
2 Ex((X − Ex(X)) ) V (X)
E(|X − Ex(X)| ≥ t) = E((X − Ex(X)) ≥ t2 ) ≤ 2
= .
t t2
6241
Consider S = (V, E) is a probability Reverse Connective Dominating. Let Xn be a Neutrosophic Variable 6243
in a probability Reverse Connective Dominating (Vn , En ), n ≥ 1. If Ex(Xn ) 6= 0 and V (Xn ) << E 2 (Xn ), 6244
then 6245
E(Xn = 0) → 0 as n → ∞
S = (V, E) is a probability Reverse Connective Dominating. Set X := Xn and t := |Ex(Xn )| in 6247
Chebyshev’s Inequality, and observe that E(Xn = 0) ≤ E(|Xn − Ex(Xn )| ≥ |Ex(Xn )|) because 6248
|Xn − Ex(Xn )| = |Ex(Xn )| when Xn = 0. 6249
Consider S = (V, E) is a probability Reverse Connective Dominating. Let G ∈ Gn,1/2 . For 0 ≤ k ≤ n, set 6251
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 6252
one. Then almost surely α(G) takes one of the three values k ∗ − 2, k ∗ − 1, k ∗ . 6253
S = (V, E) is a probability Reverse Connective Dominating. As in the proof of related Theorem, the 6255
result is straightforward. 6256
Consider S = (V, E) is a probability Reverse Connective Dominating. Let G ∈ Gn,1/2 and let f and k ∗ 6258
be as defined in previous Theorem. Then either: 6259
(i). f (k ∗ ) << 1, in which case almost surely α(G) is equal to either k ∗ − 2 or k ∗ − 1, or 6260
(ii). f (k ∗ − 1) >> 1, in which case almost surely α(G) is equal to either k ∗ − 1 or k ∗ . 6261

Definition 30.0.17. (Neutrosophic Threshold). 6264

is a probability Reverse Connective Dominating. Let P be a monotone property of SuperHyperGraphs 6266
(one which is preserved when SuperHyperEdges are added). Then a Neutrosophic Threshold 6267
for P is a function f (n) such that: 6268
(i). if p << f (n), then G ∈ Gn,p almost surely does not have P, 6269
(ii). if p >> f (n), then G ∈ Gn,p almost surely has P. 6270
Definition 30.0.18. (Neutrosophic Balanced). 6271
is a probability Reverse Connective Dominating. Let F be a fixed Neutrosophic SuperHyperGraph. 6273
Then there is a threshold function for the property of containing a copy of F as a Neutrosophic 6274
SubSuperHyperGraph is called Neutrosophic Balanced. 6275
Theorem 30.0.19. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = 6276

(V, E). Consider S = (V, E) is a probability Reverse Connective Dominating. Let F be a nonempty 6277
balanced Neutrosophic SubSuperHyperGraph with k SuperHyperVertices and l SuperHyperEdges. 6278
Then n−k/l is a threshold function for the property of containing F as a Neutrosophic 6279
SubSuperHyperGraph. 6280
136EXM1 Example 30.0.20. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) 6283
in the mentioned Neutrosophic Figures in every Neutrosophic items. 6284
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic 6285
SuperHyperReverse Connective Dominating, is up. The Neutrosophic Algorithm is Neutrosophicly 6286

straightforward. E1 and E3 are some empty Neutrosophic SuperHyperEdges but E2 6287
is a loop Neutrosophic SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. 6288
Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic 6289
SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic 6290
isolated means that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic 6291
endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given 6292

Neutrosophic SuperHyperReverse Connective Dominating. 6293
C(N SHG)Neutrosophic Reverse Connective Dominating =

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

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

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

straightforward. E1 , E2 and E3 are some empty Neutrosophic SuperHyperEdges 6297
but E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutrosophic 6298
SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . The 6299
Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 6300
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 6301
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperReverse Connective 6302

Dominating. 6303

{}.
= 0z 0 .
{}.
= 0z 0 .
6304



{}.
= 0z 0 .
{}.
= 0z 0 .
6308


{}.
= 0z 0 .




{}.
= 0z 0 .
6312




{E2 }.
= z 6−c .
{V5 }.
= z 7−c .
6316


{Ei }22
i=12 .



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


{E15 , E16 , E17 }.
= z 3−a .
{V12 , V13 , V14 }.


= z 3−a .
6324


{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.
= z 3−a .
6328



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

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


{E1 , E2 , E3 }.
= z 3−a .
{V12 , V13 , V14 }.


= z 3−a .
6336


{E1 , E3 }.
= z 3−a .
{V1 , V6 }.
= z 5−a .
6340






{E1 }.
= z 5−a .
{V1 , V2 , V3 , V7 , V8 }.
= z 5−a .
6344


{E9 , E3 }.
= z 3−a .



{V1 , V6 }.
= z 5−a .
6348


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




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




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


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



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


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






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


{E6 }.
= z 4−a .



{V1 }.
= z 6−a .
6376


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


Neutrosophic SuperHyperReverse Connective Dominating in the Neutrosophic Example (42.0.3) 95NHG1
6380


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


Neutrosophic SuperHyperReverse Connective Dominating in the Neutrosophic Example (42.0.3) 95NHG2
6384
Proposition 30.0.21. Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The 6385
all interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Connective 6386
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6387
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeighbors 6388
with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any amount 6389
of them. 6390
Proposition 30.0.22. Assume a connected non-obvious Neutrosophic SuperHyperGraph ESHG : 6391

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

It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Connective 6399
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices 6400
of the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic 6401
SuperHyperEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges 6402
contains the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to 6403
Neutrosophic Reverse Connective Dominating in some cases but the maximum number of the Neutrosophic 6404
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6405

has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Connective 6406
Dominating. 6407
Proposition 30.0.24. Assume a simple Neutrosophic SuperHyperGraph ESHG : (V, E). Then
the Neutrosophic number of type-result-R-Reverse Connective 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 Connective Dominating with the least Neutrosophic 6408
cardinality, the lower sharp Neutrosophic bound for cardinality. 6409
Proposition 30.0.25. Assume a connected loopless Neutrosophic SuperHyperGraph ESHG : 6410
(V, E). Then in the worst case, literally, 6411
C(N SHG)N eutrosophicQuasi−ReverseConnectiveDominating

= {V1 , E1 , V2 , E2 , V3 , E3 , V4 , E4 , V1 }.
C(N SHG)N eutrosophicQuasi−ReverseConnectiveDominatingSuperHyperP olynomial = z 4 .
C(N SHG)N eutrosophicQuasi−ReverseConnectiveDominating = {V1 , V2 , V3 , V4 , V1 }.
C(N SHG)N eutrosophicR−Quasi−ReverseConnectiveDominatingSuperHyperP olynomial = z 5 .
Is a Neutrosophic type-result-Reverse Connective Dominating. In other words, the least cardinality, the 6412
lower sharp bound for the cardinality, of a Neutrosophic type-result-Reverse Connective Dominating is 6413
the cardinality of 6414

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

E
Let Zi ∼ Zj , be defined as Zi and Zj are the Neutrosophic SuperHyperVertices belong to the
Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) . Thus,
E
E = {Z1 , Z2 , . . . , Zz | Zi ∼ Zj , i 6= j, i, j = 1, 2, . . . , z}.
Or
{aE , bE , cE , . . .}E={E∈EESHG:(V,E) | |E|=max{|E| | E∈EESHG:(V,E) }} .
But with the slightly differences, 6415
Neutrosophic R-Reverse Connective Dominating =

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

Thus E ∈ EESHG:(V,E) is a Neutrosophic quasi-R-Reverse Connective 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 Connective 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 Connective Dominating is at least
V \ (V \ {aE , bE , cE , . . . , zE }).
It’s straightforward that the Neutrosophic cardinality of the Neutrosophic R-Reverse Connective 6417
Dominating is at least the maximum Neutrosophic number of Neutrosophic SuperHyperVertices of 6418

the Neutrosophic SuperHyperEdges with the maximum number of the Neutrosophic SuperHy- 6419
perEdges. In other words, the maximum number of the Neutrosophic SuperHyperEdges contains 6420
the maximum Neutrosophic number of Neutrosophic SuperHyperVertices are renamed to Neut- 6421
rosophic Reverse Connective Dominating in some cases but the maximum number of the Neutrosophic 6422
SuperHyperEdge with the maximum Neutrosophic number of Neutrosophic SuperHyperVertices, 6423
has the Neutrosophic SuperHyperVertices are contained in a Neutrosophic R-Reverse Connective 6424
Dominating. 6425
The obvious SuperHyperGraph has no Neutrosophic SuperHyperEdges. But the non-obvious 6426
Neutrosophic SuperHyperModel is up. The quasi-SuperHyperModel addresses some issues about 6427
the Neutrosophic optimal SuperHyperObject. It specially delivers some remarks on the Neutro- 6428
sophic SuperHyperSet of the Neutrosophic SuperHyperVertices such that there’s distinct amount 6429
of Neutrosophic SuperHyperEdges for distinct amount of Neutrosophic SuperHyperVertices up 6430
to all taken from that Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices 6431
but this Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices is either has 6432
the maximum Neutrosophic SuperHyperCardinality or it doesn’t have maximum Neutrosophic 6433
SuperHyperCardinality. In a non-obvious SuperHyperModel, there’s at least one Neutrosophic 6434
SuperHyperEdge containing at least all Neutrosophic SuperHyperVertices. Thus it forms a 6435
Neutrosophic quasi-R-Reverse Connective Dominating where the Neutrosophic completion of the Neut- 6436
rosophic incidence is up in that. Thus it’s, literarily, a Neutrosophic embedded R-Reverse Connective 6437
Dominating. The SuperHyperNotions of embedded SuperHyperSet and quasi-SuperHyperSet 6438
coincide. In the original setting, these types of SuperHyperSets only don’t satisfy on the 6439
maximum SuperHyperCardinality. Thus the embedded setting is elected such that those Super- 6440
HyperSets have the maximum Neutrosophic SuperHyperCardinality and they’re Neutrosophic 6441
SuperHyperOptimal. The less than two distinct types of Neutrosophic SuperHyperVertices are 6442
included in the minimum Neutrosophic style of the embedded Neutrosophic R-Reverse Connective 6443
Dominating. The interior types of the Neutrosophic SuperHyperVertices are deciders. Since the 6444
Neutrosophic number of SuperHyperNeighbors are only affected by the interior Neutrosophic Su- 6445
perHyperVertices. The common connections, more precise and more formal, the perfect unique 6446
connections inside the Neutrosophic SuperHyperSet for any distinct types of Neutrosophic 6447
SuperHyperVertices pose the Neutrosophic R-Reverse Connective Dominating. Thus Neutrosophic 6448
exterior SuperHyperVertices could be used only in one Neutrosophic SuperHyperEdge and in 6449
Neutrosophic SuperHyperRelation with the interior Neutrosophic SuperHyperVertices in that 6450
Neutrosophic SuperHyperEdge. In the embedded Neutrosophic Reverse Connective Dominating, there’s 6451
the usage of exterior Neutrosophic SuperHyperVertices since they’ve more connections inside 6452
more than outside. Thus the title “exterior” is more relevant than the title “interior”. One Neut- 6453
rosophic SuperHyperVertex has no connection, inside. Thus, the Neutrosophic SuperHyperSet 6454
of the Neutrosophic SuperHyperVertices with one SuperHyperElement has been ignored in the 6455
exploring to lead on the optimal case implying the Neutrosophic R-Reverse Connective Dominating. The 6456
Neutrosophic R-Reverse Connective Dominating with the exclusion of the exclusion of all Neutrosophic 6457
SuperHyperVertices in one Neutrosophic SuperHyperEdge and with other terms, the Neutro- 6458
sophic R-Reverse Connective Dominating with the inclusion of all Neutrosophic SuperHyperVertices in 6459
one Neutrosophic SuperHyperEdge, is a Neutrosophic quasi-R-Reverse Connective Dominating. To sum 6460

them up, in a connected non-obvious Neutrosophic SuperHyperGraph ESHG : (V, E). There’s 6461
only one Neutrosophic SuperHyperEdge E ∈ EESHG:(V,E) has only the maximum possibilities 6462
of the distinct interior Neutrosophic SuperHyperVertices inside of any given Neutrosophic 6463
quasi-R-Reverse Connective Dominating minus all Neutrosophic SuperHypeNeighbor to some of them 6464

but not all of them. In other words, there’s only an unique Neutrosophic SuperHyperEdge 6465
E ∈ EESHG:(V,E) has only two distinct Neutrosophic SuperHyperVertices in an Neutrosophic 6466
quasi-R-Reverse Connective Dominating, minus all Neutrosophic SuperHypeNeighbor to some of them 6467
but not all of them. 6468
The main definition of the Neutrosophic R-Reverse Connective Dominating has two titles. a Neut- 6469
rosophic quasi-R-Reverse Connective Dominating and its corresponded quasi-maximum Neutrosophic 6470
R-SuperHyperCardinality are two titles in the terms of quasi-R-styles. For any Neutrosophic 6471
number, there’s a Neutrosophic quasi-R-Reverse Connective Dominating with that quasi-maximum 6472
Neutrosophic SuperHyperCardinality in the terms of the embedded Neutrosophic SuperHy- 6473
perGraph. If there’s an embedded Neutrosophic SuperHyperGraph, then the Neutrosophic 6474
quasi-SuperHyperNotions lead us to take the collection of all the Neutrosophic quasi-R-Reverse 6475
Connective Dominatings for all Neutrosophic numbers less than its Neutrosophic corresponded max- 6476
imum number. The essence of the Neutrosophic Reverse Connective Dominating ends up but this essence 6477
starts up in the terms of the Neutrosophic quasi-R-Reverse Connective Dominating, again and more in 6478
the operations of collecting all the Neutrosophic quasi-R-Reverse Connective Dominatings acted on the 6479
all possible used formations of the Neutrosophic SuperHyperGraph to achieve one Neutrosophic 6480
number. This Neutrosophic number is 6481
considered as the equivalence class for all corresponded quasi-R-Reverse Connective Dominatings. 6482
Let zNeutrosophic Number , SNeutrosophic SuperHyperSet and GNeutrosophic Reverse Connective Dominating be 6483
a Neutrosophic number, a Neutrosophic SuperHyperSet and a Neutrosophic Reverse Connective 6484
Dominating. Then 6485
[zNeutrosophic Number ]Neutrosophic Class = {SNeutrosophic SuperHyperSet |

SNeutrosophic SuperHyperSet = GNeutrosophic Reverse Connective Dominating ,
|SNeutrosophic SuperHyperSet |Neutrosophic Cardinality
= zNeutrosophic Number }.
As its consequences, the formal definition of the Neutrosophic Reverse Connective Dominating is re- 6486
formalized and redefined as follows. 6487
GNeutrosophic Reverse Connective 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 6488
definition for the Neutrosophic Reverse Connective Dominating. 6489
GNeutrosophic Reverse Connective 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 6490
Connective Dominating poses the upcoming expressions. 6491

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

= max zNeutrosophic Number

And then, 6493


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

6495

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


6496

[zNeutrosophic
Number ]Neutrosophic Class

6497


Now, the extension of these types of approaches is up. Since the new term, “Neutrosophic 6498
SuperHyperNeighborhood”, could be redefined as the collection of the Neutrosophic SuperHy- 6499
perVertices such that any amount of its Neutrosophic SuperHyperVertices are incident to a 6500
Neutrosophic SuperHyperEdge. It’s, literarily, another name for “Neutrosophic Quasi-Reverse 6501
Connective Dominating” but, precisely, it’s the generalization of “Neutrosophic Quasi-Reverse Connective 6502
Dominating” since “Neutrosophic Quasi-Reverse Connective Dominating” happens “Neutrosophic Reverse 6503
Connective Dominating” in a Neutrosophic SuperHyperGraph as initial framework and background 6504

but “Neutrosophic SuperHyperNeighborhood” may not happens “Neutrosophic Reverse Connective 6505
Dominating” in a Neutrosophic SuperHyperGraph as initial framework and preliminarily back- 6506
ground since there are some ambiguities about the Neutrosophic SuperHyperCardinality arise 6507
from it. To get orderly keywords, the terms, “Neutrosophic SuperHyperNeighborhood”, “Neut- 6508
rosophic Quasi-Reverse Connective Dominating”, and “Neutrosophic Reverse Connective Dominating” are up. 6509
Thus, let 6510

zNeutrosophic Number , NNeutrosophic SuperHyperNeighborhood and 6511
GNeutrosophic Reverse Connective Dominating be a Neutrosophic number, a Neutrosophic SuperHyper- 6512
Neighborhood and a Neutrosophic Reverse Connective Dominating and the new terms are up. 6513
GNeutrosophic Reverse Connective Dominating ∈ ∪zNeutrosophic Number

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

{NNeutrosophic SuperHyperNeighborhood

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =

|NNeutrosophic SuperHyperSet |Neutrosophic Cardinality
6515

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

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

6518

∈ ∪zNeutrosophic Number [zNeutrosophic Number ]Neutrosophic Class =


6519


6520


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

The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
Is an Neutrosophic R-Reverse Connective 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 Connective 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 Connective Dominating is up. The obvious
simple Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Connective 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 Connective 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 Con-

. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperVertices,
nective Dominating
(V \ V \ {x, z}) ∪ {xy}
or
(V \ V \ {x, z}) ∪ {zy}
is an Neutrosophic R-Reverse Connective 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
Connective Dominating and it’s an Neutrosophic Reverse Connective 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 Connective Dominating. There isn’t only less than two
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet,
Thus the non-obvious Neutrosophic R-Reverse Connective Dominating,
is up. The non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse

Connective Dominating, not:

Is the Neutrosophic SuperHyperSet, not:
does includes only less than two SuperHyperVertices in a connected Neutrosophic Super- 6521
HyperGraph ESHG : (V, E) but it’s impossible in the case, they’ve corresponded to an 6522
SuperHyperEdge. It’s interesting to mention that the only non-obvious simple Neutrosophic 6523
type-SuperHyperSet called the 6524
“Neutrosophic R-Reverse Connective Dominating” 6525
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6526
Neutrosophic R-Reverse Connective Dominating, 6527
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 Connective Dominating amid those obvious simple Neutrosophic type-
SuperHyperSets of the Neutrosophic Reverse Connective 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 Connective Dominating. In other words, the least cardinality, the lower
sharp bound for the cardinality, of a Neutrosophic R-Reverse Connective Dominating is the cardinality
of
6528
To sum them up, in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). The all 6529
interior Neutrosophic SuperHyperVertices belong to any Neutrosophic quasi-R-Reverse Connective 6530
Dominating if for any of them, and any of other corresponded Neutrosophic SuperHyperVertex, 6531
some interior Neutrosophic SuperHyperVertices are mutually Neutrosophic SuperHyperNeigh- 6532
bors with no Neutrosophic exception at all minus all Neutrosophic SuperHypeNeighbors to any 6533
amount of them. 6534
Assume a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Let a Neutrosophic 6535
SuperHyperEdge ESHE : E ∈ EESHG:(V,E) has some Neutrosophic SuperHyperVertices 6536
r. Consider all Neutrosophic numbers of those Neutrosophic SuperHyperVertices from that 6537

Neutrosophic SuperHyperEdge excluding excluding more than r distinct Neutrosophic Su- 6538
perHyperVertices, exclude to any given Neutrosophic SuperHyperSet of the Neutrosophic 6539
SuperHyperVertices. Consider there’s a Neutrosophic R-Reverse Connective Dominating with the 6540
least cardinality, the lower sharp Neutrosophic bound for Neutrosophic cardinality. Assume a 6541
connected Neutrosophic SuperHyperGraph ESHG : (V, E). The Neutrosophic SuperHyperSet 6542
of the Neutrosophic SuperHyperVertices VESHE \ {z} is a Neutrosophic SuperHyperSet S of the 6543
Neutrosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have 6544

some Neutrosophic SuperHyperVertices uniquely but it isn’t a Neutrosophic R-Reverse Connective 6545
Dominating. Since it doesn’t have 6546
6547
the maximum Neutrosophic cardinality of a Neutrosophic SuperHyperSet S of Neut- 6548
rosophic SuperHyperVertices such that there’s a Neutrosophic SuperHyperEdge to have some 6549
SuperHyperVertices uniquely. The Neutrosophic SuperHyperSet of the Neutrosophic Supe- 6550

rHyperVertices VESHE ∪ {z} is the maximum Neutrosophic cardinality of a Neutrosophic 6551
SuperHyperSet S of Neutrosophic SuperHyperVertices but it isn’t a Neutrosophic R-Reverse 6552
Connective Dominating. Since it doesn’t do the Neutrosophic procedure such that such that there’s 6553
a Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely [there 6554
are at least one Neutrosophic SuperHyperVertex outside implying there’s, sometimes in the 6555
connected Neutrosophic SuperHyperGraph ESHG : (V, E), a Neutrosophic SuperHyperVertex, 6556

titled its Neutrosophic SuperHyperNeighbor, to that Neutrosophic SuperHyperVertex in the 6557
Neutrosophic SuperHyperSet S so as S doesn’t do “the Neutrosophic procedure”.]. There’s 6558
only one Neutrosophic SuperHyperVertex outside the intended Neutrosophic SuperHyperSet, 6559
VESHE ∪ {z}, in the terms of Neutrosophic SuperHyperNeighborhood. Thus the obvious 6560
Neutrosophic R-Reverse Connective Dominating, VESHE is up. The obvious simple Neutrosophic type- 6561
SuperHyperSet of the Neutrosophic R-Reverse Connective Dominating, VESHE , is a Neutrosophic Supe- 6562
rHyperSet, VESHE , includes only all Neutrosophic SuperHyperVertices does forms any kind of 6563
Neutrosophic pairs are titled Neutrosophic SuperHyperNeighbors in a connected Neutrosophic 6564
SuperHyperGraph ESHG : (V, E). Since the Neutrosophic SuperHyperSet of the Neutrosophic 6565
SuperHyperVertices VESHE , is the maximum Neutrosophic SuperHyperCardinality of 6566
a Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such that there’s a 6567
Neutrosophic SuperHyperEdge to have some Neutrosophic SuperHyperVertices uniquely. Thus, 6568

in a connected Neutrosophic SuperHyperGraph ESHG : (V, E). Any Neutrosophic R-Reverse 6569
Connective Dominating only contains all interior Neutrosophic SuperHyperVertices and all exterior 6570
Neutrosophic SuperHyperVertices from the unique Neutrosophic SuperHyperEdge where there’s 6571
any of them has all possible Neutrosophic SuperHyperNeighbors in and there’s all Neutrosophic 6572
SuperHyperNeighborhoods in with no exception minus all Neutrosophic SuperHypeNeighbors 6573

to some of them not all of them but everything is possible about Neutrosophic SuperHyper- 6574
Neighborhoods and Neutrosophic SuperHyperNeighbors out. 6575
The SuperHyperNotion, namely, Reverse Connective Dominating, is up. There’s neither empty SuperHy- 6576
perEdge nor loop SuperHyperEdge. The following Neutrosophic SuperHyperSet of Neutrosophic 6577
SuperHyperEdges[SuperHyperVertices] is the simple Neutrosophic type-SuperHyperSet of 6578
the Neutrosophic Reverse Connective Dominating. The Neutrosophic SuperHyperSet of Neutrosophic 6579
SuperHyperEdges[SuperHyperVertices], 6580

|EESHG:(V,E) |Neutrosophic Cardinality
b c
= {E2i−1 }i=1 2
.

C(N SHG)N eutrosophicQuasi−ReverseConnectiveDominatingSuperHyperP olynomial

= 2z b 2 c
.
C(N SHG)N eutrosophicR−Quasi−ReverseConnectiveDominating = {Vi }si=1 , {Vj }tj=1 .
C(N SHG)N eutrosophicR−Quasi−ReverseConnectiveDominatingSuperHyperP olynomial
= az s + bz t .
is the simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse Connective Dominating. 6581
The Neutrosophic SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6582

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

Graph ESHG : (V, E) is a Neutrosophic type-SuperHyperSet with 6584
6585
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6587
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6588
SuperHyperEdge for all Neutrosophic SuperHyperVertices. There are not only two Neut- 6589
rosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet. Thus the 6590
non-obvious Neutrosophic Reverse Connective Dominating is up. The obvious simple Neutrosophic 6591
type-SuperHyperSet called the Neutrosophic Reverse Connective Dominating is a Neutrosophic Su- 6592
perHyperSet includes only two Neutrosophic SuperHyperVertices. But the Neutrosophic 6593
SuperHyperSet of the Neutrosophic SuperHyperEdges[SuperHyperVertices], 6594

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- 6595
Set. Thus the non-obvious simple Neutrosophic type-SuperHyperSet of the Neutrosophic Reverse 6596
Connective Dominating is up. To sum them up, the Neutrosophic SuperHyperSet of the Neutrosophic 6597

SuperHyperEdges[SuperHyperVertices], 6598

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 6599
. Since the Neutrosophic SuperHyperSet of the Neutrosophic SuperHy-

b c
= {E2i−1 }i=1 2
.
= 2z b 2 c
.
= az s + bz t .
Is an Neutrosophic Reverse Connective Dominating C(ESHG) for an Neutrosophic SuperHyperGraph 6602
ESHG : (V, E) is the Neutrosophic SuperHyperSet S of Neutrosophic SuperHyperVertices such 6603
that there’s no a Neutrosophic SuperHyperEdge for some Neutrosophic SuperHyperVertices 6604

given by that Neutrosophic type-SuperHyperSet called the Neutrosophic Reverse Connective Dominating 6605
and it’s an Neutrosophic Reverse Connective Dominating. Since it’s 6606
6607
rosophic SuperHyperEdges[SuperHyperVertices] such that there’s no Neutrosophic Super- 6609
HyperVertex of a Neutrosophic SuperHyperEdge is common and there’s an Neutrosophic 6610

SuperHyperEdge for all Neutrosophic SuperHyperVertices. There aren’t only less than three 6611
Neutrosophic SuperHyperVertices inside the intended Neutrosophic SuperHyperSet, 6612

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

Thus the non-obvious Neutrosophic Reverse Connective Dominating , 6613

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 Connective 6614
Dominating, not: 6615

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

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- 6617
HyperGraph ESHG : (V, E). It’s interesting to mention that the only non-obvious simple 6618
Neutrosophic type-SuperHyperSet called the 6619
“Neutrosophic Reverse Connective Dominating ” 6620
amid those obvious[non-obvious] simple Neutrosophic type-SuperHyperSets called the 6621
Neutrosophic Reverse Connective Dominating, 6622

is only and only 6623

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

CHAPTER 31 6625
The Neutrosophic Departures on The 6626
Theoretical Results Toward Theoretical 6627
Motivations 6628
The previous Neutrosophic approach apply on the upcoming Neutrosophic results on 6629
Neutrosophic SuperHyperClasses. 6630
Proposition 31.0.1. Assume a connected Neutrosophic SuperHyperPath ESHP : (V, E). Then 6631

|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 6632
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
V |EN SHG |
, E |EN SHG |
3 3
6633
P :
E1 , V1EXT ERN AL ,
E2 , V2EXT ERN AL ,
325
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). 6634

136EXM18a Example 31.0.2. In the Figure (31.1), the connected Neutrosophic SuperHyperPath ESHP : 6639
(V, E), is highlighted and featured. The Neutrosophic SuperHyperSet, in the Neutrosophic 6640
SuperHyperModel (31.1), is the SuperHyperReverse Connective Dominating. 6641
Proposition 31.0.3. Assume a connected Neutrosophic SuperHyperCycle ESHC : (V, E). Then 6642

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

136EXM19a Example 31.0.4. In the Figure (31.2), the connected Neutrosophic SuperHyperCycle N SHC : 6650
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, in the 6651
Neutrosophic SuperHyperModel (31.2), is the Neutrosophic SuperHyperReverse Connective Dominating. 6652
6653

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

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

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6655
P :
V1EXT ERN AL , E1 ,
CEN T ER, E2
6656
P :
E1 , V1EXT ERN AL ,
E2 , CEN T ER

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

Neutrosophic SuperHyperReverse Connective Dominating in the Neutrosophic Example (42.0.9) 136NSHG20a
be a longest path taken a connected Neutrosophic SuperHyperStar ESHS : (V, E). There’s a 6657

136EXM20a Example 31.0.6. In the Figure (31.3), the connected Neutrosophic SuperHyperStar ESHS : 6662
(V, E), is highlighted and featured. The obtained Neutrosophic SuperHyperSet, by the Algorithm 6663
in previous Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected 6664
Neutrosophic SuperHyperStar ESHS : (V, E), in the Neutrosophic SuperHyperModel (31.3), is 6665
the Neutrosophic SuperHyperReverse Connective Dominating. 6666
Proposition 31.0.7. Assume a connected Neutrosophic SuperHyperBipartite ESHB : (V, E). 6667

Then 6668

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6669
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6670
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). 6671

Dominating could be applied. There are only two SuperHyperParts. Thus every SuperHyperPart 6677
P :

Figure 31.4: Neutrosophic SuperHyperBipartite Neutrosophic Associated to the Neutrosophic

Notions of Neutrosophic SuperHyperReverse Connective Dominating in the Example (42.0.11) 136NSHG21a
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperReverse Connective Dominating taken from a connected Neutrosophic 6679

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

Bipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel (31.4), is the Neutrosophic 6687
Proposition 31.0.9. Assume a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6689

Then 6690

|P min |
{E3i+2 }i=0
ESHP
.
| min |E | |Ei |
{P min } ESHP
=z 3i+2 i=0 .
EXT ERN AL |P min |
{V2i+2 }i=0
ESHP
.
=z 2i+2 i=0 .
Proof. Let 6691
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
j N SHG
6692
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 6694

0
Dominating could be applied. There are only z SuperHyperParts. Thus every SuperHyperPart 6699
P :

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

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest path taken from a connected Neutrosophic SuperHyperMultipartite ESHM : (V, E). 6701
Thus only some SuperHyperVertices and only minimum-Neutrosophic-of-SuperHyperPart 6702
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
136EXM22a Example 31.0.10. In the Figure (31.5), the connected Neutrosophic SuperHyperMultipartite 6706
ESHM : (V, E), is highlighted and Neutrosophic featured. The obtained Neutrosophic 6707
SuperHyperSet, by the Algorithm in previous Neutrosophic result, of the Neutrosophic 6708
SuperHyperVertices of the connected Neutrosophic SuperHyperMultipartite ESHM : (V, E), 6709
in the Neutrosophic SuperHyperModel (31.5), is the Neutrosophic SuperHyperReverse Connective 6710

Dominating. 6711
Proposition 31.0.11. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E∪E ∗ ). 6712

Then, 6713

{Ei }.
= z |Ei | .
{CEN T ER}.
= z |CEN T ER| .
Proof. Let 6714
P :
CEN T ER, E2∗
6715
P :
E1∗ , V1EXT ERN AL ,
E2∗ , CEN T ER

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

straightforward. Then there’s at least one SuperHyperReverse Connective Dominating. Thus the notion 6720
of quasi isn’t up and the SuperHyperNotions based on SuperHyperReverse Connective Dominating 6721
could be applied. The unique embedded SuperHyperReverse Connective Dominating proposes some 6722
longest SuperHyperReverse Connective Dominating excerpt from some representatives. The latter is 6723
136EXM23a Example 31.0.12. In the Neutrosophic Figure (31.6), the connected Neutrosophic SuperHyper- 6725
Wheel N SHW : (V, E), is Neutrosophic highlighted and featured. The obtained Neutrosophic 6726
SuperHyperSet, by the Algorithm in previous result, of the Neutrosophic SuperHyperVer- 6727
tices of the connected Neutrosophic SuperHyperWheel ESHW : (V, E), in the Neutrosophic 6728
SuperHyperModel (31.6), is the Neutrosophic SuperHyperReverse Connective Dominating. 6729

Figure 31.6: a Neutrosophic SuperHyperWheel Neutrosophic Associated to the Neutrosophic

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

CHAPTER 32 6730
The Surveys of Mathematical Sets On 6731
The Results But As The Initial Motivation 6732
For the SuperHyperReverse Connective Dominating, Neutrosophic SuperHyperReverse Connective Dominating, 6733
and the Neutrosophic SuperHyperReverse Connective Dominating, some general results are introduced. 6734
6735
Remark 32.0.1. Let remind that the Neutrosophic SuperHyperReverse Connective Dominating is 6736
“redefined” on the positions of the alphabets. 6737
Corollary 32.0.2. Assume Neutrosophic SuperHyperReverse Connective Dominating. Then 6738
N eutrosophic SuperHyperReverseConnectiveDominating =
{theSuperHyperReverseConnectiveDominatingof theSuperHyperV ertices |
max |SuperHyperOf f ensive
SuperHyperReverseConnectiveDominating
|N eutrosophiccardinalityamidthoseSuperHyperReverseConnectiveDominating. }
plus one Neutrosophic SuperHypeNeighbor to one. Where σi is the unary operation on the 6739
SuperHyperVertices of the SuperHyperGraph to assign the determinacy, the indeterminacy and 6740
the neutrality, for i = 1, 2, 3, respectively. 6741
Corollary 32.0.3. Assume a Neutrosophic SuperHyperGraph on the same identical letter 6742
of the alphabet. Then the notion of Neutrosophic SuperHyperReverse Connective Dominating and 6743
SuperHyperReverse Connective Dominating coincide. 6744
Corollary 32.0.4. Assume a Neutrosophic SuperHyperGraph on the same identical letter of 6745
the alphabet. Then a consecutive sequence of the SuperHyperVertices is a Neutrosophic 6746

SuperHyperReverse Connective Dominating if and only if it’s a SuperHyperReverse Connective Dominating. 6747
Corollary 32.0.5. Assume a Neutrosophic SuperHyperGraph on the same identical letter of the 6748
alphabet. Then a consecutive sequence of the SuperHyperVertices is a strongest SuperHyperReverse 6749
Connective Dominating if and only if it’s a longest SuperHyperReverse Connective Dominating. 6750
Corollary 32.0.6. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph on the same 6751

identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Connective Dominating is its 6752
337
Corollary 32.0.7. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Connective Dominating, 6754

SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel) on the same 6755
identical letter of the alphabet. Then its Neutrosophic SuperHyperReverse Connective Dominating is its 6756
Corollary 32.0.8. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6758
perReverse Connective Dominating isn’t well-defined if and only if its SuperHyperReverse Connective Dominating 6759
isn’t well-defined. 6760
Corollary 32.0.9. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then 6761

its Neutrosophic SuperHyperReverse Connective Dominating isn’t well-defined if and only if its 6762
SuperHyperReverse Connective Dominating isn’t well-defined. 6763
Corollary 32.0.10. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Connective Domin- 6764

, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then
ating 6765
its Neutrosophic SuperHyperReverse Connective Dominating isn’t well-defined if and only if its SuperHy- 6766
perReverse Connective Dominating isn’t well-defined. 6767
Corollary 32.0.11. Assume a Neutrosophic SuperHyperGraph. Then its Neutrosophic SuperHy- 6768
perReverse Connective Dominating is well-defined if and only if its SuperHyperReverse Connective Dominating is 6769
well-defined. 6770
Corollary 32.0.12. Assume SuperHyperClasses of a Neutrosophic SuperHyperGraph. Then its 6771
Neutrosophic SuperHyperReverse Connective Dominating is well-defined if and only if its SuperHyperReverse 6772
Corollary 32.0.13. Assume a Neutrosophic SuperHyperPath(-/SuperHyperReverse Connective Dominat- 6774
, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). Then its

ing 6775
Neutrosophic SuperHyperReverse Connective Dominating is well-defined if and only if its SuperHyperReverse 6776
Proposition 32.0.14. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then V is 6778
(i) : the dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6779
(ii) : the strong dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6780
(iii) : the connected dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6781
(iv) : the δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6782
(v) : the strong δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6783
(vi) : the connected δ-dual SuperHyperDefensive SuperHyperReverse Connective Dominating. 6784
Proposition 32.0.15. Let N T G : (V, E, σ, µ) be a Neutrosophic SuperHyperGraph. Then ∅ is 6785
(iii) : the connected defensive SuperHyperDefensive SuperHyperReverse Connective Dominating; 6788

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

independent SuperHyperSet is 6793
(iii) : the connected SuperHyperDefensive SuperHyperReverse Connective Dominating; 6796
Proposition 32.0.17. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHyper- 6800

Graph which is a SuperHyperReverse Connective Dominating/SuperHyperPath. Then V is a maximal 6801
(iv) : O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6805
(v) : strong O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6806
(vi) : connected O(ESHG)-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6807
Proposition 32.0.18. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is a 6809

SuperHyperUniform SuperHyperWheel. Then V is a maximal 6810
(iv) : O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6814
(v) : strong O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6815
(vi) : connected O(ESHG)-dual SuperHyperDefensive SuperHyperReverse Connective Dominating; 6816
Proposition 32.0.19. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6818

perGraph which is a SuperHyperReverse Connective Dominating/SuperHyperPath. Then the number 6819
of 6820

(i) : the SuperHyperReverse Connective Dominating; 6821
(ii) : the SuperHyperReverse Connective Dominating; 6822
(iii) : the connected SuperHyperReverse Connective Dominating; 6823
(iv) : the O(ESHG)-SuperHyperReverse Connective Dominating; 6824
(v) : the strong O(ESHG)-SuperHyperReverse Connective Dominating; 6825
(vi) : the connected O(ESHG)-SuperHyperReverse Connective Dominating. 6826
coincide. 6828

Graph which is a SuperHyperWheel. Then the number of 6830
(i) : the dual SuperHyperReverse Connective Dominating; 6831
(ii) : the dual SuperHyperReverse Connective Dominating; 6832
(iii) : the dual connected SuperHyperReverse Connective Dominating; 6833
(iv) : the dual O(ESHG)-SuperHyperReverse Connective Dominating; 6834
(v) : the strong dual O(ESHG)-SuperHyperReverse Connective Dominating; 6835
(vi) : the connected dual O(ESHG)-SuperHyperReverse Connective Dominating. 6836
coincide. 6838
Proposition 32.0.21. Let ESHG : (V, E) be a Neutrosophic SuperHyperUniform SuperHy- 6839

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


Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6851
plete SuperHyperMultipartite. Then a SuperHyperSet contains the half of multiplying r with 6852
the number of all the SuperHyperEdges plus one of all the SuperHyperVertices in the biggest 6853
SuperHyperPart is a 6854
(iv) : δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6858
(v) : strong δ-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6859
(vi) : connected δ-SuperHyperDefensive SuperHyperReverse Connective Dominating. 6860
Graph which is a SuperHyperStar/SuperHyperComplete SuperHyperBipartite/SuperHyperCom- 6862

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

Proposition 32.0.25. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph. Then the 6881
number is at most O(ESHG) and the Neutrosophic number is at most On (ESHG). 6882
Proposition 32.0.26. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is 6883
SuperHyperComplete. The number is O(ESHG:(V,E)) 2 + 1 and the Neutrosophic number is 6884

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


Proposition 32.0.27. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is ∅. The 6892
number is 0 and the Neutrosophic number is 0, for an independent SuperHyperSet in the setting 6893
of dual 6894
(iv) : 0-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6898

SuperHyperComplete. Then there’s no independent SuperHyperSet. 6902
Proposition 32.0.29. Let ESHG : (V, E) be a Neutrosophic SuperHyperGraph which is Super- 6903
HyperReverse Connective Dominating/SuperHyperPath/SuperHyperWheel. The number is O(ESHG : 6904
(V, E)) and the Neutrosophic number is On (ESHG : (V, E)), in the setting of a dual 6905
(iv) : O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6909
(v) : strong O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating; 6910
(vi) : connected O(ESHG : (V, E))-SuperHyperDefensive SuperHyperReverse Connective Dominating. 6911


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


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

that 6928
(i) v ∈ Ns (x); 6929
(ii) vx ∈ E. 6930
Proposition 32.0.33. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. If S is 6931

a dual SuperHyperDefensive SuperHyperReverse Connective Dominating, then 6932
(i) S is SuperHyperReverse Connective Dominating set; 6933
(ii) there’s S ⊆ S 0 such that |S 0 | is SuperHyperChromatic number. 6934
Proposition 32.0.34. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph. Then 6935
(i) Γ ≤ O; 6936
(ii) Γs ≤ On . 6937
Proposition 32.0.35. Let ESHG : (V, E) be a strong Neutrosophic SuperHyperGraph which is 6938
connected. Then 6939
(i) Γ ≤ O − 1; 6940
(ii) Γs ≤ On − Σ3i=1 σi (x). 6941
Proposition 32.0.36. Let ESHG : (V, E) be an odd SuperHyperPath. Then 6942


(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· ,vn−1 } Σ3i=1 σi (s)}; 6946
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn−1 } and S2 = {v1 , v3 , · · · , vn−1 } are only a dual 6947
Proposition 32.0.37. Let ESHG : (V, E) be an even SuperHyperPath. Then 6949
(i) the set S = {v2 , v4 , · · · .vn } is a dual SuperHyperDefensive SuperHyperReverse Connective 6950
Dominating; 6951
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · .vn } and {v1 , v3 , · · · .vn−1 }; 6952
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6953
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6954
Proposition 32.0.38. Let ESHG : (V, E) be an even SuperHyperReverse Connective Dominating. Then 6956
(i) the SuperHyperSet S = {v2 , v4 , · · · , vn } is a dual SuperHyperDefensive SuperHyperReverse 6957
(ii) Γ = b n2 c and corresponded SuperHyperSets are {v2 , v4 , · · · , vn } and {v1 , v3 , · · · , vn−1 }; 6959
(iii) Γs = min{Σs∈S={v2 ,v4 ,··· ,vn } σ(s), Σs∈S={v1 ,v3 ,··· ,vn−1 } σ(s)}; 6960
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · , vn } and S2 = {v1 , v3 , · · · , vn−1 } are only dual 6961
Proposition 32.0.39. Let ESHG : (V, E) be an odd SuperHyperReverse Connective Dominating. Then 6963

(iii) Γs = min{Σs∈S={v2 ,v4 ,··· .vn−1 } Σ3i=1 σi (s), Σs∈S={v1 ,v3 ,··· .vn−1 } Σ3i=1 σi (s)}; 6967
(iv) the SuperHyperSets S1 = {v2 , v4 , · · · .vn−1 } and S2 = {v1 , v3 , · · · .vn−1 } are only dual 6968
Proposition 32.0.40. Let ESHG : (V, E) be SuperHyperStar. Then 6970
(i) the SuperHyperSet S = {c} is a dual maximal SuperHyperReverse Connective Dominating; 6971
(ii) Γ = 1; 6972
(iii) Γs = Σ3i=1 σi (c); 6973

(iv) the SuperHyperSets S = {c} and S ⊂ S 0 are only dual SuperHyperReverse Connective Dominating. 6974
Proposition 32.0.41. Let ESHG : (V, E) be SuperHyperWheel. Then 6975
6+3(i−1)≤n
(i) the SuperHyperSet S = {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is a dual maximal 6976
6+3(i−1)≤n
(ii) Γ = |{v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 |; 6978
(iii) Γs = Σ{v1 ,v3 }∪{v6 ,v9 ··· ,vi+6 ,··· ,vn }6+3(i−1)≤n Σ3i=1 σi (s); 6979
i=1
6+3(i−1)≤n
(iv) the SuperHyperSet {v1 , v3 } ∪ {v6 , v9 · · · , vi+6 , · · · , vn }i=1 is only a dual maximal 6980
Proposition 32.0.42. Let ESHG : (V, E) be an odd SuperHyperComplete. Then 6982
b n c+1
2
Dominating; 6984
(ii) Γ = b n2 c + 1; 6985

b n c+1 ; 6986
S={vi }i=1
b n c+1
(iv) the SuperHyperSet S = {vi }i=1
2
is only a dual SuperHyperDefensive SuperHyperReverse 6987
Proposition 32.0.43. Let ESHG : (V, E) be an even SuperHyperComplete. Then 6989
bn
2c
(i) the SuperHyperSet S = {vi }i=1 is a dual SuperHyperDefensive SuperHyperReverse Connective 6990
Dominating; 6991
(ii) Γ = b n2 c; 6992

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

perStars with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 6997
(i) the SuperHyperSet S = {c1 , c2 , · · · , cm } is a dual SuperHyperDefensive SuperHyperReverse 6998
Connective Dominating for N SHF; 6999
(ii) Γ = m for N SHF : (V, E); 7000
(iii) Γs = Σm 3
i=1 Σj=1 σj (ci ) for N SHF : (V, E); 7001
(iv) the SuperHyperSets S = {c1 , c2 , · · · , cm } and S ⊂ S 0 are only dual SuperHyperReverse 7002
Connective Dominating for N SHF : (V, E). 7003

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

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

2
for N SHF : (V, E); 7009
S={vi }i=1
b n c+1
are only a dual maximal SuperHyperReverse Connective 7010
Dominating for N SHF : (V, E). 7011
Proposition 32.0.46. Let N SHF : (V, E) be a m-SuperHyperFamily of even SuperHyperCom- 7012
plete SuperHyperGraphs with common Neutrosophic SuperHyperVertex SuperHyperSet. Then 7013
bnc
Dominating for N SHF : (V, E); 7015
(ii) Γ = b n2 c for N SHF : (V, E); 7016
(iii) Γs = min{Σs∈S Σ3i=1 σi (s)} bnc

2
for N SHF : (V, E); 7017
S={vi }i=1
bnc
2
are only dual maximal SuperHyperReverse Connective Dominating 7018
for N SHF : (V, E). 7019
(i) if s ≥ t and a SuperHyperSet S of SuperHyperVertices is an t-SuperHyperDefensive 7022

SuperHyperReverse Connective Dominating, then S is an s-SuperHyperDefensive SuperHyperReverse 7023

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

SuperHyperReverse Connective Dominating, then S is an s-SuperHyperPowerful SuperHyperReverse 7031

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

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

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

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

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


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

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


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

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

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

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

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


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

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

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


CHAPTER 33 7096
Neutrosophic Applications in Cancer’s 7097
The cancer is the Neutrosophic disease but the Neutrosophic model is going to figure out what’s 7099
going on this Neutrosophic phenomenon. The special Neutrosophic case of this Neutrosophic 7100
disease is considered and as the consequences of the model, some parameters are used. The cells 7101
are under attack of this disease but the moves of the cancer in the special region are the matter 7102
of mind. The Neutrosophic recognition of the cancer could help to find some Neutrosophic 7103
treatments for this Neutrosophic disease. 7104
In the following, some Neutrosophic steps are Neutrosophic devised on this disease. 7105
Step 1. (Neutrosophic Definition) The Neutrosophic recognition of the cancer in the long- 7106
term Neutrosophic function. 7107
Step 2. (Neutrosophic Issue) The specific region has been assigned by the Neutrosophic 7108
model [it’s called Neutrosophic SuperHyperGraph] and the long Neutrosophic cycle of the 7109
move from the cancer is identified by this research. Sometimes the move of the cancer 7110
hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality 7111
about the moves and the effects of the cancer on that region; this event leads us to 7112
choose another model [it’s said to be Neutrosophic SuperHyperGraph] to have convenient 7113
perception on what’s happened and what’s done. 7114
Step 3. (Neutrosophic Model) There are some specific Neutrosophic models, which are well- 7115
known and they’ve got the names, and some general Neutrosophic models. The moves 7116
and the Neutrosophic traces of the cancer on the complex tracks and between complicated 7117
groups of cells could be fantasized by a Neutrosophic SuperHyperPath(-/SuperHyperReverse 7118
Connective Dominating, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, Su- 7119
perHyperWheel). The aim is to find either the Neutrosophic SuperHyperReverse Connective 7120
Dominating or the Neutrosophic SuperHyperReverse Connective Dominating in those Neutrosophic 7121
Neutrosophic SuperHyperModels. 7122
349
CHAPTER 34 7123
Case 1: The Initial Neutrosophic Steps 7124
Toward Neutrosophic 7125
SuperHyperBipartite as Neutrosophic 7126
SuperHyperModel 7127
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (34.1), the Neutrosophic Super- 7128
HyperBipartite is Neutrosophic highlighted and Neutrosophic featured. 7129
Figure 34.1: a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

351
Belong to The Neutrosophic SuperHyperBipartite

136TBLaa21aa
By using the Neutrosophic Figure (34.1) and the Table (34.1), the Neutrosophic SuperHy- 7130
perBipartite is obtained. 7131
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7132
Neutrosophic result, of the Neutrosophic SuperHyperVertices of the connected Neut- 7133
rosophic SuperHyperBipartite ESHB : (V, E), in the Neutrosophic SuperHyperModel 7134
(34.1), is the Neutrosophic SuperHyperReverse Connective Dominating. 7135

CHAPTER 35 7136
Case 2: The Increasing Neutrosophic 7137
Steps Toward Neutrosophic 7138
SuperHyperMultipartite as 7139
Neutrosophic SuperHyperModel 7140
Step 4. (Neutrosophic Solution) In the Neutrosophic Figure (35.1), the Neutrosophic Super- 7141
HyperMultipartite is Neutrosophic highlighted and Neutrosophic featured. 7142
By using the Neutrosophic Figure (35.1) and the Table (35.1), the Neutrosophic SuperHy- 7143
perMultipartite is obtained. 7144
The obtained Neutrosophic SuperHyperSet, by the Neutrosophic Algorithm in previous 7145
Figure 35.1: a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

353
Belong to The Neutrosophic SuperHyperMultipartite

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

perMultipartite ESHM : (V, E), in the Neutrosophic SuperHyperModel (35.1), is the 7147
Neutrosophic SuperHyperReverse Connective Dominating. 7148

CHAPTER 36 7149
Wondering Open Problems But As The 7150
Directions To Forming The Motivations 7151
In what follows, some “problems” and some “questions” are proposed. 7152
The SuperHyperReverse Connective Dominating and the Neutrosophic SuperHyperReverse Connective 7153
Dominating are defined on a real-world application, titled “Cancer’s Recognitions”. 7154
Question 36.0.1. Which the else SuperHyperModels could be defined based on Cancer’s 7155
recognitions? 7156
Question 36.0.2. Are there some SuperHyperNotions related to SuperHyperReverse Connective 7157
and the Neutrosophic SuperHyperReverse Connective Dominating?
Dominating 7158
Question 36.0.3. Are there some Algorithms to be defined on the SuperHyperModels to compute 7159
them? 7160
Question 36.0.4. Which the SuperHyperNotions are related to beyond the SuperHyperReverse 7161
and the Neutrosophic SuperHyperReverse Connective Dominating?
Problem 36.0.5. The SuperHyperReverse Connective Dominating and the Neutrosophic SuperHyperReverse 7163
do a SuperHyperModel for the Cancer’s recognitions and they’re based on
SuperHyperReverse Connective Dominating, are there else? 7165
Problem 36.0.6. Which the fundamental SuperHyperNumbers are related to these SuperHyper- 7166
Numbers types-results? 7167
Problem 36.0.7. What’s the independent research based on Cancer’s recognitions concerning 7168
the multiple types of SuperHyperNotions? 7169
355
CHAPTER 37 7170
Conclusion and Closing Remarks 7171
In this section, concluding remarks and closing remarks are represented. The drawbacks of this 7172
research are illustrated. Some benefits and some advantages of this research are highlighted. 7173
This research uses some approaches to make Neutrosophic SuperHyperGraphs more understand- 7174
able. In this endeavor, two SuperHyperNotions are defined on the SuperHyperReverse Connective 7175
Dominating. For that sake in the second definition, the main definition of the Neutrosophic Super- 7176
HyperGraph is redefined on the position of the alphabets. Based on the new definition for the 7177
Neutrosophic SuperHyperGraph, the new SuperHyperNotion, Neutrosophic SuperHyperReverse 7178
Connective Dominating, finds the convenient background to implement some results based on that. 7179
Some SuperHyperClasses and some Neutrosophic SuperHyperClasses are the cases of this 7180
research on the modeling of the regions where are under the attacks of the cancer to recognize 7181
this disease as it’s mentioned on the title “Cancer’s Recognitions”. To formalize the instances 7182
on the SuperHyperNotion, SuperHyperReverse Connective Dominating, the new SuperHyperClasses 7183
and SuperHyperClasses, are introduced. Some general results are gathered in the section on the 7184
SuperHyperReverse Connective Dominating and the Neutrosophic SuperHyperReverse Connective Dominating. 7185
The clarifications, instances and literature reviews have taken the whole way through. In this 7186
research, the literature reviews have fulfilled the lines containing the notions and the results. 7187
The SuperHyperGraph and Neutrosophic SuperHyperGraph are the SuperHyperModels on the 7188
and the architecture are formally called “ SuperHyperReverse Connective Dominating” in the themes of 7193
jargons and buzzwords. The prefix “SuperHyper” refers to the theme of the embedded styles to 7194
figure out the background for the SuperHyperNotions. In the Table (37.1), benefits and avenues 7195
for this research are, figured out, pointed out and spoken out. 7196
357
Table 37.1: An Overlook On This Research And Beyond 136TBLTBL
Advantages Limitations
1. Redefining Neutrosophic SuperHyperGraph 1. General Results
2. SuperHyperReverse Connective Dominating
3. Neutrosophic SuperHyperReverse Connective Dominating 2. Other SuperHyperNumbers
4. Modeling of Cancer’s Recognitions
5. SuperHyperClasses 3. SuperHyperFamilies

CHAPTER 38 7197
Neutrosophic SuperHyperDuality But As 7198
Super Forms 7200
Definition 38.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperDuality). 7201

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

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

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

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

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

Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality, and Neutro- 7214
sophic rv-SuperHyperDuality. 7215
Definition 38.0.2. ((Neutrosophic) SuperHyperDuality). 7216

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

sophic rv-SuperHyperDuality and C(N SHG) for an Extreme SuperHyperGraph N SHG : 7221
(V, E) is the maximum Extreme cardinality of an Extreme SuperHyperSet S of high Ex- 7222
treme cardinality of the Extreme SuperHyperEdges in the consecutive Extreme sequence 7223
of Extreme SuperHyperEdges and Extreme SuperHyperVertices such that they form the 7224
359
(ii) a Neutrosophic SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7226

sophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyperGraph 7228
form the Neutrosophic SuperHyperDuality; 7232
(iii) an Extreme SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7233
rosophic e-SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v- 7234

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

SuperHyperDuality, and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neut- 7244
rosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial 7245
SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7250
coefficient; 7251
(v) an Extreme R-SuperHyperDuality if it’s either of Neutrosophic e-SuperHyperDuality, 7252

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

SuperHyperDuality, Neutrosophic re-SuperHyperDuality, Neutrosophic v-SuperHyperDuality,7260
and Neutrosophic rv-SuperHyperDuality and C(N SHG) for a Neutrosophic SuperHyper- 7261
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7262
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7263
that they form the Neutrosophic SuperHyperDuality; 7265
(vii) an Extreme R-SuperHyperDuality SuperHyperPolynomial if it’s either of 7266

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

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

contains the Extreme coefficients defined as the Extreme number of the maximum 7270
SuperHyperVertices such that they form the Extreme SuperHyperDuality; and the Extreme 7273
power is corresponded to its Extreme coefficient; 7274
(viii) a Neutrosophic SuperHyperDuality SuperHyperPolynomial if it’s either of Neut- 7275

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

SuperHyperDuality; and the Neutrosophic power is corresponded to its Neutrosophic 7283
coefficient. 7284
136EXM1 Example 38.0.3. Assume a Neutrosophic SuperHyperGraph (NSHG) S is a pair S = (V, E) in 7285
the mentioned Neutrosophic Figures in every Neutrosophic items. 7286

SuperHyperDuality, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7288
E1 and E3 are some empty Extreme SuperHyperEdges but E2 is a loop Neutrosophic 7289
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of 7290
Neutrosophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, 7291
namely, E4 . The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means 7292
that there’s no Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. 7293
Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in every given Neutrosophic 7294
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 7298
SuperHyperEdge. Thus in the terms of Neutrosophic SuperHyperNeighbor, there’s only 7299
one Neutrosophic SuperHyperEdge, namely, E4 . The Neutrosophic SuperHyperVertex, V3 7300
is Neutrosophic isolated means that there’s no Neutrosophic SuperHyperEdge has it as 7301
a Neutrosophic endpoint. Thus the Neutrosophic SuperHyperVertex, V3 , is excluded in 7302

every given Neutrosophic SuperHyperDuality. 7303




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

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


the Neutrosophic SuperHyperDuality. 7374
Then 7376
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 7377
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL


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

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

(V, E). Then 7397

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


Then there’s at least one SuperHyperDuality. Thus the notion of quasi isn’t up and 7403
the SuperHyperNotions based on SuperHyperDuality could be applied. There are only z 0 7404
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. 7416
Proposition 38.0.14. Assume a connected Neutrosophic SuperHyperWheel ESHW : (V, E). 7417
Then, 7418
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 7419
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 7420


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

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

CHAPTER 39 7433
Neutrosophic SuperHyperJoin But As 7434
Super Forms 7436
Definition 39.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperJoin). 7437

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

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

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

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

Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, and Neutrosophic 7452
rv-SuperHyperJoin. 7453
Definition 39.0.2. ((Neutrosophic) SuperHyperJoin). 7454

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

373

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

rv-SuperHyperJoin and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7466
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7467
Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic 7468
SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 7469
Neutrosophic SuperHyperJoin; 7470
(iii) an Extreme SuperHyperJoin SuperHyperPolynomial if it’s either of Neutrosophic 7471

e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v-SuperHyperJoin, 7472
and Neutrosophic rv-SuperHyperJoin and C(N SHG) for an Extreme SuperHyperGraph 7473
Extreme SuperHyperJoin; and the Extreme power is corresponded to its Extreme 7478
coefficient; 7479
(iv) a Neutrosophic SuperHyperJoin SuperHyperPolynomial if it’s either of 7480

Neutrosophic e-SuperHyperJoin, Neutrosophic re-SuperHyperJoin, Neutrosophic v- 7481
SuperHyperJoin, and Neutrosophic rv-SuperHyperJoin and C(N SHG) for a Neutrosophic 7482
SuperHyperGraph N SHG : (V, E) is the Neutrosophic SuperHyperPolynomial contains 7483
the Neutrosophic coefficients defined as the Neutrosophic number of the maximum Neutro- 7484
sophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet 7485
S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7486

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

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

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

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

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

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

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

the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7516
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic 7517
SuperHyperJoin; and the Neutrosophic power is corresponded to its Neutrosophic 7520
coefficient. 7521
SuperHyperJoin, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7525

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

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




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


SuperHyperModel (31.1), is the SuperHyperJoin. 7591

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

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

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


the Neutrosophic SuperHyperJoin. 7611
Then 7613
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 7614
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 7620
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperBipartite 7622

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


(V, E). Then 7633

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

is a longest SuperHyperJoin taken from a connected Neutrosophic SuperHyperMultipartite 7635


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

Then, 7653

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

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


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

CHAPTER 40 7667
Neutrosophic SuperHyperPerfect But As 7668
Super Forms 7670
Definition 40.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperPerfect). 7671

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

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

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

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

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

Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect, and Neutrosophic 7684
rv-SuperHyperPerfect. 7685
Definition 40.0.2. ((Neutrosophic) SuperHyperPerfect). 7686

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

rv-SuperHyperPerfect and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7691
387
(ii) a Neutrosophic SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7696

rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : 7698
(V, E) is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 7699
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive 7700
form the Neutrosophic SuperHyperPerfect; 7702
(iii) an Extreme SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7703

rosophic e-SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v- 7704
SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7705
ality of the Extreme SuperHyperEdges of an Extreme SuperHyperSet S of high Extreme 7708
(iv) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7712

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7714
SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7720
coefficient; 7721
(v) an Extreme R-SuperHyperPerfect if it’s either of Neutrosophic e-SuperHyperPerfect, 7722

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

SuperHyperPerfect, Neutrosophic re-SuperHyperPerfect, Neutrosophic v-SuperHyperPerfect,7730
and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neutrosophic SuperHyper- 7731
Graph N SHG : (V, E) is the maximum Neutrosophic cardinality of the Neutrosophic 7732
SuperHyperVertices of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality 7733
that they form the Neutrosophic SuperHyperPerfect; 7735
(vii) an Extreme R-SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7736

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for an Ex- 7738

ality of the Extreme SuperHyperVertices of an Extreme SuperHyperSet S of high Extreme 7741
(viii) a Neutrosophic SuperHyperPerfect SuperHyperPolynomial if it’s either of Neut- 7745

SuperHyperPerfect, and Neutrosophic rv-SuperHyperPerfect and C(N SHG) for a Neut- 7747

SuperHyperPerfect; and the Neutrosophic power is corresponded to its Neutrosophic 7753
coefficient. 7754

SuperHyperPerfect, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7758

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





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

SuperHyperModel (31.1), is the SuperHyperPerfect. 7824
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 7826
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
3 3

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

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



the Neutrosophic SuperHyperPerfect. 7844
Then 7846
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 7847
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 7851
there’s no at least one SuperHyperPerfect. Thus the notion of quasi may be up but the 7852
SuperHyperNotions based on SuperHyperPerfect could be applied. There are only two 7853
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2 ,
...,
EXT ERN AL
is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperBipartite 7856

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

(V, E). Then 7867

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



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

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

is a longest SuperHyperPerfect taken from a connected Neutrosophic SuperHyperWheel 7890


ViEXT ERN AL in the literatures of SuperHyperPerfect. The latter is straightforward. Then there’s 7893
at least one SuperHyperPerfect. Thus the notion of quasi isn’t up and the SuperHyperNotions 7894
based on SuperHyperPerfect could be applied. The unique embedded SuperHyperPerfect 7895
proposes some longest SuperHyperPerfect excerpt from some representatives. The latter is 7896
SuperHyperModel (31.6), is the Neutrosophic SuperHyperPerfect. 7902

CHAPTER 41 7903
Neutrosophic SuperHyperTotal But As 7904
Super Forms 7906
Definition 41.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperTotal). 7907

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

Va ∈ Ei , Ej ; 7912
(ii) Neutrosophic re-SuperHyperTotal if ∀Ei ∈ EESHG:(V,E) , ∃!Ej ∈ E 0 , such that 7913

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

Vi , Vj ∈ Ea ; 7916
(iv) Neutrosophic rv-SuperHyperTotal if ∀Vi ∈ VESHG:(V,E) , ∃!Vj ∈ V 0 , such that 7917

Vi , Vj ∈ Ea ; and |Vi |NEUTROSOPHIC CARDINALITY = |Vj |NEUTROSOPHIC CARDINALITY ; 7918
(v) Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7919

Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, and Neutrosophic 7920
rv-SuperHyperTotal. 7921
Definition 41.0.2. ((Neutrosophic) SuperHyperTotal). 7922

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

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7927
Extreme SuperHyperTotal; 7931
401
(ii) a Neutrosophic SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7932

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7934
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a 7935
Neutrosophic SuperHyperTotal; 7938
(iii) an Extreme SuperHyperTotal SuperHyperPolynomial if it’s either of Neutrosophic 7939
e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v-SuperHyperTotal, 7940

and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph 7941
Extreme SuperHyperTotal; and the Extreme power is corresponded to its Extreme 7946
coefficient; 7947
(iv) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7948
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7949

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7950
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7952
Neutrosophic cardinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHy- 7953
perSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and 7954
Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyperTotal; 7955
and the Neutrosophic power is corresponded to its Neutrosophic coefficient; 7956
(v) an Extreme R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7957

rv-SuperHyperTotal and C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) 7959
Extreme SuperHyperTotal; 7963
(vi) a Neutrosophic R-SuperHyperTotal if it’s either of Neutrosophic e-SuperHyperTotal, 7964

rv-SuperHyperTotal and C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) 7966
is the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a 7967
Neutrosophic SuperHyperTotal; 7970
(vii) an Extreme R-SuperHyperTotal SuperHyperPolynomial if it’s either of Neut- 7971

rosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7972
SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for an Extreme 7973

that they form the Extreme SuperHyperTotal; and the Extreme power is corresponded to 7978
its Extreme coefficient; 7979
(viii) a Neutrosophic SuperHyperTotal SuperHyperPolynomial if it’s either of 7980
Neutrosophic e-SuperHyperTotal, Neutrosophic re-SuperHyperTotal, Neutrosophic v- 7981

SuperHyperTotal, and Neutrosophic rv-SuperHyperTotal and C(N SHG) for a Neutro- 7982
contains the Neutrosophic coefficients defined as the Neutrosophic number of the maximum 7984
Neutrosophic cardinality of the Neutrosophic SuperHyperVertices of a Neutrosophic Supe- 7985
rHyperSet S of high Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges 7986
and Neutrosophic SuperHyperVertices such that they form the Neutrosophic SuperHyper- 7987
Total; and the Neutrosophic power is corresponded to its Neutrosophic coefficient. 7988

SuperHyperTotal, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 7992

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




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

SuperHyperModel (31.1), is the SuperHyperTotal. 8058
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 8060
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. 8067
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 8069


the Neutrosophic SuperHyperTotal. 8078
Then 8080
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 8081
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

based on SuperHyperTotal could be applied. There are only two SuperHyperParts. Thus every 8087
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperBipartite 8089

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8100

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

is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperMultipartite 8102


based on SuperHyperTotal could be applied. There are only z 0 SuperHyperParts. Thus every 8107
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. 8118
Then, 8120
∗
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
P : ViEXT ERN AL , Ei∗ , CEN T ER, Ej .
is a longest SuperHyperTotal taken from a connected Neutrosophic SuperHyperWheel ESHW : 8122


at least one SuperHyperTotal. Thus the notion of quasi isn’t up and the SuperHyperNotions 8126
based on SuperHyperTotal could be applied. The unique embedded SuperHyperTotal 8127
proposes some longest SuperHyperTotal excerpt from some representatives. The latter is 8128
SuperHyperModel (31.6), is the Neutrosophic SuperHyperTotal. 8134

CHAPTER 42 8135
Neutrosophic SuperHyperConnected But 8136
As The Extensions Excerpt From Dense 8137
And Super Forms 8138
Definition 42.0.1. (Different Neutrosophic Types of Neutrosophic SuperHyperConnected). 8139

(i) Neutrosophic e-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ E 0 , such 8143
that Va ∈ Ei , Ej ; and ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; 8144
(ii) Neutrosophic re-SuperHyperConnected if ∀Ei ∈ EESHG:(V,E) \ E 0 , ∃Ej ∈ 8145

E 0 , such that Va ∈ Ei , Ej ; ∀Ei , Ej ∈ E 0 , such that Va 6∈ Ei , Ej ; and 8146
|Ei |NEUTROSOPHIC CARDINALITY = |Ej |NEUTROSOPHIC CARDINALITY ; 8147
(iii) Neutrosophic v-SuperHyperConnected if ∀Vi ∈ EESHG:(V,E) \ V 0 , ∃Vj ∈ V 0 , such 8148

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

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

8153
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8154
rosophic rv-SuperHyperConnected. 8155
Definition 42.0.2. ((Neutrosophic) SuperHyperConnected). 8156

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

8159
Neutrosophic re-SuperHyperConnected, Neutrosophic v-SuperHyperConnected, and Neut- 8160
rosophic rv-SuperHyperConnected and C(N SHG) for an Extreme SuperHyperGraph 8161
415
form the Extreme SuperHyperConnected; 8165
(ii) a Neutrosophic SuperHyperConnected if it’s either of Neutrosophic e- 8166

SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic v- 8167
SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8168
for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic car- 8169
dinality of the Neutrosophic SuperHyperEdges of a Neutrosophic SuperHyperSet S of high 8170
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8171

SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8172
(iii) an Extreme SuperHyperConnected SuperHyperPolynomial if it’s either of Neut- 8173
rosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neutrosophic 8174

v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for 8175
an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme SuperHyperPolynomial 8176
(iv) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8182

Neutrosophic e-SuperHyperConnected, Neutrosophic re-SuperHyperConnected, Neut- 8183
rosophic v-SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and 8184
C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8185
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8186
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperEdges 8187
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8188

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8189
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8190
(v) an Extreme R-SuperHyperConnected if it’s either of Neutrosophic e- 8192

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) 8194
for an Extreme SuperHyperGraph N SHG : (V, E) is the maximum Extreme cardinality 8195
of an Extreme SuperHyperSet S of high Extreme cardinality of the Extreme SuperHyper- 8196
Vertices in the consecutive Extreme sequence of Extreme SuperHyperEdges and Extreme 8197
SuperHyperVertices such that they form the Extreme SuperHyperConnected; 8198
(vi) a Neutrosophic R-SuperHyperConnected if it’s either of Neutrosophic e- 8199

SuperHyperConnected, and Neutrosophic rv-SuperHyperConnected and C(N SHG) for a 8201
Neutrosophic SuperHyperGraph N SHG : (V, E) is the maximum Neutrosophic cardinality 8202
of the Neutrosophic SuperHyperVertices of a Neutrosophic SuperHyperSet S of high 8203
Neutrosophic cardinality consecutive Neutrosophic SuperHyperEdges and Neutrosophic 8204
SuperHyperVertices such that they form the Neutrosophic SuperHyperConnected; 8205

(vii) an Extreme R-SuperHyperConnected SuperHyperPolynomial if it’s either of 8206

C(N SHG) for an Extreme SuperHyperGraph N SHG : (V, E) is the Extreme Super- 8209
HyperPolynomial contains the Extreme coefficients defined as the Extreme number of 8210

and the Extreme power is corresponded to its Extreme coefficient; 8214
(viii) a Neutrosophic SuperHyperConnected SuperHyperPolynomial if it’s either of 8215

C(N SHG) for a Neutrosophic SuperHyperGraph N SHG : (V, E) is the Neutrosophic 8218
SuperHyperPolynomial contains the Neutrosophic coefficients defined as the Neutrosophic 8219
number of the maximum Neutrosophic cardinality of the Neutrosophic SuperHyperVertices 8220
of a Neutrosophic SuperHyperSet S of high Neutrosophic cardinality consecutive Neutro- 8221

sophic SuperHyperEdges and Neutrosophic SuperHyperVertices such that they form the 8222
Neutrosophic SuperHyperConnected; and the Neutrosophic power is corresponded to its 8223
• On the Figure (30.1), the Neutrosophic SuperHyperNotion, namely, Neutrosophic Super- 8227
HyperConnected, is up. The Neutrosophic Algorithm is Neutrosophicly straightforward. 8228
SuperHyperEdge and E4 is a Neutrosophic SuperHyperEdge. Thus in the terms of Neutro- 8230
sophic SuperHyperNeighbor, there’s only one Neutrosophic SuperHyperEdge, namely, E4 . 8231

The Neutrosophic SuperHyperVertex, V3 is Neutrosophic isolated means that there’s no 8232
Neutrosophic SuperHyperEdge has it as a Neutrosophic endpoint. Thus the Neutrosophic 8233
SuperHyperVertex, V3 , is excluded in every given Neutrosophic SuperHyperConnected. 8234
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. 8242


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 8286
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. 8293
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 8295
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. 8302
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 8304



the Neutrosophic SuperHyperConnected. 8313
Then 8315
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 8316
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 8321
SuperHyperNotions based on SuperHyperConnected could be applied. There are only two 8322
P :

V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperBipartite 8325

P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2
(V, E). Then 8336
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 8337
P :
V1EXT ERN AL , E1 ,
V2EXT ERN AL , E2

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperMultipartite 8338


there’s no at least one SuperHyperConnected. Thus the notion of quasi may be up but 8342
the SuperHyperNotions based on SuperHyperConnected could be applied. There are only 8343
z 0 SuperHyperParts. Thus every SuperHyperPart could have one SuperHyperVertex as the 8344
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. 8355
Then, 8357
∗
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 8358
P : V EXT ERN AL i , E ∗ i , CEN T ER, Ej .

is a longest SuperHyperConnected taken from a connected Neutrosophic SuperHyperWheel 8359


to ViEXT ERN AL in the literatures of SuperHyperConnected. The latter is straightforward. 8362
Then there’s at least one SuperHyperConnected. Thus the notion of quasi isn’t up and 8363
the SuperHyperNotions based on SuperHyperConnected could be applied. The unique 8364
embedded SuperHyperConnected proposes some longest SuperHyperConnected excerpt from 8365
some representatives. The latter is straightforward. 8366
SuperHyperModel (31.6), is the Neutrosophic SuperHyperConnected. 8371

CHAPTER 43 8372
Background 8373
429











HG274; HG275; HG276; HG277], there are some endeavors to formalize the basic Super- 8524
HyperNotions about neutrosophic SuperHyperGraph and SuperHyperGraph alongside scientific 8525
research books at [HG60b; HG61b; HG62b; HG63b; HG64b; HG65b; HG66b; HG67b; 8526

HG171b; HG172b; HG173b; HG174b; HG175b; HG176b; HG177b; HG178b]. Two 8539
popular scientific research books in Scribd in the terms of high readers, 4728 and 5721 respect- 8540
ively, on neutrosophic science is on [HG32b; HG44b]. 8541

See the seminal scientific researches [HG11s; HG22s; HG33s]. The formalization of the 8555
notions on the framework of notions in SuperHyperGraphs, Neutrosophic notions in Supe- 8556
rHyperGraphs theory, and (Neutrosophic) SuperHyperGraphs theory at [HG44s; HG55s; 8557





Bibliography 8594
10.33140/JMTCM.01.03.09) 8617
435



10.20944/preprints202301.0282.v1). 8633

10.20944/preprints202301.0267.v1). 8636

(doi: 10.20944/preprints202301.0265.v1). 8641
prints202301.0262.v1). 8645
2023010224, (doi: 10.20944/preprints202301.0224.v1). 8651

prints202301.0105.v1). 8654

Preprints 2023, 2023010044 8660
10.20944/preprints202301.0043.v1). 8663

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

(doi: 10.20944/preprints202212.0500.v1). 8679
10.5281/zenodo.8052893). 8688

2023, (doi: 10.5281/zenodo.8052925). 8691
10.5281/zenodo.8051346). 8694
10.5281/zenodo.8051360). 8697
10.5281/zenodo.8025707). 8700

10.5281/zenodo.8027275). 8703
odo.8017246). 8706
10.5281/zenodo.8020128). 8709
odo.7978571). 8712
10.5281/zenodo.7978857). 8715
10.5281/zenodo.7940830). 8718
10.5281/zenodo.7943578). 8721
odo.7916595). 8724
odo.7923632). 8727
(doi: 10.5281/zenodo.7904698). 8730
2023, (doi: 10.5281/zenodo.7904671). 8733

10.5281/zenodo.7871026). 8742
2023, (doi: 10.5281/zenodo.7874647). 8745
10.5281/zenodo.7857856). 8748
2023, (doi: 10.5281/zenodo.7857841). 8751
10.5281/zenodo.7853867). 8760
10.5281/zenodo.7853922). 8763
(doi: 10.5281/zenodo.7851519). 8766
(doi: 10.5281/zenodo.7851550). 8769
10.5281/zenodo.7834229). 8778

10.5281/zenodo.7834261). 8781
10.5281/zenodo.7824560). 8784
(doi: 10.5281/zenodo.7824623). 8787
2023, (doi: 10.5281/zenodo.7809365). 8798
2023, (doi: 10.5281/zenodo.7809358). 8801
10.5281/zenodo.7809219). 8804
10.5281/zenodo.7809328). 8807
2023, (doi: 10.5281/zenodo.7806767). 8810
2023, (doi: 10.5281/zenodo.7806838). 8813

10.5281/zenodo.7799902). 8822
(doi: 10.5281/zenodo.7804218). 8825
(doi: 10.5281/zenodo.7796334). 8828
10.5281/zenodo.7791952). 8834
10.5281/zenodo.7791982). 8837
10.5281/zenodo.7790026). 8840
10.5281/zenodo.7790052). 8843
2023, (doi: 10.5281/zenodo.7787066). 8846
10.5281/zenodo.7781476). 8852
10.5281/zenodo.7783082). 8855

10.5281/zenodo.7777857). 8858
10.5281/zenodo.7779286). 8861
(doi: 10.5281/zenodo.7771831). 8864
2023, (doi: 10.5281/zenodo.7772468). 8867
10.13140/RG.2.2.20913.25446). 8870
odo.7764916). 8873
10.13140/RG.2.2.11770.98247). 8876
10.13140/RG.2.2.12400.12808). 8879
2023, (doi: 10.13140/RG.2.2.22545.10089). 8882
10.13140/RG.2.2.11377.76644). 8888
10.13140/RG.2.2.23750.96329). 8891
10.13140/RG.2.2.31366.24641). 8894

10.13140/RG.2.2.34721.68960). 8897
2023, (doi: 10.13140/RG.2.2.30212.81289). 8900
10.13140/RG.2.2.24288.35842). 8906
10.13140/RG.2.2.32467.25124). 8909
10.13140/RG.2.2.31025.45925). 8912
10.13140/RG.2.2.17184.25602). 8915
10.13140/RG.2.2.23423.28327). 8918
10.13140/RG.2.2.28456.44805). 8921
10.13140/RG.2.2.23525.68320). 8924
10.13140/RG.2.2.20170.24000). 8927
10.13140/RG.2.2.36475.59683). 8930
10.13140/RG.2.2.29764.71046). 8933

2023, (doi: 10.13140/RG.2.2.18780.87683). 8936
10.13140/RG.2.2.26134.01603). 8942
10.13140/RG.2.2.27392.30721). 8945
10.13140/RG.2.2.33028.40321). 8948
10.13140/RG.2.2.21389.20966). 8951
10.13140/RG.2.2.16356.04489). 8954
10.13140/RG.2.2.21756.21129). 8957
10.13140/RG.2.2.30983.68009). 8960
10.13140/RG.2.2.28552.29445). 8963
(doi: 10.13140/RG.2.2.10936.21761). 8966
10.13140/RG.2.2.35105.89447). 8969
(doi: 10.13140/RG.2.2.30072.72960). 8972

10.13140/RG.2.2.31147.52003). 8975
10.13140/RG.2.2.32825.24163). 8978
10.13140/RG.2.2.13059.58401). 8981
10.13140/RG.2.2.11172.14720). 8984
2023, (doi: 10.13140/RG.2.2.22011.80165). 8987
ate 2023, (doi: 10.13140/RG.2.2.30819.84003). 8990
2023, (doi: 10.13140/RG.2.2.10493.84962). 8993
ate 2023, (doi: 10.13140/RG.2.2.13849.29280). 8996
2023, (doi: 10.13140/RG.2.2.19944.14086). 8999
ate 2023, (doi: 10.13140/RG.2.2.23299.58404). 9002
(doi: 10.13140/RG.2.2.33103.76968). 9005
(doi: 10.13140/RG.2.2.23037.44003). 9008
(doi: 10.13140/RG.2.2.35646.56641). 9011

10.13140/RG.2.2.18030.48967). 9014
(doi: 10.13140/RG.2.2.13973.81121). 9017
2023, (doi: 10.13140/RG.2.2.34106.47047). 9020
2023, (doi: 10.13140/RG.2.2.31956.88961). 9026
2023, (doi: 10.13140/RG.2.2.15179.67361). 9029
10.13140/RG.2.2.21510.45125). 9032
2023, (doi: 10.13140/RG.2.2.13121.84321). 9035
10.13140/RG.2.2.11758.69441). 9038
2023, (doi: 10.13140/RG.2.2.31891.35367). 9041
10.13140/RG.2.2.19360.87048). 9044
10.13140/RG.2.2.32363.21286). 9047
10.13140/RG.2.2.23266.81602). 9050

10.13140/RG.2.2.19911.37285). 9053
10.13140/RG.2.2.11050.90569). 9056
2023, (doi: 10.13140/RG.2.2.17761.79206). 9059
ate 2023, (doi: 10.13140/RG.2.2.33275.80161). 9065
(doi: 10.13140/RG.2.2.30182.50241). 9068

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

2023010396 (doi: 10.20944/preprints202301.0396.v1). 9110
2023, 2023010395 (doi: 10.20944/preprints202301.0395.v1). 9113


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


10.20944/preprints202301.0282.v1). 9134

10.20944/preprints202301.0267.v1).). 9137

(doi: 10.20944/preprints202301.0265.v1). 9142
prints202301.0262.v1). 9146

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

10.13140/RG.2.2.35061.65767). 9155
10.13140/RG.2.2.18494.15680). 9159
10.13140/RG.2.2.32530.73922). 9163
10.13140/RG.2.2.15897.70243). 9167

10.13140/RG.2.2.32530.73922). 9171
prints202301.0105.v1). 9174
10.13140/RG.2.2.23172.19849). 9181

10.13140/RG.2.2.17385.36968). 9191
Preprints 2023, 2023010044 9194

10.20944/preprints202301.0043.v1). 9197

2023, (doi: 10.13140/RG.2.2.28945.92007). 9200
10.13140/RG.2.2.35774.77123). 9206


10.13140/RG.2.2.29430.88642). 9212
(doi: 10.20944/preprints202212.0549.v1). 9218
10.13140/RG.2.2.19380.94084). 9221


(doi: 10.20944/preprints202212.0500.v1). 9232
10.13140/RG.2.2.20993.12640). 9235




10.13140/RG.2.2.29173.86244). 9250
2023 (doi: 10.5281/zenodo.8052976). 9255
(doi: 10.5281/zenodo.8051368). 9257
(doi: 10.5281/zenodo.8027488). 9259
10.5281/zenodo.8020181). 9261
10.5281/zenodo.7978921). 9263
odo.7943878). 9265
10.5281/zenodo.7943871). 9267
10.5281/zenodo.7923786). 9269
2023 (doi: 10.5281/zenodo.7905287). 9271

2023 (doi: 10.5281/zenodo.7874677). 9275
(doi: 10.5281/zenodo.7857906). 9277
2023 (doi: 10.5281/zenodo.7856329). 9279

10.5281/zenodo.7854561). 9281
2023 (doi: 10.5281/zenodo.7851893). 9283

(doi: 10.5281/zenodo.7835063). 9287
(doi: 10.5281/zenodo.7826705). 9289
2023 (doi: 10.5281/zenodo.7820680). 9291
10.5281/zenodo.7812750). 9293

2023 (doi: 10.5281/zenodo.7807782). 9299
2023 (doi: 10.5281/zenodo.7804449). 9301
(doi: 10.5281/zenodo.7792307). 9305
(doi: 10.5281/zenodo.7790728). 9307
2023 (doi: 10.5281/zenodo.7787712). 9309
10.5281/zenodo.7783791). 9311
10.5281/zenodo.7780123). 9313
(doi: 10.5281/zenodo.7773119). 9315

odo.7637762). 9317
10.5281/zenodo.7766174). 9319
10.5281/zenodo.7762232). 9321
(doi: 10.5281/zenodo.7758601). 9323
10.5281/zenodo.7754661). 9325
10.5281/zenodo.7750995) . 9327
(doi: 10.5281/zenodo.7749875). 9329
10.5281/zenodo.7747236). 9331
10.5281/zenodo.7742587). 9333
(doi: 10.5281/zenodo.7738635). 9335
10.5281/zenodo.7734719). 9337
10.5281/zenodo.7730484). 9339
(doi: 10.5281/zenodo.7730469). 9341
10.5281/zenodo.7722865). 9343
odo.7713563). 9345
odo.7709116). 9347
10.5281/zenodo.7706415). 9349
10.5281/zenodo.7706063). 9351

10.5281/zenodo.7701906). 9353
odo.7700205). 9355
10.5281/zenodo.7694876). 9357
10.5281/zenodo.7679410). 9359
10.5281/zenodo.7675982). 9361
10.5281/zenodo.7672388). 9363
odo.7668648). 9365
10.5281/zenodo.7662810). 9367
10.5281/zenodo.7659162). 9369
odo.7653233). 9371
odo.7653204). 9373
odo.7653142). 9375
odo.7653117). 9377
odo.7651687). 9380
odo.7651619). 9382
odo.7651439). 9384
odo.7650729). 9386

odo.7647868). 9388
odo.7647017). 9390
odo.7644894). 9392
odo.7632923). 9395
odo.7623459). 9397
10.5281/zenodo.7606416). 9399
10.5281/zenodo.7606416). 9401
odo.7606404). 9403
10.5281/zenodo.7580018). 9405
odo.7580018). 9407
odo.7580018). 9409
odo.7579929). 9411
10.5281/zenodo.7563170). 9413
odo.7563164). 9415
odo.7563160). 9417
odo.7563160). 9419
10.5281/zenodo.7563160). 9421

10.5281/zenodo.7557063). 9423
10.5281/zenodo.7557009). 9425
10.5281/zenodo.7539484). 9427
10.5281/zenodo.7523390). 9429
10.5281/zenodo.7523390). 9431
10.5281/zenodo.7523390). 9433
odo.7574952). 9435
10.5281/zenodo.7574992). 9437
odo.7523357). 9439
10.5281/zenodo.7523357). 9441
10.5281/zenodo.7504782). 9443
10.5281/zenodo.7504782). 9445
10.5281/zenodo.7504782). 9447
10.5281/zenodo.7499395). 9449
odo.7499395). 9451
10.5281/zenodo.7499395). 9453
10.5281/zenodo.7497450). 9455
10.5281/zenodo.7497450). 9457

10.5281/zenodo.7494862). 9459
odo.7494862). 9461
10.5281/zenodo.7494862). 9463
10.5281/zenodo.7493845). 9465
odo.7493845). 9467
10.5281/zenodo.7493845). 9469
odo.7539484). 9471
odo.7523390). 9473
odo.7523357). 9475
odo.7504782). 9477
odo.7499395). 9479
odo.7497450). 9481
odo.7494862). 9483
odo.7493845). 9485
odo.7480110). 9487
odo.7378758). 9489
odo.6320305). 9491
odo.6677173). 9493

CHAPTER 44 9494
Books’ Contributions 9495
“Books’ Contributions”: | Featured Threads 9496

The following references are cited by chapters. 9497
9498
[Ref278] 9499
Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse Connective Domin- 9500
ating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”, Zenodo 2023, (doi: 9501
10.5281/zenodo.8057753). 9502
9503
[Ref279] 9504
Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph 9505
10.5281/zenodo.8057696). 9507
9508
The links to the contributions of this scientific research book are listed below. 9509
[HG278] 9510
10.5281/zenodo.8057753). 9513
9514
[TITLE] “New Ideas On Super Con By Hyper Conceit Of Reverse Connective Dominat- 9515
ing In Recognition of Cancer With (Neutrosophic) SuperHyperGraph” 9516

9517
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ResearchGate”] 9518
https://www.researchgate.net/publication/371696013 9519
9520
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9521
https://www.scribd.com/document/654083303 9522
9523
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9524
https://zenodo.org/record/8057753 9525
9526
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9527
https://www.academia.edu/103583792 9528
459
Figure 44.1: [HG278] Henry Garrett, “New Ideas On Super Con By Hyper Conceit Of Reverse
Connective Dominating In Recognition of Cancer With (Neutrosophic) SuperHyperGraph”,
Zenodo 2023, (doi: 10.5281/zenodo.8057753).
9529
[ADDRESSED CITATION] 9530
10.5281/zenodo.8057753). 9533
[ASSIGNED NUMBER] #278 Article 9534
[DATE] June 2023 9535

[DOI] 10.5281/zenodo.8057753 9536
[LICENSE] CC BY-NC-ND 4.0 9537
[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9538
[AVAILABLE AT TWITTER’S IDS] WordPress ResearchGate Scribd academia ZEN- 9539
ODO_ORG Twitter facebook LinkedIn Amazon googlebooks GooglePlay 9540
9541
[HG279] 9542
10.5281/zenodo.8057696). 9545
9546
[TITLE] “New Ideas In Recognition of Cancer And Neutrosophic SuperHyperGraph By 9547

Reverse Connective Dominating As Hyper Conceit On Super Con” 9548
9549
https://www.researchgate.net/publication/371695713 9551
9552
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”:] 9553


Figure 44.4: [HG279] Henry Garrett, “New Ideas In Recognition of Cancer And Neutrosophic
SuperHyperGraph By Reverse Connective Dominating As Hyper Conceit On Super Con”,
https://www.scribd.com/document/654084689 9554
9555
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”:] 9556
9558
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”:] 9559
https://www.academia.edu/103583154 9560
9561
10.5281/zenodo.8057696). 9565
[ASSIGNED NUMBER] #279 Article 9566
[DATE] June 2023 9567
[DOI] 10.5281/zenodo.8057696 9568
[LICENSE] CC BY-NC-ND 4.0 9569

[PROJECT] Neutrosophic SuperHyperGraphs and SuperHyperGraphs 9570
[AVAILABLE AT TWITTER’S IDS] 9571
WordPress ResearchGate Scribd academia ZENODO_ORG Twitter facebook LinkedIn Amazon 9572
googlebooks GooglePlay 9573
9574
[ASSIGNED NUMBER] | Book #179 9575

HG179b
Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”. Dr. Henry Garrett, 9577
2023 (doi: 10.5281/zenodo.8057817). 9578


[TITLE] Reverse Connective Dominating In SuperHyperGraphs 9579

#Latest_Updates 9580
#The_Links 9581
9585
9587
#The_Links 9588
9589
[ASSIGNED NUMBER] | Book #179 9590

9591
[TITLE] Reverse Connective Dominating In SuperHyperGraphs 9592
9593
9597
– 9598
9599
[PUBLISHER] 9600
(Paperback): https://www.amazon.com/dp/- 9601
(Hardcover): https://www.amazon.com/dp/- 9602

(Kindle Edition): https://www.amazon.com/dp/- 9603
9604
– 9605
9606
[ISBN] 9607
(Paperback): - 9608
(Hardcover): - 9609
(Kindle Edition): CC BY-NC-ND 4.0 9610
(EBook): CC BY-NC-ND 4.0 9611
9612
– 9613
9614
[PRINT LENGTH] 9615
(Paperback): - pages 9616
(Hardcover): - pages 9617
(Kindle Edition): - pages 9618
(E-Book): - pages 9619
9620
– 9621
9622
9624

#The_Links 9625
9626
https://www.researchgate.net/publication/- 9628
9629
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9630
https://drhenrygarrett.wordpress.com/2023/07/22/ 9631
Reverse-Connective-Dominating-In-SuperHyperGraphs/ 9632
9633
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “Scribd”] 9634
https://www.scribd.com/document/- 9635
9636
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “academia”] 9637
https://www.academia.edu/- 9638
9639
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “ZENODO_ORG”] 9640
9642
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “googlebooks”] 9643
https://books.google.com/books/about?id=- 9644
9645
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “GooglePlay”] 9646
https://play.google.com/store/books/details?id=- 9647

[TITLE] Reverse Connective Dominating In SuperHyperGraphs (Published Version) 9648

9649
[THE DOWNLOAD-ABLE LINK TO TWITTER’S ID “WordPress”] 9650
9651
https://drhenrygarrett.wordpress.com/2023/07/22/ 9652
Reverse-Connective-Dominating-In-SuperHyperGraphs/ 9653
9654
– 9655
9656
[POSTED BY] Dr. Henry Garrett 9657
9658
[DATE] June 019, 2023 9659

9660
[POSTED IN] 179 | Reverse Connective Dominating In SuperHyperGraphs 9661
9662
[TAGS] 9663
Applications, Applied Mathematics, Applied Research, Cancer, Cancer’s Recognitions, Combin- 9664
atorics, Edge, Edges, Graph Theory, Graphs, Latest Research, Literature Reviews, Modeling, 9665
Neutrosophic Graph, Neutrosophic Graph Theory, Neutrosophic Science, Neutrosophic Su- 9666
perHyperClasses, Neutrosophic SuperHyperGraph, Neutrosophic SuperHyperGraph Theory, 9667
neutrosophic SuperHyperGraphs, Neutrosophic Reverse Connective Dominating In SuperHyper- 9668
Graphs, Open Problems, Open Questions, Problems, Pure Math, Pure Mathematics, Questions, 9669
Real-World Applications, Recent Research, Recognitions, Research, scientific research Article, 9670
scientific research Articles, scientific research Book, scientific research Chapter, scientific research 9671
Chapters, Review, SuperHyperClasses, SuperHyperEdges, SuperHyperGraph, SuperHyper- 9672

Graph Theory, SuperHyperGraphs, Reverse Connective Dominating In SuperHyperGraphs, 9673
SuperHyperModeling, SuperHyperVertices, Theoretical Research, Vertex, Vertices. 9674
In this scientific research book, there are some scientific research chapters on “Extreme 9675
Reverse Connective Dominating In SuperHyperGraphs” and “Neutrosophic Reverse Connective 9676
Dominating In SuperHyperGraphs” about some scientific research on Reverse Connective 9677
Dominating In SuperHyperGraphs by two (Extreme/Neutrosophic) notions, namely, Extreme 9678

Reverse Connective Dominating In SuperHyperGraphs and Neutrosophic Reverse Connective 9679
Dominating In SuperHyperGraphs. With scientific research on the basic scientific research 9680
properties, the scientific research book starts to make Extreme Reverse Connective Dom- 9681
inating In SuperHyperGraphs theory and Neutrosophic Reverse Connective Dominating In 9682
SuperHyperGraphs theory more (Extremely/Neutrosophicly) understandable. 9683

HG179b1.png
Figure 44.7: [HG179b] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”.

Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.8057817).

HG179b2.png


HG179b3.png


CHAPTER 45 9684
“SuperHyperGraph-Based Books”: | 9685
Featured Tweets 9686
“SuperHyperGraph-Based Books”: | Featured Tweets 9687
471
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 9688
CV 9689
499
9690
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
9691
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)
9692
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

9693

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

9694
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

9695
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

9696
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

9697
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

9698
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).
9699
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

9700
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

9701
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

9702
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

9703
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

9704
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

9705
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

9706
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

9707
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

9708
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

9709
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).
9710
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

9711

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

9712
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

9713

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: -
9714
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

9715
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).
9716
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
9717
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
9718
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
9719
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).
9720
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

9721
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).
9722
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”,

9723
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).
9724
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).
9725
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
9726
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).
9727

(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).
9728
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).
9729
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

9730
[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

9731
[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

9732
[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

9733
[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

9734
[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

9735
[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

9736
[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

9737
[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

9738
[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

9739
[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

9740
[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

9741
[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

9742
[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

9743
[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

9744
[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

9745
[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

9746
[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

9747
[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

9748
[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

9749
[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

9750
[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

9751
[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

9752
[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

9753
[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

9754
[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

9755
[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
9756
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

9757
[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

9758
[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

9759
[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

9760
[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

9761
[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
9762
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

9763
“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

9764
[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
9765
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

9766
[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

9767
[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

9768
[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

9769
[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

9770
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

9771
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
9772
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
9773
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

9774
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

9775
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
-
9776
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

9777
Анализ моделей и руководство за пределами Подход и проблемы в двух моде-

лях 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

9778
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
9779
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
9780
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

9781
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
9782
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
...
9783
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/
9784
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
9785
9786
9787
Henry Garrett
01/23/2022
9788
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
9789
View publication stats

Reverse Connective 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 Connective Dominating in SuperHyperGraphs

Uploaded by

Copyright:

Available Formats

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

Reverse Connective Dominating In SuperHyperGraphs

Book · June 2023

495 PUBLICATIONS 20,213 CITATIONS

Featured Articles View project

Metric Dimension in fuzzy(neutrosophic) Graphs View project

The user has requested enhancement of the downloaded file.

Dr. Henry Garrett

4 Cancer In Extreme SuperHyperGraph 47

5 Extreme Reverse Connective Dominating 51

6 New Ideas On Super Con By Hyper Conceit Of Reverse Connective

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 Connective 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 251

25 Neutrosophic Reverse Connective Dominating 255

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 Connective 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 349

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 357

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 459

45 “SuperHyperGraph-Based Books”: | Featured Tweets 471

Henry Garrett · Independent Researcher · Department of Mathematics ·

10.1 The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

10.17The Extreme SuperHyperGraphs Associated to the Extreme Notions of Extreme

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

14.1 an Extreme SuperHyperBipartite Associated to the Notions of Extreme SuperHy-

15.1 an Extreme SuperHyperMultipartite Associated to the Notions of Extreme

30.1 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.6 The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

Henry Garrett · Independent Researcher · Department of Mathematics ·

30.21The Neutrosophic SuperHyperGraphs Associated to the Neutrosophic Notions of

31.1 a Neutrosophic SuperHyperPath Associated to the Notions of Neutrosophic

34.1 a Neutrosophic SuperHyperBipartite Associated to the Notions of Neutrosophic

35.1 a Neutrosophic SuperHyperMultipartite Associated to the Notions of Neutrosophic

Henry Garrett · Independent Researcher · Department of Mathematics ·

44.7 [HG179b] Henry Garrett, “Reverse Connective Dominating In SuperHyperGraphs”.